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_smtcomp.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test19_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-25 06:09:49,301 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-25 06:09:49,303 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-25 06:09:49,318 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-25 06:09:49,318 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-25 06:09:49,319 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-25 06:09:49,320 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-25 06:09:49,321 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-25 06:09:49,323 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-25 06:09:49,324 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-25 06:09:49,325 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-25 06:09:49,325 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-25 06:09:49,326 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-25 06:09:49,327 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-25 06:09:49,328 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-25 06:09:49,331 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-25 06:09:49,333 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-25 06:09:49,335 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-25 06:09:49,336 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-25 06:09:49,337 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-25 06:09:49,339 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-25 06:09:49,339 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-25 06:09:49,340 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-25 06:09:49,341 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-25 06:09:49,341 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-25 06:09:49,343 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-25 06:09:49,343 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-25 06:09:49,344 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-25 06:09:49,344 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-25 06:09:49,344 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-25 06:09:49,345 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-25 06:09:49,345 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_smtcomp.epf [2018-01-25 06:09:49,353 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-25 06:09:49,354 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-25 06:09:49,354 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-25 06:09:49,355 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-25 06:09:49,355 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-25 06:09:49,355 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-25 06:09:49,355 INFO L133 SettingsManager]: * Precise comparison operator=true [2018-01-25 06:09:49,355 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-25 06:09:49,355 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-25 06:09:49,356 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-25 06:09:49,356 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-25 06:09:49,356 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-25 06:09:49,356 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-25 06:09:49,356 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-25 06:09:49,356 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-25 06:09:49,356 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-25 06:09:49,357 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-25 06:09:49,357 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-25 06:09:49,357 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-25 06:09:49,357 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-25 06:09:49,357 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-25 06:09:49,357 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-25 06:09:49,357 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-25 06:09:49,358 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-25 06:09:49,358 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-25 06:09:49,358 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-25 06:09:49,358 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-25 06:09:49,358 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-25 06:09:49,358 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-25 06:09:49,359 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-25 06:09:49,359 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-25 06:09:49,359 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-25 06:09:49,359 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-25 06:09:49,359 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-25 06:09:49,360 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-25 06:09:49,360 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-25 06:09:49,392 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-25 06:09:49,402 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-25 06:09:49,405 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-25 06:09:49,406 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-25 06:09:49,407 INFO L276 PluginConnector]: CDTParser initialized [2018-01-25 06:09:49,407 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test19_true-valid-memsafety_true-termination.i [2018-01-25 06:09:49,587 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-25 06:09:49,593 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-25 06:09:49,594 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-25 06:09:49,594 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-25 06:09:49,599 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-25 06:09:49,600 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 06:09:49" (1/1) ... [2018-01-25 06:09:49,603 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d434187 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:09:49, skipping insertion in model container [2018-01-25 06:09:49,603 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 06:09:49" (1/1) ... [2018-01-25 06:09:49,621 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 06:09:49,673 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 06:09:49,789 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 06:09:49,813 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 06:09:49,822 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:09:49 WrapperNode [2018-01-25 06:09:49,822 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-25 06:09:49,822 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-25 06:09:49,822 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-25 06:09:49,823 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-25 06:09:49,839 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:09:49" (1/1) ... [2018-01-25 06:09:49,839 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:09:49" (1/1) ... [2018-01-25 06:09:49,852 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:09:49" (1/1) ... [2018-01-25 06:09:49,852 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:09:49" (1/1) ... [2018-01-25 06:09:49,858 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:09:49" (1/1) ... [2018-01-25 06:09:49,861 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:09:49" (1/1) ... [2018-01-25 06:09:49,862 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:09:49" (1/1) ... [2018-01-25 06:09:49,865 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-25 06:09:49,865 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-25 06:09:49,866 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-25 06:09:49,866 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-25 06:09:49,867 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:09:49" (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-25 06:09:49,936 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-25 06:09:49,936 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-25 06:09:49,936 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-01-25 06:09:49,936 INFO L136 BoogieDeclarations]: Found implementation of procedure f19 [2018-01-25 06:09:49,936 INFO L136 BoogieDeclarations]: Found implementation of procedure f19_undo [2018-01-25 06:09:49,936 INFO L136 BoogieDeclarations]: Found implementation of procedure g19 [2018-01-25 06:09:49,937 INFO L136 BoogieDeclarations]: Found implementation of procedure probe_19 [2018-01-25 06:09:49,937 INFO L136 BoogieDeclarations]: Found implementation of procedure disconnect_19 [2018-01-25 06:09:49,937 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-01-25 06:09:49,937 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-25 06:09:49,937 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-25 06:09:49,937 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-25 06:09:49,937 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-25 06:09:49,937 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-25 06:09:49,937 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-25 06:09:49,937 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-25 06:09:49,938 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-25 06:09:49,938 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-25 06:09:49,938 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-01-25 06:09:49,938 INFO L128 BoogieDeclarations]: Found specification of procedure f19 [2018-01-25 06:09:49,938 INFO L128 BoogieDeclarations]: Found specification of procedure f19_undo [2018-01-25 06:09:49,938 INFO L128 BoogieDeclarations]: Found specification of procedure g19 [2018-01-25 06:09:49,939 INFO L128 BoogieDeclarations]: Found specification of procedure probe_19 [2018-01-25 06:09:49,939 INFO L128 BoogieDeclarations]: Found specification of procedure disconnect_19 [2018-01-25 06:09:49,939 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-01-25 06:09:49,939 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-25 06:09:49,939 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-25 06:09:49,939 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-25 06:09:50,225 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-25 06:09:50,226 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 06:09:50 BoogieIcfgContainer [2018-01-25 06:09:50,226 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-25 06:09:50,227 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-25 06:09:50,227 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-25 06:09:50,229 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-25 06:09:50,230 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.01 06:09:49" (1/3) ... [2018-01-25 06:09:50,231 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@731e4e53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 06:09:50, skipping insertion in model container [2018-01-25 06:09:50,231 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:09:49" (2/3) ... [2018-01-25 06:09:50,231 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@731e4e53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 06:09:50, skipping insertion in model container [2018-01-25 06:09:50,231 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 06:09:50" (3/3) ... [2018-01-25 06:09:50,233 INFO L105 eAbstractionObserver]: Analyzing ICFG memleaks_test19_true-valid-memsafety_true-termination.i [2018-01-25 06:09:50,239 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-25 06:09:50,246 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 21 error locations. [2018-01-25 06:09:50,287 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-25 06:09:50,287 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-25 06:09:50,287 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-25 06:09:50,288 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-25 06:09:50,288 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-25 06:09:50,288 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-25 06:09:50,288 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-25 06:09:50,288 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-25 06:09:50,289 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-25 06:09:50,310 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states. [2018-01-25 06:09:50,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-25 06:09:50,315 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:09:50,315 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 06:09:50,315 INFO L371 AbstractCegarLoop]: === Iteration 1 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation, probe_19Err4RequiresViolation, probe_19Err2RequiresViolation, probe_19Err3RequiresViolation, probe_19Err7RequiresViolation, probe_19Err5RequiresViolation, probe_19Err1RequiresViolation, probe_19Err0RequiresViolation, probe_19Err6RequiresViolation]=== [2018-01-25 06:09:50,319 INFO L82 PathProgramCache]: Analyzing trace with hash 1329506467, now seen corresponding path program 1 times [2018-01-25 06:09:50,321 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:09:50,366 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:09:50,366 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:09:50,366 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:09:50,367 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:09:50,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:09:50,429 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:09:50,586 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-25 06:09:50,588 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:09:50,588 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 06:09:50,589 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:09:50,590 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 06:09:50,664 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 06:09:50,665 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-25 06:09:50,667 INFO L87 Difference]: Start difference. First operand 89 states. Second operand 6 states. [2018-01-25 06:09:51,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:09:51,044 INFO L93 Difference]: Finished difference Result 139 states and 163 transitions. [2018-01-25 06:09:51,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-25 06:09:51,046 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2018-01-25 06:09:51,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:09:51,059 INFO L225 Difference]: With dead ends: 139 [2018-01-25 06:09:51,059 INFO L226 Difference]: Without dead ends: 133 [2018-01-25 06:09:51,062 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-01-25 06:09:51,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-01-25 06:09:51,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 97. [2018-01-25 06:09:51,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-01-25 06:09:51,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 113 transitions. [2018-01-25 06:09:51,106 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 113 transitions. Word has length 15 [2018-01-25 06:09:51,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:09:51,107 INFO L432 AbstractCegarLoop]: Abstraction has 97 states and 113 transitions. [2018-01-25 06:09:51,107 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 06:09:51,107 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 113 transitions. [2018-01-25 06:09:51,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-25 06:09:51,109 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:09:51,109 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 06:09:51,109 INFO L371 AbstractCegarLoop]: === Iteration 2 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation, probe_19Err4RequiresViolation, probe_19Err2RequiresViolation, probe_19Err3RequiresViolation, probe_19Err7RequiresViolation, probe_19Err5RequiresViolation, probe_19Err1RequiresViolation, probe_19Err0RequiresViolation, probe_19Err6RequiresViolation]=== [2018-01-25 06:09:51,109 INFO L82 PathProgramCache]: Analyzing trace with hash 1329506468, now seen corresponding path program 1 times [2018-01-25 06:09:51,110 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:09:51,111 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:09:51,111 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:09:51,112 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:09:51,112 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:09:51,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:09:51,132 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:09:51,284 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-25 06:09:51,284 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:09:51,284 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 06:09:51,284 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:09:51,286 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 06:09:51,286 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 06:09:51,286 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-25 06:09:51,287 INFO L87 Difference]: Start difference. First operand 97 states and 113 transitions. Second operand 6 states. [2018-01-25 06:09:51,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:09:51,573 INFO L93 Difference]: Finished difference Result 129 states and 150 transitions. [2018-01-25 06:09:51,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 06:09:51,574 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2018-01-25 06:09:51,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:09:51,575 INFO L225 Difference]: With dead ends: 129 [2018-01-25 06:09:51,575 INFO L226 Difference]: Without dead ends: 126 [2018-01-25 06:09:51,576 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-01-25 06:09:51,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-01-25 06:09:51,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 109. [2018-01-25 06:09:51,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-01-25 06:09:51,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 132 transitions. [2018-01-25 06:09:51,590 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 132 transitions. Word has length 15 [2018-01-25 06:09:51,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:09:51,590 INFO L432 AbstractCegarLoop]: Abstraction has 109 states and 132 transitions. [2018-01-25 06:09:51,590 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 06:09:51,590 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 132 transitions. [2018-01-25 06:09:51,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-25 06:09:51,591 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:09:51,591 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 06:09:51,591 INFO L371 AbstractCegarLoop]: === Iteration 3 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation, probe_19Err4RequiresViolation, probe_19Err2RequiresViolation, probe_19Err3RequiresViolation, probe_19Err7RequiresViolation, probe_19Err5RequiresViolation, probe_19Err1RequiresViolation, probe_19Err0RequiresViolation, probe_19Err6RequiresViolation]=== [2018-01-25 06:09:51,591 INFO L82 PathProgramCache]: Analyzing trace with hash 1959488357, now seen corresponding path program 1 times [2018-01-25 06:09:51,592 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:09:51,593 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:09:51,593 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:09:51,593 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:09:51,594 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:09:51,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:09:51,618 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:09:51,724 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-25 06:09:51,724 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:09:51,724 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-25 06:09:51,724 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:09:51,725 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-25 06:09:51,725 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-25 06:09:51,725 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-25 06:09:51,725 INFO L87 Difference]: Start difference. First operand 109 states and 132 transitions. Second operand 8 states. [2018-01-25 06:09:52,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:09:52,219 INFO L93 Difference]: Finished difference Result 149 states and 177 transitions. [2018-01-25 06:09:52,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-25 06:09:52,249 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2018-01-25 06:09:52,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:09:52,251 INFO L225 Difference]: With dead ends: 149 [2018-01-25 06:09:52,251 INFO L226 Difference]: Without dead ends: 147 [2018-01-25 06:09:52,252 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-01-25 06:09:52,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-01-25 06:09:52,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 106. [2018-01-25 06:09:52,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-01-25 06:09:52,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 128 transitions. [2018-01-25 06:09:52,270 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 128 transitions. Word has length 17 [2018-01-25 06:09:52,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:09:52,270 INFO L432 AbstractCegarLoop]: Abstraction has 106 states and 128 transitions. [2018-01-25 06:09:52,270 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-25 06:09:52,270 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 128 transitions. [2018-01-25 06:09:52,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-25 06:09:52,271 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:09:52,271 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 06:09:52,272 INFO L371 AbstractCegarLoop]: === Iteration 4 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation, probe_19Err4RequiresViolation, probe_19Err2RequiresViolation, probe_19Err3RequiresViolation, probe_19Err7RequiresViolation, probe_19Err5RequiresViolation, probe_19Err1RequiresViolation, probe_19Err0RequiresViolation, probe_19Err6RequiresViolation]=== [2018-01-25 06:09:52,272 INFO L82 PathProgramCache]: Analyzing trace with hash 1959488358, now seen corresponding path program 1 times [2018-01-25 06:09:52,272 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:09:52,273 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:09:52,274 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:09:52,274 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:09:52,274 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:09:52,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:09:52,290 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:09:52,436 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-25 06:09:52,436 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:09:52,436 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-25 06:09:52,437 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:09:52,437 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-25 06:09:52,437 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-25 06:09:52,437 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-01-25 06:09:52,438 INFO L87 Difference]: Start difference. First operand 106 states and 128 transitions. Second operand 9 states. [2018-01-25 06:09:52,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:09:52,827 INFO L93 Difference]: Finished difference Result 152 states and 182 transitions. [2018-01-25 06:09:52,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-25 06:09:52,827 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 17 [2018-01-25 06:09:52,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:09:52,829 INFO L225 Difference]: With dead ends: 152 [2018-01-25 06:09:52,829 INFO L226 Difference]: Without dead ends: 149 [2018-01-25 06:09:52,829 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2018-01-25 06:09:52,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-01-25 06:09:52,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 82. [2018-01-25 06:09:52,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-01-25 06:09:52,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 89 transitions. [2018-01-25 06:09:52,842 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 89 transitions. Word has length 17 [2018-01-25 06:09:52,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:09:52,842 INFO L432 AbstractCegarLoop]: Abstraction has 82 states and 89 transitions. [2018-01-25 06:09:52,843 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-25 06:09:52,843 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 89 transitions. [2018-01-25 06:09:52,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-25 06:09:52,844 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:09:52,844 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] [2018-01-25 06:09:52,844 INFO L371 AbstractCegarLoop]: === Iteration 5 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation, probe_19Err4RequiresViolation, probe_19Err2RequiresViolation, probe_19Err3RequiresViolation, probe_19Err7RequiresViolation, probe_19Err5RequiresViolation, probe_19Err1RequiresViolation, probe_19Err0RequiresViolation, probe_19Err6RequiresViolation]=== [2018-01-25 06:09:52,844 INFO L82 PathProgramCache]: Analyzing trace with hash -1193563309, now seen corresponding path program 1 times [2018-01-25 06:09:52,845 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:09:52,846 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:09:52,846 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:09:52,846 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:09:52,847 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:09:52,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:09:52,860 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:09:52,950 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-25 06:09:52,951 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:09:52,951 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 06:09:52,952 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 27 with the following transitions: [2018-01-25 06:09:52,954 INFO L201 CegarAbsIntRunner]: [24], [27], [38], [44], [45], [46], [47], [51], [64], [66], [69], [70], [77], [106], [108], [109], [110], [111], [112], [114], [118], [119], [120] [2018-01-25 06:09:53,002 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 06:09:53,003 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 06:09:53,525 INFO L262 AbstractInterpreter]: Error location(s) were unreachable [2018-01-25 06:09:53,527 INFO L268 AbstractInterpreter]: Visited 18 different actions 18 times. Never merged. Never widened. Never found a fixpoint. Largest state had 21 variables. [2018-01-25 06:09:53,557 INFO L395 sIntCurrentIteration]: Generating AbsInt predicates [2018-01-25 06:09:53,912 INFO L232 lantSequenceWeakener]: Weakened 4 states. On average, predicates are now at 51.57% of their original sizes. [2018-01-25 06:09:53,912 INFO L408 sIntCurrentIteration]: Unifying AI predicates [2018-01-25 06:09:54,106 WARN L1007 $PredicateComparison]: unable to prove that (let ((.cse3 (+ c_probe_19_~a.offset 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$.offset| c_probe_19_~a.base) .cse3)) (.cse0 (select (select |c_#memory_$Pointer$.base| c_probe_19_~a.base) .cse3)) (.cse2 (select |c_#valid| 0))) (and (not (= 0 c_probe_19_~a.base)) (= .cse0 .cse1) (= 1 (select |c_#valid| c_probe_19_~a.base)) (not (= |c_#valid| |c_#length|)) (= .cse1 .cse2) (= 0 .cse0) (= (select |c_#length| c_probe_19_~a.base) 8) (forall ((v_weq0_1 Int) (v_weq1_1 Int)) (or (not (= v_weq0_1 c_probe_19_~a.base)) (not (= v_weq1_1 (+ c_probe_19_~a.offset 4))) (= (select (select |c_#memory_$Pointer$.base| v_weq0_1) v_weq1_1) (select (select |c_#memory_$Pointer$.offset| v_weq0_1) v_weq1_1)))) (forall ((v_weq0_1 Int)) (or (not (= v_weq0_1 (+ c_probe_19_~a.offset 4))) (= (select (select |c_#memory_$Pointer$.base| c_probe_19_~a.base) v_weq0_1) (select (select |c_#memory_$Pointer$.offset| c_probe_19_~a.base) v_weq0_1)))) (= .cse2 c_probe_19_~a.offset)))) is different from false [2018-01-25 06:09:54,128 INFO L419 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-01-25 06:09:54,129 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-25 06:09:54,129 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [6] total 19 [2018-01-25 06:09:54,129 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:09:54,129 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-25 06:09:54,130 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-25 06:09:54,130 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=138, Unknown=1, NotChecked=24, Total=210 [2018-01-25 06:09:54,130 INFO L87 Difference]: Start difference. First operand 82 states and 89 transitions. Second operand 15 states. [2018-01-25 06:09:57,035 WARN L1007 $PredicateComparison]: unable to prove that (let ((.cse3 (+ c_probe_19_~a.offset 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| c_probe_19_~a.base) .cse3)) (.cse2 (select (select |c_#memory_$Pointer$.offset| c_probe_19_~a.base) .cse3)) (.cse1 (select |c_#valid| 0))) (and (= 1 (select |c_#valid| c_probe_19_~a.base)) (= 0 .cse0) (= |c_probe_19_#t~ret7.offset| 0) (= (select |c_#length| c_probe_19_~a.base) 8) (forall ((v_weq0_1 Int) (v_weq1_1 Int)) (or (not (= v_weq0_1 c_probe_19_~a.base)) (not (= v_weq1_1 (+ c_probe_19_~a.offset 4))) (= (select (select |c_#memory_$Pointer$.base| v_weq0_1) v_weq1_1) (select (select |c_#memory_$Pointer$.offset| v_weq0_1) v_weq1_1)))) (forall ((v_weq0_1 Int)) (or (not (= v_weq0_1 (+ c_probe_19_~a.offset 4))) (= (select (select |c_#memory_$Pointer$.base| c_probe_19_~a.base) v_weq0_1) (select (select |c_#memory_$Pointer$.offset| c_probe_19_~a.base) v_weq0_1)))) (= |c_#NULL.base| .cse1) (= .cse1 c_probe_19_~a.offset) (not (= 0 c_probe_19_~a.base)) (= .cse0 .cse2) (= |c_#NULL.offset| |c_#NULL.base|) (= |c_old(#NULL.offset)| |c_#NULL.offset|) (= |c_#valid| |c_old(#valid)|) (= |c_old(#NULL.base)| |c_#NULL.base|) (not (= |c_#valid| |c_#length|)) (= .cse2 .cse1) (= |c_probe_19_#t~ret7.base| .cse1) (= 0 |c_#NULL.offset|) (= 0 |c_probe_19_#t~ret7.base|) (forall ((v_weq0_1 Int)) (or (= (select |c_old(#valid)| v_weq0_1) (select |c_#valid| v_weq0_1)) (and (= |c_#NULL.offset| |c_#NULL.base|) (= v_weq0_1 |c_#NULL.offset|) (= 0 v_weq0_1) (= |c_#NULL.base| (select |c_#valid| 0)))))))) is different from false [2018-01-25 06:10:00,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:10:00,373 INFO L93 Difference]: Finished difference Result 204 states and 219 transitions. [2018-01-25 06:10:00,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-01-25 06:10:00,373 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 26 [2018-01-25 06:10:00,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:10:00,375 INFO L225 Difference]: With dead ends: 204 [2018-01-25 06:10:00,375 INFO L226 Difference]: Without dead ends: 136 [2018-01-25 06:10:00,376 INFO L525 BasicCegarLoop]: 2 DeclaredPredicates, 34 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=127, Invalid=341, Unknown=2, NotChecked=82, Total=552 [2018-01-25 06:10:00,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-01-25 06:10:00,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 111. [2018-01-25 06:10:00,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-01-25 06:10:00,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 128 transitions. [2018-01-25 06:10:00,397 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 128 transitions. Word has length 26 [2018-01-25 06:10:00,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:10:00,397 INFO L432 AbstractCegarLoop]: Abstraction has 111 states and 128 transitions. [2018-01-25 06:10:00,397 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-25 06:10:00,398 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 128 transitions. [2018-01-25 06:10:00,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-25 06:10:00,399 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:10:00,399 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, 1] [2018-01-25 06:10:00,399 INFO L371 AbstractCegarLoop]: === Iteration 6 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation, probe_19Err4RequiresViolation, probe_19Err2RequiresViolation, probe_19Err3RequiresViolation, probe_19Err7RequiresViolation, probe_19Err5RequiresViolation, probe_19Err1RequiresViolation, probe_19Err0RequiresViolation, probe_19Err6RequiresViolation]=== [2018-01-25 06:10:00,399 INFO L82 PathProgramCache]: Analyzing trace with hash -1571443383, now seen corresponding path program 1 times [2018-01-25 06:10:00,399 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:10:00,401 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:10:00,401 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:10:00,401 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:10:00,402 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:10:00,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:10:00,415 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:10:00,476 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-25 06:10:00,476 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:10:00,476 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-25 06:10:00,476 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:10:00,476 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-25 06:10:00,477 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-25 06:10:00,477 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-25 06:10:00,477 INFO L87 Difference]: Start difference. First operand 111 states and 128 transitions. Second operand 8 states. [2018-01-25 06:10:00,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:10:00,705 INFO L93 Difference]: Finished difference Result 125 states and 144 transitions. [2018-01-25 06:10:00,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-25 06:10:00,705 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 26 [2018-01-25 06:10:00,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:10:00,707 INFO L225 Difference]: With dead ends: 125 [2018-01-25 06:10:00,707 INFO L226 Difference]: Without dead ends: 124 [2018-01-25 06:10:00,707 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-01-25 06:10:00,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-01-25 06:10:00,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 119. [2018-01-25 06:10:00,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-01-25 06:10:00,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 138 transitions. [2018-01-25 06:10:00,746 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 138 transitions. Word has length 26 [2018-01-25 06:10:00,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:10:00,746 INFO L432 AbstractCegarLoop]: Abstraction has 119 states and 138 transitions. [2018-01-25 06:10:00,747 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-25 06:10:00,747 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 138 transitions. [2018-01-25 06:10:00,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-25 06:10:00,748 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:10:00,748 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, 1] [2018-01-25 06:10:00,748 INFO L371 AbstractCegarLoop]: === Iteration 7 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation, probe_19Err4RequiresViolation, probe_19Err2RequiresViolation, probe_19Err3RequiresViolation, probe_19Err7RequiresViolation, probe_19Err5RequiresViolation, probe_19Err1RequiresViolation, probe_19Err0RequiresViolation, probe_19Err6RequiresViolation]=== [2018-01-25 06:10:00,748 INFO L82 PathProgramCache]: Analyzing trace with hash -1571443382, now seen corresponding path program 1 times [2018-01-25 06:10:00,748 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:10:00,750 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:10:00,750 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:10:00,750 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:10:00,750 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:10:00,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:10:00,764 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:10:00,808 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-25 06:10:00,808 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:10:00,808 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-25 06:10:00,808 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:10:00,809 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 06:10:00,809 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 06:10:00,809 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-25 06:10:00,809 INFO L87 Difference]: Start difference. First operand 119 states and 138 transitions. Second operand 6 states. [2018-01-25 06:10:00,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:10:00,845 INFO L93 Difference]: Finished difference Result 147 states and 163 transitions. [2018-01-25 06:10:00,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 06:10:00,845 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-01-25 06:10:00,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:10:00,846 INFO L225 Difference]: With dead ends: 147 [2018-01-25 06:10:00,846 INFO L226 Difference]: Without dead ends: 106 [2018-01-25 06:10:00,846 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-01-25 06:10:00,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-01-25 06:10:00,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 97. [2018-01-25 06:10:00,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-01-25 06:10:00,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 105 transitions. [2018-01-25 06:10:00,864 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 105 transitions. Word has length 26 [2018-01-25 06:10:00,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:10:00,864 INFO L432 AbstractCegarLoop]: Abstraction has 97 states and 105 transitions. [2018-01-25 06:10:00,864 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 06:10:00,864 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 105 transitions. [2018-01-25 06:10:00,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-25 06:10:00,865 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:10:00,865 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] [2018-01-25 06:10:00,865 INFO L371 AbstractCegarLoop]: === Iteration 8 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation, probe_19Err4RequiresViolation, probe_19Err2RequiresViolation, probe_19Err3RequiresViolation, probe_19Err7RequiresViolation, probe_19Err5RequiresViolation, probe_19Err1RequiresViolation, probe_19Err0RequiresViolation, probe_19Err6RequiresViolation]=== [2018-01-25 06:10:00,866 INFO L82 PathProgramCache]: Analyzing trace with hash 1472265041, now seen corresponding path program 1 times [2018-01-25 06:10:00,866 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:10:00,867 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:10:00,867 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:10:00,867 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:10:00,867 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:10:00,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:10:00,880 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:10:00,936 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:10:00,936 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:10:00,936 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 06:10:00,936 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:10:00,937 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 06:10:00,937 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 06:10:00,937 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-25 06:10:00,937 INFO L87 Difference]: Start difference. First operand 97 states and 105 transitions. Second operand 6 states. [2018-01-25 06:10:01,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:10:01,126 INFO L93 Difference]: Finished difference Result 118 states and 132 transitions. [2018-01-25 06:10:01,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-25 06:10:01,126 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2018-01-25 06:10:01,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:10:01,127 INFO L225 Difference]: With dead ends: 118 [2018-01-25 06:10:01,127 INFO L226 Difference]: Without dead ends: 116 [2018-01-25 06:10:01,127 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-01-25 06:10:01,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-01-25 06:10:01,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 97. [2018-01-25 06:10:01,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-01-25 06:10:01,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 106 transitions. [2018-01-25 06:10:01,140 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 106 transitions. Word has length 28 [2018-01-25 06:10:01,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:10:01,140 INFO L432 AbstractCegarLoop]: Abstraction has 97 states and 106 transitions. [2018-01-25 06:10:01,140 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 06:10:01,140 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 106 transitions. [2018-01-25 06:10:01,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-25 06:10:01,141 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:10:01,141 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] [2018-01-25 06:10:01,141 INFO L371 AbstractCegarLoop]: === Iteration 9 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation, probe_19Err4RequiresViolation, probe_19Err2RequiresViolation, probe_19Err3RequiresViolation, probe_19Err7RequiresViolation, probe_19Err5RequiresViolation, probe_19Err1RequiresViolation, probe_19Err0RequiresViolation, probe_19Err6RequiresViolation]=== [2018-01-25 06:10:01,141 INFO L82 PathProgramCache]: Analyzing trace with hash 1472265042, now seen corresponding path program 1 times [2018-01-25 06:10:01,141 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:10:01,142 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:10:01,142 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:10:01,142 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:10:01,142 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:10:01,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:10:01,155 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:10:01,238 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:10:01,239 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:10:01,239 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-25 06:10:01,239 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:10:01,239 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-25 06:10:01,240 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-25 06:10:01,240 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-01-25 06:10:01,240 INFO L87 Difference]: Start difference. First operand 97 states and 106 transitions. Second operand 9 states. [2018-01-25 06:10:01,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:10:01,527 INFO L93 Difference]: Finished difference Result 118 states and 131 transitions. [2018-01-25 06:10:01,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-25 06:10:01,527 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 28 [2018-01-25 06:10:01,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:10:01,528 INFO L225 Difference]: With dead ends: 118 [2018-01-25 06:10:01,528 INFO L226 Difference]: Without dead ends: 116 [2018-01-25 06:10:01,529 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2018-01-25 06:10:01,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-01-25 06:10:01,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 99. [2018-01-25 06:10:01,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-01-25 06:10:01,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 107 transitions. [2018-01-25 06:10:01,542 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 107 transitions. Word has length 28 [2018-01-25 06:10:01,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:10:01,542 INFO L432 AbstractCegarLoop]: Abstraction has 99 states and 107 transitions. [2018-01-25 06:10:01,542 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-25 06:10:01,542 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 107 transitions. [2018-01-25 06:10:01,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-25 06:10:01,543 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:10:01,544 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 06:10:01,544 INFO L371 AbstractCegarLoop]: === Iteration 10 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation, probe_19Err4RequiresViolation, probe_19Err2RequiresViolation, probe_19Err3RequiresViolation, probe_19Err7RequiresViolation, probe_19Err5RequiresViolation, probe_19Err1RequiresViolation, probe_19Err0RequiresViolation, probe_19Err6RequiresViolation]=== [2018-01-25 06:10:01,544 INFO L82 PathProgramCache]: Analyzing trace with hash 1711860499, now seen corresponding path program 1 times [2018-01-25 06:10:01,544 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:10:01,545 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:10:01,545 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:10:01,546 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:10:01,546 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:10:01,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:10:01,559 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:10:01,728 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:10:01,728 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:10:01,728 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-25 06:10:01,728 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:10:01,729 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-25 06:10:01,729 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-25 06:10:01,729 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-25 06:10:01,729 INFO L87 Difference]: Start difference. First operand 99 states and 107 transitions. Second operand 8 states. [2018-01-25 06:10:01,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:10:01,955 INFO L93 Difference]: Finished difference Result 122 states and 135 transitions. [2018-01-25 06:10:01,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-25 06:10:01,955 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 30 [2018-01-25 06:10:01,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:10:01,956 INFO L225 Difference]: With dead ends: 122 [2018-01-25 06:10:01,957 INFO L226 Difference]: Without dead ends: 121 [2018-01-25 06:10:01,957 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-01-25 06:10:01,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-01-25 06:10:01,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 98. [2018-01-25 06:10:01,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-01-25 06:10:01,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 106 transitions. [2018-01-25 06:10:01,969 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 106 transitions. Word has length 30 [2018-01-25 06:10:01,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:10:01,969 INFO L432 AbstractCegarLoop]: Abstraction has 98 states and 106 transitions. [2018-01-25 06:10:01,970 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-25 06:10:01,970 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 106 transitions. [2018-01-25 06:10:01,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-25 06:10:01,971 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:10:01,971 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 06:10:01,971 INFO L371 AbstractCegarLoop]: === Iteration 11 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation, probe_19Err4RequiresViolation, probe_19Err2RequiresViolation, probe_19Err3RequiresViolation, probe_19Err7RequiresViolation, probe_19Err5RequiresViolation, probe_19Err1RequiresViolation, probe_19Err0RequiresViolation, probe_19Err6RequiresViolation]=== [2018-01-25 06:10:01,971 INFO L82 PathProgramCache]: Analyzing trace with hash 1711860500, now seen corresponding path program 1 times [2018-01-25 06:10:01,971 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:10:01,973 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:10:01,973 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:10:01,973 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:10:01,973 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:10:01,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:10:01,988 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:10:02,123 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:10:02,124 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:10:02,124 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-01-25 06:10:02,124 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:10:02,124 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-25 06:10:02,124 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-25 06:10:02,125 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-01-25 06:10:02,125 INFO L87 Difference]: Start difference. First operand 98 states and 106 transitions. Second operand 12 states. [2018-01-25 06:10:02,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:10:02,496 INFO L93 Difference]: Finished difference Result 130 states and 142 transitions. [2018-01-25 06:10:02,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-01-25 06:10:02,496 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 30 [2018-01-25 06:10:02,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:10:02,497 INFO L225 Difference]: With dead ends: 130 [2018-01-25 06:10:02,497 INFO L226 Difference]: Without dead ends: 128 [2018-01-25 06:10:02,498 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=106, Invalid=446, Unknown=0, NotChecked=0, Total=552 [2018-01-25 06:10:02,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-01-25 06:10:02,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 93. [2018-01-25 06:10:02,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-01-25 06:10:02,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 101 transitions. [2018-01-25 06:10:02,514 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 101 transitions. Word has length 30 [2018-01-25 06:10:02,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:10:02,515 INFO L432 AbstractCegarLoop]: Abstraction has 93 states and 101 transitions. [2018-01-25 06:10:02,515 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-25 06:10:02,515 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 101 transitions. [2018-01-25 06:10:02,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-25 06:10:02,516 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:10:02,517 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, 1, 1, 1] [2018-01-25 06:10:02,517 INFO L371 AbstractCegarLoop]: === Iteration 12 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation, probe_19Err4RequiresViolation, probe_19Err2RequiresViolation, probe_19Err3RequiresViolation, probe_19Err7RequiresViolation, probe_19Err5RequiresViolation, probe_19Err1RequiresViolation, probe_19Err0RequiresViolation, probe_19Err6RequiresViolation]=== [2018-01-25 06:10:02,517 INFO L82 PathProgramCache]: Analyzing trace with hash 1708399928, now seen corresponding path program 1 times [2018-01-25 06:10:02,517 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:10:02,518 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:10:02,518 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:10:02,518 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:10:02,519 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:10:02,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:10:02,527 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:10:02,612 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-25 06:10:02,612 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:10:02,613 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 06:10:02,613 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:10:02,613 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 06:10:02,613 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 06:10:02,614 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 06:10:02,614 INFO L87 Difference]: Start difference. First operand 93 states and 101 transitions. Second operand 4 states. [2018-01-25 06:10:02,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:10:02,772 INFO L93 Difference]: Finished difference Result 110 states and 118 transitions. [2018-01-25 06:10:02,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 06:10:02,773 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2018-01-25 06:10:02,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:10:02,774 INFO L225 Difference]: With dead ends: 110 [2018-01-25 06:10:02,774 INFO L226 Difference]: Without dead ends: 93 [2018-01-25 06:10:02,774 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-25 06:10:02,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-01-25 06:10:02,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 87. [2018-01-25 06:10:02,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-01-25 06:10:02,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 94 transitions. [2018-01-25 06:10:02,785 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 94 transitions. Word has length 28 [2018-01-25 06:10:02,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:10:02,785 INFO L432 AbstractCegarLoop]: Abstraction has 87 states and 94 transitions. [2018-01-25 06:10:02,785 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 06:10:02,785 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 94 transitions. [2018-01-25 06:10:02,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-25 06:10:02,786 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:10:02,786 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, 1, 1, 1, 1, 1] [2018-01-25 06:10:02,786 INFO L371 AbstractCegarLoop]: === Iteration 13 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation, probe_19Err4RequiresViolation, probe_19Err2RequiresViolation, probe_19Err3RequiresViolation, probe_19Err7RequiresViolation, probe_19Err5RequiresViolation, probe_19Err1RequiresViolation, probe_19Err0RequiresViolation, probe_19Err6RequiresViolation]=== [2018-01-25 06:10:02,787 INFO L82 PathProgramCache]: Analyzing trace with hash -526031434, now seen corresponding path program 1 times [2018-01-25 06:10:02,787 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:10:02,788 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:10:02,788 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:10:02,788 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:10:02,788 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:10:02,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:10:02,795 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:10:02,895 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-25 06:10:02,895 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:10:02,895 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-25 06:10:02,895 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:10:02,895 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-25 06:10:02,895 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-25 06:10:02,896 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-25 06:10:02,896 INFO L87 Difference]: Start difference. First operand 87 states and 94 transitions. Second operand 7 states. [2018-01-25 06:10:02,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:10:02,947 INFO L93 Difference]: Finished difference Result 93 states and 99 transitions. [2018-01-25 06:10:02,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-25 06:10:02,948 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2018-01-25 06:10:02,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:10:02,949 INFO L225 Difference]: With dead ends: 93 [2018-01-25 06:10:02,950 INFO L226 Difference]: Without dead ends: 82 [2018-01-25 06:10:02,950 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-01-25 06:10:02,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-01-25 06:10:02,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2018-01-25 06:10:02,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-01-25 06:10:02,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 88 transitions. [2018-01-25 06:10:02,964 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 88 transitions. Word has length 30 [2018-01-25 06:10:02,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:10:02,964 INFO L432 AbstractCegarLoop]: Abstraction has 82 states and 88 transitions. [2018-01-25 06:10:02,964 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-25 06:10:02,964 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 88 transitions. [2018-01-25 06:10:02,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-25 06:10:02,965 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:10:02,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-25 06:10:02,965 INFO L371 AbstractCegarLoop]: === Iteration 14 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation, probe_19Err4RequiresViolation, probe_19Err2RequiresViolation, probe_19Err3RequiresViolation, probe_19Err7RequiresViolation, probe_19Err5RequiresViolation, probe_19Err1RequiresViolation, probe_19Err0RequiresViolation, probe_19Err6RequiresViolation]=== [2018-01-25 06:10:02,965 INFO L82 PathProgramCache]: Analyzing trace with hash 850149805, now seen corresponding path program 1 times [2018-01-25 06:10:02,965 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:10:02,966 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:10:02,967 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:10:02,967 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:10:02,967 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:10:02,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:10:02,978 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:10:03,023 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-25 06:10:03,024 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:10:03,024 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 06:10:03,024 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:10:03,024 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 06:10:03,024 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 06:10:03,025 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 06:10:03,025 INFO L87 Difference]: Start difference. First operand 82 states and 88 transitions. Second operand 5 states. [2018-01-25 06:10:03,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:10:03,053 INFO L93 Difference]: Finished difference Result 126 states and 133 transitions. [2018-01-25 06:10:03,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 06:10:03,054 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2018-01-25 06:10:03,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:10:03,055 INFO L225 Difference]: With dead ends: 126 [2018-01-25 06:10:03,056 INFO L226 Difference]: Without dead ends: 88 [2018-01-25 06:10:03,056 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 06:10:03,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-01-25 06:10:03,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 86. [2018-01-25 06:10:03,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-01-25 06:10:03,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 92 transitions. [2018-01-25 06:10:03,074 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 92 transitions. Word has length 37 [2018-01-25 06:10:03,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:10:03,074 INFO L432 AbstractCegarLoop]: Abstraction has 86 states and 92 transitions. [2018-01-25 06:10:03,075 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 06:10:03,075 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 92 transitions. [2018-01-25 06:10:03,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-25 06:10:03,075 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:10:03,076 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-25 06:10:03,076 INFO L371 AbstractCegarLoop]: === Iteration 15 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation, probe_19Err4RequiresViolation, probe_19Err2RequiresViolation, probe_19Err3RequiresViolation, probe_19Err7RequiresViolation, probe_19Err5RequiresViolation, probe_19Err1RequiresViolation, probe_19Err0RequiresViolation, probe_19Err6RequiresViolation]=== [2018-01-25 06:10:03,076 INFO L82 PathProgramCache]: Analyzing trace with hash 1737653486, now seen corresponding path program 1 times [2018-01-25 06:10:03,076 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:10:03,077 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:10:03,077 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:10:03,077 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:10:03,078 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:10:03,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:10:03,091 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:10:03,413 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-25 06:10:03,413 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:10:03,413 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 06:10:03,414 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 38 with the following transitions: [2018-01-25 06:10:03,414 INFO L201 CegarAbsIntRunner]: [24], [26], [29], [30], [36], [37], [38], [41], [42], [43], [44], [45], [46], [47], [51], [64], [66], [69], [70], [77], [79], [82], [94], [98], [106], [108], [109], [110], [111], [112], [114], [118], [119], [120], [121] [2018-01-25 06:10:03,415 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 06:10:03,415 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 06:10:04,478 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-25 06:10:04,478 INFO L268 AbstractInterpreter]: Visited 35 different actions 53 times. Merged at 10 different actions 12 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-01-25 06:10:04,489 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-25 06:10:04,489 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:10:04,489 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-25 06:10:04,505 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:10:04,505 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 06:10:04,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:10:04,549 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 06:10:04,724 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-25 06:10:04,725 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 10 treesize of output 9 [2018-01-25 06:10:04,726 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 06:10:04,728 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 06:10:04,729 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-25 06:10:04,729 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-01-25 06:10:05,067 WARN L1029 $PredicateComparison]: unable to prove that (exists ((f19_~a.offset Int)) (= (store |c_old(#memory_$Pointer$.offset)| |c_f19_#in~a.base| (store (select |c_old(#memory_$Pointer$.offset)| |c_f19_#in~a.base|) f19_~a.offset 0)) |c_#memory_$Pointer$.offset|)) is different from true [2018-01-25 06:10:05,076 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 21 treesize of output 16 [2018-01-25 06:10:05,119 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 16 treesize of output 17 [2018-01-25 06:10:05,120 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 06:10:05,123 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 06:10:05,126 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 1 xjuncts. [2018-01-25 06:10:05,127 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:17 [2018-01-25 06:10:05,202 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 19 treesize of output 15 [2018-01-25 06:10:05,212 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 15 treesize of output 3 [2018-01-25 06:10:05,212 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 06:10:05,239 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 06:10:05,241 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-25 06:10:05,241 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-01-25 06:10:05,243 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-25 06:10:05,244 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 06:10:05,826 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 32 treesize of output 28 [2018-01-25 06:10:05,828 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.UnsupportedOperationException: alternation not yet supported at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.applyNonSddEliminations(ElimStorePlain.java:347) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:223) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.elimAllRec(ElimStorePlain.java:199) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:270) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:243) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:445) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:421) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:292) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:328) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:237) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:185) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseTaipanRefinementStrategy.getTraceCheck(BaseTaipanRefinementStrategy.java:213) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:231) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:205) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:381) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:316) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:294) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:149) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:113) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:117) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:324) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.runToolchainDefault(DefaultToolchainJob.java:221) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.BasicToolchainJob.run(BasicToolchainJob.java:134) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-01-25 06:10:05,831 INFO L168 Benchmark]: Toolchain (without parser) took 16243.34 ms. Allocated memory was 304.1 MB in the beginning and 915.9 MB in the end (delta: 611.8 MB). Free memory was 263.2 MB in the beginning and 424.7 MB in the end (delta: -161.5 MB). Peak memory consumption was 450.3 MB. Max. memory is 5.3 GB. [2018-01-25 06:10:05,832 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 304.1 MB. Free memory is still 270.1 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-25 06:10:05,832 INFO L168 Benchmark]: CACSL2BoogieTranslator took 228.07 ms. Allocated memory is still 304.1 MB. Free memory was 263.2 MB in the beginning and 249.2 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 5.3 GB. [2018-01-25 06:10:05,832 INFO L168 Benchmark]: Boogie Preprocessor took 42.69 ms. Allocated memory is still 304.1 MB. Free memory was 249.2 MB in the beginning and 248.2 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 5.3 GB. [2018-01-25 06:10:05,833 INFO L168 Benchmark]: RCFGBuilder took 360.65 ms. Allocated memory is still 304.1 MB. Free memory was 248.2 MB in the beginning and 224.3 MB in the end (delta: 23.9 MB). Peak memory consumption was 23.9 MB. Max. memory is 5.3 GB. [2018-01-25 06:10:05,833 INFO L168 Benchmark]: TraceAbstraction took 15603.30 ms. Allocated memory was 304.1 MB in the beginning and 915.9 MB in the end (delta: 611.8 MB). Free memory was 224.3 MB in the beginning and 424.7 MB in the end (delta: -200.4 MB). Peak memory consumption was 411.5 MB. Max. memory is 5.3 GB. [2018-01-25 06:10:05,834 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.12 ms. Allocated memory is still 304.1 MB. Free memory is still 270.1 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 228.07 ms. Allocated memory is still 304.1 MB. Free memory was 263.2 MB in the beginning and 249.2 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 42.69 ms. Allocated memory is still 304.1 MB. Free memory was 249.2 MB in the beginning and 248.2 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 5.3 GB. * RCFGBuilder took 360.65 ms. Allocated memory is still 304.1 MB. Free memory was 248.2 MB in the beginning and 224.3 MB in the end (delta: 23.9 MB). Peak memory consumption was 23.9 MB. Max. memory is 5.3 GB. * TraceAbstraction took 15603.30 ms. Allocated memory was 304.1 MB in the beginning and 915.9 MB in the end (delta: 611.8 MB). Free memory was 224.3 MB in the beginning and 424.7 MB in the end (delta: -200.4 MB). Peak memory consumption was 411.5 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 17 LocStat_MAX_WEQGRAPH_SIZE : 2 LocStat_MAX_SIZEOF_WEQEDGELABEL : 2 LocStat_NO_SUPPORTING_EQUALITIES : 143 LocStat_NO_SUPPORTING_DISEQUALITIES : 20 LocStat_NO_DISJUNCTIONS : -34 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 28 TransStat_MAX_WEQGRAPH_SIZE : 4 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 59 TransStat_NO_SUPPORTING_DISEQUALITIES : 6 TransStat_NO_DISJUNCTIONS : 29 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 3.299043 RENAME_VARIABLES(MILLISECONDS) : 2.295478 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 1.485568 PROJECTAWAY(MILLISECONDS) : 0.022038 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.151582 DISJOIN(MILLISECONDS) : 0.000000 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 2.366644 ADD_EQUALITY(MILLISECONDS) : 0.046002 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.009264 #CONJOIN_DISJUNCTIVE : 37 #RENAME_VARIABLES : 53 #UNFREEZE : 0 #CONJOIN : 85 #PROJECTAWAY : 55 #ADD_WEAK_EQUALITY : 7 #DISJOIN : 0 #RENAME_VARIABLES_DISJUNCTIVE : 52 #ADD_EQUALITY : 61 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 3 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 33 LocStat_MAX_WEQGRAPH_SIZE : 4 LocStat_MAX_SIZEOF_WEQEDGELABEL : 2 LocStat_NO_SUPPORTING_EQUALITIES : 342 LocStat_NO_SUPPORTING_DISEQUALITIES : 96 LocStat_NO_DISJUNCTIONS : -66 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 47 TransStat_MAX_WEQGRAPH_SIZE : 4 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 94 TransStat_NO_SUPPORTING_DISEQUALITIES : 11 TransStat_NO_DISJUNCTIONS : 48 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 14.638606 RENAME_VARIABLES(MILLISECONDS) : 1.423315 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 14.595834 PROJECTAWAY(MILLISECONDS) : 0.102227 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.035167 DISJOIN(MILLISECONDS) : 0.463329 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 1.447979 ADD_EQUALITY(MILLISECONDS) : 0.019932 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.008415 #CONJOIN_DISJUNCTIVE : 96 #RENAME_VARIABLES : 171 #UNFREEZE : 0 #CONJOIN : 194 #PROJECTAWAY : 145 #ADD_WEAK_EQUALITY : 13 #DISJOIN : 18 #RENAME_VARIABLES_DISJUNCTIVE : 168 #ADD_EQUALITY : 98 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 7 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: UnsupportedOperationException: alternation not yet supported de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: UnsupportedOperationException: alternation not yet supported: de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.applyNonSddEliminations(ElimStorePlain.java:347) RESULT: Ultimate could not prove your program: Toolchain returned no result. Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test19_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-25_06-10-05-843.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test19_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-VPDomainBenchmark-0-2018-01-25_06-10-05-843.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test19_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-0-2018-01-25_06-10-05-843.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test19_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-VPDomainBenchmark-1-2018-01-25_06-10-05-843.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test19_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-1-2018-01-25_06-10-05-843.csv Received shutdown request...