./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/ldv-regression/test25_true-unreach-call.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_57ffbeee-16b3-4e57-9e9d-8a705aa6bdef/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_57ffbeee-16b3-4e57-9e9d-8a705aa6bdef/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_57ffbeee-16b3-4e57-9e9d-8a705aa6bdef/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_57ffbeee-16b3-4e57-9e9d-8a705aa6bdef/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ldv-regression/test25_true-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_57ffbeee-16b3-4e57-9e9d-8a705aa6bdef/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_57ffbeee-16b3-4e57-9e9d-8a705aa6bdef/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5d33db1882917813547794c8974f871f0a78640e ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-10-26 19:27:29,240 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-26 19:27:29,242 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-26 19:27:29,252 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-26 19:27:29,253 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-26 19:27:29,254 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-26 19:27:29,255 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-26 19:27:29,256 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-26 19:27:29,257 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-26 19:27:29,260 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-26 19:27:29,262 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-26 19:27:29,262 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-26 19:27:29,263 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-26 19:27:29,265 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-26 19:27:29,271 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-26 19:27:29,271 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-26 19:27:29,272 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-26 19:27:29,273 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-26 19:27:29,276 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-26 19:27:29,278 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-26 19:27:29,278 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-26 19:27:29,279 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-26 19:27:29,280 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-26 19:27:29,280 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-26 19:27:29,281 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-26 19:27:29,281 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-26 19:27:29,282 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-26 19:27:29,283 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-26 19:27:29,284 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-26 19:27:29,284 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-26 19:27:29,285 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-26 19:27:29,285 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-26 19:27:29,285 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-26 19:27:29,285 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-26 19:27:29,287 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-26 19:27:29,287 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-26 19:27:29,287 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_57ffbeee-16b3-4e57-9e9d-8a705aa6bdef/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-10-26 19:27:29,297 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-26 19:27:29,297 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-26 19:27:29,298 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-26 19:27:29,298 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-26 19:27:29,299 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-26 19:27:29,299 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-26 19:27:29,299 INFO L133 SettingsManager]: * Use SBE=true [2018-10-26 19:27:29,299 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-26 19:27:29,299 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-26 19:27:29,299 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-26 19:27:29,300 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-26 19:27:29,300 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-26 19:27:29,300 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-26 19:27:29,300 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-26 19:27:29,300 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-26 19:27:29,300 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-26 19:27:29,300 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-26 19:27:29,300 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-26 19:27:29,301 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-26 19:27:29,301 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-26 19:27:29,301 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-26 19:27:29,301 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-26 19:27:29,301 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-26 19:27:29,301 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-26 19:27:29,301 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-26 19:27:29,301 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-26 19:27:29,304 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-26 19:27:29,304 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-26 19:27:29,304 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-26 19:27:29,304 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_57ffbeee-16b3-4e57-9e9d-8a705aa6bdef/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5d33db1882917813547794c8974f871f0a78640e [2018-10-26 19:27:29,331 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-26 19:27:29,341 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-26 19:27:29,345 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-26 19:27:29,346 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-26 19:27:29,347 INFO L276 PluginConnector]: CDTParser initialized [2018-10-26 19:27:29,348 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_57ffbeee-16b3-4e57-9e9d-8a705aa6bdef/bin-2019/uautomizer/../../sv-benchmarks/c/ldv-regression/test25_true-unreach-call.c [2018-10-26 19:27:29,394 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_57ffbeee-16b3-4e57-9e9d-8a705aa6bdef/bin-2019/uautomizer/data/0e40c235c/eae58eceed29485fae5138445dfe7223/FLAG160f5f619 [2018-10-26 19:27:29,769 INFO L298 CDTParser]: Found 1 translation units. [2018-10-26 19:27:29,769 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_57ffbeee-16b3-4e57-9e9d-8a705aa6bdef/sv-benchmarks/c/ldv-regression/test25_true-unreach-call.c [2018-10-26 19:27:29,775 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_57ffbeee-16b3-4e57-9e9d-8a705aa6bdef/bin-2019/uautomizer/data/0e40c235c/eae58eceed29485fae5138445dfe7223/FLAG160f5f619 [2018-10-26 19:27:29,787 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_57ffbeee-16b3-4e57-9e9d-8a705aa6bdef/bin-2019/uautomizer/data/0e40c235c/eae58eceed29485fae5138445dfe7223 [2018-10-26 19:27:29,790 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-26 19:27:29,791 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-26 19:27:29,792 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-26 19:27:29,792 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-26 19:27:29,795 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-26 19:27:29,796 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 07:27:29" (1/1) ... [2018-10-26 19:27:29,798 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52c645ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:27:29, skipping insertion in model container [2018-10-26 19:27:29,798 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 07:27:29" (1/1) ... [2018-10-26 19:27:29,805 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-26 19:27:29,827 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-26 19:27:29,949 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 19:27:29,954 INFO L189 MainTranslator]: Completed pre-run [2018-10-26 19:27:29,970 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 19:27:29,984 INFO L193 MainTranslator]: Completed translation [2018-10-26 19:27:29,984 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:27:29 WrapperNode [2018-10-26 19:27:29,984 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-26 19:27:29,985 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-26 19:27:29,985 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-26 19:27:29,985 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-26 19:27:29,998 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:27:29" (1/1) ... [2018-10-26 19:27:29,999 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:27:29" (1/1) ... [2018-10-26 19:27:30,006 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:27:29" (1/1) ... [2018-10-26 19:27:30,006 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:27:29" (1/1) ... [2018-10-26 19:27:30,012 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:27:29" (1/1) ... [2018-10-26 19:27:30,016 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:27:29" (1/1) ... [2018-10-26 19:27:30,017 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:27:29" (1/1) ... [2018-10-26 19:27:30,019 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-26 19:27:30,019 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-26 19:27:30,019 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-26 19:27:30,019 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-26 19:27:30,020 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:27:29" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_57ffbeee-16b3-4e57-9e9d-8a705aa6bdef/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-26 19:27:30,121 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-26 19:27:30,122 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-26 19:27:30,122 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2018-10-26 19:27:30,122 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-26 19:27:30,122 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-10-26 19:27:30,122 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-10-26 19:27:30,122 INFO L130 BoogieDeclarations]: Found specification of procedure check [2018-10-26 19:27:30,122 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-10-26 19:27:30,122 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-10-26 19:27:30,123 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-26 19:27:30,123 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-10-26 19:27:30,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-10-26 19:27:30,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-10-26 19:27:30,123 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-10-26 19:27:30,123 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-26 19:27:30,123 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-26 19:27:30,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-10-26 19:27:30,617 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-26 19:27:30,618 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 07:27:30 BoogieIcfgContainer [2018-10-26 19:27:30,618 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-26 19:27:30,619 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-26 19:27:30,619 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-26 19:27:30,622 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-26 19:27:30,622 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.10 07:27:29" (1/3) ... [2018-10-26 19:27:30,623 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19d1c6f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 07:27:30, skipping insertion in model container [2018-10-26 19:27:30,623 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:27:29" (2/3) ... [2018-10-26 19:27:30,623 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19d1c6f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 07:27:30, skipping insertion in model container [2018-10-26 19:27:30,623 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 07:27:30" (3/3) ... [2018-10-26 19:27:30,625 INFO L112 eAbstractionObserver]: Analyzing ICFG test25_true-unreach-call.c [2018-10-26 19:27:30,633 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-26 19:27:30,640 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-26 19:27:30,655 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-26 19:27:30,684 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-26 19:27:30,684 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-26 19:27:30,684 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-26 19:27:30,685 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-26 19:27:30,685 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-26 19:27:30,685 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-26 19:27:30,685 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-26 19:27:30,685 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-26 19:27:30,685 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-26 19:27:30,708 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states. [2018-10-26 19:27:30,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-10-26 19:27:30,717 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:27:30,719 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:27:30,721 INFO L424 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:27:30,727 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:27:30,727 INFO L82 PathProgramCache]: Analyzing trace with hash 612174076, now seen corresponding path program 1 times [2018-10-26 19:27:30,729 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:27:30,729 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:27:30,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:27:30,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:27:30,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:27:30,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:27:30,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:27:30,870 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:27:30,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-26 19:27:30,873 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-10-26 19:27:30,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-10-26 19:27:30,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-10-26 19:27:30,886 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 2 states. [2018-10-26 19:27:30,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:27:30,905 INFO L93 Difference]: Finished difference Result 83 states and 93 transitions. [2018-10-26 19:27:30,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-10-26 19:27:30,907 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 29 [2018-10-26 19:27:30,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:27:30,913 INFO L225 Difference]: With dead ends: 83 [2018-10-26 19:27:30,913 INFO L226 Difference]: Without dead ends: 38 [2018-10-26 19:27:30,916 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-10-26 19:27:30,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-10-26 19:27:30,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-10-26 19:27:30,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-10-26 19:27:30,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2018-10-26 19:27:30,944 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 39 transitions. Word has length 29 [2018-10-26 19:27:30,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:27:30,944 INFO L481 AbstractCegarLoop]: Abstraction has 38 states and 39 transitions. [2018-10-26 19:27:30,945 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-10-26 19:27:30,945 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2018-10-26 19:27:30,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-10-26 19:27:30,945 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:27:30,946 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:27:30,946 INFO L424 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:27:30,946 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:27:30,946 INFO L82 PathProgramCache]: Analyzing trace with hash 680014012, now seen corresponding path program 1 times [2018-10-26 19:27:30,946 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:27:30,946 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:27:30,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:27:30,947 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:27:30,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:27:30,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:27:31,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:27:31,009 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:27:31,009 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:27:31,010 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:27:31,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:27:31,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:27:31,011 INFO L87 Difference]: Start difference. First operand 38 states and 39 transitions. Second operand 3 states. [2018-10-26 19:27:31,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:27:31,079 INFO L93 Difference]: Finished difference Result 68 states and 70 transitions. [2018-10-26 19:27:31,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:27:31,081 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-10-26 19:27:31,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:27:31,082 INFO L225 Difference]: With dead ends: 68 [2018-10-26 19:27:31,082 INFO L226 Difference]: Without dead ends: 45 [2018-10-26 19:27:31,083 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:27:31,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-10-26 19:27:31,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 40. [2018-10-26 19:27:31,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-10-26 19:27:31,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 41 transitions. [2018-10-26 19:27:31,088 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 41 transitions. Word has length 32 [2018-10-26 19:27:31,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:27:31,089 INFO L481 AbstractCegarLoop]: Abstraction has 40 states and 41 transitions. [2018-10-26 19:27:31,089 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:27:31,089 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2018-10-26 19:27:31,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-10-26 19:27:31,089 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:27:31,090 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:27:31,090 INFO L424 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:27:31,090 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:27:31,090 INFO L82 PathProgramCache]: Analyzing trace with hash 746290864, now seen corresponding path program 1 times [2018-10-26 19:27:31,090 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:27:31,090 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:27:31,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:27:31,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:27:31,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:27:31,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:27:31,191 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:27:31,191 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 19:27:31,191 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_57ffbeee-16b3-4e57-9e9d-8a705aa6bdef/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 19:27:31,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:27:31,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:27:31,254 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 19:27:31,293 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:27:31,316 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 19:27:31,316 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-10-26 19:27:31,317 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-26 19:27:31,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-26 19:27:31,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-26 19:27:31,318 INFO L87 Difference]: Start difference. First operand 40 states and 41 transitions. Second operand 5 states. [2018-10-26 19:27:31,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:27:31,470 INFO L93 Difference]: Finished difference Result 75 states and 77 transitions. [2018-10-26 19:27:31,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 19:27:31,470 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2018-10-26 19:27:31,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:27:31,471 INFO L225 Difference]: With dead ends: 75 [2018-10-26 19:27:31,471 INFO L226 Difference]: Without dead ends: 52 [2018-10-26 19:27:31,473 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-26 19:27:31,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-10-26 19:27:31,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 47. [2018-10-26 19:27:31,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-10-26 19:27:31,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2018-10-26 19:27:31,478 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 39 [2018-10-26 19:27:31,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:27:31,479 INFO L481 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2018-10-26 19:27:31,479 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-26 19:27:31,479 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2018-10-26 19:27:31,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-10-26 19:27:31,480 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:27:31,480 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:27:31,480 INFO L424 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:27:31,480 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:27:31,480 INFO L82 PathProgramCache]: Analyzing trace with hash 507926076, now seen corresponding path program 2 times [2018-10-26 19:27:31,481 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:27:31,481 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:27:31,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:27:31,484 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:27:31,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:27:31,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:27:31,619 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:27:31,619 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 19:27:31,619 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_57ffbeee-16b3-4e57-9e9d-8a705aa6bdef/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-10-26 19:27:31,632 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 19:27:31,682 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-10-26 19:27:31,682 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-26 19:27:31,685 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 19:27:31,758 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-10-26 19:27:31,786 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-10-26 19:27:31,787 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 19:27:31,813 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:27:31,841 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-10-26 19:27:31,844 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-26 19:27:31,844 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 19:27:31,846 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:27:31,860 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:27:31,860 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:27, output treesize:19 [2018-10-26 19:27:32,038 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-10-26 19:27:32,047 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-10-26 19:27:32,048 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 19:27:32,049 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:27:32,056 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-10-26 19:27:32,059 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 8 [2018-10-26 19:27:32,059 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 19:27:32,090 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:27:32,103 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:27:32,103 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:35, output treesize:12 [2018-10-26 19:27:32,257 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-10-26 19:27:32,260 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-10-26 19:27:32,260 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 19:27:32,261 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:27:32,263 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:27:32,263 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:17, output treesize:5 [2018-10-26 19:27:32,294 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-10-26 19:27:32,320 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 19:27:32,320 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [5] total 12 [2018-10-26 19:27:32,321 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-26 19:27:32,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-26 19:27:32,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-10-26 19:27:32,321 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand 12 states. [2018-10-26 19:27:32,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:27:32,760 INFO L93 Difference]: Finished difference Result 85 states and 88 transitions. [2018-10-26 19:27:32,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-26 19:27:32,761 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 46 [2018-10-26 19:27:32,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:27:32,762 INFO L225 Difference]: With dead ends: 85 [2018-10-26 19:27:32,762 INFO L226 Difference]: Without dead ends: 62 [2018-10-26 19:27:32,763 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2018-10-26 19:27:32,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-10-26 19:27:32,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 57. [2018-10-26 19:27:32,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-10-26 19:27:32,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2018-10-26 19:27:32,769 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 46 [2018-10-26 19:27:32,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:27:32,770 INFO L481 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2018-10-26 19:27:32,770 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-26 19:27:32,770 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2018-10-26 19:27:32,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-10-26 19:27:32,771 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:27:32,771 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:27:32,771 INFO L424 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:27:32,771 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:27:32,772 INFO L82 PathProgramCache]: Analyzing trace with hash -1628843076, now seen corresponding path program 1 times [2018-10-26 19:27:32,772 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:27:32,772 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:27:32,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:27:32,773 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-26 19:27:32,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:27:32,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:27:32,862 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-10-26 19:27:32,862 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 19:27:32,862 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_57ffbeee-16b3-4e57-9e9d-8a705aa6bdef/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 19:27:32,880 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:27:32,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:27:32,929 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 19:27:33,038 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-10-26 19:27:33,061 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 19:27:33,061 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-10-26 19:27:33,061 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-26 19:27:33,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-26 19:27:33,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-10-26 19:27:33,062 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 7 states. [2018-10-26 19:27:33,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:27:33,111 INFO L93 Difference]: Finished difference Result 95 states and 97 transitions. [2018-10-26 19:27:33,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-26 19:27:33,114 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 56 [2018-10-26 19:27:33,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:27:33,114 INFO L225 Difference]: With dead ends: 95 [2018-10-26 19:27:33,115 INFO L226 Difference]: Without dead ends: 69 [2018-10-26 19:27:33,115 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-10-26 19:27:33,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-10-26 19:27:33,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 64. [2018-10-26 19:27:33,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-10-26 19:27:33,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 65 transitions. [2018-10-26 19:27:33,119 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 65 transitions. Word has length 56 [2018-10-26 19:27:33,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:27:33,120 INFO L481 AbstractCegarLoop]: Abstraction has 64 states and 65 transitions. [2018-10-26 19:27:33,120 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-26 19:27:33,120 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 65 transitions. [2018-10-26 19:27:33,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-10-26 19:27:33,121 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:27:33,121 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:27:33,121 INFO L424 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:27:33,122 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:27:33,122 INFO L82 PathProgramCache]: Analyzing trace with hash 1057981872, now seen corresponding path program 2 times [2018-10-26 19:27:33,122 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:27:33,122 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:27:33,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:27:33,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:27:33,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:27:33,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:27:33,511 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-10-26 19:27:33,511 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 19:27:33,511 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_57ffbeee-16b3-4e57-9e9d-8a705aa6bdef/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 19:27:33,518 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-26 19:27:33,546 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-26 19:27:33,546 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-26 19:27:33,548 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 19:27:33,565 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-10-26 19:27:33,583 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 19:27:33,583 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-10-26 19:27:33,584 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-26 19:27:33,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-26 19:27:33,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-10-26 19:27:33,584 INFO L87 Difference]: Start difference. First operand 64 states and 65 transitions. Second operand 8 states. [2018-10-26 19:27:33,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:27:33,634 INFO L93 Difference]: Finished difference Result 102 states and 104 transitions. [2018-10-26 19:27:33,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-26 19:27:33,635 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 63 [2018-10-26 19:27:33,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:27:33,635 INFO L225 Difference]: With dead ends: 102 [2018-10-26 19:27:33,635 INFO L226 Difference]: Without dead ends: 76 [2018-10-26 19:27:33,636 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-10-26 19:27:33,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-10-26 19:27:33,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 71. [2018-10-26 19:27:33,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-10-26 19:27:33,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 72 transitions. [2018-10-26 19:27:33,641 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 72 transitions. Word has length 63 [2018-10-26 19:27:33,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:27:33,641 INFO L481 AbstractCegarLoop]: Abstraction has 71 states and 72 transitions. [2018-10-26 19:27:33,641 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-26 19:27:33,643 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 72 transitions. [2018-10-26 19:27:33,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-10-26 19:27:33,643 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:27:33,644 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:27:33,645 INFO L424 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:27:33,645 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:27:33,645 INFO L82 PathProgramCache]: Analyzing trace with hash -839943876, now seen corresponding path program 3 times [2018-10-26 19:27:33,645 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:27:33,645 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:27:33,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:27:33,646 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-26 19:27:33,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:27:33,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:27:33,768 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-10-26 19:27:33,768 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 19:27:33,768 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_57ffbeee-16b3-4e57-9e9d-8a705aa6bdef/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 19:27:33,775 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-26 19:27:33,812 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-10-26 19:27:33,812 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-26 19:27:33,815 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 19:27:33,830 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-10-26 19:27:33,841 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-10-26 19:27:33,841 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 19:27:33,855 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:27:33,856 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:27:33,856 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:16, output treesize:1 [2018-10-26 19:27:33,862 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-10-26 19:27:33,866 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-10-26 19:27:33,866 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 19:27:33,868 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:27:33,876 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-10-26 19:27:33,879 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-26 19:27:33,879 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 19:27:33,881 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:27:33,885 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:27:33,885 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:27, output treesize:19 [2018-10-26 19:27:33,896 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-10-26 19:27:33,898 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-10-26 19:27:33,898 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 19:27:33,902 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:27:33,907 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-10-26 19:27:33,913 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2018-10-26 19:27:33,913 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 19:27:33,915 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:27:33,918 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:27:33,918 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:33, output treesize:11 [2018-10-26 19:27:34,001 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-10-26 19:27:34,003 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-10-26 19:27:34,004 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 19:27:34,006 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:27:34,007 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:27:34,007 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:17, output treesize:5 [2018-10-26 19:27:34,021 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2018-10-26 19:27:34,037 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 19:27:34,038 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 15 [2018-10-26 19:27:34,038 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-26 19:27:34,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-26 19:27:34,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2018-10-26 19:27:34,039 INFO L87 Difference]: Start difference. First operand 71 states and 72 transitions. Second operand 15 states. [2018-10-26 19:27:34,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:27:34,372 INFO L93 Difference]: Finished difference Result 112 states and 115 transitions. [2018-10-26 19:27:34,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-26 19:27:34,373 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 70 [2018-10-26 19:27:34,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:27:34,374 INFO L225 Difference]: With dead ends: 112 [2018-10-26 19:27:34,374 INFO L226 Difference]: Without dead ends: 86 [2018-10-26 19:27:34,375 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=313, Unknown=0, NotChecked=0, Total=380 [2018-10-26 19:27:34,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-10-26 19:27:34,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 81. [2018-10-26 19:27:34,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-10-26 19:27:34,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 82 transitions. [2018-10-26 19:27:34,381 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 82 transitions. Word has length 70 [2018-10-26 19:27:34,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:27:34,382 INFO L481 AbstractCegarLoop]: Abstraction has 81 states and 82 transitions. [2018-10-26 19:27:34,382 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-26 19:27:34,382 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 82 transitions. [2018-10-26 19:27:34,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-10-26 19:27:34,383 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:27:34,383 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 6, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:27:34,383 INFO L424 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:27:34,383 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:27:34,383 INFO L82 PathProgramCache]: Analyzing trace with hash 2095836348, now seen corresponding path program 4 times [2018-10-26 19:27:34,384 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:27:34,384 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:27:34,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:27:34,384 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-26 19:27:34,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:27:34,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:27:34,545 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-10-26 19:27:34,545 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 19:27:34,546 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_57ffbeee-16b3-4e57-9e9d-8a705aa6bdef/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 19:27:34,551 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-26 19:27:34,613 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-26 19:27:34,613 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-26 19:27:34,616 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 19:27:34,630 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-10-26 19:27:34,631 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-10-26 19:27:34,632 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 19:27:34,633 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:27:34,635 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:27:34,635 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:16, output treesize:1 [2018-10-26 19:27:34,639 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-10-26 19:27:34,641 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-26 19:27:34,641 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 19:27:34,660 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:27:34,665 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-10-26 19:27:34,667 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-10-26 19:27:34,667 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 19:27:34,670 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:27:34,673 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:27:34,673 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:27, output treesize:19 [2018-10-26 19:27:34,724 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-10-26 19:27:34,727 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-10-26 19:27:34,727 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 19:27:34,729 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:27:34,816 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-10-26 19:27:34,830 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 8 [2018-10-26 19:27:34,830 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 19:27:34,856 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:27:34,859 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:27:34,859 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:35, output treesize:12 [2018-10-26 19:27:34,927 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-10-26 19:27:34,930 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-10-26 19:27:34,931 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 19:27:34,932 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:27:34,936 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:27:34,937 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:17, output treesize:5 [2018-10-26 19:27:34,952 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2018-10-26 19:27:34,972 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 19:27:34,972 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 18 [2018-10-26 19:27:34,972 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-26 19:27:34,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-26 19:27:34,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2018-10-26 19:27:34,973 INFO L87 Difference]: Start difference. First operand 81 states and 82 transitions. Second operand 18 states. [2018-10-26 19:27:35,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:27:35,146 INFO L93 Difference]: Finished difference Result 125 states and 128 transitions. [2018-10-26 19:27:35,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-26 19:27:35,147 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 80 [2018-10-26 19:27:35,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:27:35,148 INFO L225 Difference]: With dead ends: 125 [2018-10-26 19:27:35,148 INFO L226 Difference]: Without dead ends: 96 [2018-10-26 19:27:35,149 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=378, Unknown=0, NotChecked=0, Total=462 [2018-10-26 19:27:35,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-10-26 19:27:35,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 91. [2018-10-26 19:27:35,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-10-26 19:27:35,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 92 transitions. [2018-10-26 19:27:35,156 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 92 transitions. Word has length 80 [2018-10-26 19:27:35,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:27:35,156 INFO L481 AbstractCegarLoop]: Abstraction has 91 states and 92 transitions. [2018-10-26 19:27:35,156 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-26 19:27:35,156 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 92 transitions. [2018-10-26 19:27:35,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-10-26 19:27:35,158 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:27:35,158 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 7, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:27:35,158 INFO L424 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:27:35,158 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:27:35,159 INFO L82 PathProgramCache]: Analyzing trace with hash 136415804, now seen corresponding path program 5 times [2018-10-26 19:27:35,159 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:27:35,159 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:27:35,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:27:35,159 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-26 19:27:35,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:27:35,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:27:35,413 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 0 proven. 161 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-26 19:27:35,413 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 19:27:35,413 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_57ffbeee-16b3-4e57-9e9d-8a705aa6bdef/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 19:27:35,421 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-26 19:27:35,489 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2018-10-26 19:27:35,489 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-26 19:27:35,494 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 19:27:35,516 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 0 proven. 161 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-26 19:27:35,542 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 19:27:35,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-10-26 19:27:35,542 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-26 19:27:35,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-26 19:27:35,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-26 19:27:35,543 INFO L87 Difference]: Start difference. First operand 91 states and 92 transitions. Second operand 11 states. [2018-10-26 19:27:35,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:27:35,630 INFO L93 Difference]: Finished difference Result 135 states and 137 transitions. [2018-10-26 19:27:35,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-26 19:27:35,631 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 90 [2018-10-26 19:27:35,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:27:35,632 INFO L225 Difference]: With dead ends: 135 [2018-10-26 19:27:35,632 INFO L226 Difference]: Without dead ends: 103 [2018-10-26 19:27:35,633 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-26 19:27:35,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-10-26 19:27:35,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 98. [2018-10-26 19:27:35,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-10-26 19:27:35,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 99 transitions. [2018-10-26 19:27:35,642 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 99 transitions. Word has length 90 [2018-10-26 19:27:35,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:27:35,643 INFO L481 AbstractCegarLoop]: Abstraction has 98 states and 99 transitions. [2018-10-26 19:27:35,643 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-26 19:27:35,643 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 99 transitions. [2018-10-26 19:27:35,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-10-26 19:27:35,644 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:27:35,644 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 8, 8, 8, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:27:35,644 INFO L424 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:27:35,644 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:27:35,644 INFO L82 PathProgramCache]: Analyzing trace with hash 1110556464, now seen corresponding path program 6 times [2018-10-26 19:27:35,645 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:27:35,645 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:27:35,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:27:35,645 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-26 19:27:35,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:27:35,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:27:35,861 INFO L134 CoverageAnalysis]: Checked inductivity of 230 backedges. 0 proven. 212 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-26 19:27:35,861 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 19:27:35,861 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_57ffbeee-16b3-4e57-9e9d-8a705aa6bdef/bin-2019/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 19:27:35,871 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-26 19:27:35,900 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2018-10-26 19:27:35,900 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-26 19:27:35,904 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 19:27:35,933 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-10-26 19:27:35,938 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-10-26 19:27:35,938 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 19:27:35,939 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:27:35,942 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:27:35,943 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:20, output treesize:3 [2018-10-26 19:27:35,950 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-10-26 19:27:35,952 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-26 19:27:35,952 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 19:27:35,954 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:27:35,962 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-10-26 19:27:35,964 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-10-26 19:27:35,964 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 19:27:35,966 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:27:35,970 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:27:35,970 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:30, output treesize:3 [2018-10-26 19:27:36,200 INFO L134 CoverageAnalysis]: Checked inductivity of 230 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 219 trivial. 0 not checked. [2018-10-26 19:27:36,217 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 19:27:36,217 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14] total 23 [2018-10-26 19:27:36,217 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-26 19:27:36,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-26 19:27:36,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=419, Unknown=0, NotChecked=0, Total=506 [2018-10-26 19:27:36,218 INFO L87 Difference]: Start difference. First operand 98 states and 99 transitions. Second operand 23 states. [2018-10-26 19:27:36,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:27:36,866 INFO L93 Difference]: Finished difference Result 140 states and 143 transitions. [2018-10-26 19:27:36,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-26 19:27:36,867 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 97 [2018-10-26 19:27:36,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:27:36,867 INFO L225 Difference]: With dead ends: 140 [2018-10-26 19:27:36,867 INFO L226 Difference]: Without dead ends: 0 [2018-10-26 19:27:36,868 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 269 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=230, Invalid=1176, Unknown=0, NotChecked=0, Total=1406 [2018-10-26 19:27:36,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-26 19:27:36,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-26 19:27:36,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-26 19:27:36,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-26 19:27:36,869 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 97 [2018-10-26 19:27:36,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:27:36,869 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-26 19:27:36,869 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-26 19:27:36,869 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-26 19:27:36,869 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-26 19:27:36,875 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-26 19:27:37,319 WARN L179 SmtUtils]: Spent 386.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 22 [2018-10-26 19:27:37,411 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-10-26 19:27:37,411 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-10-26 19:27:37,411 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-10-26 19:27:37,411 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-10-26 19:27:37,411 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-10-26 19:27:37,411 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-10-26 19:27:37,412 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-10-26 19:27:37,412 INFO L425 ceAbstractionStarter]: For program point L35-2(lines 35 43) no Hoare annotation was computed. [2018-10-26 19:27:37,412 INFO L425 ceAbstractionStarter]: For program point L27-1(lines 27 30) no Hoare annotation was computed. [2018-10-26 19:27:37,412 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 20 50) no Hoare annotation was computed. [2018-10-26 19:27:37,412 INFO L425 ceAbstractionStarter]: For program point L27-3(lines 27 30) no Hoare annotation was computed. [2018-10-26 19:27:37,412 INFO L425 ceAbstractionStarter]: For program point L23(line 23) no Hoare annotation was computed. [2018-10-26 19:27:37,412 INFO L421 ceAbstractionStarter]: At program point L27-4(lines 27 30) the Hoare annotation is: (= |main_~#cont~0.offset| 0) [2018-10-26 19:27:37,412 INFO L425 ceAbstractionStarter]: For program point L27-5(lines 21 50) no Hoare annotation was computed. [2018-10-26 19:27:37,412 INFO L425 ceAbstractionStarter]: For program point L23-1(line 23) no Hoare annotation was computed. [2018-10-26 19:27:37,412 INFO L425 ceAbstractionStarter]: For program point L23-2(line 23) no Hoare annotation was computed. [2018-10-26 19:27:37,412 INFO L425 ceAbstractionStarter]: For program point L23-3(line 23) no Hoare annotation was computed. [2018-10-26 19:27:37,412 INFO L425 ceAbstractionStarter]: For program point L23-4(line 23) no Hoare annotation was computed. [2018-10-26 19:27:37,412 INFO L425 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2018-10-26 19:27:37,413 INFO L425 ceAbstractionStarter]: For program point L40-1(lines 40 42) no Hoare annotation was computed. [2018-10-26 19:27:37,413 INFO L425 ceAbstractionStarter]: For program point L36(line 36) no Hoare annotation was computed. [2018-10-26 19:27:37,413 INFO L425 ceAbstractionStarter]: For program point L36-1(line 36) no Hoare annotation was computed. [2018-10-26 19:27:37,413 INFO L425 ceAbstractionStarter]: For program point L32(lines 32 44) no Hoare annotation was computed. [2018-10-26 19:27:37,413 INFO L425 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2018-10-26 19:27:37,413 INFO L425 ceAbstractionStarter]: For program point L28-1(line 28) no Hoare annotation was computed. [2018-10-26 19:27:37,413 INFO L421 ceAbstractionStarter]: At program point L41(lines 21 50) the Hoare annotation is: false [2018-10-26 19:27:37,413 INFO L425 ceAbstractionStarter]: For program point L37-1(lines 37 39) no Hoare annotation was computed. [2018-10-26 19:27:37,413 INFO L425 ceAbstractionStarter]: For program point L37-2(lines 37 39) no Hoare annotation was computed. [2018-10-26 19:27:37,413 INFO L425 ceAbstractionStarter]: For program point L33(line 33) no Hoare annotation was computed. [2018-10-26 19:27:37,413 INFO L421 ceAbstractionStarter]: At program point L37-4(lines 37 39) the Hoare annotation is: (and (= main_~pa~0.base (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (= |main_~#cont~0.offset| 0) (<= main_~i~0 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (= main_~pa~0.offset (+ (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|) 4))) [2018-10-26 19:27:37,413 INFO L425 ceAbstractionStarter]: For program point L33-1(line 33) no Hoare annotation was computed. [2018-10-26 19:27:37,414 INFO L421 ceAbstractionStarter]: At program point L37-5(lines 37 39) the Hoare annotation is: (let ((.cse0 (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (.cse1 (+ (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|) 4))) (let ((.cse2 (select (select |#memory_int| .cse0) .cse1))) (and (= main_~pa~0.base .cse0) (= |main_~#cont~0.offset| 0) (= main_~pa~0.offset .cse1) (<= main_~i~0 .cse2) (<= .cse2 main_~i~0)))) [2018-10-26 19:27:37,414 INFO L425 ceAbstractionStarter]: For program point L29(line 29) no Hoare annotation was computed. [2018-10-26 19:27:37,414 INFO L425 ceAbstractionStarter]: For program point L29-1(line 29) no Hoare annotation was computed. [2018-10-26 19:27:37,414 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 20 50) no Hoare annotation was computed. [2018-10-26 19:27:37,415 INFO L425 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2018-10-26 19:27:37,415 INFO L425 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 48) no Hoare annotation was computed. [2018-10-26 19:27:37,415 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 20 50) the Hoare annotation is: true [2018-10-26 19:27:37,415 INFO L425 ceAbstractionStarter]: For program point L22(line 22) no Hoare annotation was computed. [2018-10-26 19:27:37,415 INFO L425 ceAbstractionStarter]: For program point L22-1(line 22) no Hoare annotation was computed. [2018-10-26 19:27:37,415 INFO L425 ceAbstractionStarter]: For program point L22-2(line 22) no Hoare annotation was computed. [2018-10-26 19:27:37,415 INFO L425 ceAbstractionStarter]: For program point L22-3(line 22) no Hoare annotation was computed. [2018-10-26 19:27:37,415 INFO L425 ceAbstractionStarter]: For program point L22-4(line 22) no Hoare annotation was computed. [2018-10-26 19:27:37,415 INFO L425 ceAbstractionStarter]: For program point L35(line 35) no Hoare annotation was computed. [2018-10-26 19:27:37,415 INFO L425 ceAbstractionStarter]: For program point L35-1(line 35) no Hoare annotation was computed. [2018-10-26 19:27:37,415 INFO L425 ceAbstractionStarter]: For program point L17(line 17) no Hoare annotation was computed. [2018-10-26 19:27:37,415 INFO L425 ceAbstractionStarter]: For program point L17-1(line 17) no Hoare annotation was computed. [2018-10-26 19:27:37,415 INFO L428 ceAbstractionStarter]: At program point checkENTRY(lines 15 18) the Hoare annotation is: true [2018-10-26 19:27:37,415 INFO L425 ceAbstractionStarter]: For program point L17-2(line 17) no Hoare annotation was computed. [2018-10-26 19:27:37,416 INFO L425 ceAbstractionStarter]: For program point checkFINAL(lines 15 18) no Hoare annotation was computed. [2018-10-26 19:27:37,416 INFO L425 ceAbstractionStarter]: For program point checkEXIT(lines 15 18) no Hoare annotation was computed. [2018-10-26 19:27:37,423 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:27:37,424 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 19:27:37,425 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:27:37,430 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 19:27:37,430 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:27:37,432 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:27:37,433 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 19:27:37,433 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:27:37,433 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 19:27:37,433 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:27:37,435 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.10 07:27:37 BoogieIcfgContainer [2018-10-26 19:27:37,435 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-26 19:27:37,436 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-10-26 19:27:37,436 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-10-26 19:27:37,436 INFO L276 PluginConnector]: Witness Printer initialized [2018-10-26 19:27:37,436 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 07:27:30" (3/4) ... [2018-10-26 19:27:37,442 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-10-26 19:27:37,447 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-10-26 19:27:37,447 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-10-26 19:27:37,447 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure check [2018-10-26 19:27:37,450 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2018-10-26 19:27:37,451 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2018-10-26 19:27:37,451 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-10-26 19:27:37,495 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_57ffbeee-16b3-4e57-9e9d-8a705aa6bdef/bin-2019/uautomizer/witness.graphml [2018-10-26 19:27:37,498 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-10-26 19:27:37,499 INFO L168 Benchmark]: Toolchain (without parser) took 7708.70 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 265.8 MB). Free memory was 953.1 MB in the beginning and 1.2 GB in the end (delta: -289.6 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-10-26 19:27:37,499 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-26 19:27:37,500 INFO L168 Benchmark]: CACSL2BoogieTranslator took 192.78 ms. Allocated memory is still 1.0 GB. Free memory was 953.1 MB in the beginning and 942.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-10-26 19:27:37,500 INFO L168 Benchmark]: Boogie Preprocessor took 34.39 ms. Allocated memory is still 1.0 GB. Free memory was 942.3 MB in the beginning and 939.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-10-26 19:27:37,500 INFO L168 Benchmark]: RCFGBuilder took 598.87 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 166.2 MB). Free memory was 939.6 MB in the beginning and 1.1 GB in the end (delta: -202.1 MB). Peak memory consumption was 16.0 MB. Max. memory is 11.5 GB. [2018-10-26 19:27:37,500 INFO L168 Benchmark]: TraceAbstraction took 6816.79 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 99.6 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -107.4 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-10-26 19:27:37,501 INFO L168 Benchmark]: Witness Printer took 62.22 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 6.4 MB). Peak memory consumption was 6.4 MB. Max. memory is 11.5 GB. [2018-10-26 19:27:37,510 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 192.78 ms. Allocated memory is still 1.0 GB. Free memory was 953.1 MB in the beginning and 942.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 34.39 ms. Allocated memory is still 1.0 GB. Free memory was 942.3 MB in the beginning and 939.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 598.87 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 166.2 MB). Free memory was 939.6 MB in the beginning and 1.1 GB in the end (delta: -202.1 MB). Peak memory consumption was 16.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 6816.79 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 99.6 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -107.4 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 62.22 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 6.4 MB). Peak memory consumption was 6.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 48]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 37]: Loop Invariant [2018-10-26 19:27:37,513 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:27:37,522 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 19:27:37,522 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:27:37,522 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 19:27:37,522 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:27:37,522 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:27:37,523 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 19:27:37,523 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:27:37,523 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 19:27:37,523 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: ((pa == #memory_$Pointer$[cont][cont] && cont == 0) && i <= unknown-#memory_int-unknown[pa][pa]) && pa == #memory_$Pointer$[cont][cont] + 4 - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: cont == 0 - InvariantResult [Line: 21]: Loop Invariant Derived loop invariant: 0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 51 locations, 1 error locations. SAFE Result, 6.7s OverallTime, 10 OverallIterations, 9 TraceHistogramMax, 2.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.5s HoareAnnotationTime, HoareTripleCheckerStatistics: 331 SDtfs, 269 SDslu, 1707 SDs, 0 SdLazy, 961 SolverSat, 28 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 624 GetRequests, 514 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 449 ImplicationChecksByTransitivity, 2.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=98occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 40 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 19 PreInvPairs, 33 NumberOfFragments, 90 HoareAnnotationTreeSize, 19 FomulaSimplifications, 136 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 9 FomulaSimplificationsInter, 30 FormulaSimplificationTreeSizeReductionInter, 0.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 1143 NumberOfCodeBlocks, 1038 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 1125 ConstructedInterpolants, 0 QuantifiedInterpolants, 230511 SizeOfPredicates, 65 NumberOfNonLiveVariables, 1153 ConjunctsInSsa, 124 ConjunctsInUnsatCore, 18 InterpolantComputations, 3 PerfectInterpolantSequences, 513/1428 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...