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/test23-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-efa34d5 [2019-09-16 16:24:13,525 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-16 16:24:13,527 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-16 16:24:13,541 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-16 16:24:13,542 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-16 16:24:13,543 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-16 16:24:13,546 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-16 16:24:13,550 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-16 16:24:13,554 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-16 16:24:13,554 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-16 16:24:13,562 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-16 16:24:13,564 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-16 16:24:13,564 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-16 16:24:13,565 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-16 16:24:13,566 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-16 16:24:13,567 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-16 16:24:13,568 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-16 16:24:13,568 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-16 16:24:13,570 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-16 16:24:13,572 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-16 16:24:13,573 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-16 16:24:13,574 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-16 16:24:13,575 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-16 16:24:13,575 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-16 16:24:13,577 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-16 16:24:13,578 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-16 16:24:13,578 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-16 16:24:13,579 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-16 16:24:13,579 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-16 16:24:13,580 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-16 16:24:13,580 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-16 16:24:13,581 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-16 16:24:13,581 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-16 16:24:13,582 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-16 16:24:13,583 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-16 16:24:13,583 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-16 16:24:13,584 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-16 16:24:13,584 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-16 16:24:13,584 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-16 16:24:13,585 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-16 16:24:13,586 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-16 16:24:13,586 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-09-16 16:24:13,600 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-16 16:24:13,600 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-16 16:24:13,601 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-16 16:24:13,602 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-16 16:24:13,602 INFO L138 SettingsManager]: * Use SBE=true [2019-09-16 16:24:13,602 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-16 16:24:13,602 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-16 16:24:13,602 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-16 16:24:13,603 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-16 16:24:13,603 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-16 16:24:13,603 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-16 16:24:13,603 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-16 16:24:13,603 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-16 16:24:13,604 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-16 16:24:13,604 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-16 16:24:13,604 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-16 16:24:13,604 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-16 16:24:13,604 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-16 16:24:13,605 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-16 16:24:13,605 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-16 16:24:13,605 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-16 16:24:13,605 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-16 16:24:13,605 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-16 16:24:13,606 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-16 16:24:13,606 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-16 16:24:13,606 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-16 16:24:13,606 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-16 16:24:13,606 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-16 16:24:13,606 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-16 16:24:13,647 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-16 16:24:13,657 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-16 16:24:13,661 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-16 16:24:13,662 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-16 16:24:13,662 INFO L275 PluginConnector]: CDTParser initialized [2019-09-16 16:24:13,663 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-regression/test23-2.c [2019-09-16 16:24:13,722 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b260a2c31/b4f8529ba0c54113a826d2af726826f1/FLAGedd0aa154 [2019-09-16 16:24:14,163 INFO L306 CDTParser]: Found 1 translation units. [2019-09-16 16:24:14,164 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-regression/test23-2.c [2019-09-16 16:24:14,170 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b260a2c31/b4f8529ba0c54113a826d2af726826f1/FLAGedd0aa154 [2019-09-16 16:24:14,536 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b260a2c31/b4f8529ba0c54113a826d2af726826f1 [2019-09-16 16:24:14,546 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-16 16:24:14,548 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-16 16:24:14,548 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-16 16:24:14,549 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-16 16:24:14,552 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-16 16:24:14,553 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.09 04:24:14" (1/1) ... [2019-09-16 16:24:14,555 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5182a5c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:24:14, skipping insertion in model container [2019-09-16 16:24:14,556 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.09 04:24:14" (1/1) ... [2019-09-16 16:24:14,563 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-16 16:24:14,580 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-16 16:24:14,772 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-16 16:24:14,784 INFO L188 MainTranslator]: Completed pre-run [2019-09-16 16:24:14,891 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-16 16:24:14,907 INFO L192 MainTranslator]: Completed translation [2019-09-16 16:24:14,908 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:24:14 WrapperNode [2019-09-16 16:24:14,908 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-16 16:24:14,909 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-16 16:24:14,909 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-16 16:24:14,909 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-16 16:24:14,919 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:24:14" (1/1) ... [2019-09-16 16:24:14,919 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:24:14" (1/1) ... [2019-09-16 16:24:14,926 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:24:14" (1/1) ... [2019-09-16 16:24:14,926 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:24:14" (1/1) ... [2019-09-16 16:24:14,935 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:24:14" (1/1) ... [2019-09-16 16:24:14,939 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:24:14" (1/1) ... [2019-09-16 16:24:14,940 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:24:14" (1/1) ... [2019-09-16 16:24:14,943 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-16 16:24:14,943 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-16 16:24:14,943 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-16 16:24:14,943 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-16 16:24:14,944 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:24:14" (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-09-16 16:24:14,997 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-16 16:24:14,998 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-16 16:24:14,998 INFO L138 BoogieDeclarations]: Found implementation of procedure init [2019-09-16 16:24:14,998 INFO L138 BoogieDeclarations]: Found implementation of procedure get_dummy [2019-09-16 16:24:14,998 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2019-09-16 16:24:14,998 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-16 16:24:14,998 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-16 16:24:14,998 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-16 16:24:14,999 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-16 16:24:14,999 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-16 16:24:14,999 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-16 16:24:14,999 INFO L130 BoogieDeclarations]: Found specification of procedure get_dummy [2019-09-16 16:24:14,999 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-16 16:24:15,000 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-16 16:24:15,000 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-16 16:24:15,000 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-16 16:24:15,000 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-16 16:24:15,000 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-16 16:24:15,000 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-16 16:24:15,266 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-16 16:24:15,267 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-16 16:24:15,268 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.09 04:24:15 BoogieIcfgContainer [2019-09-16 16:24:15,268 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-16 16:24:15,274 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-16 16:24:15,274 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-16 16:24:15,277 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-16 16:24:15,277 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.09 04:24:14" (1/3) ... [2019-09-16 16:24:15,278 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c64802 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.09 04:24:15, skipping insertion in model container [2019-09-16 16:24:15,278 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:24:14" (2/3) ... [2019-09-16 16:24:15,278 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c64802 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.09 04:24:15, skipping insertion in model container [2019-09-16 16:24:15,279 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.09 04:24:15" (3/3) ... [2019-09-16 16:24:15,281 INFO L109 eAbstractionObserver]: Analyzing ICFG test23-2.c [2019-09-16 16:24:15,291 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-16 16:24:15,297 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-16 16:24:15,314 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-16 16:24:15,340 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-16 16:24:15,341 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-16 16:24:15,341 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-16 16:24:15,341 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-16 16:24:15,341 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-16 16:24:15,341 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-16 16:24:15,341 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-16 16:24:15,341 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-16 16:24:15,342 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-16 16:24:15,359 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states. [2019-09-16 16:24:15,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-16 16:24:15,364 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:24:15,365 INFO L407 BasicCegarLoop]: trace histogram [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] [2019-09-16 16:24:15,366 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:24:15,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:24:15,371 INFO L82 PathProgramCache]: Analyzing trace with hash -128514638, now seen corresponding path program 1 times [2019-09-16 16:24:15,372 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:24:15,373 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:24:15,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:24:15,421 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:24:15,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:24:15,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:24:15,582 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-16 16:24:15,585 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:24:15,585 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-16 16:24:15,589 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-16 16:24:15,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-16 16:24:15,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-16 16:24:15,605 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 2 states. [2019-09-16 16:24:15,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:24:15,626 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2019-09-16 16:24:15,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-16 16:24:15,628 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 30 [2019-09-16 16:24:15,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:24:15,637 INFO L225 Difference]: With dead ends: 46 [2019-09-16 16:24:15,638 INFO L226 Difference]: Without dead ends: 28 [2019-09-16 16:24:15,641 INFO L636 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 [2019-09-16 16:24:15,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-09-16 16:24:15,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-09-16 16:24:15,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-09-16 16:24:15,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2019-09-16 16:24:15,684 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 30 [2019-09-16 16:24:15,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:24:15,686 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2019-09-16 16:24:15,686 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-16 16:24:15,687 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2019-09-16 16:24:15,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-09-16 16:24:15,689 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:24:15,689 INFO L407 BasicCegarLoop]: trace histogram [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] [2019-09-16 16:24:15,689 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:24:15,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:24:15,690 INFO L82 PathProgramCache]: Analyzing trace with hash -1246729484, now seen corresponding path program 1 times [2019-09-16 16:24:15,690 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:24:15,690 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:24:15,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:24:15,693 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:24:15,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:24:15,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:24:16,076 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-16 16:24:16,076 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:24:16,076 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-16 16:24:16,078 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-16 16:24:16,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-16 16:24:16,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-09-16 16:24:16,079 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand 11 states. [2019-09-16 16:24:16,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:24:16,514 INFO L93 Difference]: Finished difference Result 56 states and 63 transitions. [2019-09-16 16:24:16,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-16 16:24:16,515 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 31 [2019-09-16 16:24:16,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:24:16,518 INFO L225 Difference]: With dead ends: 56 [2019-09-16 16:24:16,519 INFO L226 Difference]: Without dead ends: 48 [2019-09-16 16:24:16,520 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2019-09-16 16:24:16,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-09-16 16:24:16,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 30. [2019-09-16 16:24:16,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-09-16 16:24:16,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2019-09-16 16:24:16,531 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 31 [2019-09-16 16:24:16,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:24:16,532 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2019-09-16 16:24:16,532 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-16 16:24:16,532 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2019-09-16 16:24:16,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-09-16 16:24:16,533 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:24:16,534 INFO L407 BasicCegarLoop]: trace histogram [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] [2019-09-16 16:24:16,534 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:24:16,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:24:16,534 INFO L82 PathProgramCache]: Analyzing trace with hash 1472168143, now seen corresponding path program 1 times [2019-09-16 16:24:16,535 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:24:16,535 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:24:16,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:24:16,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:24:16,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:24:16,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:24:16,811 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-16 16:24:16,812 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 16:24:16,812 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-09-16 16:24:16,846 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:24:16,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:24:16,894 INFO L256 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 40 conjunts are in the unsatisfiable core [2019-09-16 16:24:16,902 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-16 16:24:17,150 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 24 treesize of output 20 [2019-09-16 16:24:17,150 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-16 16:24:17,164 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:24:17,166 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-16 16:24:17,167 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:54, output treesize:50 [2019-09-16 16:24:17,284 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-16 16:24:17,286 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:24:17,287 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 19 [2019-09-16 16:24:17,290 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-16 16:24:17,302 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:24:17,303 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-16 16:24:17,304 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:57, output treesize:22 [2019-09-16 16:24:19,158 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-16 16:24:19,163 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-16 16:24:19,163 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 22 [2019-09-16 16:24:19,163 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-16 16:24:19,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-16 16:24:19,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=400, Unknown=2, NotChecked=0, Total=462 [2019-09-16 16:24:19,164 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand 22 states. [2019-09-16 16:24:24,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:24:24,849 INFO L93 Difference]: Finished difference Result 60 states and 67 transitions. [2019-09-16 16:24:24,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-16 16:24:24,850 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 33 [2019-09-16 16:24:24,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:24:24,851 INFO L225 Difference]: With dead ends: 60 [2019-09-16 16:24:24,851 INFO L226 Difference]: Without dead ends: 52 [2019-09-16 16:24:24,853 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=157, Invalid=831, Unknown=4, NotChecked=0, Total=992 [2019-09-16 16:24:24,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-09-16 16:24:24,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 32. [2019-09-16 16:24:24,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-09-16 16:24:24,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2019-09-16 16:24:24,862 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 33 [2019-09-16 16:24:24,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:24:24,863 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2019-09-16 16:24:24,863 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-16 16:24:24,863 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2019-09-16 16:24:24,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-09-16 16:24:24,866 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:24:24,866 INFO L407 BasicCegarLoop]: trace histogram [3, 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] [2019-09-16 16:24:24,867 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:24:24,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:24:24,867 INFO L82 PathProgramCache]: Analyzing trace with hash -1302295574, now seen corresponding path program 2 times [2019-09-16 16:24:24,868 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:24:24,868 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:24:24,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:24:24,872 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:24:24,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:24:24,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:24:25,207 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-16 16:24:25,208 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 16:24:25,208 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-16 16:24:25,230 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-16 16:24:25,264 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-16 16:24:25,264 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-16 16:24:25,266 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 40 conjunts are in the unsatisfiable core [2019-09-16 16:24:25,270 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-16 16:24:25,361 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 30 treesize of output 26 [2019-09-16 16:24:25,362 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-16 16:24:25,370 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:24:25,371 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-16 16:24:25,371 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:64, output treesize:60 [2019-09-16 16:24:25,491 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-16 16:24:25,493 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:24:25,494 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 22 [2019-09-16 16:24:25,495 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-16 16:24:25,515 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:24:25,516 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-16 16:24:25,516 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:67, output treesize:35 [2019-09-16 16:24:25,562 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (3)] Exception during sending of exit command (exit): Broken pipe [2019-09-16 16:24:25,566 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-16 16:24:25,567 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 22 [2019-09-16 16:24:25,567 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-16 16:24:25,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-16 16:24:25,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=394, Unknown=0, NotChecked=0, Total=462 [2019-09-16 16:24:25,568 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand 22 states. [2019-09-16 16:24:26,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:24:26,785 INFO L93 Difference]: Finished difference Result 79 states and 88 transitions. [2019-09-16 16:24:26,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-16 16:24:26,786 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 35 [2019-09-16 16:24:26,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:24:26,787 INFO L225 Difference]: With dead ends: 79 [2019-09-16 16:24:26,788 INFO L226 Difference]: Without dead ends: 71 [2019-09-16 16:24:26,789 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 451 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=379, Invalid=1601, Unknown=0, NotChecked=0, Total=1980 [2019-09-16 16:24:26,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-09-16 16:24:26,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 34. [2019-09-16 16:24:26,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-09-16 16:24:26,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 36 transitions. [2019-09-16 16:24:26,797 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 36 transitions. Word has length 35 [2019-09-16 16:24:26,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:24:26,797 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 36 transitions. [2019-09-16 16:24:26,798 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-16 16:24:26,798 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2019-09-16 16:24:26,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-09-16 16:24:26,799 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:24:26,799 INFO L407 BasicCegarLoop]: trace histogram [4, 3, 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] [2019-09-16 16:24:26,799 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:24:26,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:24:26,800 INFO L82 PathProgramCache]: Analyzing trace with hash -387236795, now seen corresponding path program 3 times [2019-09-16 16:24:26,800 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:24:26,800 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:24:26,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:24:26,802 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-16 16:24:26,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:24:26,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:24:27,085 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-16 16:24:27,085 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 16:24:27,086 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-09-16 16:24:27,117 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-16 16:24:27,156 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-09-16 16:24:27,156 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-16 16:24:27,158 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 42 conjunts are in the unsatisfiable core [2019-09-16 16:24:27,161 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-16 16:24:27,238 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 30 treesize of output 26 [2019-09-16 16:24:27,238 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-16 16:24:27,247 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:24:27,248 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-16 16:24:27,248 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:46, output treesize:42 [2019-09-16 16:24:29,458 WARN L860 $PredicateComparison]: unable to prove that (exists ((main_~pa~0.offset Int) (v_main_~pd2~0.base_BEFORE_CALL_1 Int)) (and (let ((.cse0 (div (+ main_~pa~0.offset (- 8)) 4))) (= .cse0 (select (select |c_#memory_int| v_main_~pd2~0.base_BEFORE_CALL_1) (+ (* 4 .cse0) 8)))) (= 0 (mod main_~pa~0.offset 4)))) is different from true [2019-09-16 16:24:35,543 WARN L191 SmtUtils]: Spent 6.03 s on a formula simplification that was a NOOP. DAG size: 34 [2019-09-16 16:24:35,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:24:35,646 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-16 16:24:35,657 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-16 16:24:35,657 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 27 [2019-09-16 16:24:35,658 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-09-16 16:24:35,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-09-16 16:24:35,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=579, Unknown=1, NotChecked=48, Total=702 [2019-09-16 16:24:35,659 INFO L87 Difference]: Start difference. First operand 34 states and 36 transitions. Second operand 27 states. [2019-09-16 16:25:02,049 WARN L191 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 21 [2019-09-16 16:25:08,124 WARN L191 SmtUtils]: Spent 6.04 s on a formula simplification that was a NOOP. DAG size: 37 [2019-09-16 16:25:26,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:25:26,576 INFO L93 Difference]: Finished difference Result 84 states and 94 transitions. [2019-09-16 16:25:26,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-09-16 16:25:26,576 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 37 [2019-09-16 16:25:26,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:25:26,578 INFO L225 Difference]: With dead ends: 84 [2019-09-16 16:25:26,578 INFO L226 Difference]: Without dead ends: 36 [2019-09-16 16:25:26,581 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 65 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1020 ImplicationChecksByTransitivity, 57.0s TimeCoverageRelationStatistics Valid=687, Invalid=3564, Unknown=43, NotChecked=128, Total=4422 [2019-09-16 16:25:26,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-09-16 16:25:26,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-09-16 16:25:26,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-09-16 16:25:26,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2019-09-16 16:25:26,587 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 37 [2019-09-16 16:25:26,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:25:26,588 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2019-09-16 16:25:26,588 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-09-16 16:25:26,588 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2019-09-16 16:25:26,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-09-16 16:25:26,589 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:25:26,589 INFO L407 BasicCegarLoop]: trace histogram [5, 4, 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] [2019-09-16 16:25:26,590 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:25:26,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:25:26,590 INFO L82 PathProgramCache]: Analyzing trace with hash -1903280796, now seen corresponding path program 1 times [2019-09-16 16:25:26,590 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:25:26,590 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:25:26,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:25:26,592 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-16 16:25:26,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:25:26,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:25:26,890 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-16 16:25:26,890 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 16:25:26,890 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-09-16 16:25:26,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:25:26,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:25:26,939 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 43 conjunts are in the unsatisfiable core [2019-09-16 16:25:26,942 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-16 16:25:27,112 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 24 treesize of output 20 [2019-09-16 16:25:27,112 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-16 16:25:27,124 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:25:27,125 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-16 16:25:27,125 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:54, output treesize:50 [2019-09-16 16:25:27,341 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-16 16:25:27,343 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:25:27,343 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 19 [2019-09-16 16:25:27,344 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-16 16:25:27,353 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:25:27,354 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-16 16:25:27,354 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:57, output treesize:22 [2019-09-16 16:25:29,400 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-16 16:25:29,405 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-16 16:25:29,406 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17] total 28 [2019-09-16 16:25:29,406 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-16 16:25:29,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-16 16:25:29,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=649, Unknown=2, NotChecked=0, Total=756 [2019-09-16 16:25:29,407 INFO L87 Difference]: Start difference. First operand 36 states and 37 transitions. Second operand 28 states. [2019-09-16 16:25:30,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:25:30,140 INFO L93 Difference]: Finished difference Result 46 states and 47 transitions. [2019-09-16 16:25:30,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-16 16:25:30,141 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 39 [2019-09-16 16:25:30,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:25:30,142 INFO L225 Difference]: With dead ends: 46 [2019-09-16 16:25:30,142 INFO L226 Difference]: Without dead ends: 38 [2019-09-16 16:25:30,143 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 313 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=293, Invalid=1265, Unknown=2, NotChecked=0, Total=1560 [2019-09-16 16:25:30,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-09-16 16:25:30,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-09-16 16:25:30,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-09-16 16:25:30,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2019-09-16 16:25:30,150 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 39 transitions. Word has length 39 [2019-09-16 16:25:30,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:25:30,150 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 39 transitions. [2019-09-16 16:25:30,150 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-16 16:25:30,151 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2019-09-16 16:25:30,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-09-16 16:25:30,152 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:25:30,152 INFO L407 BasicCegarLoop]: trace histogram [6, 5, 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] [2019-09-16 16:25:30,152 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:25:30,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:25:30,152 INFO L82 PathProgramCache]: Analyzing trace with hash 1886549823, now seen corresponding path program 2 times [2019-09-16 16:25:30,153 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:25:30,153 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:25:30,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:25:30,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:25:30,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:25:30,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:25:30,415 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-16 16:25:30,415 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 16:25:30,415 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-09-16 16:25:30,445 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-16 16:25:30,479 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-16 16:25:30,479 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-16 16:25:30,481 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 43 conjunts are in the unsatisfiable core [2019-09-16 16:25:30,484 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-16 16:25:30,587 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 30 treesize of output 26 [2019-09-16 16:25:30,588 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-16 16:25:30,597 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:25:30,598 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-16 16:25:30,598 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:64, output treesize:60 [2019-09-16 16:25:30,829 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-16 16:25:30,832 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:25:30,832 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 22 [2019-09-16 16:25:30,833 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-16 16:25:30,842 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:25:30,843 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-16 16:25:30,843 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:67, output treesize:35 [2019-09-16 16:25:30,905 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 3 proven. 30 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-16 16:25:30,912 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-16 16:25:30,912 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14] total 28 [2019-09-16 16:25:30,912 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-16 16:25:30,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-16 16:25:30,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=631, Unknown=0, NotChecked=0, Total=756 [2019-09-16 16:25:30,913 INFO L87 Difference]: Start difference. First operand 38 states and 39 transitions. Second operand 28 states. [2019-09-16 16:25:31,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:25:31,785 INFO L93 Difference]: Finished difference Result 48 states and 49 transitions. [2019-09-16 16:25:31,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-16 16:25:31,786 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 41 [2019-09-16 16:25:31,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:25:31,788 INFO L225 Difference]: With dead ends: 48 [2019-09-16 16:25:31,788 INFO L226 Difference]: Without dead ends: 40 [2019-09-16 16:25:31,789 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 346 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=369, Invalid=1353, Unknown=0, NotChecked=0, Total=1722 [2019-09-16 16:25:31,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-09-16 16:25:31,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-09-16 16:25:31,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-09-16 16:25:31,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 41 transitions. [2019-09-16 16:25:31,797 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 41 transitions. Word has length 41 [2019-09-16 16:25:31,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:25:31,797 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 41 transitions. [2019-09-16 16:25:31,797 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-16 16:25:31,797 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2019-09-16 16:25:31,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-09-16 16:25:31,798 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:25:31,798 INFO L407 BasicCegarLoop]: trace histogram [7, 6, 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] [2019-09-16 16:25:31,799 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:25:31,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:25:31,799 INFO L82 PathProgramCache]: Analyzing trace with hash 1781507674, now seen corresponding path program 3 times [2019-09-16 16:25:31,799 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:25:31,799 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:25:31,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:25:31,801 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-16 16:25:31,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:25:31,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:25:32,077 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-16 16:25:32,077 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 16:25:32,077 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-09-16 16:25:32,105 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-16 16:25:32,136 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-09-16 16:25:32,136 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-16 16:25:32,138 INFO L256 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 42 conjunts are in the unsatisfiable core [2019-09-16 16:25:32,142 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-16 16:25:32,229 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 30 treesize of output 26 [2019-09-16 16:25:32,229 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-16 16:25:32,239 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:25:32,239 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-16 16:25:32,240 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:46, output treesize:42 [2019-09-16 16:25:34,491 WARN L860 $PredicateComparison]: unable to prove that (exists ((main_~pa~0.offset Int) (v_main_~pd2~0.base_BEFORE_CALL_2 Int)) (and (let ((.cse0 (div (+ main_~pa~0.offset (- 8)) 4))) (= .cse0 (select (select |c_#memory_int| v_main_~pd2~0.base_BEFORE_CALL_2) (+ (* 4 .cse0) 8)))) (= 0 (mod main_~pa~0.offset 4)))) is different from true [2019-09-16 16:25:40,554 WARN L191 SmtUtils]: Spent 6.02 s on a formula simplification that was a NOOP. DAG size: 34 [2019-09-16 16:25:40,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:40,630 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-09-16 16:25:40,637 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-16 16:25:40,637 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15] total 30 [2019-09-16 16:25:40,638 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-09-16 16:25:40,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-09-16 16:25:40,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=717, Unknown=1, NotChecked=54, Total=870 [2019-09-16 16:25:40,639 INFO L87 Difference]: Start difference. First operand 40 states and 41 transitions. Second operand 30 states. [2019-09-16 16:26:02,598 WARN L191 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 21 [2019-09-16 16:26:08,692 WARN L191 SmtUtils]: Spent 6.04 s on a formula simplification that was a NOOP. DAG size: 37 [2019-09-16 16:26:08,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:26:08,837 INFO L93 Difference]: Finished difference Result 48 states and 50 transitions. [2019-09-16 16:26:08,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-16 16:26:08,838 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 43 [2019-09-16 16:26:08,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:26:08,838 INFO L225 Difference]: With dead ends: 48 [2019-09-16 16:26:08,839 INFO L226 Difference]: Without dead ends: 0 [2019-09-16 16:26:08,841 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 52 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 504 ImplicationChecksByTransitivity, 36.4s TimeCoverageRelationStatistics Valid=486, Invalid=2234, Unknown=40, NotChecked=102, Total=2862 [2019-09-16 16:26:08,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-16 16:26:08,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-16 16:26:08,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-16 16:26:08,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-16 16:26:08,842 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 43 [2019-09-16 16:26:08,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:26:08,842 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-16 16:26:08,842 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-09-16 16:26:08,843 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-16 16:26:08,843 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-16 16:26:08,846 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-09-16 16:26:09,213 WARN L191 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 41 [2019-09-16 16:26:09,216 INFO L443 ceAbstractionStarter]: For program point initEXIT(lines 12 19) no Hoare annotation was computed. [2019-09-16 16:26:09,216 INFO L446 ceAbstractionStarter]: At program point initENTRY(lines 12 19) the Hoare annotation is: true [2019-09-16 16:26:09,216 INFO L443 ceAbstractionStarter]: For program point initFINAL(lines 12 19) no Hoare annotation was computed. [2019-09-16 16:26:09,216 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2019-09-16 16:26:09,217 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2019-09-16 16:26:09,217 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-09-16 16:26:09,217 INFO L443 ceAbstractionStarter]: For program point get_dummyFINAL(lines 21 24) no Hoare annotation was computed. [2019-09-16 16:26:09,217 INFO L446 ceAbstractionStarter]: At program point get_dummyENTRY(lines 21 24) the Hoare annotation is: true [2019-09-16 16:26:09,217 INFO L443 ceAbstractionStarter]: For program point L23-1(line 23) no Hoare annotation was computed. [2019-09-16 16:26:09,217 INFO L443 ceAbstractionStarter]: For program point get_dummyEXIT(lines 21 24) no Hoare annotation was computed. [2019-09-16 16:26:09,217 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-09-16 16:26:09,218 INFO L439 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= 0 |~#d2~0.offset|) (= 0 |~#d1~0.offset|)) [2019-09-16 16:26:09,218 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-09-16 16:26:09,218 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-09-16 16:26:09,218 INFO L446 ceAbstractionStarter]: At program point L33(line 33) the Hoare annotation is: true [2019-09-16 16:26:09,218 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 31 52) no Hoare annotation was computed. [2019-09-16 16:26:09,218 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 31 52) no Hoare annotation was computed. [2019-09-16 16:26:09,218 INFO L439 ceAbstractionStarter]: At program point L44(lines 32 52) the Hoare annotation is: (or (not (= |~#d2~0.offset| 0)) (not (= 0 |~#d1~0.offset|))) [2019-09-16 16:26:09,218 INFO L443 ceAbstractionStarter]: For program point L40-1(lines 40 42) no Hoare annotation was computed. [2019-09-16 16:26:09,219 INFO L439 ceAbstractionStarter]: At program point L40-3(lines 40 42) the Hoare annotation is: (or (and (<= main_~i~0 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (= 0 (mod (+ (* 3 main_~pd2~0.offset) main_~pa~0.offset) 4)) (let ((.cse0 (div (+ (* (- 1) main_~pd2~0.offset) main_~pa~0.offset (- 8)) 4))) (= (select (select |#memory_int| main_~pd2~0.base) (+ main_~pd2~0.offset (* 4 .cse0) 8)) .cse0)) (= main_~pd2~0.base main_~pa~0.base) (= main_~pd2~0.offset 0) (= main_~pd1~0.offset 0) (= main_~pd2~0.base main_~pd1~0.base)) (not (= |~#d2~0.offset| 0)) (not (= 0 |~#d1~0.offset|))) [2019-09-16 16:26:09,219 INFO L443 ceAbstractionStarter]: For program point L36(lines 36 46) no Hoare annotation was computed. [2019-09-16 16:26:09,219 INFO L439 ceAbstractionStarter]: At program point L40-4(lines 40 42) the Hoare annotation is: (or (not (= |~#d2~0.offset| 0)) (not (= 0 |~#d1~0.offset|)) (and (<= main_~i~0 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (= 0 (mod (+ (* 3 main_~pd2~0.offset) main_~pa~0.offset) 4)) (let ((.cse0 (div (+ (* (- 1) main_~pd2~0.offset) main_~pa~0.offset (- 8)) 4))) (= (select (select |#memory_int| main_~pd2~0.base) (+ main_~pd2~0.offset (* 4 .cse0) 8)) .cse0)) (= main_~pd2~0.base main_~pa~0.base) (= main_~pd2~0.offset 0) (= main_~pd1~0.offset 0) (= main_~pd2~0.base main_~pd1~0.base) (exists ((main_~pa~0.offset Int)) (let ((.cse1 (select |#memory_int| main_~pd2~0.base))) (let ((.cse3 (select .cse1 main_~pa~0.offset))) (and (= 0 (mod (+ (* 3 main_~pd2~0.offset) main_~pa~0.offset) 4)) (let ((.cse2 (div (+ (* (- 1) main_~pd2~0.offset) main_~pa~0.offset (- 8)) 4))) (= (select .cse1 (+ main_~pd2~0.offset (* 4 .cse2) 8)) .cse2)) (<= .cse3 main_~i~0) (<= main_~i~0 .cse3))))))) [2019-09-16 16:26:09,219 INFO L443 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2019-09-16 16:26:09,219 INFO L443 ceAbstractionStarter]: For program point L36-2(lines 36 46) no Hoare annotation was computed. [2019-09-16 16:26:09,220 INFO L439 ceAbstractionStarter]: At program point L34-1(line 34) the Hoare annotation is: (let ((.cse0 (= main_~pd1~0.offset 0))) (or (and .cse0 (= |~#d1~0.base| main_~pd1~0.base)) (not (= |~#d2~0.offset| 0)) (and (= |~#d2~0.base| main_~pd1~0.base) .cse0) (not (= 0 |~#d1~0.offset|)))) [2019-09-16 16:26:09,220 INFO L443 ceAbstractionStarter]: For program point L34-2(line 34) no Hoare annotation was computed. [2019-09-16 16:26:09,220 INFO L443 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 50) no Hoare annotation was computed. [2019-09-16 16:26:09,220 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 31 52) the Hoare annotation is: true [2019-09-16 16:26:09,220 INFO L443 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2019-09-16 16:26:09,220 INFO L443 ceAbstractionStarter]: For program point L43-1(lines 43 45) no Hoare annotation was computed. [2019-09-16 16:26:09,220 INFO L446 ceAbstractionStarter]: At program point checkENTRY(lines 26 29) the Hoare annotation is: true [2019-09-16 16:26:09,221 INFO L443 ceAbstractionStarter]: For program point checkFINAL(lines 26 29) no Hoare annotation was computed. [2019-09-16 16:26:09,221 INFO L443 ceAbstractionStarter]: For program point checkEXIT(lines 26 29) no Hoare annotation was computed. [2019-09-16 16:26:09,237 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-16 16:26:09,239 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-16 16:26:09,242 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-16 16:26:09,243 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-16 16:26:09,247 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.09 04:26:09 BoogieIcfgContainer [2019-09-16 16:26:09,247 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-16 16:26:09,249 INFO L168 Benchmark]: Toolchain (without parser) took 114701.30 ms. Allocated memory was 131.6 MB in the beginning and 395.8 MB in the end (delta: 264.2 MB). Free memory was 86.2 MB in the beginning and 305.6 MB in the end (delta: -219.4 MB). Peak memory consumption was 44.9 MB. Max. memory is 7.1 GB. [2019-09-16 16:26:09,250 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 131.6 MB. Free memory is still 104.1 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-09-16 16:26:09,251 INFO L168 Benchmark]: CACSL2BoogieTranslator took 359.98 ms. Allocated memory was 131.6 MB in the beginning and 197.1 MB in the end (delta: 65.5 MB). Free memory was 86.2 MB in the beginning and 173.3 MB in the end (delta: -87.2 MB). Peak memory consumption was 25.9 MB. Max. memory is 7.1 GB. [2019-09-16 16:26:09,253 INFO L168 Benchmark]: Boogie Preprocessor took 34.04 ms. Allocated memory is still 197.1 MB. Free memory was 173.3 MB in the beginning and 171.1 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB. [2019-09-16 16:26:09,258 INFO L168 Benchmark]: RCFGBuilder took 325.36 ms. Allocated memory is still 197.1 MB. Free memory was 171.1 MB in the beginning and 153.8 MB in the end (delta: 17.3 MB). Peak memory consumption was 17.3 MB. Max. memory is 7.1 GB. [2019-09-16 16:26:09,260 INFO L168 Benchmark]: TraceAbstraction took 113973.21 ms. Allocated memory was 197.1 MB in the beginning and 395.8 MB in the end (delta: 198.7 MB). Free memory was 153.8 MB in the beginning and 305.6 MB in the end (delta: -151.7 MB). Peak memory consumption was 47.0 MB. Max. memory is 7.1 GB. [2019-09-16 16:26:09,269 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.20 ms. Allocated memory is still 131.6 MB. Free memory is still 104.1 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 359.98 ms. Allocated memory was 131.6 MB in the beginning and 197.1 MB in the end (delta: 65.5 MB). Free memory was 86.2 MB in the beginning and 173.3 MB in the end (delta: -87.2 MB). Peak memory consumption was 25.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 34.04 ms. Allocated memory is still 197.1 MB. Free memory was 173.3 MB in the beginning and 171.1 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 325.36 ms. Allocated memory is still 197.1 MB. Free memory was 171.1 MB in the beginning and 153.8 MB in the end (delta: 17.3 MB). Peak memory consumption was 17.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 113973.21 ms. Allocated memory was 197.1 MB in the beginning and 395.8 MB in the end (delta: 198.7 MB). Free memory was 153.8 MB in the beginning and 305.6 MB in the end (delta: -151.7 MB). Peak memory consumption was 47.0 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: 50]: 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: 32]: Loop Invariant Derived loop invariant: !(d2 == 0) || !(0 == d1) - InvariantResult [Line: 40]: Loop Invariant [2019-09-16 16:26:09,282 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-16 16:26:09,282 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-16 16:26:09,283 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-16 16:26:09,283 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: (((((((i <= unknown-#memory_int-unknown[pa][pa] && 0 == (3 * pd2 + pa) % 4) && unknown-#memory_int-unknown[pd2][pd2 + 4 * ((-1 * pd2 + pa + -8) / 4) + 8] == (-1 * pd2 + pa + -8) / 4) && pd2 == pa) && pd2 == 0) && pd1 == 0) && pd2 == pd1) || !(d2 == 0)) || !(0 == d1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 33 locations, 1 error locations. SAFE Result, 113.8s OverallTime, 8 OverallIterations, 7 TraceHistogramMax, 88.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 183 SDtfs, 440 SDslu, 1617 SDs, 0 SdLazy, 1795 SolverSat, 243 SolverUnsat, 3 SolverUnknown, 0 SolverNotchecked, 5.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 480 GetRequests, 182 SyntacticMatches, 13 SemanticMatches, 285 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 2820 ImplicationChecksByTransitivity, 105.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=40occurred in iteration=7, 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, 8 MinimizatonAttempts, 75 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 12 LocationsWithAnnotation, 24 PreInvPairs, 45 NumberOfFragments, 225 HoareAnnotationTreeSize, 24 FomulaSimplifications, 8640 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 12 FomulaSimplificationsInter, 880 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 24.3s InterpolantComputationTime, 517 NumberOfCodeBlocks, 507 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 503 ConstructedInterpolants, 26 QuantifiedInterpolants, 193443 SizeOfPredicates, 60 NumberOfNonLiveVariables, 1034 ConjunctsInSsa, 250 ConjunctsInUnsatCore, 14 InterpolantComputations, 2 PerfectInterpolantSequences, 95/280 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...