./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_5f7cb060-361f-4b61-9f82-eb9ee2d1bc5b/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_5f7cb060-361f-4b61-9f82-eb9ee2d1bc5b/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_5f7cb060-361f-4b61-9f82-eb9ee2d1bc5b/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_5f7cb060-361f-4b61-9f82-eb9ee2d1bc5b/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_5f7cb060-361f-4b61-9f82-eb9ee2d1bc5b/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_5f7cb060-361f-4b61-9f82-eb9ee2d1bc5b/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-11-10 12:29:44,441 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 12:29:44,443 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 12:29:44,451 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 12:29:44,451 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 12:29:44,452 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 12:29:44,453 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 12:29:44,454 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 12:29:44,456 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 12:29:44,456 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 12:29:44,457 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 12:29:44,457 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 12:29:44,458 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 12:29:44,459 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 12:29:44,460 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 12:29:44,460 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 12:29:44,461 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 12:29:44,462 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 12:29:44,463 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 12:29:44,465 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 12:29:44,466 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 12:29:44,467 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 12:29:44,469 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 12:29:44,469 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 12:29:44,469 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 12:29:44,470 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 12:29:44,471 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 12:29:44,471 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 12:29:44,472 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 12:29:44,472 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 12:29:44,472 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 12:29:44,473 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 12:29:44,473 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 12:29:44,473 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 12:29:44,474 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 12:29:44,474 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 12:29:44,474 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_5f7cb060-361f-4b61-9f82-eb9ee2d1bc5b/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-10 12:29:44,482 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 12:29:44,483 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 12:29:44,483 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 12:29:44,484 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-10 12:29:44,484 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 12:29:44,484 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 12:29:44,484 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 12:29:44,484 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 12:29:44,484 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 12:29:44,485 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 12:29:44,485 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 12:29:44,485 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 12:29:44,485 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 12:29:44,485 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 12:29:44,485 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 12:29:44,486 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 12:29:44,486 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 12:29:44,486 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 12:29:44,486 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 12:29:44,486 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 12:29:44,486 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 12:29:44,487 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 12:29:44,487 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 12:29:44,487 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 12:29:44,487 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 12:29:44,487 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 12:29:44,487 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 12:29:44,487 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 12:29:44,488 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 12:29:44,488 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_5f7cb060-361f-4b61-9f82-eb9ee2d1bc5b/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-11-10 12:29:44,516 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 12:29:44,527 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 12:29:44,530 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 12:29:44,532 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 12:29:44,532 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 12:29:44,532 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_5f7cb060-361f-4b61-9f82-eb9ee2d1bc5b/bin-2019/uautomizer/../../sv-benchmarks/c/ldv-regression/test25_true-unreach-call.c [2018-11-10 12:29:44,589 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5f7cb060-361f-4b61-9f82-eb9ee2d1bc5b/bin-2019/uautomizer/data/97ddb9520/51c6cc13eb324f62bc233550fd4134b3/FLAG07fd39c0b [2018-11-10 12:29:44,940 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 12:29:44,940 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_5f7cb060-361f-4b61-9f82-eb9ee2d1bc5b/sv-benchmarks/c/ldv-regression/test25_true-unreach-call.c [2018-11-10 12:29:44,945 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5f7cb060-361f-4b61-9f82-eb9ee2d1bc5b/bin-2019/uautomizer/data/97ddb9520/51c6cc13eb324f62bc233550fd4134b3/FLAG07fd39c0b [2018-11-10 12:29:44,958 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_5f7cb060-361f-4b61-9f82-eb9ee2d1bc5b/bin-2019/uautomizer/data/97ddb9520/51c6cc13eb324f62bc233550fd4134b3 [2018-11-10 12:29:44,962 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 12:29:44,963 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-10 12:29:44,964 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 12:29:44,964 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 12:29:44,969 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 12:29:44,970 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:29:44" (1/1) ... [2018-11-10 12:29:44,972 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4682f4b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:29:44, skipping insertion in model container [2018-11-10 12:29:44,973 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:29:44" (1/1) ... [2018-11-10 12:29:44,983 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 12:29:45,004 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 12:29:45,172 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 12:29:45,179 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 12:29:45,197 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 12:29:45,211 INFO L193 MainTranslator]: Completed translation [2018-11-10 12:29:45,211 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:29:45 WrapperNode [2018-11-10 12:29:45,212 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 12:29:45,212 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 12:29:45,212 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 12:29:45,212 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 12:29:45,222 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:29:45" (1/1) ... [2018-11-10 12:29:45,223 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:29:45" (1/1) ... [2018-11-10 12:29:45,231 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:29:45" (1/1) ... [2018-11-10 12:29:45,231 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:29:45" (1/1) ... [2018-11-10 12:29:45,238 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:29:45" (1/1) ... [2018-11-10 12:29:45,241 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:29:45" (1/1) ... [2018-11-10 12:29:45,243 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:29:45" (1/1) ... [2018-11-10 12:29:45,244 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 12:29:45,245 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 12:29:45,245 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 12:29:45,245 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 12:29:45,246 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:29:45" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5f7cb060-361f-4b61-9f82-eb9ee2d1bc5b/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-11-10 12:29:45,329 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 12:29:45,329 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 12:29:45,329 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2018-11-10 12:29:45,329 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 12:29:45,329 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-10 12:29:45,329 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-10 12:29:45,330 INFO L130 BoogieDeclarations]: Found specification of procedure check [2018-11-10 12:29:45,330 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-10 12:29:45,330 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-10 12:29:45,330 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 12:29:45,330 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-10 12:29:45,330 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-10 12:29:45,330 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-10 12:29:45,331 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-10 12:29:45,331 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 12:29:45,331 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 12:29:45,331 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-11-10 12:29:45,532 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 12:29:45,532 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:29:45 BoogieIcfgContainer [2018-11-10 12:29:45,532 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 12:29:45,533 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 12:29:45,533 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 12:29:45,536 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 12:29:45,536 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 12:29:44" (1/3) ... [2018-11-10 12:29:45,537 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e570211 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 12:29:45, skipping insertion in model container [2018-11-10 12:29:45,537 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:29:45" (2/3) ... [2018-11-10 12:29:45,537 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e570211 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 12:29:45, skipping insertion in model container [2018-11-10 12:29:45,537 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:29:45" (3/3) ... [2018-11-10 12:29:45,539 INFO L112 eAbstractionObserver]: Analyzing ICFG test25_true-unreach-call.c [2018-11-10 12:29:45,547 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 12:29:45,552 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-10 12:29:45,564 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-10 12:29:45,593 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 12:29:45,594 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 12:29:45,594 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-10 12:29:45,594 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 12:29:45,594 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 12:29:45,594 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 12:29:45,594 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 12:29:45,595 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 12:29:45,595 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 12:29:45,608 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states. [2018-11-10 12:29:45,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-10 12:29:45,612 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:29:45,613 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-11-10 12:29:45,614 INFO L424 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:29:45,618 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:29:45,618 INFO L82 PathProgramCache]: Analyzing trace with hash 612174076, now seen corresponding path program 1 times [2018-11-10 12:29:45,620 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:29:45,620 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:29:45,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:29:45,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:29:45,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:29:45,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:29:45,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:29:45,732 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:29:45,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 12:29:45,736 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-10 12:29:45,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-10 12:29:45,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-10 12:29:45,751 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 2 states. [2018-11-10 12:29:45,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:29:45,768 INFO L93 Difference]: Finished difference Result 83 states and 93 transitions. [2018-11-10 12:29:45,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-10 12:29:45,769 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 29 [2018-11-10 12:29:45,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:29:45,776 INFO L225 Difference]: With dead ends: 83 [2018-11-10 12:29:45,776 INFO L226 Difference]: Without dead ends: 38 [2018-11-10 12:29:45,779 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-11-10 12:29:45,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-11-10 12:29:45,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-11-10 12:29:45,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-10 12:29:45,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2018-11-10 12:29:45,806 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 39 transitions. Word has length 29 [2018-11-10 12:29:45,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:29:45,807 INFO L481 AbstractCegarLoop]: Abstraction has 38 states and 39 transitions. [2018-11-10 12:29:45,807 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-10 12:29:45,807 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2018-11-10 12:29:45,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-10 12:29:45,808 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:29:45,808 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-11-10 12:29:45,809 INFO L424 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:29:45,809 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:29:45,809 INFO L82 PathProgramCache]: Analyzing trace with hash 680014012, now seen corresponding path program 1 times [2018-11-10 12:29:45,809 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:29:45,809 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:29:45,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:29:45,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:29:45,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:29:45,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:29:45,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:29:45,878 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:29:45,878 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:29:45,879 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 12:29:45,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:29:45,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:29:45,880 INFO L87 Difference]: Start difference. First operand 38 states and 39 transitions. Second operand 3 states. [2018-11-10 12:29:45,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:29:45,921 INFO L93 Difference]: Finished difference Result 68 states and 70 transitions. [2018-11-10 12:29:45,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:29:45,922 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-11-10 12:29:45,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:29:45,922 INFO L225 Difference]: With dead ends: 68 [2018-11-10 12:29:45,923 INFO L226 Difference]: Without dead ends: 45 [2018-11-10 12:29:45,923 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-11-10 12:29:45,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-11-10 12:29:45,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 40. [2018-11-10 12:29:45,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-10 12:29:45,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 41 transitions. [2018-11-10 12:29:45,928 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 41 transitions. Word has length 32 [2018-11-10 12:29:45,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:29:45,928 INFO L481 AbstractCegarLoop]: Abstraction has 40 states and 41 transitions. [2018-11-10 12:29:45,928 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 12:29:45,928 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2018-11-10 12:29:45,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-10 12:29:45,929 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:29:45,929 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-11-10 12:29:45,929 INFO L424 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:29:45,929 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:29:45,929 INFO L82 PathProgramCache]: Analyzing trace with hash 746290864, now seen corresponding path program 1 times [2018-11-10 12:29:45,929 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:29:45,930 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:29:45,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:29:45,930 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:29:45,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:29:45,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:29:46,009 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:29:46,009 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 12:29:46,010 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5f7cb060-361f-4b61-9f82-eb9ee2d1bc5b/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-11-10 12:29:46,020 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:29:46,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:29:46,063 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:29:46,093 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:29:46,112 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 12:29:46,112 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-10 12:29:46,113 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 12:29:46,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 12:29:46,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-10 12:29:46,113 INFO L87 Difference]: Start difference. First operand 40 states and 41 transitions. Second operand 5 states. [2018-11-10 12:29:46,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:29:46,140 INFO L93 Difference]: Finished difference Result 75 states and 77 transitions. [2018-11-10 12:29:46,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 12:29:46,141 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2018-11-10 12:29:46,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:29:46,141 INFO L225 Difference]: With dead ends: 75 [2018-11-10 12:29:46,141 INFO L226 Difference]: Without dead ends: 52 [2018-11-10 12:29:46,142 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-11-10 12:29:46,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-11-10 12:29:46,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 47. [2018-11-10 12:29:46,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-10 12:29:46,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2018-11-10 12:29:46,146 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 39 [2018-11-10 12:29:46,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:29:46,146 INFO L481 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2018-11-10 12:29:46,146 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 12:29:46,146 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2018-11-10 12:29:46,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-10 12:29:46,147 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:29:46,147 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-11-10 12:29:46,147 INFO L424 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:29:46,148 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:29:46,148 INFO L82 PathProgramCache]: Analyzing trace with hash 507926076, now seen corresponding path program 2 times [2018-11-10 12:29:46,148 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:29:46,148 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:29:46,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:29:46,149 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:29:46,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:29:46,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:29:46,208 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:29:46,209 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 12:29:46,209 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5f7cb060-361f-4b61-9f82-eb9ee2d1bc5b/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 12:29:46,221 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-10 12:29:46,264 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-10 12:29:46,264 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 12:29:46,268 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:29:46,299 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-11-10 12:29:46,302 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-11-10 12:29:46,303 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:29:46,311 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:29:46,322 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-11-10 12:29:46,326 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-11-10 12:29:46,327 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 12:29:46,329 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:29:46,336 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:29:46,336 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:27, output treesize:19 [2018-11-10 12:29:46,405 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-11-10 12:29:46,410 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-11-10 12:29:46,411 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:29:46,413 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:29:46,421 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-11-10 12:29:46,424 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-11-10 12:29:46,425 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 12:29:46,426 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:29:46,431 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:29:46,431 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:35, output treesize:12 [2018-11-10 12:29:46,474 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-11-10 12:29:46,476 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-11-10 12:29:46,477 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:29:46,478 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:29:46,480 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:29:46,480 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:17, output treesize:5 [2018-11-10 12:29:46,507 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-10 12:29:46,536 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 12:29:46,536 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [5] total 12 [2018-11-10 12:29:46,537 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-10 12:29:46,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-10 12:29:46,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-11-10 12:29:46,538 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand 12 states. [2018-11-10 12:29:46,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:29:46,702 INFO L93 Difference]: Finished difference Result 85 states and 88 transitions. [2018-11-10 12:29:46,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-10 12:29:46,703 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 46 [2018-11-10 12:29:46,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:29:46,704 INFO L225 Difference]: With dead ends: 85 [2018-11-10 12:29:46,704 INFO L226 Difference]: Without dead ends: 62 [2018-11-10 12:29:46,705 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2018-11-10 12:29:46,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-11-10 12:29:46,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 57. [2018-11-10 12:29:46,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-11-10 12:29:46,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2018-11-10 12:29:46,711 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 46 [2018-11-10 12:29:46,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:29:46,712 INFO L481 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2018-11-10 12:29:46,712 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-10 12:29:46,712 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2018-11-10 12:29:46,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-10 12:29:46,713 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:29:46,714 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-11-10 12:29:46,714 INFO L424 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:29:46,715 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:29:46,715 INFO L82 PathProgramCache]: Analyzing trace with hash -1628843076, now seen corresponding path program 1 times [2018-11-10 12:29:46,715 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:29:46,715 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:29:46,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:29:46,716 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:29:46,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:29:46,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:29:46,787 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-10 12:29:46,787 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 12:29:46,787 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5f7cb060-361f-4b61-9f82-eb9ee2d1bc5b/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-11-10 12:29:46,807 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:29:46,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:29:46,836 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:29:46,865 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-10 12:29:46,884 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 12:29:46,885 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-11-10 12:29:46,886 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 12:29:46,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 12:29:46,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-10 12:29:46,887 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 7 states. [2018-11-10 12:29:46,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:29:46,918 INFO L93 Difference]: Finished difference Result 95 states and 97 transitions. [2018-11-10 12:29:46,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 12:29:46,919 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 56 [2018-11-10 12:29:46,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:29:46,919 INFO L225 Difference]: With dead ends: 95 [2018-11-10 12:29:46,919 INFO L226 Difference]: Without dead ends: 69 [2018-11-10 12:29:46,920 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-10 12:29:46,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-11-10 12:29:46,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 64. [2018-11-10 12:29:46,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-11-10 12:29:46,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 65 transitions. [2018-11-10 12:29:46,925 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 65 transitions. Word has length 56 [2018-11-10 12:29:46,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:29:46,925 INFO L481 AbstractCegarLoop]: Abstraction has 64 states and 65 transitions. [2018-11-10 12:29:46,925 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 12:29:46,925 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 65 transitions. [2018-11-10 12:29:46,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-11-10 12:29:46,926 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:29:46,926 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-11-10 12:29:46,927 INFO L424 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:29:46,927 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:29:46,927 INFO L82 PathProgramCache]: Analyzing trace with hash 1057981872, now seen corresponding path program 2 times [2018-11-10 12:29:46,927 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:29:46,927 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:29:46,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:29:46,928 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:29:46,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:29:46,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:29:47,021 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-10 12:29:47,023 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 12:29:47,023 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5f7cb060-361f-4b61-9f82-eb9ee2d1bc5b/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-11-10 12:29:47,032 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-10 12:29:47,066 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-10 12:29:47,066 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 12:29:47,070 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:29:47,102 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-10 12:29:47,134 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 12:29:47,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-10 12:29:47,135 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-10 12:29:47,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 12:29:47,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-10 12:29:47,135 INFO L87 Difference]: Start difference. First operand 64 states and 65 transitions. Second operand 8 states. [2018-11-10 12:29:47,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:29:47,185 INFO L93 Difference]: Finished difference Result 102 states and 104 transitions. [2018-11-10 12:29:47,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 12:29:47,186 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 63 [2018-11-10 12:29:47,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:29:47,187 INFO L225 Difference]: With dead ends: 102 [2018-11-10 12:29:47,190 INFO L226 Difference]: Without dead ends: 76 [2018-11-10 12:29:47,190 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-10 12:29:47,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-11-10 12:29:47,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 71. [2018-11-10 12:29:47,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-11-10 12:29:47,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 72 transitions. [2018-11-10 12:29:47,199 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 72 transitions. Word has length 63 [2018-11-10 12:29:47,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:29:47,199 INFO L481 AbstractCegarLoop]: Abstraction has 71 states and 72 transitions. [2018-11-10 12:29:47,200 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-10 12:29:47,200 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 72 transitions. [2018-11-10 12:29:47,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-11-10 12:29:47,201 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:29:47,201 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-11-10 12:29:47,201 INFO L424 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:29:47,201 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:29:47,204 INFO L82 PathProgramCache]: Analyzing trace with hash -839943876, now seen corresponding path program 3 times [2018-11-10 12:29:47,204 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:29:47,205 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:29:47,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:29:47,205 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:29:47,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:29:47,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:29:47,328 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-10 12:29:47,328 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 12:29:47,328 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5f7cb060-361f-4b61-9f82-eb9ee2d1bc5b/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-11-10 12:29:47,335 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 12:29:47,361 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-10 12:29:47,361 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 12:29:47,365 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:29:47,377 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-11-10 12:29:47,380 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-11-10 12:29:47,380 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:29:47,382 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:29:47,384 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:29:47,384 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:16, output treesize:1 [2018-11-10 12:29:47,389 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-11-10 12:29:47,391 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-11-10 12:29:47,392 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:29:47,394 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:29:47,413 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-11-10 12:29:47,415 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-11-10 12:29:47,415 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 12:29:47,417 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:29:47,424 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:29:47,425 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:27, output treesize:19 [2018-11-10 12:29:47,436 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-11-10 12:29:47,439 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-11-10 12:29:47,439 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:29:47,441 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:29:47,456 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-11-10 12:29:47,467 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-11-10 12:29:47,467 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 12:29:47,469 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:29:47,472 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:29:47,472 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:33, output treesize:11 [2018-11-10 12:29:47,530 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-11-10 12:29:47,533 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-11-10 12:29:47,534 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:29:47,536 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:29:47,538 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:29:47,538 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:17, output treesize:5 [2018-11-10 12:29:47,557 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2018-11-10 12:29:47,588 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 12:29:47,588 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 15 [2018-11-10 12:29:47,588 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-10 12:29:47,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-10 12:29:47,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2018-11-10 12:29:47,589 INFO L87 Difference]: Start difference. First operand 71 states and 72 transitions. Second operand 15 states. [2018-11-10 12:29:47,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:29:47,789 INFO L93 Difference]: Finished difference Result 112 states and 115 transitions. [2018-11-10 12:29:47,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-10 12:29:47,790 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 70 [2018-11-10 12:29:47,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:29:47,790 INFO L225 Difference]: With dead ends: 112 [2018-11-10 12:29:47,791 INFO L226 Difference]: Without dead ends: 86 [2018-11-10 12:29:47,791 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-11-10 12:29:47,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-11-10 12:29:47,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 81. [2018-11-10 12:29:47,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-11-10 12:29:47,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 82 transitions. [2018-11-10 12:29:47,799 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 82 transitions. Word has length 70 [2018-11-10 12:29:47,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:29:47,800 INFO L481 AbstractCegarLoop]: Abstraction has 81 states and 82 transitions. [2018-11-10 12:29:47,800 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-10 12:29:47,800 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 82 transitions. [2018-11-10 12:29:47,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-10 12:29:47,802 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:29:47,802 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-11-10 12:29:47,803 INFO L424 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:29:47,803 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:29:47,803 INFO L82 PathProgramCache]: Analyzing trace with hash 2095836348, now seen corresponding path program 4 times [2018-11-10 12:29:47,803 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:29:47,803 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:29:47,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:29:47,804 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:29:47,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:29:47,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:29:47,891 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-10 12:29:47,891 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 12:29:47,891 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5f7cb060-361f-4b61-9f82-eb9ee2d1bc5b/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-11-10 12:29:47,898 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-10 12:29:47,949 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-10 12:29:47,949 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 12:29:47,953 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:29:47,963 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-11-10 12:29:47,965 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-11-10 12:29:47,965 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:29:47,967 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:29:47,969 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:29:47,969 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:16, output treesize:1 [2018-11-10 12:29:47,974 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-11-10 12:29:47,976 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-11-10 12:29:47,976 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:29:47,978 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:29:47,984 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-11-10 12:29:47,986 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-11-10 12:29:47,987 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 12:29:47,988 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:29:47,992 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:29:47,992 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:27, output treesize:19 [2018-11-10 12:29:48,032 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-11-10 12:29:48,035 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-11-10 12:29:48,035 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:29:48,037 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:29:48,044 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-11-10 12:29:48,046 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-11-10 12:29:48,046 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 12:29:48,048 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:29:48,051 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:29:48,052 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:35, output treesize:12 [2018-11-10 12:29:48,120 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-11-10 12:29:48,122 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-11-10 12:29:48,122 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:29:48,123 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:29:48,124 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:29:48,125 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:17, output treesize:5 [2018-11-10 12:29:48,139 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2018-11-10 12:29:48,160 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 12:29:48,160 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 18 [2018-11-10 12:29:48,160 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-10 12:29:48,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-10 12:29:48,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2018-11-10 12:29:48,161 INFO L87 Difference]: Start difference. First operand 81 states and 82 transitions. Second operand 18 states. [2018-11-10 12:29:48,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:29:48,309 INFO L93 Difference]: Finished difference Result 125 states and 128 transitions. [2018-11-10 12:29:48,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-10 12:29:48,309 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 80 [2018-11-10 12:29:48,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:29:48,310 INFO L225 Difference]: With dead ends: 125 [2018-11-10 12:29:48,310 INFO L226 Difference]: Without dead ends: 96 [2018-11-10 12:29:48,310 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=378, Unknown=0, NotChecked=0, Total=462 [2018-11-10 12:29:48,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-11-10 12:29:48,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 91. [2018-11-10 12:29:48,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-11-10 12:29:48,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 92 transitions. [2018-11-10 12:29:48,316 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 92 transitions. Word has length 80 [2018-11-10 12:29:48,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:29:48,317 INFO L481 AbstractCegarLoop]: Abstraction has 91 states and 92 transitions. [2018-11-10 12:29:48,317 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-10 12:29:48,317 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 92 transitions. [2018-11-10 12:29:48,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-11-10 12:29:48,318 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:29:48,318 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-11-10 12:29:48,318 INFO L424 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:29:48,318 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:29:48,319 INFO L82 PathProgramCache]: Analyzing trace with hash 136415804, now seen corresponding path program 5 times [2018-11-10 12:29:48,319 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:29:48,319 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:29:48,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:29:48,320 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:29:48,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:29:48,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:29:48,423 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 0 proven. 161 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-10 12:29:48,423 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 12:29:48,423 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5f7cb060-361f-4b61-9f82-eb9ee2d1bc5b/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-11-10 12:29:48,437 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-10 12:29:48,529 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2018-11-10 12:29:48,530 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 12:29:48,533 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:29:48,558 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 0 proven. 161 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-10 12:29:48,577 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 12:29:48,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-11-10 12:29:48,578 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-10 12:29:48,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-10 12:29:48,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-10 12:29:48,578 INFO L87 Difference]: Start difference. First operand 91 states and 92 transitions. Second operand 11 states. [2018-11-10 12:29:48,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:29:48,619 INFO L93 Difference]: Finished difference Result 135 states and 137 transitions. [2018-11-10 12:29:48,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-10 12:29:48,620 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 90 [2018-11-10 12:29:48,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:29:48,620 INFO L225 Difference]: With dead ends: 135 [2018-11-10 12:29:48,621 INFO L226 Difference]: Without dead ends: 103 [2018-11-10 12:29:48,621 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-10 12:29:48,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-11-10 12:29:48,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 98. [2018-11-10 12:29:48,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-11-10 12:29:48,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 99 transitions. [2018-11-10 12:29:48,627 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 99 transitions. Word has length 90 [2018-11-10 12:29:48,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:29:48,627 INFO L481 AbstractCegarLoop]: Abstraction has 98 states and 99 transitions. [2018-11-10 12:29:48,627 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-10 12:29:48,627 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 99 transitions. [2018-11-10 12:29:48,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-11-10 12:29:48,628 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:29:48,629 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-11-10 12:29:48,629 INFO L424 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:29:48,629 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:29:48,629 INFO L82 PathProgramCache]: Analyzing trace with hash 1110556464, now seen corresponding path program 6 times [2018-11-10 12:29:48,629 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:29:48,629 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:29:48,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:29:48,630 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:29:48,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:29:48,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:29:48,722 INFO L134 CoverageAnalysis]: Checked inductivity of 230 backedges. 0 proven. 212 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-10 12:29:48,722 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 12:29:48,722 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5f7cb060-361f-4b61-9f82-eb9ee2d1bc5b/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-11-10 12:29:48,737 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-10 12:29:48,768 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2018-11-10 12:29:48,768 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 12:29:48,774 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:29:48,819 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-11-10 12:29:48,821 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-11-10 12:29:48,821 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:29:48,823 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:29:48,827 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:29:48,827 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:20, output treesize:3 [2018-11-10 12:29:48,836 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-11-10 12:29:48,839 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-11-10 12:29:48,839 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:29:48,841 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:29:48,849 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-11-10 12:29:48,852 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-11-10 12:29:48,852 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 12:29:48,854 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:29:48,859 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:29:48,859 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:30, output treesize:3 [2018-11-10 12:29:49,110 INFO L134 CoverageAnalysis]: Checked inductivity of 230 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 219 trivial. 0 not checked. [2018-11-10 12:29:49,142 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 12:29:49,142 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14] total 23 [2018-11-10 12:29:49,143 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-10 12:29:49,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-10 12:29:49,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=419, Unknown=0, NotChecked=0, Total=506 [2018-11-10 12:29:49,144 INFO L87 Difference]: Start difference. First operand 98 states and 99 transitions. Second operand 23 states. [2018-11-10 12:29:49,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:29:49,628 INFO L93 Difference]: Finished difference Result 140 states and 143 transitions. [2018-11-10 12:29:49,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-10 12:29:49,629 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 97 [2018-11-10 12:29:49,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:29:49,629 INFO L225 Difference]: With dead ends: 140 [2018-11-10 12:29:49,629 INFO L226 Difference]: Without dead ends: 0 [2018-11-10 12:29:49,630 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 269 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=230, Invalid=1176, Unknown=0, NotChecked=0, Total=1406 [2018-11-10 12:29:49,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-10 12:29:49,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-10 12:29:49,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-10 12:29:49,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-10 12:29:49,631 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 97 [2018-11-10 12:29:49,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:29:49,631 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 12:29:49,631 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-10 12:29:49,631 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-10 12:29:49,632 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-10 12:29:49,635 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-10 12:29:49,686 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-10 12:29:49,687 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-11-10 12:29:49,687 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-10 12:29:49,687 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-10 12:29:49,687 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-10 12:29:49,687 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-10 12:29:49,687 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-10 12:29:49,687 INFO L425 ceAbstractionStarter]: For program point L35-2(lines 35 43) no Hoare annotation was computed. [2018-11-10 12:29:49,687 INFO L425 ceAbstractionStarter]: For program point L27-1(lines 27 30) no Hoare annotation was computed. [2018-11-10 12:29:49,687 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 20 50) no Hoare annotation was computed. [2018-11-10 12:29:49,687 INFO L425 ceAbstractionStarter]: For program point L27-3(lines 27 30) no Hoare annotation was computed. [2018-11-10 12:29:49,687 INFO L425 ceAbstractionStarter]: For program point L23(line 23) no Hoare annotation was computed. [2018-11-10 12:29:49,688 INFO L421 ceAbstractionStarter]: At program point L27-4(lines 27 30) the Hoare annotation is: (= |main_~#cont~0.offset| 0) [2018-11-10 12:29:49,688 INFO L425 ceAbstractionStarter]: For program point L27-5(lines 21 50) no Hoare annotation was computed. [2018-11-10 12:29:49,688 INFO L425 ceAbstractionStarter]: For program point L23-1(line 23) no Hoare annotation was computed. [2018-11-10 12:29:49,688 INFO L425 ceAbstractionStarter]: For program point L23-2(line 23) no Hoare annotation was computed. [2018-11-10 12:29:49,688 INFO L425 ceAbstractionStarter]: For program point L23-3(line 23) no Hoare annotation was computed. [2018-11-10 12:29:49,688 INFO L425 ceAbstractionStarter]: For program point L23-4(line 23) no Hoare annotation was computed. [2018-11-10 12:29:49,688 INFO L425 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2018-11-10 12:29:49,688 INFO L425 ceAbstractionStarter]: For program point L40-1(lines 40 42) no Hoare annotation was computed. [2018-11-10 12:29:49,688 INFO L425 ceAbstractionStarter]: For program point L36(line 36) no Hoare annotation was computed. [2018-11-10 12:29:49,688 INFO L425 ceAbstractionStarter]: For program point L36-1(line 36) no Hoare annotation was computed. [2018-11-10 12:29:49,688 INFO L425 ceAbstractionStarter]: For program point L32(lines 32 44) no Hoare annotation was computed. [2018-11-10 12:29:49,689 INFO L425 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2018-11-10 12:29:49,689 INFO L425 ceAbstractionStarter]: For program point L28-1(line 28) no Hoare annotation was computed. [2018-11-10 12:29:49,689 INFO L421 ceAbstractionStarter]: At program point L41(lines 21 50) the Hoare annotation is: false [2018-11-10 12:29:49,689 INFO L425 ceAbstractionStarter]: For program point L37-1(lines 37 39) no Hoare annotation was computed. [2018-11-10 12:29:49,689 INFO L425 ceAbstractionStarter]: For program point L37-2(lines 37 39) no Hoare annotation was computed. [2018-11-10 12:29:49,689 INFO L425 ceAbstractionStarter]: For program point L33(line 33) no Hoare annotation was computed. [2018-11-10 12:29:49,689 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-11-10 12:29:49,689 INFO L425 ceAbstractionStarter]: For program point L33-1(line 33) no Hoare annotation was computed. [2018-11-10 12:29:49,689 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-11-10 12:29:49,689 INFO L425 ceAbstractionStarter]: For program point L29(line 29) no Hoare annotation was computed. [2018-11-10 12:29:49,690 INFO L425 ceAbstractionStarter]: For program point L29-1(line 29) no Hoare annotation was computed. [2018-11-10 12:29:49,690 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 20 50) no Hoare annotation was computed. [2018-11-10 12:29:49,690 INFO L425 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 48) no Hoare annotation was computed. [2018-11-10 12:29:49,690 INFO L425 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2018-11-10 12:29:49,690 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 20 50) the Hoare annotation is: true [2018-11-10 12:29:49,690 INFO L425 ceAbstractionStarter]: For program point L22(line 22) no Hoare annotation was computed. [2018-11-10 12:29:49,690 INFO L425 ceAbstractionStarter]: For program point L22-1(line 22) no Hoare annotation was computed. [2018-11-10 12:29:49,690 INFO L425 ceAbstractionStarter]: For program point L22-2(line 22) no Hoare annotation was computed. [2018-11-10 12:29:49,690 INFO L425 ceAbstractionStarter]: For program point L22-3(line 22) no Hoare annotation was computed. [2018-11-10 12:29:49,690 INFO L425 ceAbstractionStarter]: For program point L22-4(line 22) no Hoare annotation was computed. [2018-11-10 12:29:49,690 INFO L425 ceAbstractionStarter]: For program point L35(line 35) no Hoare annotation was computed. [2018-11-10 12:29:49,691 INFO L425 ceAbstractionStarter]: For program point L35-1(line 35) no Hoare annotation was computed. [2018-11-10 12:29:49,691 INFO L425 ceAbstractionStarter]: For program point L17(line 17) no Hoare annotation was computed. [2018-11-10 12:29:49,691 INFO L425 ceAbstractionStarter]: For program point L17-1(line 17) no Hoare annotation was computed. [2018-11-10 12:29:49,691 INFO L428 ceAbstractionStarter]: At program point checkENTRY(lines 15 18) the Hoare annotation is: true [2018-11-10 12:29:49,691 INFO L425 ceAbstractionStarter]: For program point L17-2(line 17) no Hoare annotation was computed. [2018-11-10 12:29:49,691 INFO L425 ceAbstractionStarter]: For program point checkFINAL(lines 15 18) no Hoare annotation was computed. [2018-11-10 12:29:49,691 INFO L425 ceAbstractionStarter]: For program point checkEXIT(lines 15 18) no Hoare annotation was computed. [2018-11-10 12:29:49,698 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 12:29:49,699 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 12:29:49,701 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 12:29:49,701 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 12:29:49,701 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 12:29:49,703 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 12:29:49,703 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 12:29:49,704 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 12:29:49,704 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 12:29:49,704 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 12:29:49,706 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 12:29:49 BoogieIcfgContainer [2018-11-10 12:29:49,706 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-10 12:29:49,707 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 12:29:49,707 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 12:29:49,707 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 12:29:49,707 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:29:45" (3/4) ... [2018-11-10 12:29:49,710 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-10 12:29:49,715 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-10 12:29:49,716 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-10 12:29:49,716 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure check [2018-11-10 12:29:49,720 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2018-11-10 12:29:49,720 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2018-11-10 12:29:49,720 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-11-10 12:29:49,760 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_5f7cb060-361f-4b61-9f82-eb9ee2d1bc5b/bin-2019/uautomizer/witness.graphml [2018-11-10 12:29:49,760 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 12:29:49,761 INFO L168 Benchmark]: Toolchain (without parser) took 4798.53 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 188.2 MB). Free memory was 960.9 MB in the beginning and 1.0 GB in the end (delta: -49.5 MB). Peak memory consumption was 138.7 MB. Max. memory is 11.5 GB. [2018-11-10 12:29:49,762 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 12:29:49,762 INFO L168 Benchmark]: CACSL2BoogieTranslator took 247.51 ms. Allocated memory is still 1.0 GB. Free memory was 960.9 MB in the beginning and 950.1 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-10 12:29:49,763 INFO L168 Benchmark]: Boogie Preprocessor took 32.40 ms. Allocated memory is still 1.0 GB. Free memory was 950.1 MB in the beginning and 944.8 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-10 12:29:49,763 INFO L168 Benchmark]: RCFGBuilder took 287.87 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.7 MB). Free memory was 944.8 MB in the beginning and 1.1 GB in the end (delta: -180.2 MB). Peak memory consumption was 14.7 MB. Max. memory is 11.5 GB. [2018-11-10 12:29:49,763 INFO L168 Benchmark]: TraceAbstraction took 4173.20 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 43.5 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 103.3 MB). Peak memory consumption was 146.8 MB. Max. memory is 11.5 GB. [2018-11-10 12:29:49,763 INFO L168 Benchmark]: Witness Printer took 53.79 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 12:29:49,764 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 247.51 ms. Allocated memory is still 1.0 GB. Free memory was 960.9 MB in the beginning and 950.1 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 32.40 ms. Allocated memory is still 1.0 GB. Free memory was 950.1 MB in the beginning and 944.8 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 287.87 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.7 MB). Free memory was 944.8 MB in the beginning and 1.1 GB in the end (delta: -180.2 MB). Peak memory consumption was 14.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 4173.20 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 43.5 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 103.3 MB). Peak memory consumption was 146.8 MB. Max. memory is 11.5 GB. * Witness Printer took 53.79 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. 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-11-10 12:29:49,770 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 12:29:49,770 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 12:29:49,770 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 12:29:49,771 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 12:29:49,771 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 12:29:49,771 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 12:29:49,771 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 12:29:49,771 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 12:29:49,771 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 12:29:49,771 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, 4.1s OverallTime, 10 OverallIterations, 9 TraceHistogramMax, 1.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 331 SDtfs, 269 SDslu, 1707 SDs, 0 SdLazy, 961 SolverSat, 28 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 624 GetRequests, 514 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 449 ImplicationChecksByTransitivity, 1.3s 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.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.7s 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...