java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -s config/svcomp-Reach-32bit-Automizer_Default.epf --rcfgbuilder.command.for.external.solver 'z3 SMTLIB2_COMPLIANT=true -memory:4096 -smt2 -in -t:12000' -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --rcfgbuilder.size.of.a.code.block SingleStatement -i /storage/repos/svcomp/c/array-industry-pattern/array_of_struct_ptr_flag_init_true-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-7aa59a0 [2019-05-23 11:21:50,529 INFO L146 ILogger]: Resetting all preferences to default values... [2019-05-23 11:21:50,533 INFO L146 ILogger]: Resetting UltimateCore preferences to default values [2019-05-23 11:21:50,550 INFO L146 ILogger]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-05-23 11:21:50,550 INFO L146 ILogger]: Resetting Boogie Preprocessor preferences to default values [2019-05-23 11:21:50,551 INFO L146 ILogger]: Resetting Boogie Procedure Inliner preferences to default values [2019-05-23 11:21:50,555 INFO L146 ILogger]: Resetting Abstract Interpretation preferences to default values [2019-05-23 11:21:50,559 INFO L146 ILogger]: Resetting LassoRanker preferences to default values [2019-05-23 11:21:50,561 INFO L146 ILogger]: Resetting Reaching Definitions preferences to default values [2019-05-23 11:21:50,563 INFO L146 ILogger]: Resetting SyntaxChecker preferences to default values [2019-05-23 11:21:50,564 INFO L146 ILogger]: Büchi Program Product provides no preferences, ignoring... [2019-05-23 11:21:50,564 INFO L146 ILogger]: Resetting LTL2Aut preferences to default values [2019-05-23 11:21:50,565 INFO L146 ILogger]: Resetting PEA to Boogie preferences to default values [2019-05-23 11:21:50,566 INFO L146 ILogger]: Resetting BlockEncodingV2 preferences to default values [2019-05-23 11:21:50,567 INFO L146 ILogger]: Resetting ChcToBoogie preferences to default values [2019-05-23 11:21:50,568 INFO L146 ILogger]: Resetting AutomataScriptInterpreter preferences to default values [2019-05-23 11:21:50,569 INFO L146 ILogger]: Resetting BuchiAutomizer preferences to default values [2019-05-23 11:21:50,571 INFO L146 ILogger]: Resetting CACSL2BoogieTranslator preferences to default values [2019-05-23 11:21:50,573 INFO L146 ILogger]: Resetting CodeCheck preferences to default values [2019-05-23 11:21:50,575 INFO L146 ILogger]: Resetting InvariantSynthesis preferences to default values [2019-05-23 11:21:50,576 INFO L146 ILogger]: Resetting RCFGBuilder preferences to default values [2019-05-23 11:21:50,577 INFO L146 ILogger]: Resetting TraceAbstraction preferences to default values [2019-05-23 11:21:50,580 INFO L146 ILogger]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-05-23 11:21:50,580 INFO L146 ILogger]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-05-23 11:21:50,580 INFO L146 ILogger]: Resetting TreeAutomizer preferences to default values [2019-05-23 11:21:50,581 INFO L146 ILogger]: Resetting IcfgToChc preferences to default values [2019-05-23 11:21:50,582 INFO L146 ILogger]: Resetting IcfgTransformer preferences to default values [2019-05-23 11:21:50,583 INFO L146 ILogger]: ReqToTest provides no preferences, ignoring... [2019-05-23 11:21:50,583 INFO L146 ILogger]: Resetting Boogie Printer preferences to default values [2019-05-23 11:21:50,584 INFO L146 ILogger]: Resetting ChcSmtPrinter preferences to default values [2019-05-23 11:21:50,585 INFO L146 ILogger]: Resetting ReqPrinter preferences to default values [2019-05-23 11:21:50,586 INFO L146 ILogger]: Resetting Witness Printer preferences to default values [2019-05-23 11:21:50,587 INFO L146 ILogger]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-05-23 11:21:50,587 INFO L146 ILogger]: Resetting CDTParser preferences to default values [2019-05-23 11:21:50,588 INFO L146 ILogger]: AutomataScriptParser provides no preferences, ignoring... [2019-05-23 11:21:50,588 INFO L146 ILogger]: ReqParser provides no preferences, ignoring... [2019-05-23 11:21:50,589 INFO L146 ILogger]: Resetting SmtParser preferences to default values [2019-05-23 11:21:50,591 INFO L146 ILogger]: Resetting Witness Parser preferences to default values [2019-05-23 11:21:50,592 INFO L146 ILogger]: Finished resetting all preferences to default values... [2019-05-23 11:21:50,592 INFO L146 ILogger]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-05-23 11:21:50,611 INFO L146 ILogger]: Loading preferences was successful [2019-05-23 11:21:50,611 INFO L146 ILogger]: Preferences different from defaults after loading the file: [2019-05-23 11:21:50,613 INFO L146 ILogger]: Preferences of BlockEncodingV2 differ from their defaults: [2019-05-23 11:21:50,614 INFO L146 ILogger]: * Create parallel compositions if possible=false [2019-05-23 11:21:50,614 INFO L146 ILogger]: * Use SBE=true [2019-05-23 11:21:50,614 INFO L146 ILogger]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-05-23 11:21:50,614 INFO L146 ILogger]: * sizeof long=4 [2019-05-23 11:21:50,614 INFO L146 ILogger]: * Overapproximate operations on floating types=true [2019-05-23 11:21:50,615 INFO L146 ILogger]: * sizeof POINTER=4 [2019-05-23 11:21:50,615 INFO L146 ILogger]: * Check division by zero=IGNORE [2019-05-23 11:21:50,615 INFO L146 ILogger]: * Pointer to allocated memory at dereference=IGNORE [2019-05-23 11:21:50,616 INFO L146 ILogger]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-05-23 11:21:50,616 INFO L146 ILogger]: * Check array bounds for arrays that are off heap=IGNORE [2019-05-23 11:21:50,616 INFO L146 ILogger]: * sizeof long double=12 [2019-05-23 11:21:50,616 INFO L146 ILogger]: * Check if freed pointer was valid=false [2019-05-23 11:21:50,616 INFO L146 ILogger]: * Use constant arrays=true [2019-05-23 11:21:50,617 INFO L146 ILogger]: * Pointer base address is valid at dereference=IGNORE [2019-05-23 11:21:50,618 INFO L146 ILogger]: Preferences of RCFGBuilder differ from their defaults: [2019-05-23 11:21:50,618 INFO L146 ILogger]: * Size of a code block=SequenceOfStatements [2019-05-23 11:21:50,618 INFO L146 ILogger]: * To the following directory=./dump/ [2019-05-23 11:21:50,619 INFO L146 ILogger]: * SMT solver=External_DefaultMode [2019-05-23 11:21:50,619 INFO L146 ILogger]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-05-23 11:21:50,619 INFO L146 ILogger]: Preferences of TraceAbstraction differ from their defaults: [2019-05-23 11:21:50,619 INFO L146 ILogger]: * Compute Interpolants along a Counterexample=FPandBP [2019-05-23 11:21:50,619 INFO L146 ILogger]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-05-23 11:21:50,620 INFO L146 ILogger]: * Trace refinement strategy=CAMEL [2019-05-23 11:21:50,620 INFO L146 ILogger]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-05-23 11:21:50,620 INFO L146 ILogger]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-05-23 11:21:50,620 INFO L146 ILogger]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Command for external solver -> z3 SMTLIB2_COMPLIANT=true -memory:4096 -smt2 -in -t:12000 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> SingleStatement [2019-05-23 11:21:50,658 INFO L146 ILogger]: Repository-Root is: /tmp [2019-05-23 11:21:50,671 INFO L146 ILogger]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-05-23 11:21:50,675 INFO L146 ILogger]: [Toolchain 1]: Toolchain selected. [2019-05-23 11:21:50,676 INFO L146 ILogger]: Initializing CDTParser... [2019-05-23 11:21:50,677 INFO L146 ILogger]: CDTParser initialized [2019-05-23 11:21:50,678 INFO L146 ILogger]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/array-industry-pattern/array_of_struct_ptr_flag_init_true-unreach-call.i [2019-05-23 11:21:50,734 INFO L146 ILogger]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98a85dae2/1fb6a2b6240f472ea4fab9ab5d8d523a/FLAGc9b18e333 [2019-05-23 11:21:51,188 INFO L146 ILogger]: Found 1 translation units. [2019-05-23 11:21:51,189 INFO L146 ILogger]: Scanning /storage/repos/svcomp/c/array-industry-pattern/array_of_struct_ptr_flag_init_true-unreach-call.i [2019-05-23 11:21:51,195 INFO L146 ILogger]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98a85dae2/1fb6a2b6240f472ea4fab9ab5d8d523a/FLAGc9b18e333 [2019-05-23 11:21:51,552 INFO L146 ILogger]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98a85dae2/1fb6a2b6240f472ea4fab9ab5d8d523a [2019-05-23 11:21:51,562 INFO L146 ILogger]: ####################### [Toolchain 1] ####################### [2019-05-23 11:21:51,564 INFO L146 ILogger]: Walking toolchain with 5 elements. [2019-05-23 11:21:51,565 INFO L146 ILogger]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-05-23 11:21:51,566 INFO L146 ILogger]: Initializing CACSL2BoogieTranslator... [2019-05-23 11:21:51,572 INFO L146 ILogger]: CACSL2BoogieTranslator initialized [2019-05-23 11:21:51,573 INFO L146 ILogger]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.05 11:21:51" (1/1) ... [2019-05-23 11:21:51,575 INFO L146 ILogger]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50d11dcc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.05 11:21:51, skipping insertion in model container [2019-05-23 11:21:51,576 INFO L146 ILogger]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.05 11:21:51" (1/1) ... [2019-05-23 11:21:51,583 INFO L146 ILogger]: Starting translation in SV-COMP mode [2019-05-23 11:21:51,607 INFO L146 ILogger]: Built tables and reachable declarations [2019-05-23 11:21:51,785 INFO L146 ILogger]: Analyzing one entry point: main [2019-05-23 11:21:51,794 INFO L146 ILogger]: Completed pre-run [2019-05-23 11:21:51,815 INFO L146 ILogger]: Analyzing one entry point: main [2019-05-23 11:21:51,835 INFO L146 ILogger]: Completed translation [2019-05-23 11:21:51,835 INFO L146 ILogger]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.05 11:21:51 WrapperNode [2019-05-23 11:21:51,836 INFO L146 ILogger]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-05-23 11:21:51,837 INFO L146 ILogger]: ------------------------Boogie Procedure Inliner---------------------------- [2019-05-23 11:21:51,837 INFO L146 ILogger]: Initializing Boogie Procedure Inliner... [2019-05-23 11:21:51,838 INFO L146 ILogger]: Boogie Procedure Inliner initialized [2019-05-23 11:21:51,848 INFO L146 ILogger]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.05 11:21:51" (1/1) ... [2019-05-23 11:21:51,860 INFO L146 ILogger]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.05 11:21:51" (1/1) ... [2019-05-23 11:21:51,879 INFO L146 ILogger]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-05-23 11:21:51,880 INFO L146 ILogger]: ------------------------Boogie Preprocessor---------------------------- [2019-05-23 11:21:51,880 INFO L146 ILogger]: Initializing Boogie Preprocessor... [2019-05-23 11:21:51,880 INFO L146 ILogger]: Boogie Preprocessor initialized [2019-05-23 11:21:51,890 INFO L146 ILogger]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.05 11:21:51" (1/1) ... [2019-05-23 11:21:51,890 INFO L146 ILogger]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.05 11:21:51" (1/1) ... [2019-05-23 11:21:51,892 INFO L146 ILogger]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.05 11:21:51" (1/1) ... [2019-05-23 11:21:51,893 INFO L146 ILogger]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.05 11:21:51" (1/1) ... [2019-05-23 11:21:51,898 INFO L146 ILogger]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.05 11:21:51" (1/1) ... [2019-05-23 11:21:51,904 INFO L146 ILogger]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.05 11:21:51" (1/1) ... [2019-05-23 11:21:51,905 INFO L146 ILogger]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.05 11:21:51" (1/1) ... [2019-05-23 11:21:51,908 INFO L146 ILogger]: ------------------------ END Boogie Preprocessor---------------------------- [2019-05-23 11:21:51,908 INFO L146 ILogger]: ------------------------RCFGBuilder---------------------------- [2019-05-23 11:21:51,908 INFO L146 ILogger]: Initializing RCFGBuilder... [2019-05-23 11:21:51,909 INFO L146 ILogger]: RCFGBuilder initialized [2019-05-23 11:21:51,910 INFO L146 ILogger]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.05 11:21:51" (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:4096 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4096 -smt2 -in -t:12000 [2019-05-23 11:21:52,056 INFO L146 ILogger]: Found specification of procedure read~$Pointer$ [2019-05-23 11:21:52,057 INFO L146 ILogger]: Found specification of procedure #Ultimate.allocOnHeap [2019-05-23 11:21:52,057 INFO L146 ILogger]: Found specification of procedure ULTIMATE.start [2019-05-23 11:21:52,057 INFO L146 ILogger]: Found implementation of procedure ULTIMATE.start [2019-05-23 11:21:52,057 INFO L146 ILogger]: Found specification of procedure #Ultimate.allocOnStack [2019-05-23 11:21:52,057 INFO L146 ILogger]: Found specification of procedure write~$Pointer$ [2019-05-23 11:21:52,057 INFO L146 ILogger]: Found specification of procedure ULTIMATE.dealloc [2019-05-23 11:21:52,517 INFO L146 ILogger]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-05-23 11:21:52,517 INFO L146 ILogger]: Removed 11 assume(true) statements. [2019-05-23 11:21:52,518 INFO L146 ILogger]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.05 11:21:52 BoogieIcfgContainer [2019-05-23 11:21:52,519 INFO L146 ILogger]: ------------------------ END RCFGBuilder---------------------------- [2019-05-23 11:21:52,520 INFO L146 ILogger]: ------------------------TraceAbstraction---------------------------- [2019-05-23 11:21:52,520 INFO L146 ILogger]: Initializing TraceAbstraction... [2019-05-23 11:21:52,523 INFO L146 ILogger]: TraceAbstraction initialized [2019-05-23 11:21:52,523 INFO L146 ILogger]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.05 11:21:51" (1/3) ... [2019-05-23 11:21:52,524 INFO L146 ILogger]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49494f82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.05 11:21:52, skipping insertion in model container [2019-05-23 11:21:52,524 INFO L146 ILogger]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.05 11:21:51" (2/3) ... [2019-05-23 11:21:52,525 INFO L146 ILogger]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49494f82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.05 11:21:52, skipping insertion in model container [2019-05-23 11:21:52,525 INFO L146 ILogger]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.05 11:21:52" (3/3) ... [2019-05-23 11:21:52,526 INFO L146 ILogger]: Analyzing ICFG array_of_struct_ptr_flag_init_true-unreach-call.i [2019-05-23 11:21:52,536 INFO L146 ILogger]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-05-23 11:21:52,545 INFO L146 ILogger]: Appying trace abstraction to program that has 1 error locations. [2019-05-23 11:21:52,559 INFO L146 ILogger]: Starting to check reachability of 1 error locations. [2019-05-23 11:21:52,590 INFO L146 ILogger]: Using default assertion order modulation [2019-05-23 11:21:52,590 INFO L146 ILogger]: Interprodecural is true [2019-05-23 11:21:52,591 INFO L146 ILogger]: Hoare is true [2019-05-23 11:21:52,591 INFO L146 ILogger]: Compute interpolants for FPandBP [2019-05-23 11:21:52,591 INFO L146 ILogger]: Backedges is STRAIGHT_LINE [2019-05-23 11:21:52,591 INFO L146 ILogger]: Determinization is PREDICATE_ABSTRACTION [2019-05-23 11:21:52,591 INFO L146 ILogger]: Difference is false [2019-05-23 11:21:52,592 INFO L146 ILogger]: Minimize is MINIMIZE_SEVPA [2019-05-23 11:21:52,592 INFO L146 ILogger]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-05-23 11:21:52,609 INFO L146 ILogger]: Start isEmpty. Operand 50 states. [2019-05-23 11:21:52,616 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 27 [2019-05-23 11:21:52,616 INFO L146 ILogger]: Found error trace [2019-05-23 11:21:52,617 INFO L146 ILogger]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 11:21:52,619 INFO L146 ILogger]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-05-23 11:21:52,623 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 11:21:52,624 INFO L146 ILogger]: Analyzing trace with hash 1738969198, now seen corresponding path program 1 times [2019-05-23 11:21:52,625 INFO L146 ILogger]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-05-23 11:21:52,626 INFO L146 ILogger]: Using refinement strategy CamelRefinementStrategy [2019-05-23 11:21:52,665 INFO L146 ILogger]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-05-23 11:21:52,665 INFO L146 ILogger]: Keeping assertion order NOT_INCREMENTALLY [2019-05-23 11:21:52,665 INFO L146 ILogger]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-05-23 11:21:52,712 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 11:21:52,777 INFO L146 ILogger]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 11:21:52,779 INFO L146 ILogger]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-05-23 11:21:52,780 INFO L146 ILogger]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-05-23 11:21:52,784 INFO L146 ILogger]: Interpolant automaton has 3 states [2019-05-23 11:21:52,793 INFO L146 ILogger]: Constructing interpolant automaton starting with 3 interpolants. [2019-05-23 11:21:52,794 INFO L146 ILogger]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-05-23 11:21:52,796 INFO L146 ILogger]: Start difference. First operand 50 states. Second operand 3 states. [2019-05-23 11:21:52,903 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 11:21:52,903 INFO L146 ILogger]: Finished difference Result 100 states and 121 transitions. [2019-05-23 11:21:52,904 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-05-23 11:21:52,905 INFO L146 ILogger]: Start accepts. Automaton has 3 states. Word has length 26 [2019-05-23 11:21:52,906 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 11:21:52,916 INFO L146 ILogger]: With dead ends: 100 [2019-05-23 11:21:52,916 INFO L146 ILogger]: Without dead ends: 64 [2019-05-23 11:21:52,919 INFO L146 ILogger]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-05-23 11:21:52,936 INFO L146 ILogger]: Start minimizeSevpa. Operand 64 states. [2019-05-23 11:21:52,953 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 64 to 45. [2019-05-23 11:21:52,954 INFO L146 ILogger]: Start removeUnreachable. Operand 45 states. [2019-05-23 11:21:52,956 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2019-05-23 11:21:52,957 INFO L146 ILogger]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 26 [2019-05-23 11:21:52,958 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 11:21:52,958 INFO L146 ILogger]: Abstraction has 45 states and 49 transitions. [2019-05-23 11:21:52,958 INFO L146 ILogger]: Interpolant automaton has 3 states. [2019-05-23 11:21:52,958 INFO L146 ILogger]: Start isEmpty. Operand 45 states and 49 transitions. [2019-05-23 11:21:52,961 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 34 [2019-05-23 11:21:52,962 INFO L146 ILogger]: Found error trace [2019-05-23 11:21:52,962 INFO L146 ILogger]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 11:21:52,962 INFO L146 ILogger]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-05-23 11:21:52,962 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 11:21:52,963 INFO L146 ILogger]: Analyzing trace with hash -322902472, now seen corresponding path program 1 times [2019-05-23 11:21:52,964 INFO L146 ILogger]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-05-23 11:21:52,964 INFO L146 ILogger]: Using refinement strategy CamelRefinementStrategy [2019-05-23 11:21:52,965 INFO L146 ILogger]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-05-23 11:21:52,966 INFO L146 ILogger]: Keeping assertion order NOT_INCREMENTALLY [2019-05-23 11:21:52,966 INFO L146 ILogger]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-05-23 11:21:53,004 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 11:21:53,156 INFO L146 ILogger]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 11:21:53,156 INFO L146 ILogger]: The current sequences of interpolants are not accepted, trying to find more. [2019-05-23 11:21:53,156 INFO L146 ILogger]: 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-05-23 11:21:53,173 INFO L146 ILogger]: Keeping assertion order NOT_INCREMENTALLY [2019-05-23 11:21:53,217 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 11:21:53,219 INFO L146 ILogger]: Trace formula consists of 73 conjuncts, 4 conjunts are in the unsatisfiable core [2019-05-23 11:21:53,227 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 11:21:53,346 INFO L146 ILogger]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-05-23 11:21:53,367 INFO L146 ILogger]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-05-23 11:21:53,367 INFO L146 ILogger]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2019-05-23 11:21:53,368 INFO L146 ILogger]: Interpolant automaton has 8 states [2019-05-23 11:21:53,369 INFO L146 ILogger]: Constructing interpolant automaton starting with 8 interpolants. [2019-05-23 11:21:53,369 INFO L146 ILogger]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-05-23 11:21:53,370 INFO L146 ILogger]: Start difference. First operand 45 states and 49 transitions. Second operand 8 states. [2019-05-23 11:21:53,918 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 11:21:53,918 INFO L146 ILogger]: Finished difference Result 103 states and 115 transitions. [2019-05-23 11:21:53,920 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-05-23 11:21:53,920 INFO L146 ILogger]: Start accepts. Automaton has 8 states. Word has length 33 [2019-05-23 11:21:53,920 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 11:21:53,922 INFO L146 ILogger]: With dead ends: 103 [2019-05-23 11:21:53,922 INFO L146 ILogger]: Without dead ends: 78 [2019-05-23 11:21:53,923 INFO L146 ILogger]: 0 DeclaredPredicates, 45 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2019-05-23 11:21:53,924 INFO L146 ILogger]: Start minimizeSevpa. Operand 78 states. [2019-05-23 11:21:53,930 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 78 to 55. [2019-05-23 11:21:53,931 INFO L146 ILogger]: Start removeUnreachable. Operand 55 states. [2019-05-23 11:21:53,932 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 55 states to 55 states and 60 transitions. [2019-05-23 11:21:53,932 INFO L146 ILogger]: Start accepts. Automaton has 55 states and 60 transitions. Word has length 33 [2019-05-23 11:21:53,933 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 11:21:53,933 INFO L146 ILogger]: Abstraction has 55 states and 60 transitions. [2019-05-23 11:21:53,933 INFO L146 ILogger]: Interpolant automaton has 8 states. [2019-05-23 11:21:53,933 INFO L146 ILogger]: Start isEmpty. Operand 55 states and 60 transitions. [2019-05-23 11:21:53,935 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 47 [2019-05-23 11:21:53,935 INFO L146 ILogger]: Found error trace [2019-05-23 11:21:53,935 INFO L146 ILogger]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 11:21:53,935 INFO L146 ILogger]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-05-23 11:21:53,936 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 11:21:53,936 INFO L146 ILogger]: Analyzing trace with hash -1705716142, now seen corresponding path program 1 times [2019-05-23 11:21:53,936 INFO L146 ILogger]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-05-23 11:21:53,936 INFO L146 ILogger]: Using refinement strategy CamelRefinementStrategy [2019-05-23 11:21:53,937 INFO L146 ILogger]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-05-23 11:21:53,938 INFO L146 ILogger]: Keeping assertion order NOT_INCREMENTALLY [2019-05-23 11:21:53,938 INFO L146 ILogger]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-05-23 11:21:53,960 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 11:21:54,062 INFO L146 ILogger]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-05-23 11:21:54,063 INFO L146 ILogger]: The current sequences of interpolants are not accepted, trying to find more. [2019-05-23 11:21:54,063 INFO L146 ILogger]: 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) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-05-23 11:21:54,082 INFO L146 ILogger]: Keeping assertion order NOT_INCREMENTALLY [2019-05-23 11:21:54,125 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 11:21:54,126 INFO L146 ILogger]: Trace formula consists of 104 conjuncts, 6 conjunts are in the unsatisfiable core [2019-05-23 11:21:54,129 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 11:21:54,554 INFO L146 ILogger]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-05-23 11:21:54,586 INFO L146 ILogger]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-05-23 11:21:54,586 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2019-05-23 11:21:54,587 INFO L146 ILogger]: Interpolant automaton has 10 states [2019-05-23 11:21:54,587 INFO L146 ILogger]: Constructing interpolant automaton starting with 10 interpolants. [2019-05-23 11:21:54,587 INFO L146 ILogger]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-05-23 11:21:54,588 INFO L146 ILogger]: Start difference. First operand 55 states and 60 transitions. Second operand 10 states. [2019-05-23 11:21:54,799 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 11:21:54,799 INFO L146 ILogger]: Finished difference Result 99 states and 109 transitions. [2019-05-23 11:21:54,800 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-05-23 11:21:54,800 INFO L146 ILogger]: Start accepts. Automaton has 10 states. Word has length 46 [2019-05-23 11:21:54,800 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 11:21:54,801 INFO L146 ILogger]: With dead ends: 99 [2019-05-23 11:21:54,801 INFO L146 ILogger]: Without dead ends: 65 [2019-05-23 11:21:54,802 INFO L146 ILogger]: 0 DeclaredPredicates, 57 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-05-23 11:21:54,803 INFO L146 ILogger]: Start minimizeSevpa. Operand 65 states. [2019-05-23 11:21:54,808 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 65 to 61. [2019-05-23 11:21:54,808 INFO L146 ILogger]: Start removeUnreachable. Operand 61 states. [2019-05-23 11:21:54,809 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 61 states to 61 states and 66 transitions. [2019-05-23 11:21:54,810 INFO L146 ILogger]: Start accepts. Automaton has 61 states and 66 transitions. Word has length 46 [2019-05-23 11:21:54,810 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 11:21:54,810 INFO L146 ILogger]: Abstraction has 61 states and 66 transitions. [2019-05-23 11:21:54,810 INFO L146 ILogger]: Interpolant automaton has 10 states. [2019-05-23 11:21:54,810 INFO L146 ILogger]: Start isEmpty. Operand 61 states and 66 transitions. [2019-05-23 11:21:54,812 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 53 [2019-05-23 11:21:54,812 INFO L146 ILogger]: Found error trace [2019-05-23 11:21:54,812 INFO L146 ILogger]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 11:21:54,812 INFO L146 ILogger]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-05-23 11:21:54,813 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 11:21:54,813 INFO L146 ILogger]: Analyzing trace with hash -763500426, now seen corresponding path program 2 times [2019-05-23 11:21:54,813 INFO L146 ILogger]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-05-23 11:21:54,813 INFO L146 ILogger]: Using refinement strategy CamelRefinementStrategy [2019-05-23 11:21:54,814 INFO L146 ILogger]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-05-23 11:21:54,814 INFO L146 ILogger]: Keeping assertion order NOT_INCREMENTALLY [2019-05-23 11:21:54,814 INFO L146 ILogger]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-05-23 11:21:54,836 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 11:21:55,024 INFO L146 ILogger]: Checked inductivity of 17 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-05-23 11:21:55,024 INFO L146 ILogger]: The current sequences of interpolants are not accepted, trying to find more. [2019-05-23 11:21:55,024 INFO L146 ILogger]: 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-05-23 11:21:55,034 INFO L146 ILogger]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-05-23 11:21:55,064 INFO L146 ILogger]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-05-23 11:21:55,064 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 11:21:55,065 INFO L146 ILogger]: Trace formula consists of 120 conjuncts, 8 conjunts are in the unsatisfiable core [2019-05-23 11:21:55,069 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 11:21:55,245 INFO L146 ILogger]: Checked inductivity of 17 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-05-23 11:21:55,265 INFO L146 ILogger]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-05-23 11:21:55,265 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2019-05-23 11:21:55,266 INFO L146 ILogger]: Interpolant automaton has 14 states [2019-05-23 11:21:55,266 INFO L146 ILogger]: Constructing interpolant automaton starting with 14 interpolants. [2019-05-23 11:21:55,266 INFO L146 ILogger]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2019-05-23 11:21:55,267 INFO L146 ILogger]: Start difference. First operand 61 states and 66 transitions. Second operand 14 states. [2019-05-23 11:21:55,588 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 11:21:55,590 INFO L146 ILogger]: Finished difference Result 105 states and 115 transitions. [2019-05-23 11:21:55,594 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-05-23 11:21:55,594 INFO L146 ILogger]: Start accepts. Automaton has 14 states. Word has length 52 [2019-05-23 11:21:55,595 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 11:21:55,596 INFO L146 ILogger]: With dead ends: 105 [2019-05-23 11:21:55,596 INFO L146 ILogger]: Without dead ends: 71 [2019-05-23 11:21:55,598 INFO L146 ILogger]: 0 DeclaredPredicates, 68 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=148, Invalid=314, Unknown=0, NotChecked=0, Total=462 [2019-05-23 11:21:55,598 INFO L146 ILogger]: Start minimizeSevpa. Operand 71 states. [2019-05-23 11:21:55,610 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 71 to 67. [2019-05-23 11:21:55,611 INFO L146 ILogger]: Start removeUnreachable. Operand 67 states. [2019-05-23 11:21:55,612 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 67 states to 67 states and 72 transitions. [2019-05-23 11:21:55,614 INFO L146 ILogger]: Start accepts. Automaton has 67 states and 72 transitions. Word has length 52 [2019-05-23 11:21:55,614 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 11:21:55,614 INFO L146 ILogger]: Abstraction has 67 states and 72 transitions. [2019-05-23 11:21:55,614 INFO L146 ILogger]: Interpolant automaton has 14 states. [2019-05-23 11:21:55,614 INFO L146 ILogger]: Start isEmpty. Operand 67 states and 72 transitions. [2019-05-23 11:21:55,616 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 59 [2019-05-23 11:21:55,617 INFO L146 ILogger]: Found error trace [2019-05-23 11:21:55,617 INFO L146 ILogger]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 11:21:55,617 INFO L146 ILogger]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-05-23 11:21:55,618 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 11:21:55,621 INFO L146 ILogger]: Analyzing trace with hash 678547354, now seen corresponding path program 3 times [2019-05-23 11:21:55,621 INFO L146 ILogger]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-05-23 11:21:55,621 INFO L146 ILogger]: Using refinement strategy CamelRefinementStrategy [2019-05-23 11:21:55,622 INFO L146 ILogger]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-05-23 11:21:55,625 INFO L146 ILogger]: Changing assertion order to NOT_INCREMENTALLY [2019-05-23 11:21:55,625 INFO L146 ILogger]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-05-23 11:21:55,678 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 11:21:56,012 INFO L146 ILogger]: Checked inductivity of 30 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-05-23 11:21:56,013 INFO L146 ILogger]: The current sequences of interpolants are not accepted, trying to find more. [2019-05-23 11:21:56,013 INFO L146 ILogger]: 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-05-23 11:21:56,021 INFO L146 ILogger]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-05-23 11:21:56,074 INFO L146 ILogger]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-05-23 11:21:56,074 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 11:21:56,075 INFO L146 ILogger]: Trace formula consists of 120 conjuncts, 6 conjunts are in the unsatisfiable core [2019-05-23 11:21:56,077 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 11:21:56,192 INFO L146 ILogger]: Checked inductivity of 30 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-05-23 11:21:56,210 INFO L146 ILogger]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-05-23 11:21:56,211 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7] total 16 [2019-05-23 11:21:56,211 INFO L146 ILogger]: Interpolant automaton has 16 states [2019-05-23 11:21:56,211 INFO L146 ILogger]: Constructing interpolant automaton starting with 16 interpolants. [2019-05-23 11:21:56,212 INFO L146 ILogger]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2019-05-23 11:21:56,212 INFO L146 ILogger]: Start difference. First operand 67 states and 72 transitions. Second operand 16 states. [2019-05-23 11:21:57,057 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 11:21:57,058 INFO L146 ILogger]: Finished difference Result 139 states and 153 transitions. [2019-05-23 11:21:57,058 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-05-23 11:21:57,058 INFO L146 ILogger]: Start accepts. Automaton has 16 states. Word has length 58 [2019-05-23 11:21:57,059 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 11:21:57,060 INFO L146 ILogger]: With dead ends: 139 [2019-05-23 11:21:57,061 INFO L146 ILogger]: Without dead ends: 105 [2019-05-23 11:21:57,062 INFO L146 ILogger]: 0 DeclaredPredicates, 87 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=243, Invalid=879, Unknown=0, NotChecked=0, Total=1122 [2019-05-23 11:21:57,062 INFO L146 ILogger]: Start minimizeSevpa. Operand 105 states. [2019-05-23 11:21:57,068 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 105 to 82. [2019-05-23 11:21:57,068 INFO L146 ILogger]: Start removeUnreachable. Operand 82 states. [2019-05-23 11:21:57,069 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 82 states to 82 states and 88 transitions. [2019-05-23 11:21:57,069 INFO L146 ILogger]: Start accepts. Automaton has 82 states and 88 transitions. Word has length 58 [2019-05-23 11:21:57,070 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 11:21:57,070 INFO L146 ILogger]: Abstraction has 82 states and 88 transitions. [2019-05-23 11:21:57,070 INFO L146 ILogger]: Interpolant automaton has 16 states. [2019-05-23 11:21:57,070 INFO L146 ILogger]: Start isEmpty. Operand 82 states and 88 transitions. [2019-05-23 11:21:57,071 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 72 [2019-05-23 11:21:57,072 INFO L146 ILogger]: Found error trace [2019-05-23 11:21:57,072 INFO L146 ILogger]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 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] [2019-05-23 11:21:57,072 INFO L146 ILogger]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-05-23 11:21:57,072 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 11:21:57,072 INFO L146 ILogger]: Analyzing trace with hash 392188136, now seen corresponding path program 4 times [2019-05-23 11:21:57,073 INFO L146 ILogger]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-05-23 11:21:57,073 INFO L146 ILogger]: Using refinement strategy CamelRefinementStrategy [2019-05-23 11:21:57,074 INFO L146 ILogger]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-05-23 11:21:57,074 INFO L146 ILogger]: Changing assertion order to NOT_INCREMENTALLY [2019-05-23 11:21:57,074 INFO L146 ILogger]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-05-23 11:21:57,095 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 11:21:57,408 INFO L146 ILogger]: Checked inductivity of 64 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-05-23 11:21:57,408 INFO L146 ILogger]: The current sequences of interpolants are not accepted, trying to find more. [2019-05-23 11:21:57,409 INFO L146 ILogger]: 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-05-23 11:21:57,421 INFO L146 ILogger]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-05-23 11:21:57,446 INFO L146 ILogger]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-05-23 11:21:57,446 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 11:21:57,447 INFO L146 ILogger]: Trace formula consists of 148 conjuncts, 22 conjunts are in the unsatisfiable core [2019-05-23 11:21:57,451 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 11:21:57,736 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-05-23 11:21:57,737 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 11:21:57,749 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 11:21:57,752 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-05-23 11:21:57,753 INFO L146 ILogger]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-05-23 11:21:57,766 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 11:21:57,767 INFO L146 ILogger]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-05-23 11:21:57,767 INFO L146 ILogger]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:7 [2019-05-23 11:21:57,944 INFO L146 ILogger]: Checked inductivity of 64 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-05-23 11:21:57,966 INFO L146 ILogger]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-05-23 11:21:57,966 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9] total 20 [2019-05-23 11:21:57,967 INFO L146 ILogger]: Interpolant automaton has 20 states [2019-05-23 11:21:57,967 INFO L146 ILogger]: Constructing interpolant automaton starting with 20 interpolants. [2019-05-23 11:21:57,968 INFO L146 ILogger]: CoverageRelationStatistics Valid=57, Invalid=323, Unknown=0, NotChecked=0, Total=380 [2019-05-23 11:21:57,968 INFO L146 ILogger]: Start difference. First operand 82 states and 88 transitions. Second operand 20 states. [2019-05-23 11:21:59,051 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 11:21:59,052 INFO L146 ILogger]: Finished difference Result 203 states and 223 transitions. [2019-05-23 11:21:59,052 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-05-23 11:21:59,052 INFO L146 ILogger]: Start accepts. Automaton has 20 states. Word has length 71 [2019-05-23 11:21:59,053 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 11:21:59,055 INFO L146 ILogger]: With dead ends: 203 [2019-05-23 11:21:59,055 INFO L146 ILogger]: Without dead ends: 160 [2019-05-23 11:21:59,058 INFO L146 ILogger]: 0 DeclaredPredicates, 110 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 400 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=377, Invalid=1693, Unknown=0, NotChecked=0, Total=2070 [2019-05-23 11:21:59,058 INFO L146 ILogger]: Start minimizeSevpa. Operand 160 states. [2019-05-23 11:21:59,068 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 160 to 118. [2019-05-23 11:21:59,069 INFO L146 ILogger]: Start removeUnreachable. Operand 118 states. [2019-05-23 11:21:59,070 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 118 states to 118 states and 128 transitions. [2019-05-23 11:21:59,070 INFO L146 ILogger]: Start accepts. Automaton has 118 states and 128 transitions. Word has length 71 [2019-05-23 11:21:59,070 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 11:21:59,070 INFO L146 ILogger]: Abstraction has 118 states and 128 transitions. [2019-05-23 11:21:59,071 INFO L146 ILogger]: Interpolant automaton has 20 states. [2019-05-23 11:21:59,071 INFO L146 ILogger]: Start isEmpty. Operand 118 states and 128 transitions. [2019-05-23 11:21:59,072 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 79 [2019-05-23 11:21:59,072 INFO L146 ILogger]: Found error trace [2019-05-23 11:21:59,073 INFO L146 ILogger]: trace histogram [5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 11:21:59,073 INFO L146 ILogger]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-05-23 11:21:59,073 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 11:21:59,073 INFO L146 ILogger]: Analyzing trace with hash 947947818, now seen corresponding path program 1 times [2019-05-23 11:21:59,073 INFO L146 ILogger]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-05-23 11:21:59,074 INFO L146 ILogger]: Using refinement strategy CamelRefinementStrategy [2019-05-23 11:21:59,074 INFO L146 ILogger]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-05-23 11:21:59,074 INFO L146 ILogger]: Changing assertion order to NOT_INCREMENTALLY [2019-05-23 11:21:59,075 INFO L146 ILogger]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-05-23 11:21:59,093 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 11:21:59,154 INFO L146 ILogger]: Checked inductivity of 87 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2019-05-23 11:21:59,155 INFO L146 ILogger]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-05-23 11:21:59,155 INFO L146 ILogger]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-05-23 11:21:59,155 INFO L146 ILogger]: Interpolant automaton has 3 states [2019-05-23 11:21:59,155 INFO L146 ILogger]: Constructing interpolant automaton starting with 3 interpolants. [2019-05-23 11:21:59,156 INFO L146 ILogger]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-05-23 11:21:59,156 INFO L146 ILogger]: Start difference. First operand 118 states and 128 transitions. Second operand 3 states. [2019-05-23 11:21:59,173 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 11:21:59,173 INFO L146 ILogger]: Finished difference Result 157 states and 172 transitions. [2019-05-23 11:21:59,174 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-05-23 11:21:59,174 INFO L146 ILogger]: Start accepts. Automaton has 3 states. Word has length 78 [2019-05-23 11:21:59,174 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 11:21:59,175 INFO L146 ILogger]: With dead ends: 157 [2019-05-23 11:21:59,175 INFO L146 ILogger]: Without dead ends: 89 [2019-05-23 11:21:59,176 INFO L146 ILogger]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-05-23 11:21:59,176 INFO L146 ILogger]: Start minimizeSevpa. Operand 89 states. [2019-05-23 11:21:59,183 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 89 to 89. [2019-05-23 11:21:59,183 INFO L146 ILogger]: Start removeUnreachable. Operand 89 states. [2019-05-23 11:21:59,184 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 89 states to 89 states and 93 transitions. [2019-05-23 11:21:59,184 INFO L146 ILogger]: Start accepts. Automaton has 89 states and 93 transitions. Word has length 78 [2019-05-23 11:21:59,184 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 11:21:59,184 INFO L146 ILogger]: Abstraction has 89 states and 93 transitions. [2019-05-23 11:21:59,185 INFO L146 ILogger]: Interpolant automaton has 3 states. [2019-05-23 11:21:59,185 INFO L146 ILogger]: Start isEmpty. Operand 89 states and 93 transitions. [2019-05-23 11:21:59,186 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 83 [2019-05-23 11:21:59,186 INFO L146 ILogger]: Found error trace [2019-05-23 11:21:59,186 INFO L146 ILogger]: trace histogram [5, 5, 5, 5, 5, 5, 3, 3, 3, 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, 1] [2019-05-23 11:21:59,187 INFO L146 ILogger]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-05-23 11:21:59,187 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 11:21:59,187 INFO L146 ILogger]: Analyzing trace with hash 1241972622, now seen corresponding path program 1 times [2019-05-23 11:21:59,187 INFO L146 ILogger]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-05-23 11:21:59,187 INFO L146 ILogger]: Using refinement strategy CamelRefinementStrategy [2019-05-23 11:21:59,188 INFO L146 ILogger]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-05-23 11:21:59,188 INFO L146 ILogger]: Keeping assertion order NOT_INCREMENTALLY [2019-05-23 11:21:59,188 INFO L146 ILogger]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-05-23 11:21:59,204 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 11:21:59,277 INFO L146 ILogger]: Checked inductivity of 91 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2019-05-23 11:21:59,277 INFO L146 ILogger]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-05-23 11:21:59,277 INFO L146 ILogger]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-05-23 11:21:59,278 INFO L146 ILogger]: Interpolant automaton has 3 states [2019-05-23 11:21:59,278 INFO L146 ILogger]: Constructing interpolant automaton starting with 3 interpolants. [2019-05-23 11:21:59,278 INFO L146 ILogger]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-05-23 11:21:59,278 INFO L146 ILogger]: Start difference. First operand 89 states and 93 transitions. Second operand 3 states. [2019-05-23 11:21:59,299 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 11:21:59,299 INFO L146 ILogger]: Finished difference Result 102 states and 107 transitions. [2019-05-23 11:21:59,300 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-05-23 11:21:59,300 INFO L146 ILogger]: Start accepts. Automaton has 3 states. Word has length 82 [2019-05-23 11:21:59,300 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 11:21:59,301 INFO L146 ILogger]: With dead ends: 102 [2019-05-23 11:21:59,301 INFO L146 ILogger]: Without dead ends: 89 [2019-05-23 11:21:59,301 INFO L146 ILogger]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-05-23 11:21:59,302 INFO L146 ILogger]: Start minimizeSevpa. Operand 89 states. [2019-05-23 11:21:59,307 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 89 to 89. [2019-05-23 11:21:59,307 INFO L146 ILogger]: Start removeUnreachable. Operand 89 states. [2019-05-23 11:21:59,308 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 89 states to 89 states and 91 transitions. [2019-05-23 11:21:59,308 INFO L146 ILogger]: Start accepts. Automaton has 89 states and 91 transitions. Word has length 82 [2019-05-23 11:21:59,308 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 11:21:59,308 INFO L146 ILogger]: Abstraction has 89 states and 91 transitions. [2019-05-23 11:21:59,309 INFO L146 ILogger]: Interpolant automaton has 3 states. [2019-05-23 11:21:59,309 INFO L146 ILogger]: Start isEmpty. Operand 89 states and 91 transitions. [2019-05-23 11:21:59,310 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 89 [2019-05-23 11:21:59,310 INFO L146 ILogger]: Found error trace [2019-05-23 11:21:59,310 INFO L146 ILogger]: trace histogram [5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 11:21:59,310 INFO L146 ILogger]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-05-23 11:21:59,311 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 11:21:59,311 INFO L146 ILogger]: Analyzing trace with hash 1758638170, now seen corresponding path program 1 times [2019-05-23 11:21:59,311 INFO L146 ILogger]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-05-23 11:21:59,311 INFO L146 ILogger]: Using refinement strategy CamelRefinementStrategy [2019-05-23 11:21:59,312 INFO L146 ILogger]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-05-23 11:21:59,312 INFO L146 ILogger]: Keeping assertion order NOT_INCREMENTALLY [2019-05-23 11:21:59,312 INFO L146 ILogger]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-05-23 11:21:59,331 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 11:21:59,532 INFO L146 ILogger]: Checked inductivity of 96 backedges. 0 proven. 65 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-05-23 11:21:59,532 INFO L146 ILogger]: The current sequences of interpolants are not accepted, trying to find more. [2019-05-23 11:21:59,532 INFO L146 ILogger]: 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-05-23 11:21:59,545 INFO L146 ILogger]: Keeping assertion order NOT_INCREMENTALLY [2019-05-23 11:21:59,595 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 11:21:59,596 INFO L146 ILogger]: Trace formula consists of 202 conjuncts, 14 conjunts are in the unsatisfiable core [2019-05-23 11:21:59,604 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 11:21:59,861 INFO L146 ILogger]: Checked inductivity of 96 backedges. 0 proven. 65 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-05-23 11:21:59,881 INFO L146 ILogger]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-05-23 11:21:59,882 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 26 [2019-05-23 11:21:59,882 INFO L146 ILogger]: Interpolant automaton has 26 states [2019-05-23 11:21:59,882 INFO L146 ILogger]: Constructing interpolant automaton starting with 26 interpolants. [2019-05-23 11:21:59,883 INFO L146 ILogger]: CoverageRelationStatistics Valid=157, Invalid=493, Unknown=0, NotChecked=0, Total=650 [2019-05-23 11:21:59,883 INFO L146 ILogger]: Start difference. First operand 89 states and 91 transitions. Second operand 26 states. [2019-05-23 11:22:00,497 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 11:22:00,497 INFO L146 ILogger]: Finished difference Result 143 states and 147 transitions. [2019-05-23 11:22:00,498 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-05-23 11:22:00,498 INFO L146 ILogger]: Start accepts. Automaton has 26 states. Word has length 88 [2019-05-23 11:22:00,498 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 11:22:00,499 INFO L146 ILogger]: With dead ends: 143 [2019-05-23 11:22:00,499 INFO L146 ILogger]: Without dead ends: 99 [2019-05-23 11:22:00,501 INFO L146 ILogger]: 0 DeclaredPredicates, 119 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 458 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=508, Invalid=1298, Unknown=0, NotChecked=0, Total=1806 [2019-05-23 11:22:00,501 INFO L146 ILogger]: Start minimizeSevpa. Operand 99 states. [2019-05-23 11:22:00,506 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 99 to 95. [2019-05-23 11:22:00,506 INFO L146 ILogger]: Start removeUnreachable. Operand 95 states. [2019-05-23 11:22:00,507 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 95 states to 95 states and 97 transitions. [2019-05-23 11:22:00,507 INFO L146 ILogger]: Start accepts. Automaton has 95 states and 97 transitions. Word has length 88 [2019-05-23 11:22:00,507 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 11:22:00,507 INFO L146 ILogger]: Abstraction has 95 states and 97 transitions. [2019-05-23 11:22:00,507 INFO L146 ILogger]: Interpolant automaton has 26 states. [2019-05-23 11:22:00,507 INFO L146 ILogger]: Start isEmpty. Operand 95 states and 97 transitions. [2019-05-23 11:22:00,509 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 95 [2019-05-23 11:22:00,509 INFO L146 ILogger]: Found error trace [2019-05-23 11:22:00,509 INFO L146 ILogger]: trace histogram [6, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 11:22:00,509 INFO L146 ILogger]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-05-23 11:22:00,510 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 11:22:00,510 INFO L146 ILogger]: Analyzing trace with hash 884528510, now seen corresponding path program 2 times [2019-05-23 11:22:00,510 INFO L146 ILogger]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-05-23 11:22:00,510 INFO L146 ILogger]: Using refinement strategy CamelRefinementStrategy [2019-05-23 11:22:00,511 INFO L146 ILogger]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-05-23 11:22:00,511 INFO L146 ILogger]: Keeping assertion order NOT_INCREMENTALLY [2019-05-23 11:22:00,511 INFO L146 ILogger]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-05-23 11:22:00,531 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 11:22:00,793 INFO L146 ILogger]: Checked inductivity of 127 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-05-23 11:22:00,793 INFO L146 ILogger]: The current sequences of interpolants are not accepted, trying to find more. [2019-05-23 11:22:00,793 INFO L146 ILogger]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-05-23 11:22:00,803 INFO L146 ILogger]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-05-23 11:22:00,839 INFO L146 ILogger]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-05-23 11:22:00,839 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 11:22:00,840 INFO L146 ILogger]: Trace formula consists of 218 conjuncts, 16 conjunts are in the unsatisfiable core [2019-05-23 11:22:00,843 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 11:22:01,188 INFO L146 ILogger]: Checked inductivity of 127 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-05-23 11:22:01,207 INFO L146 ILogger]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-05-23 11:22:01,207 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 30 [2019-05-23 11:22:01,208 INFO L146 ILogger]: Interpolant automaton has 30 states [2019-05-23 11:22:01,208 INFO L146 ILogger]: Constructing interpolant automaton starting with 30 interpolants. [2019-05-23 11:22:01,208 INFO L146 ILogger]: CoverageRelationStatistics Valid=204, Invalid=666, Unknown=0, NotChecked=0, Total=870 [2019-05-23 11:22:01,209 INFO L146 ILogger]: Start difference. First operand 95 states and 97 transitions. Second operand 30 states. [2019-05-23 11:22:01,734 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 11:22:01,734 INFO L146 ILogger]: Finished difference Result 149 states and 153 transitions. [2019-05-23 11:22:01,734 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-05-23 11:22:01,735 INFO L146 ILogger]: Start accepts. Automaton has 30 states. Word has length 94 [2019-05-23 11:22:01,735 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 11:22:01,736 INFO L146 ILogger]: With dead ends: 149 [2019-05-23 11:22:01,736 INFO L146 ILogger]: Without dead ends: 105 [2019-05-23 11:22:01,737 INFO L146 ILogger]: 0 DeclaredPredicates, 130 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 657 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=674, Invalid=1776, Unknown=0, NotChecked=0, Total=2450 [2019-05-23 11:22:01,737 INFO L146 ILogger]: Start minimizeSevpa. Operand 105 states. [2019-05-23 11:22:01,741 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 105 to 101. [2019-05-23 11:22:01,742 INFO L146 ILogger]: Start removeUnreachable. Operand 101 states. [2019-05-23 11:22:01,742 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 101 states to 101 states and 103 transitions. [2019-05-23 11:22:01,743 INFO L146 ILogger]: Start accepts. Automaton has 101 states and 103 transitions. Word has length 94 [2019-05-23 11:22:01,743 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 11:22:01,743 INFO L146 ILogger]: Abstraction has 101 states and 103 transitions. [2019-05-23 11:22:01,743 INFO L146 ILogger]: Interpolant automaton has 30 states. [2019-05-23 11:22:01,743 INFO L146 ILogger]: Start isEmpty. Operand 101 states and 103 transitions. [2019-05-23 11:22:01,745 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 101 [2019-05-23 11:22:01,745 INFO L146 ILogger]: Found error trace [2019-05-23 11:22:01,745 INFO L146 ILogger]: trace histogram [7, 7, 7, 7, 7, 7, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 11:22:01,745 INFO L146 ILogger]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-05-23 11:22:01,745 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 11:22:01,749 INFO L146 ILogger]: Analyzing trace with hash -1290825822, now seen corresponding path program 3 times [2019-05-23 11:22:01,749 INFO L146 ILogger]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-05-23 11:22:01,749 INFO L146 ILogger]: Using refinement strategy CamelRefinementStrategy [2019-05-23 11:22:01,750 INFO L146 ILogger]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-05-23 11:22:01,750 INFO L146 ILogger]: Changing assertion order to NOT_INCREMENTALLY [2019-05-23 11:22:01,750 INFO L146 ILogger]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-05-23 11:22:01,778 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 11:22:02,078 INFO L146 ILogger]: Checked inductivity of 164 backedges. 0 proven. 133 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-05-23 11:22:02,079 INFO L146 ILogger]: The current sequences of interpolants are not accepted, trying to find more. [2019-05-23 11:22:02,079 INFO L146 ILogger]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-05-23 11:22:02,090 INFO L146 ILogger]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-05-23 11:22:02,116 INFO L146 ILogger]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-05-23 11:22:02,117 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 11:22:02,117 INFO L146 ILogger]: Trace formula consists of 139 conjuncts, 26 conjunts are in the unsatisfiable core [2019-05-23 11:22:02,122 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 11:22:02,558 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-05-23 11:22:02,559 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 11:22:02,566 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 11:22:02,567 INFO L146 ILogger]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-05-23 11:22:02,567 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2019-05-23 11:22:02,978 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 11:22:02,978 INFO L146 ILogger]: 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 24 treesize of output 24 [2019-05-23 11:22:02,982 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-05-23 11:22:02,999 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 11:22:03,003 INFO L146 ILogger]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-05-23 11:22:03,003 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 4 variables, input treesize:33, output treesize:15 [2019-05-23 11:22:03,208 INFO L146 ILogger]: Checked inductivity of 164 backedges. 14 proven. 38 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-05-23 11:22:03,226 INFO L146 ILogger]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-05-23 11:22:03,227 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 16] total 33 [2019-05-23 11:22:03,227 INFO L146 ILogger]: Interpolant automaton has 33 states [2019-05-23 11:22:03,228 INFO L146 ILogger]: Constructing interpolant automaton starting with 33 interpolants. [2019-05-23 11:22:03,228 INFO L146 ILogger]: CoverageRelationStatistics Valid=131, Invalid=925, Unknown=0, NotChecked=0, Total=1056 [2019-05-23 11:22:03,228 INFO L146 ILogger]: Start difference. First operand 101 states and 103 transitions. Second operand 33 states. [2019-05-23 11:22:06,956 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 11:22:06,956 INFO L146 ILogger]: Finished difference Result 134 states and 138 transitions. [2019-05-23 11:22:06,956 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-05-23 11:22:06,956 INFO L146 ILogger]: Start accepts. Automaton has 33 states. Word has length 100 [2019-05-23 11:22:06,957 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 11:22:06,957 INFO L146 ILogger]: With dead ends: 134 [2019-05-23 11:22:06,957 INFO L146 ILogger]: Without dead ends: 0 [2019-05-23 11:22:06,960 INFO L146 ILogger]: 0 DeclaredPredicates, 164 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1473 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=1335, Invalid=4827, Unknown=0, NotChecked=0, Total=6162 [2019-05-23 11:22:06,960 INFO L146 ILogger]: Start minimizeSevpa. Operand 0 states. [2019-05-23 11:22:06,960 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-05-23 11:22:06,960 INFO L146 ILogger]: Start removeUnreachable. Operand 0 states. [2019-05-23 11:22:06,960 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-05-23 11:22:06,961 INFO L146 ILogger]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 100 [2019-05-23 11:22:06,961 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 11:22:06,961 INFO L146 ILogger]: Abstraction has 0 states and 0 transitions. [2019-05-23 11:22:06,961 INFO L146 ILogger]: Interpolant automaton has 33 states. [2019-05-23 11:22:06,961 INFO L146 ILogger]: Start isEmpty. Operand 0 states and 0 transitions. [2019-05-23 11:22:06,961 INFO L146 ILogger]: Finished isEmpty. No accepting run. [2019-05-23 11:22:06,965 INFO L146 ILogger]: Before removal of dead ends 0 states and 0 transitions. [2019-05-23 11:22:07,711 WARN L146 ILogger]: Spent 629.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 38 [2019-05-23 11:22:08,061 WARN L146 ILogger]: Spent 348.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 55 [2019-05-23 11:22:08,064 INFO L146 ILogger]: For program point L31-2(lines 31 35) no Hoare annotation was computed. [2019-05-23 11:22:08,064 INFO L146 ILogger]: For program point L31-3(line 31) no Hoare annotation was computed. [2019-05-23 11:22:08,064 INFO L146 ILogger]: For program point L31-4(line 31) no Hoare annotation was computed. [2019-05-23 11:22:08,064 INFO L146 ILogger]: At program point L31-5(lines 31 35) the Hoare annotation is: (and (<= 100000 ULTIMATE.start_init_~size) (<= 100000 |ULTIMATE.start_init_#in~size|) (= ULTIMATE.start_main_~flag~0 1)) [2019-05-23 11:22:08,064 INFO L146 ILogger]: For program point L31-6(lines 31 35) no Hoare annotation was computed. [2019-05-23 11:22:08,065 INFO L146 ILogger]: For program point L23(line 23) no Hoare annotation was computed. [2019-05-23 11:22:08,065 INFO L146 ILogger]: For program point L23-1(line 23) no Hoare annotation was computed. [2019-05-23 11:22:08,065 INFO L146 ILogger]: For program point L19(line 19) no Hoare annotation was computed. [2019-05-23 11:22:08,065 INFO L146 ILogger]: For program point L19-1(line 19) no Hoare annotation was computed. [2019-05-23 11:22:08,065 INFO L146 ILogger]: For program point L19-2(line 19) no Hoare annotation was computed. [2019-05-23 11:22:08,065 INFO L146 ILogger]: For program point L19-3(line 19) no Hoare annotation was computed. [2019-05-23 11:22:08,065 INFO L146 ILogger]: For program point L11(line 11) no Hoare annotation was computed. [2019-05-23 11:22:08,065 INFO L146 ILogger]: At program point L36(lines 17 37) the Hoare annotation is: true [2019-05-23 11:22:08,065 INFO L146 ILogger]: For program point L-1(line -1) no Hoare annotation was computed. [2019-05-23 11:22:08,066 INFO L146 ILogger]: For program point L-1-1(line -1) no Hoare annotation was computed. [2019-05-23 11:22:08,066 INFO L146 ILogger]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-05-23 11:22:08,066 INFO L146 ILogger]: For program point L-1-2(line -1) no Hoare annotation was computed. [2019-05-23 11:22:08,066 INFO L146 ILogger]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-05-23 11:22:08,066 INFO L146 ILogger]: For program point L28(line 28) no Hoare annotation was computed. [2019-05-23 11:22:08,066 INFO L146 ILogger]: For program point L24-2(lines 24 30) no Hoare annotation was computed. [2019-05-23 11:22:08,066 INFO L146 ILogger]: For program point L24-3(line 24) no Hoare annotation was computed. [2019-05-23 11:22:08,067 INFO L146 ILogger]: For program point L24-4(line 24) no Hoare annotation was computed. [2019-05-23 11:22:08,067 INFO L146 ILogger]: At program point L24-5(lines 24 30) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_main_~#a~0.offset| ULTIMATE.start_init_~a.offset)) (.cse1 (= |ULTIMATE.start_main_~#a~0.base| |ULTIMATE.start_init_#in~a.base|)) (.cse2 (= ULTIMATE.start_main_~flag~0 0)) (.cse3 (exists ((v_prenex_1 Int)) (and (< v_prenex_1 ULTIMATE.start_init_~size) (not (= 0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#a~0.base|) (+ |ULTIMATE.start_main_~#a~0.offset| (* 4 v_prenex_1))))) (<= ULTIMATE.start_init_~i~0 (+ v_prenex_1 1))))) (.cse4 (= |ULTIMATE.start_init_#in~size| 100000)) (.cse5 (exists ((v_prenex_1 Int)) (and (<= 99999 v_prenex_1) (< v_prenex_1 100000) (not (= 0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#a~0.base|) (+ |ULTIMATE.start_main_~#a~0.offset| (* 4 v_prenex_1)))))))) (.cse6 (= ULTIMATE.start_init_~size 100000)) (.cse7 (= |ULTIMATE.start_main_~#a~0.base| ULTIMATE.start_init_~a.base)) (.cse8 (= |ULTIMATE.start_init_#in~a.offset| |ULTIMATE.start_main_~#a~0.offset|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ULTIMATE.start_main_~i~1 0) .cse6 .cse7 .cse8) (and (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#a~0.base|) |ULTIMATE.start_main_~#a~0.offset|)) .cse0 .cse1 .cse2 .cse3 (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#a~0.base|) |ULTIMATE.start_main_~#a~0.offset|) 0) .cse4 .cse5 .cse6 .cse7 (< ULTIMATE.start_main_~i~1 100000) .cse8) (and (<= 100000 ULTIMATE.start_init_~size) (<= 100000 |ULTIMATE.start_init_#in~size|) (= ULTIMATE.start_main_~flag~0 1)))) [2019-05-23 11:22:08,067 INFO L146 ILogger]: For program point L24-6(lines 24 30) no Hoare annotation was computed. [2019-05-23 11:22:08,067 INFO L146 ILogger]: For program point L12(line 12) no Hoare annotation was computed. [2019-05-23 11:22:08,067 INFO L146 ILogger]: For program point L12-3(line 12) no Hoare annotation was computed. [2019-05-23 11:22:08,067 INFO L146 ILogger]: For program point L12-4(line 12) no Hoare annotation was computed. [2019-05-23 11:22:08,068 INFO L146 ILogger]: At program point L12-5(lines 12 15) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_main_~#a~0.offset| ULTIMATE.start_init_~a.offset)) (.cse1 (= |ULTIMATE.start_main_~#a~0.base| |ULTIMATE.start_init_#in~a.base|)) (.cse2 (= ULTIMATE.start_init_~size 100000)) (.cse3 (= ULTIMATE.start_main_~flag~0 0)) (.cse4 (= |ULTIMATE.start_init_#in~size| 100000)) (.cse5 (= |ULTIMATE.start_main_~#a~0.base| ULTIMATE.start_init_~a.base)) (.cse6 (= |ULTIMATE.start_init_#in~a.offset| |ULTIMATE.start_main_~#a~0.offset|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= ULTIMATE.start_init_~i~0 0)) (and .cse0 .cse1 .cse2 .cse3 (exists ((v_prenex_1 Int)) (and (< v_prenex_1 ULTIMATE.start_init_~size) (not (= 0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#a~0.base|) (+ |ULTIMATE.start_main_~#a~0.offset| (* 4 v_prenex_1))))) (<= ULTIMATE.start_init_~i~0 (+ v_prenex_1 1)))) .cse4 .cse5 .cse6))) [2019-05-23 11:22:08,068 INFO L146 ILogger]: For program point L4(line 4) no Hoare annotation was computed. [2019-05-23 11:22:08,068 INFO L146 ILogger]: For program point L4-1(line 4) no Hoare annotation was computed. [2019-05-23 11:22:08,068 INFO L146 ILogger]: For program point L4-2(line 4) no Hoare annotation was computed. [2019-05-23 11:22:08,068 INFO L146 ILogger]: For program point L33(lines 33 34) no Hoare annotation was computed. [2019-05-23 11:22:08,068 INFO L146 ILogger]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-05-23 11:22:08,068 INFO L146 ILogger]: For program point L4-4(line 4) no Hoare annotation was computed. [2019-05-23 11:22:08,068 INFO L146 ILogger]: For program point L21(line 21) no Hoare annotation was computed. [2019-05-23 11:22:08,068 INFO L146 ILogger]: For program point L9(lines 9 16) no Hoare annotation was computed. [2019-05-23 11:22:08,069 INFO L146 ILogger]: For program point L9-1(lines 9 16) no Hoare annotation was computed. [2019-05-23 11:22:08,069 INFO L146 ILogger]: For program point L9-2(lines 9 16) no Hoare annotation was computed. [2019-05-23 11:22:08,069 INFO L146 ILogger]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 4) no Hoare annotation was computed. [2019-05-23 11:22:08,069 INFO L146 ILogger]: For program point L34(line 34) no Hoare annotation was computed. [2019-05-23 11:22:08,069 INFO L146 ILogger]: For program point L34-1(line 34) no Hoare annotation was computed. [2019-05-23 11:22:08,069 INFO L146 ILogger]: For program point L34-2(line 34) no Hoare annotation was computed. [2019-05-23 11:22:08,069 INFO L146 ILogger]: For program point L26(line 26) no Hoare annotation was computed. [2019-05-23 11:22:08,070 INFO L146 ILogger]: For program point L26-1(lines 26 29) no Hoare annotation was computed. [2019-05-23 11:22:08,070 INFO L146 ILogger]: For program point L26-2(line 26) no Hoare annotation was computed. [2019-05-23 11:22:08,070 INFO L146 ILogger]: For program point L22(line 22) no Hoare annotation was computed. [2019-05-23 11:22:08,070 INFO L146 ILogger]: For program point L26-4(line 26) no Hoare annotation was computed. [2019-05-23 11:22:08,070 INFO L146 ILogger]: For program point L14(line 14) no Hoare annotation was computed. [2019-05-23 11:22:08,070 INFO L146 ILogger]: For program point L14-1(line 14) no Hoare annotation was computed. [2019-05-23 11:22:08,070 INFO L146 ILogger]: For program point L14-2(lines 12 15) no Hoare annotation was computed. [2019-05-23 11:22:08,087 WARN L146 ILogger]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-05-23 11:22:08,088 WARN L146 ILogger]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-05-23 11:22:08,088 WARN L146 ILogger]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-05-23 11:22:08,089 WARN L146 ILogger]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-05-23 11:22:08,090 WARN L146 ILogger]: unknown boogie variable #memory_$Pointer$ [2019-05-23 11:22:08,091 WARN L146 ILogger]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-05-23 11:22:08,091 WARN L146 ILogger]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-05-23 11:22:08,091 WARN L146 ILogger]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-05-23 11:22:08,092 WARN L146 ILogger]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-05-23 11:22:08,093 WARN L146 ILogger]: unknown boogie variable #memory_$Pointer$ [2019-05-23 11:22:08,095 WARN L146 ILogger]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-05-23 11:22:08,095 WARN L146 ILogger]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-05-23 11:22:08,095 WARN L146 ILogger]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-05-23 11:22:08,096 WARN L146 ILogger]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-05-23 11:22:08,096 WARN L146 ILogger]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-05-23 11:22:08,096 WARN L146 ILogger]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-05-23 11:22:08,096 WARN L146 ILogger]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-05-23 11:22:08,097 WARN L146 ILogger]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-05-23 11:22:08,097 WARN L146 ILogger]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-05-23 11:22:08,097 WARN L146 ILogger]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-05-23 11:22:08,098 WARN L146 ILogger]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-05-23 11:22:08,098 WARN L146 ILogger]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-05-23 11:22:08,098 WARN L146 ILogger]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-05-23 11:22:08,098 WARN L146 ILogger]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-05-23 11:22:08,099 WARN L146 ILogger]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-05-23 11:22:08,099 WARN L146 ILogger]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-05-23 11:22:08,099 WARN L146 ILogger]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-05-23 11:22:08,099 WARN L146 ILogger]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-05-23 11:22:08,101 WARN L146 ILogger]: unknown boogie variable #memory_$Pointer$ [2019-05-23 11:22:08,101 WARN L146 ILogger]: unknown boogie variable #memory_$Pointer$ [2019-05-23 11:22:08,101 WARN L146 ILogger]: unknown boogie variable #memory_$Pointer$ [2019-05-23 11:22:08,101 WARN L146 ILogger]: unknown boogie variable #memory_$Pointer$ [2019-05-23 11:22:08,102 WARN L146 ILogger]: unknown boogie variable #memory_$Pointer$ [2019-05-23 11:22:08,102 WARN L146 ILogger]: unknown boogie variable #memory_$Pointer$ [2019-05-23 11:22:08,103 WARN L146 ILogger]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-05-23 11:22:08,103 WARN L146 ILogger]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-05-23 11:22:08,103 WARN L146 ILogger]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-05-23 11:22:08,104 WARN L146 ILogger]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-05-23 11:22:08,104 WARN L146 ILogger]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-05-23 11:22:08,104 WARN L146 ILogger]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-05-23 11:22:08,105 WARN L146 ILogger]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-05-23 11:22:08,105 WARN L146 ILogger]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-05-23 11:22:08,105 WARN L146 ILogger]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-05-23 11:22:08,106 WARN L146 ILogger]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-05-23 11:22:08,106 WARN L146 ILogger]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-05-23 11:22:08,106 WARN L146 ILogger]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-05-23 11:22:08,106 WARN L146 ILogger]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-05-23 11:22:08,107 WARN L146 ILogger]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-05-23 11:22:08,107 WARN L146 ILogger]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-05-23 11:22:08,107 WARN L146 ILogger]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-05-23 11:22:08,108 WARN L146 ILogger]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-05-23 11:22:08,108 WARN L146 ILogger]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-05-23 11:22:08,109 WARN L146 ILogger]: unknown boogie variable #memory_$Pointer$ [2019-05-23 11:22:08,109 WARN L146 ILogger]: unknown boogie variable #memory_$Pointer$ [2019-05-23 11:22:08,109 WARN L146 ILogger]: unknown boogie variable #memory_$Pointer$ [2019-05-23 11:22:08,110 WARN L146 ILogger]: unknown boogie variable #memory_$Pointer$ [2019-05-23 11:22:08,110 WARN L146 ILogger]: unknown boogie variable #memory_$Pointer$ [2019-05-23 11:22:08,110 WARN L146 ILogger]: unknown boogie variable #memory_$Pointer$ [2019-05-23 11:22:08,115 INFO L146 ILogger]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.05 11:22:08 BoogieIcfgContainer [2019-05-23 11:22:08,116 INFO L146 ILogger]: ------------------------ END TraceAbstraction---------------------------- [2019-05-23 11:22:08,117 INFO L146 ILogger]: Toolchain (without parser) took 16553.13 ms. Allocated memory was 142.1 MB in the beginning and 330.8 MB in the end (delta: 188.7 MB). Free memory was 91.0 MB in the beginning and 186.7 MB in the end (delta: -95.7 MB). Peak memory consumption was 93.1 MB. Max. memory is 7.1 GB. [2019-05-23 11:22:08,118 INFO L146 ILogger]: CDTParser took 0.21 ms. Allocated memory is still 142.1 MB. Free memory is still 109.2 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-05-23 11:22:08,119 INFO L146 ILogger]: CACSL2BoogieTranslator took 271.23 ms. Allocated memory is still 142.1 MB. Free memory was 91.0 MB in the beginning and 81.0 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 7.1 GB. [2019-05-23 11:22:08,119 INFO L146 ILogger]: Boogie Procedure Inliner took 42.42 ms. Allocated memory is still 142.1 MB. Free memory was 81.0 MB in the beginning and 79.3 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. [2019-05-23 11:22:08,120 INFO L146 ILogger]: Boogie Preprocessor took 28.04 ms. Allocated memory is still 142.1 MB. Free memory was 79.3 MB in the beginning and 77.6 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. [2019-05-23 11:22:08,121 INFO L146 ILogger]: RCFGBuilder took 610.44 ms. Allocated memory was 142.1 MB in the beginning and 203.9 MB in the end (delta: 61.9 MB). Free memory was 77.6 MB in the beginning and 165.3 MB in the end (delta: -87.7 MB). Peak memory consumption was 12.0 MB. Max. memory is 7.1 GB. [2019-05-23 11:22:08,122 INFO L146 ILogger]: TraceAbstraction took 15596.12 ms. Allocated memory was 203.9 MB in the beginning and 330.8 MB in the end (delta: 126.9 MB). Free memory was 165.3 MB in the beginning and 186.7 MB in the end (delta: -21.4 MB). Peak memory consumption was 105.5 MB. Max. memory is 7.1 GB. [2019-05-23 11:22:08,126 INFO L146 ILogger]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 142.1 MB. Free memory is still 109.2 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 271.23 ms. Allocated memory is still 142.1 MB. Free memory was 91.0 MB in the beginning and 81.0 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 42.42 ms. Allocated memory is still 142.1 MB. Free memory was 81.0 MB in the beginning and 79.3 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 28.04 ms. Allocated memory is still 142.1 MB. Free memory was 79.3 MB in the beginning and 77.6 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 610.44 ms. Allocated memory was 142.1 MB in the beginning and 203.9 MB in the end (delta: 61.9 MB). Free memory was 77.6 MB in the beginning and 165.3 MB in the end (delta: -87.7 MB). Peak memory consumption was 12.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 15596.12 ms. Allocated memory was 203.9 MB in the beginning and 330.8 MB in the end (delta: 126.9 MB). Free memory was 165.3 MB in the beginning and 186.7 MB in the end (delta: -21.4 MB). Peak memory consumption was 105.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 4]: 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: 31]: Loop Invariant Derived loop invariant: (100000 <= size && 100000 <= \old(size)) && flag == 1 - InvariantResult [Line: 12]: Loop Invariant [2019-05-23 11:22:08,139 WARN L146 ILogger]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-05-23 11:22:08,139 WARN L146 ILogger]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-05-23 11:22:08,140 WARN L146 ILogger]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-05-23 11:22:08,140 WARN L146 ILogger]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-05-23 11:22:08,140 WARN L146 ILogger]: unknown boogie variable #memory_$Pointer$ [2019-05-23 11:22:08,141 WARN L146 ILogger]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-05-23 11:22:08,141 WARN L146 ILogger]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-05-23 11:22:08,141 WARN L146 ILogger]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-05-23 11:22:08,142 WARN L146 ILogger]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-05-23 11:22:08,142 WARN L146 ILogger]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: (((((((a == a && a == a) && size == 100000) && flag == 0) && \old(size) == 100000) && a == a) && a == a) && i == 0) || (((((((a == a && a == a) && size == 100000) && flag == 0) && (\exists v_prenex_1 : int :: (v_prenex_1 < size && !(0 == #memory_$Pointer$[a][a + 4 * v_prenex_1])) && i <= v_prenex_1 + 1)) && \old(size) == 100000) && a == a) && a == a) - InvariantResult [Line: 24]: Loop Invariant [2019-05-23 11:22:08,143 WARN L146 ILogger]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-05-23 11:22:08,143 WARN L146 ILogger]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-05-23 11:22:08,143 WARN L146 ILogger]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-05-23 11:22:08,144 WARN L146 ILogger]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-05-23 11:22:08,144 WARN L146 ILogger]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-05-23 11:22:08,144 WARN L146 ILogger]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-05-23 11:22:08,144 WARN L146 ILogger]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-05-23 11:22:08,144 WARN L146 ILogger]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-05-23 11:22:08,145 WARN L146 ILogger]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-05-23 11:22:08,145 WARN L146 ILogger]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-05-23 11:22:08,145 WARN L146 ILogger]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-05-23 11:22:08,146 WARN L146 ILogger]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-05-23 11:22:08,146 WARN L146 ILogger]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-05-23 11:22:08,146 WARN L146 ILogger]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-05-23 11:22:08,146 WARN L146 ILogger]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-05-23 11:22:08,146 WARN L146 ILogger]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-05-23 11:22:08,147 WARN L146 ILogger]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-05-23 11:22:08,147 WARN L146 ILogger]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-05-23 11:22:08,148 WARN L146 ILogger]: unknown boogie variable #memory_$Pointer$ [2019-05-23 11:22:08,148 WARN L146 ILogger]: unknown boogie variable #memory_$Pointer$ [2019-05-23 11:22:08,148 WARN L146 ILogger]: unknown boogie variable #memory_$Pointer$ [2019-05-23 11:22:08,148 WARN L146 ILogger]: unknown boogie variable #memory_$Pointer$ [2019-05-23 11:22:08,149 WARN L146 ILogger]: unknown boogie variable #memory_$Pointer$ [2019-05-23 11:22:08,149 WARN L146 ILogger]: unknown boogie variable #memory_$Pointer$ [2019-05-23 11:22:08,150 WARN L146 ILogger]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-05-23 11:22:08,150 WARN L146 ILogger]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-05-23 11:22:08,150 WARN L146 ILogger]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-05-23 11:22:08,150 WARN L146 ILogger]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-05-23 11:22:08,150 WARN L146 ILogger]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-05-23 11:22:08,151 WARN L146 ILogger]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-05-23 11:22:08,151 WARN L146 ILogger]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-05-23 11:22:08,151 WARN L146 ILogger]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-05-23 11:22:08,151 WARN L146 ILogger]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-05-23 11:22:08,152 WARN L146 ILogger]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-05-23 11:22:08,152 WARN L146 ILogger]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-05-23 11:22:08,152 WARN L146 ILogger]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-05-23 11:22:08,152 WARN L146 ILogger]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-05-23 11:22:08,153 WARN L146 ILogger]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-05-23 11:22:08,153 WARN L146 ILogger]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-05-23 11:22:08,153 WARN L146 ILogger]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-05-23 11:22:08,153 WARN L146 ILogger]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-05-23 11:22:08,153 WARN L146 ILogger]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-05-23 11:22:08,154 WARN L146 ILogger]: unknown boogie variable #memory_$Pointer$ [2019-05-23 11:22:08,154 WARN L146 ILogger]: unknown boogie variable #memory_$Pointer$ [2019-05-23 11:22:08,155 WARN L146 ILogger]: unknown boogie variable #memory_$Pointer$ [2019-05-23 11:22:08,155 WARN L146 ILogger]: unknown boogie variable #memory_$Pointer$ [2019-05-23 11:22:08,155 WARN L146 ILogger]: unknown boogie variable #memory_$Pointer$ [2019-05-23 11:22:08,155 WARN L146 ILogger]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: ((((((((((a == a && a == a) && flag == 0) && (\exists v_prenex_1 : int :: (v_prenex_1 < size && !(0 == #memory_$Pointer$[a][a + 4 * v_prenex_1])) && i <= v_prenex_1 + 1)) && \old(size) == 100000) && (\exists v_prenex_1 : int :: (99999 <= v_prenex_1 && v_prenex_1 < 100000) && !(0 == #memory_$Pointer$[a][a + 4 * v_prenex_1]))) && i == 0) && size == 100000) && a == a) && a == a) || (((((((((((0 == #memory_$Pointer$[a][a] && a == a) && a == a) && flag == 0) && (\exists v_prenex_1 : int :: (v_prenex_1 < size && !(0 == #memory_$Pointer$[a][a + 4 * v_prenex_1])) && i <= v_prenex_1 + 1)) && #memory_$Pointer$[a][a] == 0) && \old(size) == 100000) && (\exists v_prenex_1 : int :: (99999 <= v_prenex_1 && v_prenex_1 < 100000) && !(0 == #memory_$Pointer$[a][a + 4 * v_prenex_1]))) && size == 100000) && a == a) && i < 100000) && a == a)) || ((100000 <= size && 100000 <= \old(size)) && flag == 1) - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 50 locations, 1 error locations. SAFE Result, 15.4s OverallTime, 11 OverallIterations, 7 TraceHistogramMax, 8.0s AutomataDifference, 0.0s DeadEndRemovalTime, 1.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 450 SDtfs, 1566 SDslu, 2708 SDs, 0 SdLazy, 1266 SolverSat, 210 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 789 GetRequests, 499 SyntacticMatches, 0 SemanticMatches, 290 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3279 ImplicationChecksByTransitivity, 9.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=118occurred in iteration=6, 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.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 123 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 24 NumberOfFragments, 240 HoareAnnotationTreeSize, 4 FomulaSimplifications, 1045 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 4 FomulaSimplificationsInter, 33 FormulaSimplificationTreeSizeReductionInter, 1.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 5.0s InterpolantComputationTime, 1270 NumberOfCodeBlocks, 1220 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 1251 ConstructedInterpolants, 20 QuantifiedInterpolants, 330220 SizeOfPredicates, 77 NumberOfNonLiveVariables, 1124 ConjunctsInSsa, 102 ConjunctsInUnsatCore, 19 InterpolantComputations, 4 PerfectInterpolantSequences, 607/1196 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...