java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test10_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-5f7ec6e [2018-01-31 08:41:36,034 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-31 08:41:36,036 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-31 08:41:36,057 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-31 08:41:36,058 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-31 08:41:36,059 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-31 08:41:36,060 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-31 08:41:36,062 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-31 08:41:36,064 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-31 08:41:36,065 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-31 08:41:36,066 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-31 08:41:36,068 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-31 08:41:36,069 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-31 08:41:36,070 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-31 08:41:36,081 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-31 08:41:36,085 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-31 08:41:36,086 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-31 08:41:36,089 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-31 08:41:36,090 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-31 08:41:36,091 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-31 08:41:36,093 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-31 08:41:36,094 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-31 08:41:36,094 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-31 08:41:36,095 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-31 08:41:36,095 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-31 08:41:36,097 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-31 08:41:36,097 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-31 08:41:36,097 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-31 08:41:36,098 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-31 08:41:36,098 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-31 08:41:36,098 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-31 08:41:36,099 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf [2018-01-31 08:41:36,115 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-31 08:41:36,115 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-31 08:41:36,116 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-31 08:41:36,116 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-31 08:41:36,117 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-31 08:41:36,117 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-31 08:41:36,117 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-31 08:41:36,117 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-31 08:41:36,118 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-31 08:41:36,118 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-31 08:41:36,118 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-31 08:41:36,118 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-31 08:41:36,118 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-31 08:41:36,119 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-31 08:41:36,119 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-31 08:41:36,119 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-31 08:41:36,123 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-31 08:41:36,123 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-31 08:41:36,123 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-31 08:41:36,123 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-31 08:41:36,123 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-31 08:41:36,123 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-31 08:41:36,124 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-31 08:41:36,124 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-31 08:41:36,124 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-31 08:41:36,124 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-31 08:41:36,124 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-31 08:41:36,125 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-31 08:41:36,125 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-31 08:41:36,125 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-31 08:41:36,125 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-31 08:41:36,125 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-31 08:41:36,128 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-31 08:41:36,128 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-31 08:41:36,174 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-31 08:41:36,192 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-31 08:41:36,199 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-31 08:41:36,200 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-31 08:41:36,201 INFO L276 PluginConnector]: CDTParser initialized [2018-01-31 08:41:36,201 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test10_true-valid-memsafety_true-termination.i [2018-01-31 08:41:36,398 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-31 08:41:36,406 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-31 08:41:36,407 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-31 08:41:36,408 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-31 08:41:36,414 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-31 08:41:36,415 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 08:41:36" (1/1) ... [2018-01-31 08:41:36,419 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b06e271 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:41:36, skipping insertion in model container [2018-01-31 08:41:36,420 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 08:41:36" (1/1) ... [2018-01-31 08:41:36,438 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-31 08:41:36,519 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-31 08:41:36,694 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-31 08:41:36,719 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-31 08:41:36,727 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:41:36 WrapperNode [2018-01-31 08:41:36,728 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-31 08:41:36,728 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-31 08:41:36,729 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-31 08:41:36,729 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-31 08:41:36,744 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:41:36" (1/1) ... [2018-01-31 08:41:36,744 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:41:36" (1/1) ... [2018-01-31 08:41:36,756 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:41:36" (1/1) ... [2018-01-31 08:41:36,756 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:41:36" (1/1) ... [2018-01-31 08:41:36,763 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:41:36" (1/1) ... [2018-01-31 08:41:36,765 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:41:36" (1/1) ... [2018-01-31 08:41:36,767 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:41:36" (1/1) ... [2018-01-31 08:41:36,769 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-31 08:41:36,769 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-31 08:41:36,769 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-31 08:41:36,769 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-31 08:41:36,776 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:41:36" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-31 08:41:36,829 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-31 08:41:36,829 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-31 08:41:36,829 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-01-31 08:41:36,829 INFO L136 BoogieDeclarations]: Found implementation of procedure alloc_10 [2018-01-31 08:41:36,829 INFO L136 BoogieDeclarations]: Found implementation of procedure free_10 [2018-01-31 08:41:36,829 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-01-31 08:41:36,830 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-31 08:41:36,830 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-31 08:41:36,830 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-31 08:41:36,830 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-31 08:41:36,830 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-31 08:41:36,830 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-31 08:41:36,831 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-31 08:41:36,831 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-31 08:41:36,831 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-31 08:41:36,831 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-01-31 08:41:36,831 INFO L128 BoogieDeclarations]: Found specification of procedure alloc_10 [2018-01-31 08:41:36,831 INFO L128 BoogieDeclarations]: Found specification of procedure free_10 [2018-01-31 08:41:36,831 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-01-31 08:41:36,832 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-31 08:41:36,832 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-31 08:41:36,832 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-31 08:41:37,575 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-31 08:41:37,576 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 08:41:37 BoogieIcfgContainer [2018-01-31 08:41:37,576 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-31 08:41:37,577 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-31 08:41:37,577 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-31 08:41:37,582 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-31 08:41:37,582 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.01 08:41:36" (1/3) ... [2018-01-31 08:41:37,583 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70b38780 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 08:41:37, skipping insertion in model container [2018-01-31 08:41:37,585 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:41:36" (2/3) ... [2018-01-31 08:41:37,586 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70b38780 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 08:41:37, skipping insertion in model container [2018-01-31 08:41:37,586 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 08:41:37" (3/3) ... [2018-01-31 08:41:37,588 INFO L107 eAbstractionObserver]: Analyzing ICFG memleaks_test10_true-valid-memsafety_true-termination.i [2018-01-31 08:41:37,597 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-31 08:41:37,607 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 39 error locations. [2018-01-31 08:41:37,645 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-31 08:41:37,646 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-31 08:41:37,646 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-31 08:41:37,646 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-31 08:41:37,646 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-31 08:41:37,646 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-31 08:41:37,646 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-31 08:41:37,646 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-31 08:41:37,647 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-31 08:41:37,671 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states. [2018-01-31 08:41:37,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-31 08:41:37,680 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:41:37,681 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:41:37,681 INFO L371 AbstractCegarLoop]: === Iteration 1 === [free_10Err6RequiresViolation, free_10Err4RequiresViolation, free_10Err7RequiresViolation, free_10Err5RequiresViolation, free_10Err0RequiresViolation, free_10Err3RequiresViolation, free_10Err1RequiresViolation, free_10Err2RequiresViolation, alloc_10Err5RequiresViolation, alloc_10Err2RequiresViolation, alloc_10Err3RequiresViolation, alloc_10Err4RequiresViolation, alloc_10Err1RequiresViolation, alloc_10Err0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr18RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr23RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr19RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr21RequiresViolation, entry_pointErr22RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr20RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation]=== [2018-01-31 08:41:37,686 INFO L82 PathProgramCache]: Analyzing trace with hash 1616991360, now seen corresponding path program 1 times [2018-01-31 08:41:37,688 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:41:37,689 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:41:37,749 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:41:37,750 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:41:37,750 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:41:37,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:41:37,813 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:41:37,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:41:37,953 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:41:37,953 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-31 08:41:37,955 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-31 08:41:37,969 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-31 08:41:37,970 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-31 08:41:37,974 INFO L87 Difference]: Start difference. First operand 116 states. Second operand 3 states. [2018-01-31 08:41:38,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:41:38,557 INFO L93 Difference]: Finished difference Result 175 states and 194 transitions. [2018-01-31 08:41:38,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-31 08:41:38,559 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-01-31 08:41:38,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:41:38,572 INFO L225 Difference]: With dead ends: 175 [2018-01-31 08:41:38,572 INFO L226 Difference]: Without dead ends: 168 [2018-01-31 08:41:38,576 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-31 08:41:38,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2018-01-31 08:41:38,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 118. [2018-01-31 08:41:38,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-01-31 08:41:38,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 127 transitions. [2018-01-31 08:41:38,625 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 127 transitions. Word has length 21 [2018-01-31 08:41:38,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:41:38,625 INFO L432 AbstractCegarLoop]: Abstraction has 118 states and 127 transitions. [2018-01-31 08:41:38,625 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-31 08:41:38,625 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 127 transitions. [2018-01-31 08:41:38,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-31 08:41:38,627 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:41:38,628 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:41:38,629 INFO L371 AbstractCegarLoop]: === Iteration 2 === [free_10Err6RequiresViolation, free_10Err4RequiresViolation, free_10Err7RequiresViolation, free_10Err5RequiresViolation, free_10Err0RequiresViolation, free_10Err3RequiresViolation, free_10Err1RequiresViolation, free_10Err2RequiresViolation, alloc_10Err5RequiresViolation, alloc_10Err2RequiresViolation, alloc_10Err3RequiresViolation, alloc_10Err4RequiresViolation, alloc_10Err1RequiresViolation, alloc_10Err0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr18RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr23RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr19RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr21RequiresViolation, entry_pointErr22RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr20RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation]=== [2018-01-31 08:41:38,629 INFO L82 PathProgramCache]: Analyzing trace with hash -406433530, now seen corresponding path program 1 times [2018-01-31 08:41:38,629 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:41:38,630 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:41:38,631 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:41:38,632 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:41:38,632 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:41:38,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:41:38,650 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:41:38,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:41:38,758 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:41:38,759 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-31 08:41:38,760 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-31 08:41:38,760 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-31 08:41:38,761 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-31 08:41:38,761 INFO L87 Difference]: Start difference. First operand 118 states and 127 transitions. Second operand 6 states. [2018-01-31 08:41:39,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:41:39,293 INFO L93 Difference]: Finished difference Result 177 states and 194 transitions. [2018-01-31 08:41:39,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-31 08:41:39,293 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-01-31 08:41:39,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:41:39,297 INFO L225 Difference]: With dead ends: 177 [2018-01-31 08:41:39,297 INFO L226 Difference]: Without dead ends: 173 [2018-01-31 08:41:39,298 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-31 08:41:39,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-01-31 08:41:39,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 113. [2018-01-31 08:41:39,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-01-31 08:41:39,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 118 transitions. [2018-01-31 08:41:39,312 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 118 transitions. Word has length 22 [2018-01-31 08:41:39,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:41:39,313 INFO L432 AbstractCegarLoop]: Abstraction has 113 states and 118 transitions. [2018-01-31 08:41:39,313 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-31 08:41:39,313 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 118 transitions. [2018-01-31 08:41:39,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-31 08:41:39,314 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:41:39,314 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:41:39,314 INFO L371 AbstractCegarLoop]: === Iteration 3 === [free_10Err6RequiresViolation, free_10Err4RequiresViolation, free_10Err7RequiresViolation, free_10Err5RequiresViolation, free_10Err0RequiresViolation, free_10Err3RequiresViolation, free_10Err1RequiresViolation, free_10Err2RequiresViolation, alloc_10Err5RequiresViolation, alloc_10Err2RequiresViolation, alloc_10Err3RequiresViolation, alloc_10Err4RequiresViolation, alloc_10Err1RequiresViolation, alloc_10Err0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr18RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr23RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr19RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr21RequiresViolation, entry_pointErr22RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr20RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation]=== [2018-01-31 08:41:39,314 INFO L82 PathProgramCache]: Analyzing trace with hash -1584078222, now seen corresponding path program 1 times [2018-01-31 08:41:39,315 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:41:39,315 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:41:39,316 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:41:39,316 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:41:39,317 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:41:39,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:41:39,331 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:41:39,397 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-01-31 08:41:39,397 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:41:39,398 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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 [2018-01-31 08:41:39,406 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:41:39,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:41:39,442 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:41:39,474 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:41:39,499 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-31 08:41:39,499 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 5 [2018-01-31 08:41:39,500 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-31 08:41:39,500 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-31 08:41:39,500 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-31 08:41:39,500 INFO L87 Difference]: Start difference. First operand 113 states and 118 transitions. Second operand 5 states. [2018-01-31 08:41:39,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:41:39,647 INFO L93 Difference]: Finished difference Result 220 states and 232 transitions. [2018-01-31 08:41:39,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-31 08:41:39,647 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2018-01-31 08:41:39,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:41:39,649 INFO L225 Difference]: With dead ends: 220 [2018-01-31 08:41:39,649 INFO L226 Difference]: Without dead ends: 115 [2018-01-31 08:41:39,650 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 25 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-31 08:41:39,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-01-31 08:41:39,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2018-01-31 08:41:39,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-01-31 08:41:39,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 122 transitions. [2018-01-31 08:41:39,664 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 122 transitions. Word has length 27 [2018-01-31 08:41:39,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:41:39,664 INFO L432 AbstractCegarLoop]: Abstraction has 115 states and 122 transitions. [2018-01-31 08:41:39,665 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-31 08:41:39,665 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 122 transitions. [2018-01-31 08:41:39,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-31 08:41:39,666 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:41:39,666 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:41:39,666 INFO L371 AbstractCegarLoop]: === Iteration 4 === [free_10Err6RequiresViolation, free_10Err4RequiresViolation, free_10Err7RequiresViolation, free_10Err5RequiresViolation, free_10Err0RequiresViolation, free_10Err3RequiresViolation, free_10Err1RequiresViolation, free_10Err2RequiresViolation, alloc_10Err5RequiresViolation, alloc_10Err2RequiresViolation, alloc_10Err3RequiresViolation, alloc_10Err4RequiresViolation, alloc_10Err1RequiresViolation, alloc_10Err0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr18RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr23RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr19RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr21RequiresViolation, entry_pointErr22RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr20RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation]=== [2018-01-31 08:41:39,667 INFO L82 PathProgramCache]: Analyzing trace with hash 1624236664, now seen corresponding path program 1 times [2018-01-31 08:41:39,667 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:41:39,667 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:41:39,669 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:41:39,669 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:41:39,669 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:41:39,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:41:39,687 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:41:39,764 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:41:39,764 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:41:39,765 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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 [2018-01-31 08:41:39,779 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:41:39,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:41:39,811 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:41:39,840 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-31 08:41:39,842 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:41:39,844 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:41:39,844 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-31 08:41:39,923 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:41:39,946 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:41:39,946 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-01-31 08:41:39,947 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-31 08:41:39,947 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-31 08:41:39,947 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-31 08:41:39,947 INFO L87 Difference]: Start difference. First operand 115 states and 122 transitions. Second operand 7 states. [2018-01-31 08:41:40,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:41:40,997 INFO L93 Difference]: Finished difference Result 141 states and 149 transitions. [2018-01-31 08:41:40,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-31 08:41:40,998 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 28 [2018-01-31 08:41:40,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:41:41,000 INFO L225 Difference]: With dead ends: 141 [2018-01-31 08:41:41,000 INFO L226 Difference]: Without dead ends: 135 [2018-01-31 08:41:41,000 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 26 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-01-31 08:41:41,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-01-31 08:41:41,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 120. [2018-01-31 08:41:41,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-01-31 08:41:41,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 133 transitions. [2018-01-31 08:41:41,023 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 133 transitions. Word has length 28 [2018-01-31 08:41:41,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:41:41,024 INFO L432 AbstractCegarLoop]: Abstraction has 120 states and 133 transitions. [2018-01-31 08:41:41,024 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-31 08:41:41,024 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 133 transitions. [2018-01-31 08:41:41,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-31 08:41:41,025 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:41:41,025 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:41:41,025 INFO L371 AbstractCegarLoop]: === Iteration 5 === [free_10Err6RequiresViolation, free_10Err4RequiresViolation, free_10Err7RequiresViolation, free_10Err5RequiresViolation, free_10Err0RequiresViolation, free_10Err3RequiresViolation, free_10Err1RequiresViolation, free_10Err2RequiresViolation, alloc_10Err5RequiresViolation, alloc_10Err2RequiresViolation, alloc_10Err3RequiresViolation, alloc_10Err4RequiresViolation, alloc_10Err1RequiresViolation, alloc_10Err0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr18RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr23RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr19RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr21RequiresViolation, entry_pointErr22RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr20RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation]=== [2018-01-31 08:41:41,025 INFO L82 PathProgramCache]: Analyzing trace with hash 1624236665, now seen corresponding path program 1 times [2018-01-31 08:41:41,025 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:41:41,025 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:41:41,027 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:41:41,027 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:41:41,027 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:41:41,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:41:41,047 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:41:41,380 WARN L146 SmtUtils]: Spent 203ms on a formula simplification. DAG size of input: 19 DAG size of output 17 [2018-01-31 08:41:41,489 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:41:41,489 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:41:41,490 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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 [2018-01-31 08:41:41,503 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:41:41,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:41:41,538 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:41:41,691 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2018-01-31 08:41:41,692 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:41:41,716 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-01-31 08:41:41,717 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:41:41,736 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-31 08:41:41,736 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:36 [2018-01-31 08:41:41,950 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:41:41,970 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:41:41,971 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-01-31 08:41:41,971 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-31 08:41:41,971 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-31 08:41:41,971 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2018-01-31 08:41:41,972 INFO L87 Difference]: Start difference. First operand 120 states and 133 transitions. Second operand 13 states. [2018-01-31 08:41:42,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:41:42,691 INFO L93 Difference]: Finished difference Result 180 states and 201 transitions. [2018-01-31 08:41:42,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-31 08:41:42,692 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 28 [2018-01-31 08:41:42,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:41:42,693 INFO L225 Difference]: With dead ends: 180 [2018-01-31 08:41:42,694 INFO L226 Difference]: Without dead ends: 173 [2018-01-31 08:41:42,694 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2018-01-31 08:41:42,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-01-31 08:41:42,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 156. [2018-01-31 08:41:42,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-01-31 08:41:42,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 190 transitions. [2018-01-31 08:41:42,709 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 190 transitions. Word has length 28 [2018-01-31 08:41:42,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:41:42,709 INFO L432 AbstractCegarLoop]: Abstraction has 156 states and 190 transitions. [2018-01-31 08:41:42,709 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-31 08:41:42,709 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 190 transitions. [2018-01-31 08:41:42,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-31 08:41:42,710 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:41:42,711 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:41:42,711 INFO L371 AbstractCegarLoop]: === Iteration 6 === [free_10Err6RequiresViolation, free_10Err4RequiresViolation, free_10Err7RequiresViolation, free_10Err5RequiresViolation, free_10Err0RequiresViolation, free_10Err3RequiresViolation, free_10Err1RequiresViolation, free_10Err2RequiresViolation, alloc_10Err5RequiresViolation, alloc_10Err2RequiresViolation, alloc_10Err3RequiresViolation, alloc_10Err4RequiresViolation, alloc_10Err1RequiresViolation, alloc_10Err0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr18RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr23RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr19RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr21RequiresViolation, entry_pointErr22RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr20RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation]=== [2018-01-31 08:41:42,711 INFO L82 PathProgramCache]: Analyzing trace with hash -561732382, now seen corresponding path program 1 times [2018-01-31 08:41:42,711 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:41:42,711 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:41:42,712 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:41:42,713 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:41:42,713 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:41:42,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:41:42,733 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:41:42,854 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:41:42,854 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:41:42,854 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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 [2018-01-31 08:41:42,868 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:41:42,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:41:42,896 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:41:42,916 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-31 08:41:42,916 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:41:42,942 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:41:42,942 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-31 08:41:43,038 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:41:43,039 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:41:43,041 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-01-31 08:41:43,042 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:41:43,079 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-31 08:41:43,079 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2018-01-31 08:41:43,094 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:41:43,126 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:41:43,127 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2018-01-31 08:41:43,127 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-31 08:41:43,127 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-31 08:41:43,127 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2018-01-31 08:41:43,128 INFO L87 Difference]: Start difference. First operand 156 states and 190 transitions. Second operand 11 states. [2018-01-31 08:41:43,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:41:43,918 INFO L93 Difference]: Finished difference Result 170 states and 196 transitions. [2018-01-31 08:41:43,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-31 08:41:43,918 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 29 [2018-01-31 08:41:43,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:41:43,921 INFO L225 Difference]: With dead ends: 170 [2018-01-31 08:41:43,921 INFO L226 Difference]: Without dead ends: 168 [2018-01-31 08:41:43,922 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 25 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2018-01-31 08:41:43,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2018-01-31 08:41:43,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 150. [2018-01-31 08:41:43,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-01-31 08:41:43,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 181 transitions. [2018-01-31 08:41:43,939 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 181 transitions. Word has length 29 [2018-01-31 08:41:43,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:41:43,940 INFO L432 AbstractCegarLoop]: Abstraction has 150 states and 181 transitions. [2018-01-31 08:41:43,941 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-31 08:41:43,941 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 181 transitions. [2018-01-31 08:41:43,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-31 08:41:43,942 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:41:43,942 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:41:43,942 INFO L371 AbstractCegarLoop]: === Iteration 7 === [free_10Err6RequiresViolation, free_10Err4RequiresViolation, free_10Err7RequiresViolation, free_10Err5RequiresViolation, free_10Err0RequiresViolation, free_10Err3RequiresViolation, free_10Err1RequiresViolation, free_10Err2RequiresViolation, alloc_10Err5RequiresViolation, alloc_10Err2RequiresViolation, alloc_10Err3RequiresViolation, alloc_10Err4RequiresViolation, alloc_10Err1RequiresViolation, alloc_10Err0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr18RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr23RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr19RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr21RequiresViolation, entry_pointErr22RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr20RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation]=== [2018-01-31 08:41:43,942 INFO L82 PathProgramCache]: Analyzing trace with hash -561732381, now seen corresponding path program 1 times [2018-01-31 08:41:43,942 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:41:43,943 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:41:43,944 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:41:43,944 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:41:43,945 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:41:43,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:41:43,967 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:41:44,348 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:41:44,348 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:41:44,348 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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 [2018-01-31 08:41:44,353 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:41:44,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:41:44,380 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:41:44,397 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2018-01-31 08:41:44,398 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:41:44,402 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2018-01-31 08:41:44,403 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:41:44,434 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2018-01-31 08:41:44,435 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-31 08:41:44,450 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-01-31 08:41:44,450 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-31 08:41:44,479 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-31 08:41:44,480 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:46 [2018-01-31 08:41:44,756 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:41:44,762 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:41:44,763 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-31 08:41:44,763 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:41:44,769 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 12 treesize of output 15 [2018-01-31 08:41:44,770 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:41:44,775 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-31 08:41:44,775 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:18 [2018-01-31 08:41:44,797 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:41:44,818 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:41:44,819 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2018-01-31 08:41:44,819 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-01-31 08:41:44,819 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-01-31 08:41:44,819 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=291, Unknown=1, NotChecked=0, Total=342 [2018-01-31 08:41:44,820 INFO L87 Difference]: Start difference. First operand 150 states and 181 transitions. Second operand 19 states. [2018-01-31 08:41:46,251 WARN L146 SmtUtils]: Spent 291ms on a formula simplification. DAG size of input: 52 DAG size of output 36 [2018-01-31 08:41:48,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:41:48,258 INFO L93 Difference]: Finished difference Result 199 states and 219 transitions. [2018-01-31 08:41:48,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-31 08:41:48,259 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 29 [2018-01-31 08:41:48,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:41:48,261 INFO L225 Difference]: With dead ends: 199 [2018-01-31 08:41:48,261 INFO L226 Difference]: Without dead ends: 192 [2018-01-31 08:41:48,262 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=112, Invalid=584, Unknown=6, NotChecked=0, Total=702 [2018-01-31 08:41:48,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2018-01-31 08:41:48,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 106. [2018-01-31 08:41:48,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-01-31 08:41:48,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 113 transitions. [2018-01-31 08:41:48,276 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 113 transitions. Word has length 29 [2018-01-31 08:41:48,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:41:48,276 INFO L432 AbstractCegarLoop]: Abstraction has 106 states and 113 transitions. [2018-01-31 08:41:48,276 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-01-31 08:41:48,276 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 113 transitions. [2018-01-31 08:41:48,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-01-31 08:41:48,278 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:41:48,279 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:41:48,279 INFO L371 AbstractCegarLoop]: === Iteration 8 === [free_10Err6RequiresViolation, free_10Err4RequiresViolation, free_10Err7RequiresViolation, free_10Err5RequiresViolation, free_10Err0RequiresViolation, free_10Err3RequiresViolation, free_10Err1RequiresViolation, free_10Err2RequiresViolation, alloc_10Err5RequiresViolation, alloc_10Err2RequiresViolation, alloc_10Err3RequiresViolation, alloc_10Err4RequiresViolation, alloc_10Err1RequiresViolation, alloc_10Err0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr18RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr23RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr19RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr21RequiresViolation, entry_pointErr22RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr20RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation]=== [2018-01-31 08:41:48,279 INFO L82 PathProgramCache]: Analyzing trace with hash 1509056749, now seen corresponding path program 1 times [2018-01-31 08:41:48,279 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:41:48,279 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:41:48,280 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:41:48,280 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:41:48,280 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:41:48,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:41:48,293 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:41:48,802 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-31 08:41:48,802 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:41:48,802 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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 [2018-01-31 08:41:48,807 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:41:48,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:41:48,839 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:41:49,105 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-31 08:41:49,124 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:41:49,124 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9] total 13 [2018-01-31 08:41:49,125 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-01-31 08:41:49,125 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-01-31 08:41:49,125 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=143, Unknown=10, NotChecked=0, Total=182 [2018-01-31 08:41:49,126 INFO L87 Difference]: Start difference. First operand 106 states and 113 transitions. Second operand 14 states. [2018-01-31 08:41:49,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:41:49,692 INFO L93 Difference]: Finished difference Result 147 states and 160 transitions. [2018-01-31 08:41:49,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-31 08:41:49,693 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 36 [2018-01-31 08:41:49,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:41:49,694 INFO L225 Difference]: With dead ends: 147 [2018-01-31 08:41:49,694 INFO L226 Difference]: Without dead ends: 141 [2018-01-31 08:41:49,695 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 33 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=70, Invalid=340, Unknown=10, NotChecked=0, Total=420 [2018-01-31 08:41:49,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-01-31 08:41:49,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 110. [2018-01-31 08:41:49,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-01-31 08:41:49,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 117 transitions. [2018-01-31 08:41:49,707 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 117 transitions. Word has length 36 [2018-01-31 08:41:49,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:41:49,708 INFO L432 AbstractCegarLoop]: Abstraction has 110 states and 117 transitions. [2018-01-31 08:41:49,708 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-01-31 08:41:49,708 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 117 transitions. [2018-01-31 08:41:49,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-31 08:41:49,709 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:41:49,710 INFO L351 BasicCegarLoop]: 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] [2018-01-31 08:41:49,710 INFO L371 AbstractCegarLoop]: === Iteration 9 === [free_10Err6RequiresViolation, free_10Err4RequiresViolation, free_10Err7RequiresViolation, free_10Err5RequiresViolation, free_10Err0RequiresViolation, free_10Err3RequiresViolation, free_10Err1RequiresViolation, free_10Err2RequiresViolation, alloc_10Err5RequiresViolation, alloc_10Err2RequiresViolation, alloc_10Err3RequiresViolation, alloc_10Err4RequiresViolation, alloc_10Err1RequiresViolation, alloc_10Err0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr18RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr23RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr19RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr21RequiresViolation, entry_pointErr22RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr20RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation]=== [2018-01-31 08:41:49,710 INFO L82 PathProgramCache]: Analyzing trace with hash 605755735, now seen corresponding path program 1 times [2018-01-31 08:41:49,710 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:41:49,710 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:41:49,711 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:41:49,711 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:41:49,712 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:41:49,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:41:49,726 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:41:50,028 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-01-31 08:41:50,028 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:41:50,028 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-31 08:41:50,029 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-31 08:41:50,029 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-31 08:41:50,029 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-31 08:41:50,029 INFO L87 Difference]: Start difference. First operand 110 states and 117 transitions. Second operand 7 states. [2018-01-31 08:41:50,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:41:50,090 INFO L93 Difference]: Finished difference Result 120 states and 128 transitions. [2018-01-31 08:41:50,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-31 08:41:50,090 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 37 [2018-01-31 08:41:50,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:41:50,091 INFO L225 Difference]: With dead ends: 120 [2018-01-31 08:41:50,091 INFO L226 Difference]: Without dead ends: 114 [2018-01-31 08:41:50,092 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-01-31 08:41:50,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-01-31 08:41:50,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 104. [2018-01-31 08:41:50,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-01-31 08:41:50,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 110 transitions. [2018-01-31 08:41:50,102 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 110 transitions. Word has length 37 [2018-01-31 08:41:50,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:41:50,103 INFO L432 AbstractCegarLoop]: Abstraction has 104 states and 110 transitions. [2018-01-31 08:41:50,103 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-31 08:41:50,103 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 110 transitions. [2018-01-31 08:41:50,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-01-31 08:41:50,104 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:41:50,105 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:41:50,105 INFO L371 AbstractCegarLoop]: === Iteration 10 === [free_10Err6RequiresViolation, free_10Err4RequiresViolation, free_10Err7RequiresViolation, free_10Err5RequiresViolation, free_10Err0RequiresViolation, free_10Err3RequiresViolation, free_10Err1RequiresViolation, free_10Err2RequiresViolation, alloc_10Err5RequiresViolation, alloc_10Err2RequiresViolation, alloc_10Err3RequiresViolation, alloc_10Err4RequiresViolation, alloc_10Err1RequiresViolation, alloc_10Err0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr18RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr23RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr19RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr21RequiresViolation, entry_pointErr22RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr20RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation]=== [2018-01-31 08:41:50,105 INFO L82 PathProgramCache]: Analyzing trace with hash -536589536, now seen corresponding path program 1 times [2018-01-31 08:41:50,105 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:41:50,105 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:41:50,106 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:41:50,106 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:41:50,106 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:41:50,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:41:50,119 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:41:50,341 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-01-31 08:41:50,341 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:41:50,341 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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 [2018-01-31 08:41:50,346 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:41:50,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:41:50,366 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:41:50,382 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-31 08:41:50,385 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-31 08:41:50,385 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:41:50,387 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:41:50,391 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-31 08:41:50,393 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-31 08:41:50,393 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-31 08:41:50,395 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:41:50,398 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:41:50,398 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:23, output treesize:15 [2018-01-31 08:41:50,401 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-01-31 08:41:50,403 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-01-31 08:41:50,403 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:41:50,404 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:41:50,409 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-01-31 08:41:50,410 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-01-31 08:41:50,411 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-31 08:41:50,411 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:41:50,414 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:41:50,414 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:29, output treesize:7 [2018-01-31 08:41:50,420 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-31 08:41:50,439 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-31 08:41:50,439 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 6 [2018-01-31 08:41:50,439 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-31 08:41:50,439 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-31 08:41:50,439 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-31 08:41:50,440 INFO L87 Difference]: Start difference. First operand 104 states and 110 transitions. Second operand 6 states. [2018-01-31 08:41:50,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:41:50,593 INFO L93 Difference]: Finished difference Result 196 states and 205 transitions. [2018-01-31 08:41:50,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-31 08:41:50,593 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 42 [2018-01-31 08:41:50,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:41:50,594 INFO L225 Difference]: With dead ends: 196 [2018-01-31 08:41:50,594 INFO L226 Difference]: Without dead ends: 104 [2018-01-31 08:41:50,595 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 40 SyntacticMatches, 4 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-31 08:41:50,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-01-31 08:41:50,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2018-01-31 08:41:50,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-01-31 08:41:50,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 109 transitions. [2018-01-31 08:41:50,605 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 109 transitions. Word has length 42 [2018-01-31 08:41:50,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:41:50,605 INFO L432 AbstractCegarLoop]: Abstraction has 104 states and 109 transitions. [2018-01-31 08:41:50,605 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-31 08:41:50,605 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 109 transitions. [2018-01-31 08:41:50,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-01-31 08:41:50,606 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:41:50,606 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:41:50,606 INFO L371 AbstractCegarLoop]: === Iteration 11 === [free_10Err6RequiresViolation, free_10Err4RequiresViolation, free_10Err7RequiresViolation, free_10Err5RequiresViolation, free_10Err0RequiresViolation, free_10Err3RequiresViolation, free_10Err1RequiresViolation, free_10Err2RequiresViolation, alloc_10Err5RequiresViolation, alloc_10Err2RequiresViolation, alloc_10Err3RequiresViolation, alloc_10Err4RequiresViolation, alloc_10Err1RequiresViolation, alloc_10Err0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr18RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr23RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr19RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr21RequiresViolation, entry_pointErr22RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr20RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation]=== [2018-01-31 08:41:50,607 INFO L82 PathProgramCache]: Analyzing trace with hash -837317622, now seen corresponding path program 2 times [2018-01-31 08:41:50,607 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:41:50,607 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:41:50,608 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:41:50,608 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:41:50,608 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:41:50,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:41:50,617 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:41:50,883 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-01-31 08:41:50,884 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:41:50,884 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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 [2018-01-31 08:41:50,898 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-31 08:41:50,908 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:41:50,915 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:41:50,916 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 08:41:50,919 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:41:50,936 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-31 08:41:50,936 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:41:50,943 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:41:50,943 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-31 08:41:50,966 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-31 08:41:50,968 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-31 08:41:50,968 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:41:50,969 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:41:50,972 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:41:50,972 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:9 [2018-01-31 08:41:50,978 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-01-31 08:41:50,980 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-01-31 08:41:50,980 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:41:50,983 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:41:50,984 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:41:50,984 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:17, output treesize:5 [2018-01-31 08:41:50,987 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-01-31 08:41:51,006 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:41:51,006 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-01-31 08:41:51,007 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-31 08:41:51,007 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-31 08:41:51,007 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-01-31 08:41:51,007 INFO L87 Difference]: Start difference. First operand 104 states and 109 transitions. Second operand 8 states. [2018-01-31 08:41:51,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:41:51,253 INFO L93 Difference]: Finished difference Result 115 states and 120 transitions. [2018-01-31 08:41:51,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-31 08:41:51,254 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 43 [2018-01-31 08:41:51,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:41:51,255 INFO L225 Difference]: With dead ends: 115 [2018-01-31 08:41:51,255 INFO L226 Difference]: Without dead ends: 114 [2018-01-31 08:41:51,255 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-01-31 08:41:51,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-01-31 08:41:51,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 105. [2018-01-31 08:41:51,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-01-31 08:41:51,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 111 transitions. [2018-01-31 08:41:51,262 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 111 transitions. Word has length 43 [2018-01-31 08:41:51,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:41:51,263 INFO L432 AbstractCegarLoop]: Abstraction has 105 states and 111 transitions. [2018-01-31 08:41:51,263 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-31 08:41:51,263 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 111 transitions. [2018-01-31 08:41:51,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-01-31 08:41:51,264 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:41:51,264 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:41:51,264 INFO L371 AbstractCegarLoop]: === Iteration 12 === [free_10Err6RequiresViolation, free_10Err4RequiresViolation, free_10Err7RequiresViolation, free_10Err5RequiresViolation, free_10Err0RequiresViolation, free_10Err3RequiresViolation, free_10Err1RequiresViolation, free_10Err2RequiresViolation, alloc_10Err5RequiresViolation, alloc_10Err2RequiresViolation, alloc_10Err3RequiresViolation, alloc_10Err4RequiresViolation, alloc_10Err1RequiresViolation, alloc_10Err0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr18RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr23RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr19RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr21RequiresViolation, entry_pointErr22RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr20RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation]=== [2018-01-31 08:41:51,264 INFO L82 PathProgramCache]: Analyzing trace with hash -837317621, now seen corresponding path program 1 times [2018-01-31 08:41:51,264 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:41:51,265 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:41:51,266 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:41:51,266 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 08:41:51,266 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:41:51,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:41:51,280 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:41:51,789 WARN L146 SmtUtils]: Spent 419ms on a formula simplification. DAG size of input: 19 DAG size of output 17 [2018-01-31 08:41:51,850 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-01-31 08:41:51,850 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:41:51,850 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:41:51,857 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:41:51,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:41:51,879 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:41:51,934 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2018-01-31 08:41:51,934 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:41:51,946 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-01-31 08:41:51,947 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:41:51,958 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2018-01-31 08:41:51,959 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-31 08:41:51,961 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-01-31 08:41:51,961 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-31 08:41:51,972 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-31 08:41:51,972 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:44, output treesize:40 [2018-01-31 08:41:52,197 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:41:52,198 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:41:52,199 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-31 08:41:52,199 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:41:52,214 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 12 treesize of output 15 [2018-01-31 08:41:52,215 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:41:52,219 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:41:52,219 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-01-31 08:41:52,282 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-31 08:41:52,292 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-31 08:41:52,292 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:41:52,314 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:41:52,358 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-31 08:41:52,375 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 7 [2018-01-31 08:41:52,376 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-31 08:41:52,398 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:41:52,409 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:41:52,409 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:47, output treesize:40 [2018-01-31 08:41:52,447 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2018-01-31 08:41:52,449 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 19 treesize of output 10 [2018-01-31 08:41:52,449 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:41:52,453 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:41:52,462 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-01-31 08:41:52,475 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-01-31 08:41:52,476 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-31 08:41:52,477 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:41:52,484 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-31 08:41:52,485 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:54, output treesize:23 [2018-01-31 08:41:52,518 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:41:52,545 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:41:52,545 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 14] total 20 [2018-01-31 08:41:52,546 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-01-31 08:41:52,546 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-01-31 08:41:52,546 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=370, Unknown=0, NotChecked=0, Total=420 [2018-01-31 08:41:52,546 INFO L87 Difference]: Start difference. First operand 105 states and 111 transitions. Second operand 21 states. [2018-01-31 08:41:53,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:41:53,531 INFO L93 Difference]: Finished difference Result 130 states and 140 transitions. [2018-01-31 08:41:53,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-01-31 08:41:53,553 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 43 [2018-01-31 08:41:53,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:41:53,554 INFO L225 Difference]: With dead ends: 130 [2018-01-31 08:41:53,554 INFO L226 Difference]: Without dead ends: 129 [2018-01-31 08:41:53,554 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=106, Invalid=706, Unknown=0, NotChecked=0, Total=812 [2018-01-31 08:41:53,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-01-31 08:41:53,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 104. [2018-01-31 08:41:53,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-01-31 08:41:53,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 109 transitions. [2018-01-31 08:41:53,562 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 109 transitions. Word has length 43 [2018-01-31 08:41:53,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:41:53,562 INFO L432 AbstractCegarLoop]: Abstraction has 104 states and 109 transitions. [2018-01-31 08:41:53,562 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-01-31 08:41:53,563 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 109 transitions. [2018-01-31 08:41:53,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-01-31 08:41:53,563 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:41:53,563 INFO L351 BasicCegarLoop]: trace histogram [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] [2018-01-31 08:41:53,564 INFO L371 AbstractCegarLoop]: === Iteration 13 === [free_10Err6RequiresViolation, free_10Err4RequiresViolation, free_10Err7RequiresViolation, free_10Err5RequiresViolation, free_10Err0RequiresViolation, free_10Err3RequiresViolation, free_10Err1RequiresViolation, free_10Err2RequiresViolation, alloc_10Err5RequiresViolation, alloc_10Err2RequiresViolation, alloc_10Err3RequiresViolation, alloc_10Err4RequiresViolation, alloc_10Err1RequiresViolation, alloc_10Err0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr18RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr23RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr19RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr21RequiresViolation, entry_pointErr22RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr20RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation]=== [2018-01-31 08:41:53,564 INFO L82 PathProgramCache]: Analyzing trace with hash 439493680, now seen corresponding path program 1 times [2018-01-31 08:41:53,564 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:41:53,564 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:41:53,565 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:41:53,565 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:41:53,565 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:41:53,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:41:53,574 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:41:53,707 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 17 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-01-31 08:41:53,707 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:41:53,707 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:41:53,713 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:41:53,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:41:53,733 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:41:53,736 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-31 08:41:53,736 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:41:53,738 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:41:53,738 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-31 08:41:53,741 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-31 08:41:53,743 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-31 08:41:53,743 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:41:53,744 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:41:53,747 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:41:53,747 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:9 [2018-01-31 08:41:53,752 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-01-31 08:41:53,758 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-01-31 08:41:53,758 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:41:53,759 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:41:53,760 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:41:53,760 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:17, output treesize:5 [2018-01-31 08:41:53,786 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:41:53,787 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:41:53,787 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-01-31 08:41:53,787 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:41:53,792 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-31 08:41:53,792 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2018-01-31 08:41:53,806 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 16 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-01-31 08:41:53,825 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:41:53,825 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2018-01-31 08:41:53,825 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-31 08:41:53,826 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-31 08:41:53,826 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-01-31 08:41:53,826 INFO L87 Difference]: Start difference. First operand 104 states and 109 transitions. Second operand 12 states. [2018-01-31 08:41:54,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:41:54,185 INFO L93 Difference]: Finished difference Result 113 states and 118 transitions. [2018-01-31 08:41:54,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-31 08:41:54,186 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 44 [2018-01-31 08:41:54,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:41:54,187 INFO L225 Difference]: With dead ends: 113 [2018-01-31 08:41:54,187 INFO L226 Difference]: Without dead ends: 112 [2018-01-31 08:41:54,187 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2018-01-31 08:41:54,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-01-31 08:41:54,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 102. [2018-01-31 08:41:54,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-01-31 08:41:54,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 107 transitions. [2018-01-31 08:41:54,197 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 107 transitions. Word has length 44 [2018-01-31 08:41:54,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:41:54,197 INFO L432 AbstractCegarLoop]: Abstraction has 102 states and 107 transitions. [2018-01-31 08:41:54,197 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-31 08:41:54,198 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 107 transitions. [2018-01-31 08:41:54,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-01-31 08:41:54,198 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:41:54,198 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:41:54,199 INFO L371 AbstractCegarLoop]: === Iteration 14 === [free_10Err6RequiresViolation, free_10Err4RequiresViolation, free_10Err7RequiresViolation, free_10Err5RequiresViolation, free_10Err0RequiresViolation, free_10Err3RequiresViolation, free_10Err1RequiresViolation, free_10Err2RequiresViolation, alloc_10Err5RequiresViolation, alloc_10Err2RequiresViolation, alloc_10Err3RequiresViolation, alloc_10Err4RequiresViolation, alloc_10Err1RequiresViolation, alloc_10Err0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr18RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr23RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr19RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr21RequiresViolation, entry_pointErr22RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr20RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation]=== [2018-01-31 08:41:54,199 INFO L82 PathProgramCache]: Analyzing trace with hash -1609111538, now seen corresponding path program 1 times [2018-01-31 08:41:54,199 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:41:54,199 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:41:54,200 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:41:54,200 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:41:54,200 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:41:54,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:41:54,212 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:41:54,371 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-31 08:41:54,371 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:41:54,371 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:41:54,382 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:41:54,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:41:54,405 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:41:54,408 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-31 08:41:54,408 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:41:54,410 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:41:54,410 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-31 08:41:54,560 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:41:54,560 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:41:54,561 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-01-31 08:41:54,561 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:41:54,566 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:41:54,566 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:15 [2018-01-31 08:41:54,583 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-31 08:41:54,584 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 7 [2018-01-31 08:41:54,584 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:41:54,585 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:41:54,590 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:41:54,590 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:23 [2018-01-31 08:41:54,624 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-01-31 08:41:54,624 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:41:54,627 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-31 08:41:54,627 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:26, output treesize:12 [2018-01-31 08:41:58,644 WARN L143 SmtUtils]: Spent 2003ms on a formula simplification that was a NOOP. DAG size: 12 [2018-01-31 08:41:58,671 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 33 [2018-01-31 08:41:58,673 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-01-31 08:41:58,673 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:41:58,677 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:41:58,682 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:41:58,682 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:42, output treesize:23 [2018-01-31 08:41:58,687 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2018-01-31 08:41:58,688 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 19 treesize of output 10 [2018-01-31 08:41:58,689 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:41:58,691 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:41:58,699 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-31 08:41:58,699 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:15 [2018-01-31 08:41:58,778 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:41:58,797 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:41:58,797 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 20 [2018-01-31 08:41:58,798 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-01-31 08:41:58,798 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-01-31 08:41:58,798 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=360, Unknown=1, NotChecked=0, Total=420 [2018-01-31 08:41:58,798 INFO L87 Difference]: Start difference. First operand 102 states and 107 transitions. Second operand 21 states. [2018-01-31 08:42:07,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:42:07,493 INFO L93 Difference]: Finished difference Result 135 states and 140 transitions. [2018-01-31 08:42:07,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-31 08:42:07,493 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 47 [2018-01-31 08:42:07,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:42:07,494 INFO L225 Difference]: With dead ends: 135 [2018-01-31 08:42:07,494 INFO L226 Difference]: Without dead ends: 126 [2018-01-31 08:42:07,495 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 39 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=92, Invalid=557, Unknown=1, NotChecked=0, Total=650 [2018-01-31 08:42:07,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-01-31 08:42:07,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 112. [2018-01-31 08:42:07,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-01-31 08:42:07,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 116 transitions. [2018-01-31 08:42:07,514 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 116 transitions. Word has length 47 [2018-01-31 08:42:07,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:42:07,514 INFO L432 AbstractCegarLoop]: Abstraction has 112 states and 116 transitions. [2018-01-31 08:42:07,514 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-01-31 08:42:07,514 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 116 transitions. [2018-01-31 08:42:07,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-01-31 08:42:07,515 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:42:07,515 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:42:07,515 INFO L371 AbstractCegarLoop]: === Iteration 15 === [free_10Err6RequiresViolation, free_10Err4RequiresViolation, free_10Err7RequiresViolation, free_10Err5RequiresViolation, free_10Err0RequiresViolation, free_10Err3RequiresViolation, free_10Err1RequiresViolation, free_10Err2RequiresViolation, alloc_10Err5RequiresViolation, alloc_10Err2RequiresViolation, alloc_10Err3RequiresViolation, alloc_10Err4RequiresViolation, alloc_10Err1RequiresViolation, alloc_10Err0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr18RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr23RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr19RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr21RequiresViolation, entry_pointErr22RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr20RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation]=== [2018-01-31 08:42:07,516 INFO L82 PathProgramCache]: Analyzing trace with hash -1609111537, now seen corresponding path program 1 times [2018-01-31 08:42:07,516 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:42:07,516 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:42:07,517 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:42:07,517 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:42:07,517 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:42:07,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:42:07,539 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:42:07,748 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-31 08:42:07,748 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:42:07,748 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:42:07,753 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:42:07,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:42:07,775 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:42:07,780 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-31 08:42:07,780 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:42:07,781 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:42:07,782 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-31 08:42:07,789 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-01-31 08:42:07,789 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:42:07,804 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2018-01-31 08:42:07,805 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:42:07,819 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-01-31 08:42:07,819 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:48, output treesize:46 [2018-01-31 08:42:07,929 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:42:07,929 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:42:07,930 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2018-01-31 08:42:07,930 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:42:07,948 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:42:07,951 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:42:07,952 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2018-01-31 08:42:07,952 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:42:07,966 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-01-31 08:42:07,966 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:55, output treesize:43 [2018-01-31 08:42:08,022 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 38 [2018-01-31 08:42:08,024 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-31 08:42:08,024 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:42:08,031 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:42:08,083 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 34 [2018-01-31 08:42:08,085 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 7 [2018-01-31 08:42:08,086 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-31 08:42:08,092 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:42:08,113 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 36 [2018-01-31 08:42:08,115 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-31 08:42:08,115 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-31 08:42:08,127 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:42:08,146 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 32 [2018-01-31 08:42:08,148 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 7 [2018-01-31 08:42:08,148 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-31 08:42:08,155 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:42:08,171 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-01-31 08:42:08,171 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 8 variables, input treesize:81, output treesize:67 [2018-01-31 08:42:08,576 WARN L143 SmtUtils]: Spent 213ms on a formula simplification that was a NOOP. DAG size: 34 [2018-01-31 08:42:08,581 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 35 treesize of output 24 [2018-01-31 08:42:08,581 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:42:08,597 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 37 treesize of output 24 [2018-01-31 08:42:08,597 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:42:08,612 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-01-31 08:42:08,612 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:73, output treesize:39 [2018-01-31 08:42:08,988 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-01-31 08:42:08,989 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:42:09,006 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2018-01-31 08:42:09,008 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-01-31 08:42:09,009 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-31 08:42:09,013 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:42:09,031 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 57 [2018-01-31 08:42:09,033 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-01-31 08:42:09,033 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-31 08:42:09,040 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:42:09,062 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 4 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-31 08:42:09,063 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 9 variables, input treesize:171, output treesize:41 [2018-01-31 08:42:09,123 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 28 [2018-01-31 08:42:09,130 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 28 treesize of output 17 [2018-01-31 08:42:09,131 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:42:09,135 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:42:09,144 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-01-31 08:42:09,156 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-01-31 08:42:09,157 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-31 08:42:09,158 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:42:09,164 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-31 08:42:09,164 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:55, output treesize:21 [2018-01-31 08:42:09,203 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:42:09,222 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:42:09,222 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 21 [2018-01-31 08:42:09,222 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-01-31 08:42:09,223 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-01-31 08:42:09,223 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=409, Unknown=0, NotChecked=0, Total=462 [2018-01-31 08:42:09,223 INFO L87 Difference]: Start difference. First operand 112 states and 116 transitions. Second operand 22 states. [2018-01-31 08:42:11,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:42:11,241 INFO L93 Difference]: Finished difference Result 151 states and 160 transitions. [2018-01-31 08:42:11,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-01-31 08:42:11,242 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 47 [2018-01-31 08:42:11,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:42:11,243 INFO L225 Difference]: With dead ends: 151 [2018-01-31 08:42:11,243 INFO L226 Difference]: Without dead ends: 150 [2018-01-31 08:42:11,243 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 38 SyntacticMatches, 3 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=160, Invalid=1100, Unknown=0, NotChecked=0, Total=1260 [2018-01-31 08:42:11,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-01-31 08:42:11,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 111. [2018-01-31 08:42:11,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-01-31 08:42:11,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 115 transitions. [2018-01-31 08:42:11,259 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 115 transitions. Word has length 47 [2018-01-31 08:42:11,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:42:11,259 INFO L432 AbstractCegarLoop]: Abstraction has 111 states and 115 transitions. [2018-01-31 08:42:11,259 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-01-31 08:42:11,259 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 115 transitions. [2018-01-31 08:42:11,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-01-31 08:42:11,260 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:42:11,260 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:42:11,260 INFO L371 AbstractCegarLoop]: === Iteration 16 === [free_10Err6RequiresViolation, free_10Err4RequiresViolation, free_10Err7RequiresViolation, free_10Err5RequiresViolation, free_10Err0RequiresViolation, free_10Err3RequiresViolation, free_10Err1RequiresViolation, free_10Err2RequiresViolation, alloc_10Err5RequiresViolation, alloc_10Err2RequiresViolation, alloc_10Err3RequiresViolation, alloc_10Err4RequiresViolation, alloc_10Err1RequiresViolation, alloc_10Err0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr18RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr23RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr19RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr21RequiresViolation, entry_pointErr22RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr20RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation]=== [2018-01-31 08:42:11,261 INFO L82 PathProgramCache]: Analyzing trace with hash -1236229127, now seen corresponding path program 1 times [2018-01-31 08:42:11,261 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:42:11,261 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:42:11,262 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:42:11,262 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:42:11,262 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:42:11,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:42:11,274 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:42:11,357 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-01-31 08:42:11,358 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:42:11,358 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-31 08:42:11,358 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-31 08:42:11,358 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-31 08:42:11,359 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-31 08:42:11,359 INFO L87 Difference]: Start difference. First operand 111 states and 115 transitions. Second operand 6 states. [2018-01-31 08:42:11,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:42:11,471 INFO L93 Difference]: Finished difference Result 124 states and 129 transitions. [2018-01-31 08:42:11,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-31 08:42:11,472 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2018-01-31 08:42:11,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:42:11,472 INFO L225 Difference]: With dead ends: 124 [2018-01-31 08:42:11,473 INFO L226 Difference]: Without dead ends: 123 [2018-01-31 08:42:11,473 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-01-31 08:42:11,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-01-31 08:42:11,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 110. [2018-01-31 08:42:11,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-01-31 08:42:11,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 114 transitions. [2018-01-31 08:42:11,482 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 114 transitions. Word has length 53 [2018-01-31 08:42:11,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:42:11,482 INFO L432 AbstractCegarLoop]: Abstraction has 110 states and 114 transitions. [2018-01-31 08:42:11,482 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-31 08:42:11,482 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 114 transitions. [2018-01-31 08:42:11,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-01-31 08:42:11,483 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:42:11,483 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:42:11,483 INFO L371 AbstractCegarLoop]: === Iteration 17 === [free_10Err6RequiresViolation, free_10Err4RequiresViolation, free_10Err7RequiresViolation, free_10Err5RequiresViolation, free_10Err0RequiresViolation, free_10Err3RequiresViolation, free_10Err1RequiresViolation, free_10Err2RequiresViolation, alloc_10Err5RequiresViolation, alloc_10Err2RequiresViolation, alloc_10Err3RequiresViolation, alloc_10Err4RequiresViolation, alloc_10Err1RequiresViolation, alloc_10Err0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr18RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr23RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr19RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr21RequiresViolation, entry_pointErr22RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr20RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation]=== [2018-01-31 08:42:11,484 INFO L82 PathProgramCache]: Analyzing trace with hash -1236229126, now seen corresponding path program 1 times [2018-01-31 08:42:11,484 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:42:11,484 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:42:11,484 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:42:11,484 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:42:11,485 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:42:11,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:42:11,495 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:42:11,613 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-01-31 08:42:11,613 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:42:11,613 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:42:11,618 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:42:11,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:42:11,640 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:42:11,686 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-01-31 08:42:11,705 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-31 08:42:11,705 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 12 [2018-01-31 08:42:11,706 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-31 08:42:11,706 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-31 08:42:11,706 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-01-31 08:42:11,706 INFO L87 Difference]: Start difference. First operand 110 states and 114 transitions. Second operand 13 states. [2018-01-31 08:42:11,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:42:11,964 INFO L93 Difference]: Finished difference Result 125 states and 130 transitions. [2018-01-31 08:42:11,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-31 08:42:11,964 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 53 [2018-01-31 08:42:11,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:42:11,965 INFO L225 Difference]: With dead ends: 125 [2018-01-31 08:42:11,965 INFO L226 Difference]: Without dead ends: 124 [2018-01-31 08:42:11,966 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2018-01-31 08:42:11,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-01-31 08:42:11,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 109. [2018-01-31 08:42:11,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-01-31 08:42:11,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 113 transitions. [2018-01-31 08:42:11,977 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 113 transitions. Word has length 53 [2018-01-31 08:42:11,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:42:11,978 INFO L432 AbstractCegarLoop]: Abstraction has 109 states and 113 transitions. [2018-01-31 08:42:11,978 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-31 08:42:11,978 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 113 transitions. [2018-01-31 08:42:11,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-01-31 08:42:11,979 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:42:11,979 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:42:11,979 INFO L371 AbstractCegarLoop]: === Iteration 18 === [free_10Err6RequiresViolation, free_10Err4RequiresViolation, free_10Err7RequiresViolation, free_10Err5RequiresViolation, free_10Err0RequiresViolation, free_10Err3RequiresViolation, free_10Err1RequiresViolation, free_10Err2RequiresViolation, alloc_10Err5RequiresViolation, alloc_10Err2RequiresViolation, alloc_10Err3RequiresViolation, alloc_10Err4RequiresViolation, alloc_10Err1RequiresViolation, alloc_10Err0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr18RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr23RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr19RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr21RequiresViolation, entry_pointErr22RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr20RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation]=== [2018-01-31 08:42:11,979 INFO L82 PathProgramCache]: Analyzing trace with hash -43696140, now seen corresponding path program 1 times [2018-01-31 08:42:11,979 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:42:11,979 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:42:11,980 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:42:11,980 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:42:11,980 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:42:11,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:42:11,992 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:42:12,337 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-31 08:42:12,337 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:42:12,372 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:42:12,377 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:42:12,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:42:12,399 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:42:12,401 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-31 08:42:12,402 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:42:12,403 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:42:12,403 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-31 08:42:12,421 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:42:12,422 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:42:12,422 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-31 08:42:12,422 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:42:12,425 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:42:12,425 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-01-31 08:42:12,437 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-31 08:42:12,439 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-31 08:42:12,439 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:42:12,440 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:42:12,446 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-31 08:42:12,447 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 7 [2018-01-31 08:42:12,447 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-31 08:42:12,448 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:42:12,452 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:42:12,452 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:27, output treesize:16 [2018-01-31 08:42:12,471 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2018-01-31 08:42:12,485 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 12 treesize of output 4 [2018-01-31 08:42:12,486 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:42:12,495 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:42:12,498 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:42:12,498 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:12 [2018-01-31 08:42:12,614 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-01-31 08:42:12,616 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-31 08:42:12,617 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:42:12,620 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:42:12,651 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:42:12,651 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:23, output treesize:7 [2018-01-31 08:42:12,654 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-01-31 08:42:12,655 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-01-31 08:42:12,656 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:42:12,656 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:42:12,657 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:42:12,657 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2018-01-31 08:42:12,660 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:42:12,679 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:42:12,679 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 14 [2018-01-31 08:42:12,679 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-31 08:42:12,679 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-31 08:42:12,680 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2018-01-31 08:42:12,680 INFO L87 Difference]: Start difference. First operand 109 states and 113 transitions. Second operand 15 states. [2018-01-31 08:42:13,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:42:13,332 INFO L93 Difference]: Finished difference Result 137 states and 140 transitions. [2018-01-31 08:42:13,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-01-31 08:42:13,332 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 52 [2018-01-31 08:42:13,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:42:13,333 INFO L225 Difference]: With dead ends: 137 [2018-01-31 08:42:13,333 INFO L226 Difference]: Without dead ends: 136 [2018-01-31 08:42:13,333 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 47 SyntacticMatches, 7 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=111, Invalid=591, Unknown=0, NotChecked=0, Total=702 [2018-01-31 08:42:13,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-01-31 08:42:13,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 113. [2018-01-31 08:42:13,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-01-31 08:42:13,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 116 transitions. [2018-01-31 08:42:13,347 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 116 transitions. Word has length 52 [2018-01-31 08:42:13,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:42:13,347 INFO L432 AbstractCegarLoop]: Abstraction has 113 states and 116 transitions. [2018-01-31 08:42:13,347 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-31 08:42:13,348 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 116 transitions. [2018-01-31 08:42:13,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-01-31 08:42:13,348 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:42:13,348 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:42:13,348 INFO L371 AbstractCegarLoop]: === Iteration 19 === [free_10Err6RequiresViolation, free_10Err4RequiresViolation, free_10Err7RequiresViolation, free_10Err5RequiresViolation, free_10Err0RequiresViolation, free_10Err3RequiresViolation, free_10Err1RequiresViolation, free_10Err2RequiresViolation, alloc_10Err5RequiresViolation, alloc_10Err2RequiresViolation, alloc_10Err3RequiresViolation, alloc_10Err4RequiresViolation, alloc_10Err1RequiresViolation, alloc_10Err0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr18RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr23RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr19RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr21RequiresViolation, entry_pointErr22RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr20RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation]=== [2018-01-31 08:42:13,349 INFO L82 PathProgramCache]: Analyzing trace with hash -43696139, now seen corresponding path program 1 times [2018-01-31 08:42:13,349 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:42:13,349 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:42:13,353 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:42:13,353 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:42:13,353 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:42:13,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:42:13,362 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:42:13,580 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-01-31 08:42:13,581 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:42:13,581 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-31 08:42:13,581 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-31 08:42:13,581 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-31 08:42:13,581 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-31 08:42:13,581 INFO L87 Difference]: Start difference. First operand 113 states and 116 transitions. Second operand 5 states. [2018-01-31 08:42:13,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:42:13,666 INFO L93 Difference]: Finished difference Result 114 states and 116 transitions. [2018-01-31 08:42:13,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-31 08:42:13,666 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2018-01-31 08:42:13,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:42:13,667 INFO L225 Difference]: With dead ends: 114 [2018-01-31 08:42:13,667 INFO L226 Difference]: Without dead ends: 113 [2018-01-31 08:42:13,667 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-01-31 08:42:13,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-01-31 08:42:13,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2018-01-31 08:42:13,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-01-31 08:42:13,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 115 transitions. [2018-01-31 08:42:13,675 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 115 transitions. Word has length 52 [2018-01-31 08:42:13,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:42:13,675 INFO L432 AbstractCegarLoop]: Abstraction has 113 states and 115 transitions. [2018-01-31 08:42:13,675 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-31 08:42:13,675 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 115 transitions. [2018-01-31 08:42:13,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-01-31 08:42:13,676 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:42:13,676 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:42:13,676 INFO L371 AbstractCegarLoop]: === Iteration 20 === [free_10Err6RequiresViolation, free_10Err4RequiresViolation, free_10Err7RequiresViolation, free_10Err5RequiresViolation, free_10Err0RequiresViolation, free_10Err3RequiresViolation, free_10Err1RequiresViolation, free_10Err2RequiresViolation, alloc_10Err5RequiresViolation, alloc_10Err2RequiresViolation, alloc_10Err3RequiresViolation, alloc_10Err4RequiresViolation, alloc_10Err1RequiresViolation, alloc_10Err0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr18RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr23RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr19RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr21RequiresViolation, entry_pointErr22RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr20RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation]=== [2018-01-31 08:42:13,677 INFO L82 PathProgramCache]: Analyzing trace with hash 331602701, now seen corresponding path program 1 times [2018-01-31 08:42:13,677 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:42:13,677 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:42:13,678 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:42:13,678 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:42:13,678 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:42:13,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:42:13,689 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:42:13,758 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-01-31 08:42:13,758 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:42:13,758 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-31 08:42:13,758 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-31 08:42:13,758 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-31 08:42:13,759 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-31 08:42:13,759 INFO L87 Difference]: Start difference. First operand 113 states and 115 transitions. Second operand 7 states. [2018-01-31 08:42:13,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:42:13,907 INFO L93 Difference]: Finished difference Result 113 states and 115 transitions. [2018-01-31 08:42:13,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-31 08:42:13,907 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2018-01-31 08:42:13,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:42:13,908 INFO L225 Difference]: With dead ends: 113 [2018-01-31 08:42:13,908 INFO L226 Difference]: Without dead ends: 112 [2018-01-31 08:42:13,908 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-01-31 08:42:13,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-01-31 08:42:13,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2018-01-31 08:42:13,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-01-31 08:42:13,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 114 transitions. [2018-01-31 08:42:13,919 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 114 transitions. Word has length 54 [2018-01-31 08:42:13,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:42:13,919 INFO L432 AbstractCegarLoop]: Abstraction has 112 states and 114 transitions. [2018-01-31 08:42:13,919 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-31 08:42:13,920 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 114 transitions. [2018-01-31 08:42:13,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-01-31 08:42:13,920 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:42:13,920 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:42:13,921 INFO L371 AbstractCegarLoop]: === Iteration 21 === [free_10Err6RequiresViolation, free_10Err4RequiresViolation, free_10Err7RequiresViolation, free_10Err5RequiresViolation, free_10Err0RequiresViolation, free_10Err3RequiresViolation, free_10Err1RequiresViolation, free_10Err2RequiresViolation, alloc_10Err5RequiresViolation, alloc_10Err2RequiresViolation, alloc_10Err3RequiresViolation, alloc_10Err4RequiresViolation, alloc_10Err1RequiresViolation, alloc_10Err0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr18RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr23RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr19RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr21RequiresViolation, entry_pointErr22RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr20RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation]=== [2018-01-31 08:42:13,921 INFO L82 PathProgramCache]: Analyzing trace with hash 331602702, now seen corresponding path program 1 times [2018-01-31 08:42:13,921 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:42:13,921 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:42:13,922 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:42:13,922 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:42:13,922 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:42:13,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:42:13,935 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:42:14,275 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-01-31 08:42:14,276 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:42:14,276 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-31 08:42:14,276 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-31 08:42:14,276 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-31 08:42:14,276 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-31 08:42:14,276 INFO L87 Difference]: Start difference. First operand 112 states and 114 transitions. Second operand 7 states. [2018-01-31 08:42:14,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:42:14,703 INFO L93 Difference]: Finished difference Result 117 states and 119 transitions. [2018-01-31 08:42:14,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-31 08:42:14,703 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2018-01-31 08:42:14,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:42:14,704 INFO L225 Difference]: With dead ends: 117 [2018-01-31 08:42:14,704 INFO L226 Difference]: Without dead ends: 116 [2018-01-31 08:42:14,704 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-01-31 08:42:14,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-01-31 08:42:14,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 111. [2018-01-31 08:42:14,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-01-31 08:42:14,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 113 transitions. [2018-01-31 08:42:14,712 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 113 transitions. Word has length 54 [2018-01-31 08:42:14,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:42:14,713 INFO L432 AbstractCegarLoop]: Abstraction has 111 states and 113 transitions. [2018-01-31 08:42:14,713 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-31 08:42:14,713 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 113 transitions. [2018-01-31 08:42:14,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-01-31 08:42:14,714 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:42:14,714 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:42:14,714 INFO L371 AbstractCegarLoop]: === Iteration 22 === [free_10Err6RequiresViolation, free_10Err4RequiresViolation, free_10Err7RequiresViolation, free_10Err5RequiresViolation, free_10Err0RequiresViolation, free_10Err3RequiresViolation, free_10Err1RequiresViolation, free_10Err2RequiresViolation, alloc_10Err5RequiresViolation, alloc_10Err2RequiresViolation, alloc_10Err3RequiresViolation, alloc_10Err4RequiresViolation, alloc_10Err1RequiresViolation, alloc_10Err0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr18RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr23RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr19RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr21RequiresViolation, entry_pointErr22RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr20RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation]=== [2018-01-31 08:42:14,714 INFO L82 PathProgramCache]: Analyzing trace with hash 957685271, now seen corresponding path program 1 times [2018-01-31 08:42:14,714 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:42:14,714 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:42:14,715 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:42:14,715 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:42:14,715 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:42:14,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:42:14,732 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:42:15,485 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-31 08:42:15,485 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:42:15,485 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:42:15,490 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:42:15,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:42:15,514 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:42:15,691 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 23 [2018-01-31 08:42:15,693 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2018-01-31 08:42:15,693 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:42:15,706 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-01-31 08:42:15,706 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-01-31 08:42:15,713 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 4 [2018-01-31 08:42:15,713 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-31 08:42:15,716 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-31 08:42:15,724 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2018-01-31 08:42:15,725 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 12 treesize of output 4 [2018-01-31 08:42:15,725 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-31 08:42:15,731 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:42:15,732 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 10 [2018-01-31 08:42:15,733 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-01-31 08:42:15,733 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-31 08:42:15,734 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:42:15,739 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-31 08:42:15,739 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 2 variables, input treesize:39, output treesize:29 [2018-01-31 08:42:15,769 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:42:15,769 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 29 [2018-01-31 08:42:15,769 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:42:15,777 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:42:15,777 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:54, output treesize:10 [2018-01-31 08:42:15,797 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-01-31 08:42:15,816 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:42:15,816 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 23 [2018-01-31 08:42:15,817 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-01-31 08:42:15,817 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-01-31 08:42:15,817 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=485, Unknown=0, NotChecked=0, Total=552 [2018-01-31 08:42:15,817 INFO L87 Difference]: Start difference. First operand 111 states and 113 transitions. Second operand 24 states. [2018-01-31 08:42:16,398 WARN L143 SmtUtils]: Spent 110ms on a formula simplification that was a NOOP. DAG size: 12 [2018-01-31 08:42:17,206 WARN L146 SmtUtils]: Spent 386ms on a formula simplification. DAG size of input: 24 DAG size of output 23 [2018-01-31 08:42:17,746 WARN L146 SmtUtils]: Spent 275ms on a formula simplification. DAG size of input: 19 DAG size of output 18 [2018-01-31 08:42:18,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:42:18,357 INFO L93 Difference]: Finished difference Result 131 states and 135 transitions. [2018-01-31 08:42:18,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-01-31 08:42:18,358 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 54 [2018-01-31 08:42:18,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:42:18,359 INFO L225 Difference]: With dead ends: 131 [2018-01-31 08:42:18,359 INFO L226 Difference]: Without dead ends: 130 [2018-01-31 08:42:18,360 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=252, Invalid=1554, Unknown=0, NotChecked=0, Total=1806 [2018-01-31 08:42:18,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-01-31 08:42:18,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 113. [2018-01-31 08:42:18,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-01-31 08:42:18,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 115 transitions. [2018-01-31 08:42:18,371 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 115 transitions. Word has length 54 [2018-01-31 08:42:18,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:42:18,371 INFO L432 AbstractCegarLoop]: Abstraction has 113 states and 115 transitions. [2018-01-31 08:42:18,371 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-01-31 08:42:18,372 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 115 transitions. [2018-01-31 08:42:18,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-01-31 08:42:18,372 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:42:18,372 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:42:18,372 INFO L371 AbstractCegarLoop]: === Iteration 23 === [free_10Err6RequiresViolation, free_10Err4RequiresViolation, free_10Err7RequiresViolation, free_10Err5RequiresViolation, free_10Err0RequiresViolation, free_10Err3RequiresViolation, free_10Err1RequiresViolation, free_10Err2RequiresViolation, alloc_10Err5RequiresViolation, alloc_10Err2RequiresViolation, alloc_10Err3RequiresViolation, alloc_10Err4RequiresViolation, alloc_10Err1RequiresViolation, alloc_10Err0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr18RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr23RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr19RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr21RequiresViolation, entry_pointErr22RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr20RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation]=== [2018-01-31 08:42:18,372 INFO L82 PathProgramCache]: Analyzing trace with hash -1065775400, now seen corresponding path program 1 times [2018-01-31 08:42:18,373 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:42:18,373 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:42:18,374 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:42:18,374 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:42:18,374 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:42:18,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:42:18,392 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:42:19,077 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-01-31 08:42:19,077 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:42:19,077 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:42:19,084 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:42:19,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:42:19,109 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:42:19,110 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-31 08:42:19,110 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:42:19,111 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:42:19,111 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-31 08:42:19,613 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-31 08:42:19,627 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-31 08:42:19,628 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:53, output treesize:56 [2018-01-31 08:42:19,629 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: line 113398 column 44: unknown constant v_DerPreprocessor_1 at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1420) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:630) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:419) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:206) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:222) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.assertTerm(Scriptor.java:146) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.arrays.DiffWrapperScript$DiffTransformer.checkOrAddAxiom(DiffWrapperScript.java:95) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.arrays.DiffWrapperScript$DiffTransformer.convertApplicationTerm(DiffWrapperScript.java:105) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$BuildApplicationTerm.walk(TermTransformer.java:297) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:122) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:113) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.transform(TermTransformer.java:239) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.arrays.DiffWrapperScript.assertTerm(DiffWrapperScript.java:198) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.assertTerm(ManagedScript.java:133) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:1002) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:946) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:355) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:573) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:445) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:283) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:237) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:185) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackTraceAbstractionRefinementStrategy.getTraceCheck(MultiTrackTraceAbstractionRefinementStrategy.java:218) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:231) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:205) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:397) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:381) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:316) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:292) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:147) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:115) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:119) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:324) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.runToolchainDefault(DefaultToolchainJob.java:221) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.BasicToolchainJob.run(BasicToolchainJob.java:134) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-01-31 08:42:19,633 INFO L168 Benchmark]: Toolchain (without parser) took 43233.88 ms. Allocated memory was 308.8 MB in the beginning and 639.6 MB in the end (delta: 330.8 MB). Free memory was 267.5 MB in the beginning and 468.1 MB in the end (delta: -200.6 MB). Peak memory consumption was 130.2 MB. Max. memory is 5.3 GB. [2018-01-31 08:42:19,634 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 308.8 MB. Free memory is still 274.5 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-31 08:42:19,634 INFO L168 Benchmark]: CACSL2BoogieTranslator took 320.65 ms. Allocated memory is still 308.8 MB. Free memory was 267.5 MB in the beginning and 254.6 MB in the end (delta: 13.0 MB). Peak memory consumption was 13.0 MB. Max. memory is 5.3 GB. [2018-01-31 08:42:19,635 INFO L168 Benchmark]: Boogie Preprocessor took 40.39 ms. Allocated memory is still 308.8 MB. Free memory was 254.6 MB in the beginning and 252.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-31 08:42:19,635 INFO L168 Benchmark]: RCFGBuilder took 806.90 ms. Allocated memory is still 308.8 MB. Free memory was 252.6 MB in the beginning and 224.4 MB in the end (delta: 28.2 MB). Peak memory consumption was 28.2 MB. Max. memory is 5.3 GB. [2018-01-31 08:42:19,635 INFO L168 Benchmark]: TraceAbstraction took 42054.69 ms. Allocated memory was 308.8 MB in the beginning and 639.6 MB in the end (delta: 330.8 MB). Free memory was 223.4 MB in the beginning and 468.1 MB in the end (delta: -244.8 MB). Peak memory consumption was 86.1 MB. Max. memory is 5.3 GB. [2018-01-31 08:42:19,639 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 308.8 MB. Free memory is still 274.5 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 320.65 ms. Allocated memory is still 308.8 MB. Free memory was 267.5 MB in the beginning and 254.6 MB in the end (delta: 13.0 MB). Peak memory consumption was 13.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 40.39 ms. Allocated memory is still 308.8 MB. Free memory was 254.6 MB in the beginning and 252.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 806.90 ms. Allocated memory is still 308.8 MB. Free memory was 252.6 MB in the beginning and 224.4 MB in the end (delta: 28.2 MB). Peak memory consumption was 28.2 MB. Max. memory is 5.3 GB. * TraceAbstraction took 42054.69 ms. Allocated memory was 308.8 MB in the beginning and 639.6 MB in the end (delta: 330.8 MB). Free memory was 223.4 MB in the beginning and 468.1 MB in the end (delta: -244.8 MB). Peak memory consumption was 86.1 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: line 113398 column 44: unknown constant v_DerPreprocessor_1 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: line 113398 column 44: unknown constant v_DerPreprocessor_1: de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1420) RESULT: Ultimate could not prove your program: Toolchain returned no result. Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test10_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-31_08-42-19-648.csv Received shutdown request...