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_Taipan+AI_EQ.epf -i ../../../trunk/examples/svcomp/list-properties/alternating_list_true-unreach-call_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 16:06:35,005 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 16:06:35,006 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 16:06:35,018 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 16:06:35,019 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 16:06:35,020 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 16:06:35,021 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 16:06:35,022 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 16:06:35,025 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 16:06:35,025 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 16:06:35,026 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 16:06:35,026 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 16:06:35,026 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 16:06:35,027 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 16:06:35,028 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 16:06:35,031 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 16:06:35,033 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 16:06:35,035 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 16:06:35,036 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 16:06:35,037 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 16:06:35,039 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 16:06:35,040 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 16:06:35,040 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 16:06:35,041 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 16:06:35,041 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 16:06:35,043 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 16:06:35,043 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 16:06:35,044 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 16:06:35,044 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 16:06:35,044 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 16:06:35,044 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 16:06:35,045 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf [2018-01-24 16:06:35,054 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 16:06:35,055 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 16:06:35,055 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 16:06:35,056 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 16:06:35,056 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 16:06:35,056 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 16:06:35,056 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 16:06:35,057 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 16:06:35,057 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 16:06:35,057 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 16:06:35,058 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 16:06:35,058 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 16:06:35,058 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 16:06:35,058 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 16:06:35,058 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 16:06:35,059 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 16:06:35,059 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 16:06:35,059 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 16:06:35,059 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 16:06:35,059 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 16:06:35,060 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 16:06:35,060 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 16:06:35,060 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 16:06:35,060 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 16:06:35,060 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 16:06:35,061 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 16:06:35,061 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 16:06:35,061 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 16:06:35,061 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-24 16:06:35,061 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 16:06:35,062 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 16:06:35,062 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 16:06:35,062 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-24 16:06:35,063 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 16:06:35,063 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 16:06:35,099 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 16:06:35,112 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 16:06:35,116 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 16:06:35,117 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 16:06:35,118 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 16:06:35,118 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-properties/alternating_list_true-unreach-call_true-valid-memsafety.i [2018-01-24 16:06:35,275 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 16:06:35,281 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 16:06:35,281 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 16:06:35,281 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 16:06:35,286 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 16:06:35,287 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 04:06:35" (1/1) ... [2018-01-24 16:06:35,289 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41641836 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:06:35, skipping insertion in model container [2018-01-24 16:06:35,289 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 04:06:35" (1/1) ... [2018-01-24 16:06:35,307 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 16:06:35,348 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 16:06:35,463 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 16:06:35,479 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 16:06:35,486 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:06:35 WrapperNode [2018-01-24 16:06:35,487 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 16:06:35,487 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 16:06:35,487 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 16:06:35,487 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 16:06:35,505 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:06:35" (1/1) ... [2018-01-24 16:06:35,505 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:06:35" (1/1) ... [2018-01-24 16:06:35,518 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:06:35" (1/1) ... [2018-01-24 16:06:35,518 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:06:35" (1/1) ... [2018-01-24 16:06:35,524 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:06:35" (1/1) ... [2018-01-24 16:06:35,528 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:06:35" (1/1) ... [2018-01-24 16:06:35,530 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:06:35" (1/1) ... [2018-01-24 16:06:35,532 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 16:06:35,533 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 16:06:35,533 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 16:06:35,533 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 16:06:35,534 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:06:35" (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-24 16:06:35,591 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 16:06:35,591 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 16:06:35,591 INFO L136 BoogieDeclarations]: Found implementation of procedure exit [2018-01-24 16:06:35,591 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 16:06:35,591 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-24 16:06:35,591 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-24 16:06:35,592 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-24 16:06:35,592 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-24 16:06:35,592 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 16:06:35,592 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 16:06:35,592 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 16:06:35,592 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-01-24 16:06:35,592 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 16:06:35,592 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-24 16:06:35,592 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-24 16:06:35,592 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-01-24 16:06:35,593 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 16:06:35,593 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 16:06:35,593 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 16:06:35,899 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 16:06:35,900 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 04:06:35 BoogieIcfgContainer [2018-01-24 16:06:35,900 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 16:06:35,902 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 16:06:35,902 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 16:06:35,904 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 16:06:35,904 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 04:06:35" (1/3) ... [2018-01-24 16:06:35,906 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f91b727 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 04:06:35, skipping insertion in model container [2018-01-24 16:06:35,906 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:06:35" (2/3) ... [2018-01-24 16:06:35,906 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f91b727 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 04:06:35, skipping insertion in model container [2018-01-24 16:06:35,907 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 04:06:35" (3/3) ... [2018-01-24 16:06:35,909 INFO L105 eAbstractionObserver]: Analyzing ICFG alternating_list_true-unreach-call_true-valid-memsafety.i [2018-01-24 16:06:35,918 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 16:06:35,927 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 27 error locations. [2018-01-24 16:06:35,975 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 16:06:35,975 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 16:06:35,975 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 16:06:35,976 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 16:06:35,976 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 16:06:35,976 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 16:06:35,976 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 16:06:35,976 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 16:06:35,977 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 16:06:35,999 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states. [2018-01-24 16:06:36,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-01-24 16:06:36,024 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:06:36,025 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:06:36,025 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr26EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-01-24 16:06:36,029 INFO L82 PathProgramCache]: Analyzing trace with hash 1444354772, now seen corresponding path program 1 times [2018-01-24 16:06:36,031 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:06:36,071 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:06:36,071 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:06:36,071 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:06:36,071 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:06:36,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:06:36,120 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:06:36,155 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-24 16:06:36,157 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:06:36,157 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-24 16:06:36,158 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:06:36,161 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-24 16:06:36,177 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-24 16:06:36,178 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-24 16:06:36,180 INFO L87 Difference]: Start difference. First operand 81 states. Second operand 2 states. [2018-01-24 16:06:36,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:06:36,288 INFO L93 Difference]: Finished difference Result 126 states and 142 transitions. [2018-01-24 16:06:36,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-24 16:06:36,289 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2018-01-24 16:06:36,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:06:36,296 INFO L225 Difference]: With dead ends: 126 [2018-01-24 16:06:36,296 INFO L226 Difference]: Without dead ends: 73 [2018-01-24 16:06:36,299 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-24 16:06:36,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-01-24 16:06:36,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-01-24 16:06:36,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-01-24 16:06:36,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 77 transitions. [2018-01-24 16:06:36,329 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 77 transitions. Word has length 12 [2018-01-24 16:06:36,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:06:36,329 INFO L432 AbstractCegarLoop]: Abstraction has 73 states and 77 transitions. [2018-01-24 16:06:36,329 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-24 16:06:36,329 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 77 transitions. [2018-01-24 16:06:36,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-24 16:06:36,330 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:06:36,330 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:06:36,330 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr26EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-01-24 16:06:36,330 INFO L82 PathProgramCache]: Analyzing trace with hash 749299640, now seen corresponding path program 1 times [2018-01-24 16:06:36,330 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:06:36,331 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:06:36,332 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:06:36,332 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:06:36,332 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:06:36,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:06:36,347 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:06:36,424 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-24 16:06:36,425 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:06:36,425 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 16:06:36,425 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:06:36,426 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 16:06:36,426 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 16:06:36,427 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 16:06:36,427 INFO L87 Difference]: Start difference. First operand 73 states and 77 transitions. Second operand 5 states. [2018-01-24 16:06:36,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:06:36,656 INFO L93 Difference]: Finished difference Result 103 states and 112 transitions. [2018-01-24 16:06:36,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 16:06:36,657 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-01-24 16:06:36,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:06:36,658 INFO L225 Difference]: With dead ends: 103 [2018-01-24 16:06:36,659 INFO L226 Difference]: Without dead ends: 91 [2018-01-24 16:06:36,660 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-01-24 16:06:36,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-01-24 16:06:36,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 77. [2018-01-24 16:06:36,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-01-24 16:06:36,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 88 transitions. [2018-01-24 16:06:36,667 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 88 transitions. Word has length 14 [2018-01-24 16:06:36,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:06:36,667 INFO L432 AbstractCegarLoop]: Abstraction has 77 states and 88 transitions. [2018-01-24 16:06:36,667 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 16:06:36,667 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 88 transitions. [2018-01-24 16:06:36,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-24 16:06:36,668 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:06:36,668 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:06:36,668 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr26EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-01-24 16:06:36,668 INFO L82 PathProgramCache]: Analyzing trace with hash 749299641, now seen corresponding path program 1 times [2018-01-24 16:06:36,668 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:06:36,669 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:06:36,670 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:06:36,670 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:06:36,670 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:06:36,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:06:36,687 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:06:36,793 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-24 16:06:36,793 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:06:36,793 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 16:06:36,793 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:06:36,794 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 16:06:36,794 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 16:06:36,794 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 16:06:36,794 INFO L87 Difference]: Start difference. First operand 77 states and 88 transitions. Second operand 5 states. [2018-01-24 16:06:36,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:06:36,971 INFO L93 Difference]: Finished difference Result 114 states and 122 transitions. [2018-01-24 16:06:36,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 16:06:36,972 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-01-24 16:06:36,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:06:36,973 INFO L225 Difference]: With dead ends: 114 [2018-01-24 16:06:36,973 INFO L226 Difference]: Without dead ends: 102 [2018-01-24 16:06:36,974 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-01-24 16:06:36,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-01-24 16:06:36,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 94. [2018-01-24 16:06:36,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-01-24 16:06:36,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 103 transitions. [2018-01-24 16:06:36,985 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 103 transitions. Word has length 14 [2018-01-24 16:06:36,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:06:36,985 INFO L432 AbstractCegarLoop]: Abstraction has 94 states and 103 transitions. [2018-01-24 16:06:36,985 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 16:06:36,986 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 103 transitions. [2018-01-24 16:06:36,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-24 16:06:36,987 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:06:36,987 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:06:36,987 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr26EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-01-24 16:06:36,987 INFO L82 PathProgramCache]: Analyzing trace with hash 129960215, now seen corresponding path program 1 times [2018-01-24 16:06:36,987 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:06:36,989 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:06:36,989 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:06:36,989 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:06:36,989 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:06:37,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:06:37,013 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:06:37,127 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-24 16:06:37,127 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:06:37,127 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 16:06:37,128 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:06:37,128 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 16:06:37,128 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 16:06:37,129 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 16:06:37,129 INFO L87 Difference]: Start difference. First operand 94 states and 103 transitions. Second operand 6 states. [2018-01-24 16:06:37,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:06:37,311 INFO L93 Difference]: Finished difference Result 134 states and 147 transitions. [2018-01-24 16:06:37,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-24 16:06:37,312 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2018-01-24 16:06:37,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:06:37,313 INFO L225 Difference]: With dead ends: 134 [2018-01-24 16:06:37,313 INFO L226 Difference]: Without dead ends: 130 [2018-01-24 16:06:37,314 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-01-24 16:06:37,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-01-24 16:06:37,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 118. [2018-01-24 16:06:37,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-01-24 16:06:37,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 136 transitions. [2018-01-24 16:06:37,328 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 136 transitions. Word has length 25 [2018-01-24 16:06:37,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:06:37,328 INFO L432 AbstractCegarLoop]: Abstraction has 118 states and 136 transitions. [2018-01-24 16:06:37,328 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 16:06:37,328 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 136 transitions. [2018-01-24 16:06:37,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-24 16:06:37,330 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:06:37,330 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:06:37,330 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr26EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-01-24 16:06:37,330 INFO L82 PathProgramCache]: Analyzing trace with hash 130009866, now seen corresponding path program 1 times [2018-01-24 16:06:37,330 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:06:37,331 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:06:37,331 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:06:37,331 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:06:37,331 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:06:37,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:06:37,345 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:06:37,389 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-24 16:06:37,390 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:06:37,390 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 16:06:37,390 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:06:37,390 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 16:06:37,391 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 16:06:37,391 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 16:06:37,391 INFO L87 Difference]: Start difference. First operand 118 states and 136 transitions. Second operand 6 states. [2018-01-24 16:06:37,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:06:37,536 INFO L93 Difference]: Finished difference Result 130 states and 147 transitions. [2018-01-24 16:06:37,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-24 16:06:37,536 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2018-01-24 16:06:37,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:06:37,538 INFO L225 Difference]: With dead ends: 130 [2018-01-24 16:06:37,538 INFO L226 Difference]: Without dead ends: 129 [2018-01-24 16:06:37,538 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-01-24 16:06:37,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-01-24 16:06:37,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 120. [2018-01-24 16:06:37,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-01-24 16:06:37,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 139 transitions. [2018-01-24 16:06:37,552 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 139 transitions. Word has length 25 [2018-01-24 16:06:37,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:06:37,552 INFO L432 AbstractCegarLoop]: Abstraction has 120 states and 139 transitions. [2018-01-24 16:06:37,552 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 16:06:37,553 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 139 transitions. [2018-01-24 16:06:37,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-24 16:06:37,554 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:06:37,554 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:06:37,554 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr26EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-01-24 16:06:37,554 INFO L82 PathProgramCache]: Analyzing trace with hash 130009867, now seen corresponding path program 1 times [2018-01-24 16:06:37,554 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:06:37,555 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:06:37,555 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:06:37,555 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:06:37,555 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:06:37,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:06:37,568 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:06:37,603 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-24 16:06:37,603 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:06:37,603 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 16:06:37,603 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:06:37,604 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 16:06:37,604 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 16:06:37,604 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 16:06:37,604 INFO L87 Difference]: Start difference. First operand 120 states and 139 transitions. Second operand 6 states. [2018-01-24 16:06:37,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:06:37,803 INFO L93 Difference]: Finished difference Result 128 states and 146 transitions. [2018-01-24 16:06:37,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-24 16:06:37,803 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2018-01-24 16:06:37,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:06:37,804 INFO L225 Difference]: With dead ends: 128 [2018-01-24 16:06:37,804 INFO L226 Difference]: Without dead ends: 127 [2018-01-24 16:06:37,805 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2018-01-24 16:06:37,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-01-24 16:06:37,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 119. [2018-01-24 16:06:37,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-01-24 16:06:37,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 137 transitions. [2018-01-24 16:06:37,818 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 137 transitions. Word has length 25 [2018-01-24 16:06:37,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:06:37,818 INFO L432 AbstractCegarLoop]: Abstraction has 119 states and 137 transitions. [2018-01-24 16:06:37,818 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 16:06:37,818 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 137 transitions. [2018-01-24 16:06:37,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-24 16:06:37,820 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:06:37,820 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:06:37,820 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr26EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-01-24 16:06:37,820 INFO L82 PathProgramCache]: Analyzing trace with hash 825919103, now seen corresponding path program 1 times [2018-01-24 16:06:37,820 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:06:37,821 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:06:37,822 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:06:37,822 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:06:37,822 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:06:37,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:06:37,833 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:06:37,849 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:06:37,849 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:06:37,849 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 16:06:37,849 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:06:37,850 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 16:06:37,850 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 16:06:37,850 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 16:06:37,850 INFO L87 Difference]: Start difference. First operand 119 states and 137 transitions. Second operand 3 states. [2018-01-24 16:06:37,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:06:37,870 INFO L93 Difference]: Finished difference Result 270 states and 312 transitions. [2018-01-24 16:06:37,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 16:06:37,870 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-01-24 16:06:37,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:06:37,871 INFO L225 Difference]: With dead ends: 270 [2018-01-24 16:06:37,871 INFO L226 Difference]: Without dead ends: 175 [2018-01-24 16:06:37,872 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 16:06:37,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-01-24 16:06:37,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 135. [2018-01-24 16:06:37,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-01-24 16:06:37,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 161 transitions. [2018-01-24 16:06:37,883 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 161 transitions. Word has length 25 [2018-01-24 16:06:37,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:06:37,883 INFO L432 AbstractCegarLoop]: Abstraction has 135 states and 161 transitions. [2018-01-24 16:06:37,883 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 16:06:37,883 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 161 transitions. [2018-01-24 16:06:37,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-24 16:06:37,884 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:06:37,884 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:06:37,884 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr26EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-01-24 16:06:37,884 INFO L82 PathProgramCache]: Analyzing trace with hash 245290165, now seen corresponding path program 1 times [2018-01-24 16:06:37,884 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:06:37,885 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:06:37,885 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:06:37,885 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:06:37,885 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:06:37,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:06:37,895 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:06:38,054 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:06:38,054 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:06:38,054 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 16:06:38,054 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:06:38,055 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 16:06:38,055 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 16:06:38,055 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 16:06:38,055 INFO L87 Difference]: Start difference. First operand 135 states and 161 transitions. Second operand 6 states. [2018-01-24 16:06:38,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:06:38,171 INFO L93 Difference]: Finished difference Result 186 states and 206 transitions. [2018-01-24 16:06:38,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-24 16:06:38,172 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2018-01-24 16:06:38,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:06:38,173 INFO L225 Difference]: With dead ends: 186 [2018-01-24 16:06:38,173 INFO L226 Difference]: Without dead ends: 139 [2018-01-24 16:06:38,174 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-01-24 16:06:38,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-01-24 16:06:38,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 115. [2018-01-24 16:06:38,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-01-24 16:06:38,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 129 transitions. [2018-01-24 16:06:38,182 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 129 transitions. Word has length 25 [2018-01-24 16:06:38,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:06:38,183 INFO L432 AbstractCegarLoop]: Abstraction has 115 states and 129 transitions. [2018-01-24 16:06:38,183 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 16:06:38,183 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 129 transitions. [2018-01-24 16:06:38,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-24 16:06:38,184 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:06:38,184 INFO L322 BasicCegarLoop]: trace histogram [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-24 16:06:38,184 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr26EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-01-24 16:06:38,184 INFO L82 PathProgramCache]: Analyzing trace with hash 1978391014, now seen corresponding path program 1 times [2018-01-24 16:06:38,184 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:06:38,185 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:06:38,185 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:06:38,185 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:06:38,185 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:06:38,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:06:38,193 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:06:38,251 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:06:38,251 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:06:38,251 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 16:06:38,252 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:06:38,252 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-24 16:06:38,252 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-24 16:06:38,252 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-24 16:06:38,253 INFO L87 Difference]: Start difference. First operand 115 states and 129 transitions. Second operand 7 states. [2018-01-24 16:06:38,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:06:38,404 INFO L93 Difference]: Finished difference Result 118 states and 132 transitions. [2018-01-24 16:06:38,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 16:06:38,405 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2018-01-24 16:06:38,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:06:38,405 INFO L225 Difference]: With dead ends: 118 [2018-01-24 16:06:38,406 INFO L226 Difference]: Without dead ends: 115 [2018-01-24 16:06:38,406 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-01-24 16:06:38,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-01-24 16:06:38,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 112. [2018-01-24 16:06:38,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-01-24 16:06:38,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 126 transitions. [2018-01-24 16:06:38,412 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 126 transitions. Word has length 26 [2018-01-24 16:06:38,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:06:38,413 INFO L432 AbstractCegarLoop]: Abstraction has 112 states and 126 transitions. [2018-01-24 16:06:38,413 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-24 16:06:38,413 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 126 transitions. [2018-01-24 16:06:38,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-24 16:06:38,414 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:06:38,414 INFO L322 BasicCegarLoop]: trace histogram [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-24 16:06:38,414 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr26EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-01-24 16:06:38,414 INFO L82 PathProgramCache]: Analyzing trace with hash 1978391015, now seen corresponding path program 1 times [2018-01-24 16:06:38,414 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:06:38,415 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:06:38,415 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:06:38,415 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:06:38,415 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:06:38,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:06:38,427 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:06:38,546 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:06:38,547 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:06:38,547 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 16:06:38,547 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:06:38,547 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-24 16:06:38,547 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-24 16:06:38,547 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-24 16:06:38,548 INFO L87 Difference]: Start difference. First operand 112 states and 126 transitions. Second operand 7 states. [2018-01-24 16:06:38,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:06:38,779 INFO L93 Difference]: Finished difference Result 131 states and 145 transitions. [2018-01-24 16:06:38,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 16:06:38,780 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2018-01-24 16:06:38,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:06:38,781 INFO L225 Difference]: With dead ends: 131 [2018-01-24 16:06:38,781 INFO L226 Difference]: Without dead ends: 126 [2018-01-24 16:06:38,782 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2018-01-24 16:06:38,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-01-24 16:06:38,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 99. [2018-01-24 16:06:38,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-01-24 16:06:38,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 111 transitions. [2018-01-24 16:06:38,791 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 111 transitions. Word has length 26 [2018-01-24 16:06:38,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:06:38,791 INFO L432 AbstractCegarLoop]: Abstraction has 99 states and 111 transitions. [2018-01-24 16:06:38,792 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-24 16:06:38,792 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 111 transitions. [2018-01-24 16:06:38,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-24 16:06:38,793 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:06:38,793 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:06:38,793 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr26EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-01-24 16:06:38,793 INFO L82 PathProgramCache]: Analyzing trace with hash 385432044, now seen corresponding path program 1 times [2018-01-24 16:06:38,793 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:06:38,794 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:06:38,794 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:06:38,795 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:06:38,795 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:06:38,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:06:38,804 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:06:38,837 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:06:38,838 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:06:38,838 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 16:06:38,838 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:06:38,838 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-24 16:06:38,838 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-24 16:06:38,838 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-24 16:06:38,839 INFO L87 Difference]: Start difference. First operand 99 states and 111 transitions. Second operand 7 states. [2018-01-24 16:06:38,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:06:38,956 INFO L93 Difference]: Finished difference Result 138 states and 149 transitions. [2018-01-24 16:06:38,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 16:06:38,956 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2018-01-24 16:06:38,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:06:38,957 INFO L225 Difference]: With dead ends: 138 [2018-01-24 16:06:38,957 INFO L226 Difference]: Without dead ends: 111 [2018-01-24 16:06:38,958 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-01-24 16:06:38,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-01-24 16:06:38,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 94. [2018-01-24 16:06:38,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-01-24 16:06:38,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 105 transitions. [2018-01-24 16:06:38,964 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 105 transitions. Word has length 27 [2018-01-24 16:06:38,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:06:38,964 INFO L432 AbstractCegarLoop]: Abstraction has 94 states and 105 transitions. [2018-01-24 16:06:38,964 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-24 16:06:38,964 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 105 transitions. [2018-01-24 16:06:38,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-24 16:06:38,965 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:06:38,965 INFO L322 BasicCegarLoop]: trace histogram [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] [2018-01-24 16:06:38,966 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr26EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-01-24 16:06:38,966 INFO L82 PathProgramCache]: Analyzing trace with hash 1053625897, now seen corresponding path program 1 times [2018-01-24 16:06:38,966 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:06:38,967 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:06:38,967 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:06:38,967 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:06:38,967 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:06:38,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:06:38,982 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:06:39,433 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:06:39,433 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:06:39,433 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 16:06:39,434 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 38 with the following transitions: [2018-01-24 16:06:39,436 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [8], [10], [14], [16], [19], [21], [24], [25], [28], [36], [37], [43], [45], [48], [51], [55], [58], [62], [64], [69], [101], [105], [107], [112], [125], [128], [131], [136], [137], [145], [146], [147] [2018-01-24 16:06:39,483 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 16:06:39,483 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 16:06:49,018 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 16:06:49,019 INFO L268 AbstractInterpreter]: Visited 35 different actions 52 times. Merged at 16 different actions 16 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 31 variables. [2018-01-24 16:06:49,029 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 16:06:49,029 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:06:49,029 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-24 16:06:49,042 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:06:49,042 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 16:06:49,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:06:49,086 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 16:06:49,112 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-24 16:06:49,114 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:06:49,141 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:06:49,141 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-24 16:06:49,252 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-24 16:06:49,255 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-24 16:06:49,256 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:06:49,263 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:06:49,272 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:06:49,273 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:22 [2018-01-24 16:06:49,322 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:06:49,323 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:06:49,324 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-24 16:06:49,324 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:06:49,332 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:06:49,333 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:21 [2018-01-24 16:06:49,408 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 13 treesize of output 10 [2018-01-24 16:06:49,419 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 10 treesize of output 9 [2018-01-24 16:06:49,419 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:06:49,428 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:06:49,478 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 25 [2018-01-24 16:06:49,487 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:06:49,488 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 22 treesize of output 29 [2018-01-24 16:06:49,489 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 16:06:49,493 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:06:49,503 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-24 16:06:49,504 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:53, output treesize:27 [2018-01-24 16:06:49,558 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 20 treesize of output 16 [2018-01-24 16:06:49,561 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 16 treesize of output 4 [2018-01-24 16:06:49,561 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:06:49,566 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:06:49,597 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:06:49,597 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:30, output treesize:15 [2018-01-24 16:06:49,655 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-24 16:06:49,658 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-24 16:06:49,658 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:06:49,663 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:06:49,675 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-24 16:06:49,676 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:26, output treesize:22 [2018-01-24 16:06:49,731 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 0 case distinctions, treesize of input 22 treesize of output 20 [2018-01-24 16:06:49,734 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-24 16:06:49,735 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:06:49,760 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-24 16:06:49,761 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 16:06:49,768 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:06:49,783 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-24 16:06:49,783 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:26, output treesize:3 [2018-01-24 16:06:49,853 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:06:49,854 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 16:06:50,019 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:06:50,022 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:06:50,023 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 16:06:50,026 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 16:06:50,034 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-24 16:06:50,034 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:37, output treesize:23 [2018-01-24 16:06:50,161 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 30 treesize of output 28 [2018-01-24 16:06:50,164 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 18 [2018-01-24 16:06:50,182 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 16:06:50,183 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 16:06:50,183 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 9 [2018-01-24 16:06:50,183 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 16:06:50,185 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 11 [2018-01-24 16:06:50,186 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 16:06:50,202 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 16:06:50,215 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 16:06:50,228 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 21 treesize of output 19 [2018-01-24 16:06:50,230 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 6 treesize of output 1 [2018-01-24 16:06:50,230 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-24 16:06:50,240 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:06:50,263 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 4 xjuncts. [2018-01-24 16:06:50,263 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:44, output treesize:58 [2018-01-24 16:06:50,467 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:06:50,501 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:06:50,501 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 3 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 16:06:50,505 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:06:50,505 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 16:06:50,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:06:50,565 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 16:06:50,568 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-24 16:06:50,568 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:06:50,597 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:06:50,597 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-24 16:06:50,603 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-24 16:06:50,621 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-24 16:06:50,622 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:06:50,624 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:06:50,657 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:06:50,657 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2018-01-24 16:06:50,661 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:06:50,662 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:06:50,663 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-24 16:06:50,663 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:06:50,683 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:06:50,683 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:21 [2018-01-24 16:06:50,697 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 13 treesize of output 10 [2018-01-24 16:06:50,700 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 10 treesize of output 9 [2018-01-24 16:06:50,700 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:06:50,702 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:06:50,719 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 25 [2018-01-24 16:06:50,722 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:06:50,723 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 22 treesize of output 29 [2018-01-24 16:06:50,724 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 16:06:50,732 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:06:50,757 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-24 16:06:50,757 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:53, output treesize:27 [2018-01-24 16:06:50,768 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 20 treesize of output 16 [2018-01-24 16:06:50,789 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 16 treesize of output 4 [2018-01-24 16:06:50,789 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:06:50,808 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:06:50,812 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:06:50,812 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:30, output treesize:15 [2018-01-24 16:06:50,821 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-24 16:06:50,823 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-24 16:06:50,823 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:06:50,832 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:06:50,838 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-24 16:06:50,838 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:26, output treesize:22 [2018-01-24 16:06:50,874 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 0 case distinctions, treesize of input 22 treesize of output 20 [2018-01-24 16:06:50,876 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-24 16:06:50,876 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:06:50,881 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-24 16:06:50,881 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 16:06:50,882 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:06:50,885 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-24 16:06:50,885 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:26, output treesize:3 [2018-01-24 16:06:50,888 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:06:50,888 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 16:06:51,081 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:06:51,085 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:06:51,087 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 16:06:51,090 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 16:06:51,098 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-24 16:06:51,098 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:37, output treesize:23 [2018-01-24 16:06:51,243 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 27 treesize of output 25 [2018-01-24 16:06:51,253 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 18 [2018-01-24 16:06:51,284 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 11 [2018-01-24 16:06:51,285 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 16:06:51,287 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 16:06:51,287 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 16:06:51,288 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 9 [2018-01-24 16:06:51,288 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 16:06:51,296 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 16:06:51,307 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 16:06:51,308 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 18 treesize of output 16 [2018-01-24 16:06:51,310 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 6 treesize of output 1 [2018-01-24 16:06:51,310 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-24 16:06:51,313 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:06:51,335 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 4 xjuncts. [2018-01-24 16:06:51,336 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:35, output treesize:45 [2018-01-24 16:06:51,492 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:06:51,494 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 16:06:51,495 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 15, 14, 14] total 42 [2018-01-24 16:06:51,495 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 16:06:51,495 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-01-24 16:06:51,496 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-01-24 16:06:51,496 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=1524, Unknown=0, NotChecked=0, Total=1722 [2018-01-24 16:06:51,496 INFO L87 Difference]: Start difference. First operand 94 states and 105 transitions. Second operand 25 states. [2018-01-24 16:06:52,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:06:52,670 INFO L93 Difference]: Finished difference Result 204 states and 226 transitions. [2018-01-24 16:06:52,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-01-24 16:06:52,717 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 37 [2018-01-24 16:06:52,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:06:52,719 INFO L225 Difference]: With dead ends: 204 [2018-01-24 16:06:52,719 INFO L226 Difference]: Without dead ends: 196 [2018-01-24 16:06:52,720 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 118 SyntacticMatches, 3 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1032 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=592, Invalid=2948, Unknown=0, NotChecked=0, Total=3540 [2018-01-24 16:06:52,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2018-01-24 16:06:52,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 135. [2018-01-24 16:06:52,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-01-24 16:06:52,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 158 transitions. [2018-01-24 16:06:52,732 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 158 transitions. Word has length 37 [2018-01-24 16:06:52,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:06:52,733 INFO L432 AbstractCegarLoop]: Abstraction has 135 states and 158 transitions. [2018-01-24 16:06:52,733 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-01-24 16:06:52,733 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 158 transitions. [2018-01-24 16:06:52,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-24 16:06:52,734 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:06:52,734 INFO L322 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, 1] [2018-01-24 16:06:52,734 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr26EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-01-24 16:06:52,734 INFO L82 PathProgramCache]: Analyzing trace with hash 1168955847, now seen corresponding path program 1 times [2018-01-24 16:06:52,735 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:06:52,736 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:06:52,736 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:06:52,736 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:06:52,736 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:06:52,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:06:52,755 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:06:52,992 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:06:52,993 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:06:52,993 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 16:06:52,996 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 38 with the following transitions: [2018-01-24 16:06:52,996 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [8], [10], [14], [16], [19], [21], [24], [25], [28], [36], [37], [43], [45], [48], [51], [55], [58], [62], [64], [65], [71], [74], [75], [82], [94], [97], [136], [137], [145], [146], [147] [2018-01-24 16:06:52,998 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 16:06:52,998 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) Received shutdown request... [2018-01-24 16:07:25,449 WARN L571 FixpointEngine]: Received timeout, aborting fixpoint engine [2018-01-24 16:07:25,449 WARN L157 AbstractInterpreter]: Abstract interpretation run out of time [2018-01-24 16:07:25,449 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-24 16:07:25,449 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:07:25,449 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-24 16:07:25,476 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:07:25,477 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 16:07:25,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:07:25,497 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 16:07:25,498 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-01-24 16:07:25,498 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-24 16:07:25,503 WARN L187 ceAbstractionStarter]: Timeout [2018-01-24 16:07:25,503 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.01 04:07:25 BoogieIcfgContainer [2018-01-24 16:07:25,503 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-24 16:07:25,504 INFO L168 Benchmark]: Toolchain (without parser) took 50228.99 ms. Allocated memory was 307.2 MB in the beginning and 2.3 GB in the end (delta: 2.0 GB). Free memory was 266.1 MB in the beginning and 2.1 GB in the end (delta: -1.8 GB). Peak memory consumption was 134.3 MB. Max. memory is 5.3 GB. [2018-01-24 16:07:25,505 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 307.2 MB. Free memory is still 272.1 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 16:07:25,505 INFO L168 Benchmark]: CACSL2BoogieTranslator took 205.61 ms. Allocated memory is still 307.2 MB. Free memory was 266.1 MB in the beginning and 254.2 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 5.3 GB. [2018-01-24 16:07:25,506 INFO L168 Benchmark]: Boogie Preprocessor took 44.92 ms. Allocated memory is still 307.2 MB. Free memory was 254.2 MB in the beginning and 252.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-24 16:07:25,506 INFO L168 Benchmark]: RCFGBuilder took 368.00 ms. Allocated memory is still 307.2 MB. Free memory was 252.2 MB in the beginning and 229.2 MB in the end (delta: 23.0 MB). Peak memory consumption was 23.0 MB. Max. memory is 5.3 GB. [2018-01-24 16:07:25,506 INFO L168 Benchmark]: TraceAbstraction took 49601.94 ms. Allocated memory was 307.2 MB in the beginning and 2.3 GB in the end (delta: 2.0 GB). Free memory was 229.2 MB in the beginning and 2.1 GB in the end (delta: -1.9 GB). Peak memory consumption was 97.4 MB. Max. memory is 5.3 GB. [2018-01-24 16:07:25,508 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.17 ms. Allocated memory is still 307.2 MB. Free memory is still 272.1 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 205.61 ms. Allocated memory is still 307.2 MB. Free memory was 266.1 MB in the beginning and 254.2 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 44.92 ms. Allocated memory is still 307.2 MB. Free memory was 254.2 MB in the beginning and 252.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 368.00 ms. Allocated memory is still 307.2 MB. Free memory was 252.2 MB in the beginning and 229.2 MB in the end (delta: 23.0 MB). Peak memory consumption was 23.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 49601.94 ms. Allocated memory was 307.2 MB in the beginning and 2.3 GB in the end (delta: 2.0 GB). Free memory was 229.2 MB in the beginning and 2.1 GB in the end (delta: -1.9 GB). Peak memory consumption was 97.4 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 34 LocStat_MAX_WEQGRAPH_SIZE : 10 LocStat_MAX_SIZEOF_WEQEDGELABEL : 3 LocStat_NO_SUPPORTING_EQUALITIES : 471 LocStat_NO_SUPPORTING_DISEQUALITIES : 171 LocStat_NO_DISJUNCTIONS : -68 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 39 TransStat_MAX_WEQGRAPH_SIZE : 6 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 74 TransStat_NO_SUPPORTING_DISEQUALITIES : 17 TransStat_NO_DISJUNCTIONS : 44 TransStat_MAX_NO_DISJUNCTIONS : 4 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 103.246148 RENAME_VARIABLES(MILLISECONDS) : 25.968903 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 103.179944 PROJECTAWAY(MILLISECONDS) : 0.129394 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.100015 DISJOIN(MILLISECONDS) : 8.716645 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 26.029652 ADD_EQUALITY(MILLISECONDS) : 0.028911 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.014980 #CONJOIN_DISJUNCTIVE : 90 #RENAME_VARIABLES : 156 #UNFREEZE : 0 #CONJOIN : 176 #PROJECTAWAY : 113 #ADD_WEAK_EQUALITY : 24 #DISJOIN : 16 #RENAME_VARIABLES_DISJUNCTIVE : 145 #ADD_EQUALITY : 80 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 10 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 642). Cancelled while BasicCegarLoop was analyzing trace of length 38 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 651). Cancelled while BasicCegarLoop was analyzing trace of length 38 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 661). Cancelled while BasicCegarLoop was analyzing trace of length 38 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 664). Cancelled while BasicCegarLoop was analyzing trace of length 38 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 634). Cancelled while BasicCegarLoop was analyzing trace of length 38 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 663). Cancelled while BasicCegarLoop was analyzing trace of length 38 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 637). Cancelled while BasicCegarLoop was analyzing trace of length 38 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 655). Cancelled while BasicCegarLoop was analyzing trace of length 38 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 658). Cancelled while BasicCegarLoop was analyzing trace of length 38 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 666). Cancelled while BasicCegarLoop was analyzing trace of length 38 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 637). Cancelled while BasicCegarLoop was analyzing trace of length 38 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 651). Cancelled while BasicCegarLoop was analyzing trace of length 38 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 643). Cancelled while BasicCegarLoop was analyzing trace of length 38 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 661). Cancelled while BasicCegarLoop was analyzing trace of length 38 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 664). Cancelled while BasicCegarLoop was analyzing trace of length 38 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 634). Cancelled while BasicCegarLoop was analyzing trace of length 38 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 658). Cancelled while BasicCegarLoop was analyzing trace of length 38 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 645). Cancelled while BasicCegarLoop was analyzing trace of length 38 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 626]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 626). Cancelled while BasicCegarLoop was analyzing trace of length 38 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 643). Cancelled while BasicCegarLoop was analyzing trace of length 38 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 663). Cancelled while BasicCegarLoop was analyzing trace of length 38 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 648). Cancelled while BasicCegarLoop was analyzing trace of length 38 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 666). Cancelled while BasicCegarLoop was analyzing trace of length 38 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 645). Cancelled while BasicCegarLoop was analyzing trace of length 38 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 648). Cancelled while BasicCegarLoop was analyzing trace of length 38 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 642). Cancelled while BasicCegarLoop was analyzing trace of length 38 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 655). Cancelled while BasicCegarLoop was analyzing trace of length 38 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 83 locations, 27 error locations. TIMEOUT Result, 49.5s OverallTime, 13 OverallIterations, 2 TraceHistogramMax, 2.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 677 SDtfs, 1646 SDslu, 1807 SDs, 0 SdLazy, 1631 SolverSat, 228 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 270 GetRequests, 137 SyntacticMatches, 4 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1057 ImplicationChecksByTransitivity, 2.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=135occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 42.0s AbstIntTime, 2 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 12 MinimizatonAttempts, 223 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 355 NumberOfCodeBlocks, 355 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 413 ConstructedInterpolants, 38 QuantifiedInterpolants, 92803 SizeOfPredicates, 36 NumberOfNonLiveVariables, 284 ConjunctsInSsa, 67 ConjunctsInUnsatCore, 16 InterpolantComputations, 11 PerfectInterpolantSequences, 12/27 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/alternating_list_true-unreach-call_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_16-07-25-517.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/alternating_list_true-unreach-call_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-VPDomainBenchmark-0-2018-01-24_16-07-25-517.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/alternating_list_true-unreach-call_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-0-2018-01-24_16-07-25-517.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/alternating_list_true-unreach-call_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-24_16-07-25-517.csv Completed graceful shutdown