/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/ldv-regression/test22-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fb55353 [2019-11-06 21:10:43,456 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-06 21:10:43,459 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-06 21:10:43,477 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-06 21:10:43,478 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-06 21:10:43,480 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-06 21:10:43,482 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-06 21:10:43,491 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-06 21:10:43,495 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-06 21:10:43,498 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-06 21:10:43,500 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-06 21:10:43,502 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-06 21:10:43,502 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-06 21:10:43,504 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-06 21:10:43,506 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-06 21:10:43,508 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-06 21:10:43,510 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-06 21:10:43,510 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-06 21:10:43,512 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-06 21:10:43,517 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-06 21:10:43,522 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-06 21:10:43,525 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-06 21:10:43,528 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-06 21:10:43,529 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-06 21:10:43,531 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-06 21:10:43,532 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-06 21:10:43,532 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-06 21:10:43,534 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-06 21:10:43,534 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-06 21:10:43,536 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-06 21:10:43,536 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-06 21:10:43,537 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-06 21:10:43,538 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-06 21:10:43,539 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-06 21:10:43,540 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-06 21:10:43,541 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-06 21:10:43,541 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-06 21:10:43,542 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-06 21:10:43,542 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-06 21:10:43,543 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-06 21:10:43,543 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-06 21:10:43,544 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-06 21:10:43,572 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-06 21:10:43,572 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-06 21:10:43,573 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-06 21:10:43,575 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-06 21:10:43,575 INFO L138 SettingsManager]: * Use SBE=true [2019-11-06 21:10:43,575 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-06 21:10:43,576 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-06 21:10:43,576 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-06 21:10:43,576 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-06 21:10:43,576 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-06 21:10:43,576 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-06 21:10:43,577 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-06 21:10:43,577 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-06 21:10:43,577 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-06 21:10:43,577 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-06 21:10:43,577 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-06 21:10:43,578 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-06 21:10:43,578 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-06 21:10:43,578 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-06 21:10:43,578 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-06 21:10:43,578 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-06 21:10:43,579 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-06 21:10:43,579 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-06 21:10:43,579 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-06 21:10:43,579 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-06 21:10:43,579 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-06 21:10:43,580 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-06 21:10:43,580 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-06 21:10:43,580 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-06 21:10:43,855 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-06 21:10:43,877 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-06 21:10:43,881 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-06 21:10:43,882 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-06 21:10:43,883 INFO L275 PluginConnector]: CDTParser initialized [2019-11-06 21:10:43,883 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-regression/test22-1.c [2019-11-06 21:10:43,959 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38e62e761/90f70e47a76045838715ca22fdeef05f/FLAGddba97977 [2019-11-06 21:10:44,413 INFO L306 CDTParser]: Found 1 translation units. [2019-11-06 21:10:44,414 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-regression/test22-1.c [2019-11-06 21:10:44,420 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38e62e761/90f70e47a76045838715ca22fdeef05f/FLAGddba97977 [2019-11-06 21:10:44,777 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38e62e761/90f70e47a76045838715ca22fdeef05f [2019-11-06 21:10:44,786 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-06 21:10:44,788 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-11-06 21:10:44,789 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-06 21:10:44,789 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-06 21:10:44,793 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-06 21:10:44,794 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:10:44" (1/1) ... [2019-11-06 21:10:44,797 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50edd75b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:10:44, skipping insertion in model container [2019-11-06 21:10:44,798 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:10:44" (1/1) ... [2019-11-06 21:10:44,805 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-06 21:10:44,828 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-06 21:10:45,040 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-06 21:10:45,050 INFO L188 MainTranslator]: Completed pre-run [2019-11-06 21:10:45,067 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-06 21:10:45,083 INFO L192 MainTranslator]: Completed translation [2019-11-06 21:10:45,084 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:10:45 WrapperNode [2019-11-06 21:10:45,084 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-06 21:10:45,085 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-06 21:10:45,085 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-06 21:10:45,085 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-06 21:10:45,180 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:10:45" (1/1) ... [2019-11-06 21:10:45,180 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:10:45" (1/1) ... [2019-11-06 21:10:45,190 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:10:45" (1/1) ... [2019-11-06 21:10:45,190 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:10:45" (1/1) ... [2019-11-06 21:10:45,200 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:10:45" (1/1) ... [2019-11-06 21:10:45,205 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:10:45" (1/1) ... [2019-11-06 21:10:45,207 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:10:45" (1/1) ... [2019-11-06 21:10:45,209 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-06 21:10:45,210 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-06 21:10:45,210 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-06 21:10:45,210 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-06 21:10:45,211 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:10:45" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-11-06 21:10:45,266 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-06 21:10:45,266 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-06 21:10:45,266 INFO L138 BoogieDeclarations]: Found implementation of procedure init [2019-11-06 21:10:45,266 INFO L138 BoogieDeclarations]: Found implementation of procedure get_dummy [2019-11-06 21:10:45,266 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2019-11-06 21:10:45,266 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-06 21:10:45,267 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-06 21:10:45,267 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-06 21:10:45,267 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-11-06 21:10:45,267 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-11-06 21:10:45,267 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-06 21:10:45,267 INFO L130 BoogieDeclarations]: Found specification of procedure get_dummy [2019-11-06 21:10:45,267 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-11-06 21:10:45,268 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-06 21:10:45,268 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-06 21:10:45,268 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-06 21:10:45,268 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-06 21:10:45,268 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-11-06 21:10:45,268 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-06 21:10:45,269 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-06 21:10:45,563 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-06 21:10:45,563 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-11-06 21:10:45,565 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:10:45 BoogieIcfgContainer [2019-11-06 21:10:45,565 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-06 21:10:45,566 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-06 21:10:45,566 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-06 21:10:45,569 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-06 21:10:45,570 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 09:10:44" (1/3) ... [2019-11-06 21:10:45,571 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@abc8cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:10:45, skipping insertion in model container [2019-11-06 21:10:45,571 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:10:45" (2/3) ... [2019-11-06 21:10:45,571 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@abc8cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:10:45, skipping insertion in model container [2019-11-06 21:10:45,571 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:10:45" (3/3) ... [2019-11-06 21:10:45,573 INFO L109 eAbstractionObserver]: Analyzing ICFG test22-1.c [2019-11-06 21:10:45,587 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-06 21:10:45,599 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-06 21:10:45,624 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-06 21:10:45,655 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-06 21:10:45,655 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-06 21:10:45,655 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-06 21:10:45,655 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-06 21:10:45,655 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-06 21:10:45,655 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-06 21:10:45,656 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-06 21:10:45,656 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-06 21:10:45,671 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states. [2019-11-06 21:10:45,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-06 21:10:45,677 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:10:45,678 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 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] [2019-11-06 21:10:45,679 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:10:45,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:10:45,684 INFO L82 PathProgramCache]: Analyzing trace with hash 1345538594, now seen corresponding path program 1 times [2019-11-06 21:10:45,690 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:10:45,690 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033038962] [2019-11-06 21:10:45,691 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:10:45,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:10:45,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:10:45,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:10:46,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:10:46,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:10:46,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:10:46,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:10:46,059 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-11-06 21:10:46,060 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033038962] [2019-11-06 21:10:46,061 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:10:46,061 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-06 21:10:46,062 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121628618] [2019-11-06 21:10:46,068 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-06 21:10:46,068 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:10:46,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-06 21:10:46,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-06 21:10:46,082 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 4 states. [2019-11-06 21:10:46,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:10:46,310 INFO L93 Difference]: Finished difference Result 49 states and 56 transitions. [2019-11-06 21:10:46,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 21:10:46,312 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2019-11-06 21:10:46,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:10:46,323 INFO L225 Difference]: With dead ends: 49 [2019-11-06 21:10:46,323 INFO L226 Difference]: Without dead ends: 31 [2019-11-06 21:10:46,328 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-06 21:10:46,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-11-06 21:10:46,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-11-06 21:10:46,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-11-06 21:10:46,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2019-11-06 21:10:46,401 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 37 [2019-11-06 21:10:46,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:10:46,403 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2019-11-06 21:10:46,403 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-06 21:10:46,404 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2019-11-06 21:10:46,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-06 21:10:46,407 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:10:46,408 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 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] [2019-11-06 21:10:46,408 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:10:46,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:10:46,409 INFO L82 PathProgramCache]: Analyzing trace with hash -213153012, now seen corresponding path program 1 times [2019-11-06 21:10:46,409 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:10:46,410 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994415185] [2019-11-06 21:10:46,410 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:10:46,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:10:46,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:10:46,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:10:46,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:10:46,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:10:46,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:10:46,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:10:46,814 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-06 21:10:46,814 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994415185] [2019-11-06 21:10:46,815 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [546106867] [2019-11-06 21:10:46,815 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:10:46,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:10:46,904 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-06 21:10:46,917 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 21:10:47,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:10:47,134 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2019-11-06 21:10:47,137 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:10:47,145 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2019-11-06 21:10:47,146 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 21:10:47,157 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:10:47,158 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:10:47,159 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:43, output treesize:5 [2019-11-06 21:10:47,167 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-11-06 21:10:47,168 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-06 21:10:47,168 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [12] total 15 [2019-11-06 21:10:47,170 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306482570] [2019-11-06 21:10:47,172 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-06 21:10:47,174 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:10:47,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-06 21:10:47,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2019-11-06 21:10:47,176 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand 6 states. [2019-11-06 21:10:47,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:10:47,356 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2019-11-06 21:10:47,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-06 21:10:47,357 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 38 [2019-11-06 21:10:47,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:10:47,359 INFO L225 Difference]: With dead ends: 42 [2019-11-06 21:10:47,359 INFO L226 Difference]: Without dead ends: 34 [2019-11-06 21:10:47,361 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2019-11-06 21:10:47,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-11-06 21:10:47,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2019-11-06 21:10:47,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-11-06 21:10:47,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2019-11-06 21:10:47,379 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 38 [2019-11-06 21:10:47,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:10:47,380 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2019-11-06 21:10:47,381 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-06 21:10:47,389 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2019-11-06 21:10:47,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-06 21:10:47,391 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:10:47,391 INFO L410 BasicCegarLoop]: trace histogram [3, 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] [2019-11-06 21:10:47,597 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:10:47,597 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:10:47,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:10:47,598 INFO L82 PathProgramCache]: Analyzing trace with hash -655504409, now seen corresponding path program 1 times [2019-11-06 21:10:47,598 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:10:47,599 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969324389] [2019-11-06 21:10:47,599 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:10:47,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:10:47,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:10:47,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:10:47,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:10:47,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:10:47,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:10:47,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:10:47,916 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-06 21:10:47,917 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969324389] [2019-11-06 21:10:47,917 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [587308692] [2019-11-06 21:10:47,917 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:10:47,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:10:47,999 INFO L256 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-06 21:10:48,002 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 21:10:48,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:10:48,150 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2019-11-06 21:10:48,151 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:10:48,154 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2019-11-06 21:10:48,155 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 21:10:48,165 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:10:48,166 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:10:48,167 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:43, output treesize:5 [2019-11-06 21:10:48,170 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-11-06 21:10:48,171 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 21:10:48,171 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 7] total 18 [2019-11-06 21:10:48,172 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358617061] [2019-11-06 21:10:48,172 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-06 21:10:48,173 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:10:48,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-06 21:10:48,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2019-11-06 21:10:48,173 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 18 states. [2019-11-06 21:10:49,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:10:49,948 INFO L93 Difference]: Finished difference Result 71 states and 87 transitions. [2019-11-06 21:10:49,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-11-06 21:10:49,949 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 40 [2019-11-06 21:10:49,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:10:49,952 INFO L225 Difference]: With dead ends: 71 [2019-11-06 21:10:49,952 INFO L226 Difference]: Without dead ends: 63 [2019-11-06 21:10:49,953 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 215 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=224, Invalid=1182, Unknown=0, NotChecked=0, Total=1406 [2019-11-06 21:10:49,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-11-06 21:10:49,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 35. [2019-11-06 21:10:49,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-11-06 21:10:49,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2019-11-06 21:10:49,965 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 40 [2019-11-06 21:10:49,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:10:49,965 INFO L462 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2019-11-06 21:10:49,966 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-06 21:10:49,966 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2019-11-06 21:10:49,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-06 21:10:49,967 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:10:49,967 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 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] [2019-11-06 21:10:50,171 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:10:50,172 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:10:50,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:10:50,172 INFO L82 PathProgramCache]: Analyzing trace with hash -553434622, now seen corresponding path program 2 times [2019-11-06 21:10:50,173 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:10:50,173 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234964177] [2019-11-06 21:10:50,173 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:10:50,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:10:50,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:10:50,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:10:50,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:10:50,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:10:50,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:10:50,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:10:50,457 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-06 21:10:50,458 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234964177] [2019-11-06 21:10:50,458 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [720018262] [2019-11-06 21:10:50,458 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:10:50,530 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-06 21:10:50,531 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-06 21:10:50,533 INFO L256 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 23 conjunts are in the unsatisfiable core [2019-11-06 21:10:50,542 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 21:10:50,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:10:50,878 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2019-11-06 21:10:50,881 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:10:50,887 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2019-11-06 21:10:50,888 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 21:10:50,900 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:10:50,900 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:10:50,901 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:43, output treesize:5 [2019-11-06 21:10:50,906 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-06 21:10:50,907 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 21:10:50,907 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12] total 24 [2019-11-06 21:10:50,907 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537931576] [2019-11-06 21:10:50,908 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-11-06 21:10:50,909 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:10:50,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-11-06 21:10:50,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=488, Unknown=0, NotChecked=0, Total=552 [2019-11-06 21:10:50,910 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand 24 states. [2019-11-06 21:10:52,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:10:52,933 INFO L93 Difference]: Finished difference Result 75 states and 91 transitions. [2019-11-06 21:10:52,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-11-06 21:10:52,934 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 42 [2019-11-06 21:10:52,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:10:52,936 INFO L225 Difference]: With dead ends: 75 [2019-11-06 21:10:52,936 INFO L226 Difference]: Without dead ends: 67 [2019-11-06 21:10:52,938 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 371 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=344, Invalid=1912, Unknown=0, NotChecked=0, Total=2256 [2019-11-06 21:10:52,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-11-06 21:10:52,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 37. [2019-11-06 21:10:52,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-11-06 21:10:52,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2019-11-06 21:10:52,948 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 42 [2019-11-06 21:10:52,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:10:52,949 INFO L462 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2019-11-06 21:10:52,949 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-11-06 21:10:52,949 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2019-11-06 21:10:52,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-06 21:10:52,950 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:10:52,950 INFO L410 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 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] [2019-11-06 21:10:53,154 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:10:53,155 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:10:53,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:10:53,155 INFO L82 PathProgramCache]: Analyzing trace with hash -1248617123, now seen corresponding path program 3 times [2019-11-06 21:10:53,156 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:10:53,156 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26763396] [2019-11-06 21:10:53,156 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:10:53,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:10:53,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:10:53,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:10:53,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:10:53,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:10:53,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:10:53,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:10:53,508 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-06 21:10:53,508 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26763396] [2019-11-06 21:10:53,509 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [334873969] [2019-11-06 21:10:53,509 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:10:53,573 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-11-06 21:10:53,574 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-06 21:10:53,576 INFO L256 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 61 conjunts are in the unsatisfiable core [2019-11-06 21:10:53,579 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 21:10:53,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:10:53,951 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 11 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-06 21:10:53,951 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 21:10:53,951 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 30 [2019-11-06 21:10:53,952 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207366573] [2019-11-06 21:10:53,952 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-11-06 21:10:53,952 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:10:53,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-11-06 21:10:53,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=791, Unknown=0, NotChecked=0, Total=870 [2019-11-06 21:10:53,954 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand 30 states. [2019-11-06 21:10:56,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:10:56,549 INFO L93 Difference]: Finished difference Result 86 states and 103 transitions. [2019-11-06 21:10:56,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-11-06 21:10:56,550 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 44 [2019-11-06 21:10:56,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:10:56,552 INFO L225 Difference]: With dead ends: 86 [2019-11-06 21:10:56,552 INFO L226 Difference]: Without dead ends: 60 [2019-11-06 21:10:56,555 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 470 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=397, Invalid=2359, Unknown=0, NotChecked=0, Total=2756 [2019-11-06 21:10:56,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-11-06 21:10:56,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 42. [2019-11-06 21:10:56,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-11-06 21:10:56,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 49 transitions. [2019-11-06 21:10:56,567 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 49 transitions. Word has length 44 [2019-11-06 21:10:56,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:10:56,567 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 49 transitions. [2019-11-06 21:10:56,567 INFO L463 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-11-06 21:10:56,567 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2019-11-06 21:10:56,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-06 21:10:56,569 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:10:56,569 INFO L410 BasicCegarLoop]: trace histogram [4, 3, 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] [2019-11-06 21:10:56,772 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:10:56,773 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:10:56,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:10:56,774 INFO L82 PathProgramCache]: Analyzing trace with hash -1758090213, now seen corresponding path program 1 times [2019-11-06 21:10:56,774 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:10:56,775 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663901215] [2019-11-06 21:10:56,775 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:10:56,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:10:56,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:10:56,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:10:56,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:10:56,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:10:56,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:10:56,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:10:56,955 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-06 21:10:56,955 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663901215] [2019-11-06 21:10:56,955 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1001230598] [2019-11-06 21:10:56,955 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:10:57,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:10:57,023 INFO L256 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 20 conjunts are in the unsatisfiable core [2019-11-06 21:10:57,040 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 21:10:57,052 INFO L375 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 23 treesize of output 21 [2019-11-06 21:10:57,053 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-11-06 21:10:57,062 INFO L567 ElimStorePlain]: treesize reduction 14, result has 22.2 percent of original size [2019-11-06 21:10:57,063 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:10:57,063 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2019-11-06 21:10:57,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:10:57,151 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-06 21:10:57,151 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 21:10:57,152 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 18 [2019-11-06 21:10:57,152 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192148282] [2019-11-06 21:10:57,152 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-06 21:10:57,154 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:10:57,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-06 21:10:57,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2019-11-06 21:10:57,155 INFO L87 Difference]: Start difference. First operand 42 states and 49 transitions. Second operand 18 states. [2019-11-06 21:10:58,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:10:58,023 INFO L93 Difference]: Finished difference Result 65 states and 75 transitions. [2019-11-06 21:10:58,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-06 21:10:58,023 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 44 [2019-11-06 21:10:58,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:10:58,024 INFO L225 Difference]: With dead ends: 65 [2019-11-06 21:10:58,024 INFO L226 Difference]: Without dead ends: 40 [2019-11-06 21:10:58,026 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=153, Invalid=839, Unknown=0, NotChecked=0, Total=992 [2019-11-06 21:10:58,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-11-06 21:10:58,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-11-06 21:10:58,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-11-06 21:10:58,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2019-11-06 21:10:58,040 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 44 [2019-11-06 21:10:58,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:10:58,040 INFO L462 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2019-11-06 21:10:58,040 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-06 21:10:58,041 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2019-11-06 21:10:58,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-06 21:10:58,044 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:10:58,044 INFO L410 BasicCegarLoop]: trace histogram [4, 3, 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] [2019-11-06 21:10:58,249 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:10:58,249 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:10:58,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:10:58,250 INFO L82 PathProgramCache]: Analyzing trace with hash 802366875, now seen corresponding path program 2 times [2019-11-06 21:10:58,250 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:10:58,250 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939869231] [2019-11-06 21:10:58,250 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:10:58,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:10:58,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:10:58,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:10:58,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:10:58,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:10:58,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:10:58,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:10:58,427 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-06 21:10:58,428 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939869231] [2019-11-06 21:10:58,428 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [634404183] [2019-11-06 21:10:58,428 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:10:58,506 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-06 21:10:58,506 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-06 21:10:58,508 INFO L256 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 50 conjunts are in the unsatisfiable core [2019-11-06 21:10:58,511 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 21:10:58,982 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2019-11-06 21:10:58,982 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:10:58,992 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:10:58,993 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:10:58,993 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:13 [2019-11-06 21:10:59,030 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:10:59,031 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 21:10:59,031 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 19] total 31 [2019-11-06 21:10:59,031 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390508451] [2019-11-06 21:10:59,031 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-11-06 21:10:59,032 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:10:59,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-11-06 21:10:59,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=850, Unknown=0, NotChecked=0, Total=930 [2019-11-06 21:10:59,032 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand 31 states. [2019-11-06 21:11:00,649 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2019-11-06 21:11:00,780 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-11-06 21:11:01,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:11:01,434 INFO L93 Difference]: Finished difference Result 63 states and 70 transitions. [2019-11-06 21:11:01,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-11-06 21:11:01,435 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 44 [2019-11-06 21:11:01,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:11:01,436 INFO L225 Difference]: With dead ends: 63 [2019-11-06 21:11:01,436 INFO L226 Difference]: Without dead ends: 42 [2019-11-06 21:11:01,438 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 413 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=456, Invalid=2736, Unknown=0, NotChecked=0, Total=3192 [2019-11-06 21:11:01,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-11-06 21:11:01,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-11-06 21:11:01,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-11-06 21:11:01,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 45 transitions. [2019-11-06 21:11:01,446 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 45 transitions. Word has length 44 [2019-11-06 21:11:01,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:11:01,446 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 45 transitions. [2019-11-06 21:11:01,446 INFO L463 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-11-06 21:11:01,446 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2019-11-06 21:11:01,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-11-06 21:11:01,447 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:11:01,447 INFO L410 BasicCegarLoop]: trace histogram [5, 4, 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] [2019-11-06 21:11:01,651 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:11:01,651 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:11:01,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:11:01,652 INFO L82 PathProgramCache]: Analyzing trace with hash 324163060, now seen corresponding path program 3 times [2019-11-06 21:11:01,652 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:11:01,653 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047665831] [2019-11-06 21:11:01,653 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:11:01,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:11:01,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:11:01,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:11:01,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:11:01,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:11:01,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:11:01,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:11:01,935 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-06 21:11:01,936 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047665831] [2019-11-06 21:11:01,936 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [904219489] [2019-11-06 21:11:01,936 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:11:02,001 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-11-06 21:11:02,001 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-06 21:11:02,002 INFO L256 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 61 conjunts are in the unsatisfiable core [2019-11-06 21:11:02,005 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 21:11:02,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:11:02,360 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 12 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-06 21:11:02,361 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 21:11:02,361 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 31 [2019-11-06 21:11:02,361 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334201127] [2019-11-06 21:11:02,361 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-11-06 21:11:02,362 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:11:02,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-11-06 21:11:02,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=844, Unknown=0, NotChecked=0, Total=930 [2019-11-06 21:11:02,363 INFO L87 Difference]: Start difference. First operand 42 states and 45 transitions. Second operand 31 states. [2019-11-06 21:11:04,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:11:04,789 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2019-11-06 21:11:04,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-11-06 21:11:04,789 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 46 [2019-11-06 21:11:04,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:11:04,790 INFO L225 Difference]: With dead ends: 50 [2019-11-06 21:11:04,791 INFO L226 Difference]: Without dead ends: 0 [2019-11-06 21:11:04,793 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 542 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=459, Invalid=2621, Unknown=0, NotChecked=0, Total=3080 [2019-11-06 21:11:04,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-06 21:11:04,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-06 21:11:04,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-06 21:11:04,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-06 21:11:04,793 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 46 [2019-11-06 21:11:04,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:11:04,794 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-06 21:11:04,794 INFO L463 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-11-06 21:11:04,794 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-06 21:11:04,794 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-06 21:11:04,994 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:11:05,000 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-06 21:11:05,197 WARN L191 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 111 [2019-11-06 21:11:05,449 WARN L191 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 42 [2019-11-06 21:11:05,744 WARN L191 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 37 [2019-11-06 21:11:05,974 INFO L443 ceAbstractionStarter]: For program point initEXIT(lines 11 18) no Hoare annotation was computed. [2019-11-06 21:11:05,974 INFO L439 ceAbstractionStarter]: At program point initENTRY(lines 11 18) the Hoare annotation is: (or (= |~#d1~0.base| |~#d2~0.base|) (not (= |~#d2~0.offset| 0)) (not (= 0 |~#d1~0.offset|)) (= |#memory_int| |old(#memory_int)|)) [2019-11-06 21:11:05,974 INFO L443 ceAbstractionStarter]: For program point initFINAL(lines 11 18) no Hoare annotation was computed. [2019-11-06 21:11:05,974 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2019-11-06 21:11:05,975 INFO L439 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |~#d2~0.offset| |old(~#d2~0.offset)|) (= |~#d1~0.base| |old(~#d1~0.base)|) (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |~#d2~0.base| |old(~#d2~0.base)|) (= |~#d1~0.offset| |old(~#d1~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#length)| |#length|)) [2019-11-06 21:11:05,975 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-11-06 21:11:05,975 INFO L443 ceAbstractionStarter]: For program point get_dummyFINAL(lines 20 23) no Hoare annotation was computed. [2019-11-06 21:11:05,975 INFO L446 ceAbstractionStarter]: At program point get_dummyENTRY(lines 20 23) the Hoare annotation is: true [2019-11-06 21:11:05,975 INFO L443 ceAbstractionStarter]: For program point L22-1(line 22) no Hoare annotation was computed. [2019-11-06 21:11:05,975 INFO L443 ceAbstractionStarter]: For program point get_dummyEXIT(lines 20 23) no Hoare annotation was computed. [2019-11-06 21:11:05,975 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-06 21:11:05,975 INFO L439 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= 0 |~#d2~0.offset|) (not (= |~#d1~0.base| |~#d2~0.base|)) (= 0 |~#d1~0.offset|)) [2019-11-06 21:11:05,975 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-11-06 21:11:05,976 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-06 21:11:05,976 INFO L443 ceAbstractionStarter]: For program point L33(line 33) no Hoare annotation was computed. [2019-11-06 21:11:05,976 INFO L443 ceAbstractionStarter]: For program point L35-2(lines 35 44) no Hoare annotation was computed. [2019-11-06 21:11:05,976 INFO L439 ceAbstractionStarter]: At program point L33-1(line 33) the Hoare annotation is: (or (= |~#d1~0.base| |~#d2~0.base|) (not (= |~#d2~0.offset| 0)) (not (= 0 |~#d1~0.offset|)) (and (= main_~pd1~0.offset 0) (= |~#d2~0.base| main_~pd1~0.base)) (and (= |~#d1~0.base| main_~pd1~0.base) (= main_~pd1~0.offset |~#d1~0.offset|))) [2019-11-06 21:11:05,976 INFO L443 ceAbstractionStarter]: For program point L33-2(line 33) no Hoare annotation was computed. [2019-11-06 21:11:05,976 INFO L443 ceAbstractionStarter]: For program point L35-4(lines 35 44) no Hoare annotation was computed. [2019-11-06 21:11:05,976 INFO L439 ceAbstractionStarter]: At program point L33-3(line 33) the Hoare annotation is: (let ((.cse2 (= |~#d1~0.base| main_~pd1~0.base)) (.cse0 (= main_~pd2~0.offset 0)) (.cse1 (= main_~pd1~0.offset 0)) (.cse3 (not (= main_~pd2~0.base main_~pd1~0.base)))) (or (and .cse0 .cse1 (= |~#d2~0.base| main_~pd1~0.base)) (= |~#d1~0.base| |~#d2~0.base|) (and .cse0 .cse2 (= main_~pd1~0.offset |~#d1~0.offset|)) (not (= |~#d2~0.offset| 0)) (and .cse3 .cse2) (not (= 0 |~#d1~0.offset|)) (and .cse0 .cse1 .cse3))) [2019-11-06 21:11:05,978 INFO L443 ceAbstractionStarter]: For program point L33-4(line 33) no Hoare annotation was computed. [2019-11-06 21:11:05,978 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 30 50) no Hoare annotation was computed. [2019-11-06 21:11:05,978 INFO L443 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 48) no Hoare annotation was computed. [2019-11-06 21:11:05,978 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 30 50) no Hoare annotation was computed. [2019-11-06 21:11:05,979 INFO L439 ceAbstractionStarter]: At program point L42(lines 31 50) the Hoare annotation is: (or (= |~#d1~0.base| |~#d2~0.base|) (not (= |~#d2~0.offset| 0)) (not (= 0 |~#d1~0.offset|))) [2019-11-06 21:11:05,979 INFO L443 ceAbstractionStarter]: For program point L38-1(lines 38 40) no Hoare annotation was computed. [2019-11-06 21:11:05,979 INFO L439 ceAbstractionStarter]: At program point L38-3(lines 38 40) the Hoare annotation is: (let ((.cse2 (= main_~pd1~0.offset 0))) (let ((.cse0 (= main_~pd2~0.base main_~pa~0.base)) (.cse1 (= main_~pd2~0.offset 0)) (.cse3 (<= main_~i~0 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))) (.cse4 (= main_~pd2~0.base main_~pd1~0.base)) (.cse5 (or (not (= 0 main_~pd1~0.base)) (not .cse2)))) (or (not (= |~#d2~0.offset| 0)) (and (= main_~pd2~0.offset main_~pa~0.offset) .cse0 .cse1 .cse2 (= |~#d2~0.base| main_~pd1~0.base) .cse3 .cse4 .cse5) (and (= 0 main_~pa~0.offset) .cse0 .cse1 .cse3 .cse4 .cse5 (= |~#d1~0.base| main_~pd1~0.base) (= main_~pd1~0.offset |~#d1~0.offset|)) (= |~#d1~0.base| |~#d2~0.base|) (not (= 0 |~#d1~0.offset|))))) [2019-11-06 21:11:05,979 INFO L439 ceAbstractionStarter]: At program point L38-4(lines 38 40) the Hoare annotation is: (let ((.cse6 (= main_~pd1~0.offset 0))) (let ((.cse0 (select |#memory_int| main_~pd2~0.base)) (.cse1 (= main_~pd2~0.base main_~pa~0.base)) (.cse2 (= main_~pd2~0.offset 0)) (.cse3 (<= main_~i~0 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))) (.cse4 (= main_~pd2~0.base main_~pd1~0.base)) (.cse5 (or (not (= 0 main_~pd1~0.base)) (not .cse6)))) (or (= |~#d1~0.base| |~#d2~0.base|) (not (= |~#d2~0.offset| 0)) (and (<= (select .cse0 0) main_~i~0) (= 0 main_~pa~0.offset) .cse1 .cse2 .cse3 .cse4 .cse5 (= |~#d1~0.base| main_~pd1~0.base) (= main_~pd1~0.offset |~#d1~0.offset|)) (not (= 0 |~#d1~0.offset|)) (and (= main_~pd2~0.offset main_~pa~0.offset) (<= (select .cse0 main_~pd2~0.offset) main_~i~0) .cse1 .cse2 .cse6 (= |~#d2~0.base| main_~pd1~0.base) .cse3 .cse4 .cse5)))) [2019-11-06 21:11:05,980 INFO L446 ceAbstractionStarter]: At program point L32(line 32) the Hoare annotation is: true [2019-11-06 21:11:05,980 INFO L439 ceAbstractionStarter]: At program point mainENTRY(lines 30 50) the Hoare annotation is: (or (= |~#d1~0.base| |~#d2~0.base|) (not (= |~#d2~0.offset| 0)) (not (= 0 |~#d1~0.offset|)) (= |#memory_int| |old(#memory_int)|)) [2019-11-06 21:11:05,980 INFO L443 ceAbstractionStarter]: For program point L41(line 41) no Hoare annotation was computed. [2019-11-06 21:11:05,980 INFO L443 ceAbstractionStarter]: For program point L41-1(lines 41 43) no Hoare annotation was computed. [2019-11-06 21:11:05,980 INFO L443 ceAbstractionStarter]: For program point L35(line 35) no Hoare annotation was computed. [2019-11-06 21:11:05,980 INFO L446 ceAbstractionStarter]: At program point checkENTRY(lines 25 28) the Hoare annotation is: true [2019-11-06 21:11:05,980 INFO L443 ceAbstractionStarter]: For program point checkFINAL(lines 25 28) no Hoare annotation was computed. [2019-11-06 21:11:05,980 INFO L443 ceAbstractionStarter]: For program point checkEXIT(lines 25 28) no Hoare annotation was computed. [2019-11-06 21:11:05,993 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-06 21:11:05,995 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-06 21:11:06,003 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-06 21:11:06,005 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-06 21:11:06,011 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 09:11:06 BoogieIcfgContainer [2019-11-06 21:11:06,011 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-06 21:11:06,019 INFO L168 Benchmark]: Toolchain (without parser) took 21225.08 ms. Allocated memory was 147.3 MB in the beginning and 372.2 MB in the end (delta: 224.9 MB). Free memory was 104.0 MB in the beginning and 150.1 MB in the end (delta: -46.0 MB). Peak memory consumption was 223.0 MB. Max. memory is 7.1 GB. [2019-11-06 21:11:06,019 INFO L168 Benchmark]: CDTParser took 0.46 ms. Allocated memory is still 147.3 MB. Free memory is still 121.9 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-11-06 21:11:06,020 INFO L168 Benchmark]: CACSL2BoogieTranslator took 295.20 ms. Allocated memory is still 147.3 MB. Free memory was 104.0 MB in the beginning and 93.8 MB in the end (delta: 10.3 MB). Peak memory consumption was 10.3 MB. Max. memory is 7.1 GB. [2019-11-06 21:11:06,023 INFO L168 Benchmark]: Boogie Preprocessor took 125.08 ms. Allocated memory was 147.3 MB in the beginning and 205.0 MB in the end (delta: 57.7 MB). Free memory was 93.8 MB in the beginning and 182.8 MB in the end (delta: -89.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. [2019-11-06 21:11:06,024 INFO L168 Benchmark]: RCFGBuilder took 354.89 ms. Allocated memory is still 205.0 MB. Free memory was 182.8 MB in the beginning and 164.7 MB in the end (delta: 18.1 MB). Peak memory consumption was 18.1 MB. Max. memory is 7.1 GB. [2019-11-06 21:11:06,031 INFO L168 Benchmark]: TraceAbstraction took 20445.42 ms. Allocated memory was 205.0 MB in the beginning and 372.2 MB in the end (delta: 167.2 MB). Free memory was 163.8 MB in the beginning and 150.1 MB in the end (delta: 13.7 MB). Peak memory consumption was 225.1 MB. Max. memory is 7.1 GB. [2019-11-06 21:11:06,039 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.46 ms. Allocated memory is still 147.3 MB. Free memory is still 121.9 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 295.20 ms. Allocated memory is still 147.3 MB. Free memory was 104.0 MB in the beginning and 93.8 MB in the end (delta: 10.3 MB). Peak memory consumption was 10.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 125.08 ms. Allocated memory was 147.3 MB in the beginning and 205.0 MB in the end (delta: 57.7 MB). Free memory was 93.8 MB in the beginning and 182.8 MB in the end (delta: -89.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 354.89 ms. Allocated memory is still 205.0 MB. Free memory was 182.8 MB in the beginning and 164.7 MB in the end (delta: 18.1 MB). Peak memory consumption was 18.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 20445.42 ms. Allocated memory was 205.0 MB in the beginning and 372.2 MB in the end (delta: 167.2 MB). Free memory was 163.8 MB in the beginning and 150.1 MB in the end (delta: 13.7 MB). Peak memory consumption was 225.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * 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: 38]: Loop Invariant [2019-11-06 21:11:06,051 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-06 21:11:06,051 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-06 21:11:06,056 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-06 21:11:06,056 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: (((!(d2 == 0) || (((((((pd2 == pa && pd2 == pa) && pd2 == 0) && pd1 == 0) && d2 == pd1) && i <= unknown-#memory_int-unknown[pa][pa]) && pd2 == pd1) && (!(0 == pd1) || !(pd1 == 0)))) || (((((((0 == pa && pd2 == pa) && pd2 == 0) && i <= unknown-#memory_int-unknown[pa][pa]) && pd2 == pd1) && (!(0 == pd1) || !(pd1 == 0))) && d1 == pd1) && pd1 == d1)) || d1 == d2) || !(0 == d1) - InvariantResult [Line: 31]: Loop Invariant Derived loop invariant: (d1 == d2 || !(d2 == 0)) || !(0 == d1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 36 locations, 1 error locations. Result: SAFE, OverallTime: 20.3s, OverallIterations: 8, TraceHistogramMax: 5, AutomataDifference: 12.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.9s, HoareTripleCheckerStatistics: 175 SDtfs, 569 SDslu, 590 SDs, 0 SdLazy, 3871 SolverSat, 515 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 622 GetRequests, 332 SyntacticMatches, 0 SemanticMatches, 290 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2135 ImplicationChecksByTransitivity, 11.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=42occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 77 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 13 LocationsWithAnnotation, 28 PreInvPairs, 45 NumberOfFragments, 337 HoareAnnotationTreeSize, 28 FomulaSimplifications, 8785 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 13 FomulaSimplificationsInter, 2083 FormulaSimplificationTreeSizeReductionInter, 0.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.2s InterpolantComputationTime, 633 NumberOfCodeBlocks, 627 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 618 ConstructedInterpolants, 0 QuantifiedInterpolants, 123792 SizeOfPredicates, 67 NumberOfNonLiveVariables, 1343 ConjunctsInSsa, 234 ConjunctsInUnsatCore, 15 InterpolantComputations, 2 PerfectInterpolantSequences, 148/308 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...