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/memsafety/test-0504_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-25 05:43:25,514 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-25 05:43:25,539 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-25 05:43:25,551 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-25 05:43:25,551 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-25 05:43:25,552 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-25 05:43:25,553 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-25 05:43:25,555 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-25 05:43:25,557 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-25 05:43:25,558 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-25 05:43:25,559 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-25 05:43:25,559 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-25 05:43:25,560 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-25 05:43:25,562 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-25 05:43:25,562 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-25 05:43:25,565 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-25 05:43:25,567 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-25 05:43:25,569 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-25 05:43:25,570 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-25 05:43:25,571 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-25 05:43:25,573 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-25 05:43:25,574 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-25 05:43:25,574 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-25 05:43:25,575 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-25 05:43:25,575 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-25 05:43:25,577 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-25 05:43:25,577 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-25 05:43:25,577 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-25 05:43:25,578 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-25 05:43:25,578 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-25 05:43:25,578 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-25 05:43:25,579 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 05:43:25,588 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-25 05:43:25,589 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-25 05:43:25,590 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-25 05:43:25,590 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-25 05:43:25,590 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-25 05:43:25,590 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-25 05:43:25,590 INFO L133 SettingsManager]: * Precise comparison operator=true [2018-01-25 05:43:25,591 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-25 05:43:25,591 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-25 05:43:25,592 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-25 05:43:25,592 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-25 05:43:25,592 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-25 05:43:25,592 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-25 05:43:25,592 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-25 05:43:25,593 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-25 05:43:25,593 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-25 05:43:25,593 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-25 05:43:25,593 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-25 05:43:25,593 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-25 05:43:25,594 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-25 05:43:25,594 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-25 05:43:25,594 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-25 05:43:25,594 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-25 05:43:25,594 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-25 05:43:25,595 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-25 05:43:25,595 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-25 05:43:25,595 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-25 05:43:25,595 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-25 05:43:25,595 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-25 05:43:25,596 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-25 05:43:25,596 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-25 05:43:25,596 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-25 05:43:25,596 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-25 05:43:25,596 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-25 05:43:25,597 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-25 05:43:25,597 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-25 05:43:25,632 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-25 05:43:25,645 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-25 05:43:25,649 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-25 05:43:25,651 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-25 05:43:25,651 INFO L276 PluginConnector]: CDTParser initialized [2018-01-25 05:43:25,652 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/test-0504_true-valid-memsafety.i [2018-01-25 05:43:25,844 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-25 05:43:25,851 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-25 05:43:25,852 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-25 05:43:25,853 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-25 05:43:25,860 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-25 05:43:25,860 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 05:43:25" (1/1) ... [2018-01-25 05:43:25,863 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53cecf25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:43:25, skipping insertion in model container [2018-01-25 05:43:25,863 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 05:43:25" (1/1) ... [2018-01-25 05:43:25,882 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 05:43:25,924 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 05:43:26,044 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 05:43:26,060 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 05:43:26,069 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:43:26 WrapperNode [2018-01-25 05:43:26,069 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-25 05:43:26,070 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-25 05:43:26,070 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-25 05:43:26,070 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-25 05:43:26,087 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:43:26" (1/1) ... [2018-01-25 05:43:26,087 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:43:26" (1/1) ... [2018-01-25 05:43:26,098 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:43:26" (1/1) ... [2018-01-25 05:43:26,098 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:43:26" (1/1) ... [2018-01-25 05:43:26,103 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:43:26" (1/1) ... [2018-01-25 05:43:26,106 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:43:26" (1/1) ... [2018-01-25 05:43:26,108 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:43:26" (1/1) ... [2018-01-25 05:43:26,111 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-25 05:43:26,112 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-25 05:43:26,112 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-25 05:43:26,112 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-25 05:43:26,113 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:43:26" (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 05:43:26,158 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-25 05:43:26,158 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-25 05:43:26,159 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-25 05:43:26,159 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-25 05:43:26,159 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-25 05:43:26,159 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-25 05:43:26,159 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-25 05:43:26,159 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-25 05:43:26,159 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-25 05:43:26,159 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-25 05:43:26,160 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-25 05:43:26,160 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-25 05:43:26,160 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-01-25 05:43:26,160 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-25 05:43:26,160 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-25 05:43:26,160 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-25 05:43:26,160 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-25 05:43:26,547 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-25 05:43:26,548 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 05:43:26 BoogieIcfgContainer [2018-01-25 05:43:26,548 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-25 05:43:26,549 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-25 05:43:26,549 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-25 05:43:26,551 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-25 05:43:26,551 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.01 05:43:25" (1/3) ... [2018-01-25 05:43:26,553 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fd6c55e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 05:43:26, skipping insertion in model container [2018-01-25 05:43:26,553 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:43:26" (2/3) ... [2018-01-25 05:43:26,553 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fd6c55e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 05:43:26, skipping insertion in model container [2018-01-25 05:43:26,554 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 05:43:26" (3/3) ... [2018-01-25 05:43:26,556 INFO L105 eAbstractionObserver]: Analyzing ICFG test-0504_true-valid-memsafety.i [2018-01-25 05:43:26,562 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-25 05:43:26,569 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 39 error locations. [2018-01-25 05:43:26,614 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-25 05:43:26,614 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-25 05:43:26,614 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-25 05:43:26,614 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-25 05:43:26,614 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-25 05:43:26,614 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-25 05:43:26,614 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-25 05:43:26,615 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-25 05:43:26,615 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-25 05:43:26,633 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states. [2018-01-25 05:43:26,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-01-25 05:43:26,639 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:43:26,640 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:43:26,640 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-25 05:43:26,644 INFO L82 PathProgramCache]: Analyzing trace with hash 23857872, now seen corresponding path program 1 times [2018-01-25 05:43:26,646 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:43:26,689 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:43:26,690 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:43:26,690 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:43:26,690 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:43:26,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:43:26,735 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:43:26,762 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 05:43:26,764 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:43:26,764 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-25 05:43:26,764 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:43:26,767 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-25 05:43:26,777 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-25 05:43:26,777 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-25 05:43:26,779 INFO L87 Difference]: Start difference. First operand 94 states. Second operand 2 states. [2018-01-25 05:43:26,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:43:26,886 INFO L93 Difference]: Finished difference Result 182 states and 202 transitions. [2018-01-25 05:43:26,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-25 05:43:26,888 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-01-25 05:43:26,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:43:26,899 INFO L225 Difference]: With dead ends: 182 [2018-01-25 05:43:26,900 INFO L226 Difference]: Without dead ends: 91 [2018-01-25 05:43:26,903 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-25 05:43:26,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-01-25 05:43:26,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2018-01-25 05:43:26,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-01-25 05:43:26,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 95 transitions. [2018-01-25 05:43:26,943 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 95 transitions. Word has length 10 [2018-01-25 05:43:26,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:43:26,944 INFO L432 AbstractCegarLoop]: Abstraction has 91 states and 95 transitions. [2018-01-25 05:43:26,944 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-25 05:43:26,944 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 95 transitions. [2018-01-25 05:43:26,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-01-25 05:43:26,945 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:43:26,945 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:43:26,945 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-25 05:43:26,945 INFO L82 PathProgramCache]: Analyzing trace with hash -1271008375, now seen corresponding path program 1 times [2018-01-25 05:43:26,946 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:43:26,947 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:43:26,947 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:43:26,947 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:43:26,947 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:43:26,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:43:26,961 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:43:27,004 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 05:43:27,005 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:43:27,005 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 05:43:27,005 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:43:27,007 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-25 05:43:27,007 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-25 05:43:27,008 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-25 05:43:27,008 INFO L87 Difference]: Start difference. First operand 91 states and 95 transitions. Second operand 3 states. [2018-01-25 05:43:27,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:43:27,049 INFO L93 Difference]: Finished difference Result 231 states and 243 transitions. [2018-01-25 05:43:27,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-25 05:43:27,050 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-01-25 05:43:27,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:43:27,052 INFO L225 Difference]: With dead ends: 231 [2018-01-25 05:43:27,053 INFO L226 Difference]: Without dead ends: 146 [2018-01-25 05:43:27,054 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-25 05:43:27,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-01-25 05:43:27,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 122. [2018-01-25 05:43:27,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-01-25 05:43:27,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 152 transitions. [2018-01-25 05:43:27,068 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 152 transitions. Word has length 12 [2018-01-25 05:43:27,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:43:27,069 INFO L432 AbstractCegarLoop]: Abstraction has 122 states and 152 transitions. [2018-01-25 05:43:27,069 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-25 05:43:27,069 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 152 transitions. [2018-01-25 05:43:27,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-25 05:43:27,069 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:43:27,070 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:43:27,070 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-25 05:43:27,070 INFO L82 PathProgramCache]: Analyzing trace with hash -746554717, now seen corresponding path program 1 times [2018-01-25 05:43:27,070 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:43:27,071 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:43:27,072 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:43:27,072 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:43:27,072 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:43:27,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:43:27,083 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:43:27,106 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 05:43:27,106 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:43:27,106 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-25 05:43:27,106 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:43:27,107 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-25 05:43:27,107 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-25 05:43:27,107 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-25 05:43:27,107 INFO L87 Difference]: Start difference. First operand 122 states and 152 transitions. Second operand 3 states. [2018-01-25 05:43:27,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:43:27,207 INFO L93 Difference]: Finished difference Result 125 states and 154 transitions. [2018-01-25 05:43:27,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-25 05:43:27,207 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-01-25 05:43:27,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:43:27,209 INFO L225 Difference]: With dead ends: 125 [2018-01-25 05:43:27,209 INFO L226 Difference]: Without dead ends: 120 [2018-01-25 05:43:27,210 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-25 05:43:27,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-01-25 05:43:27,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2018-01-25 05:43:27,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-01-25 05:43:27,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 149 transitions. [2018-01-25 05:43:27,220 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 149 transitions. Word has length 13 [2018-01-25 05:43:27,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:43:27,221 INFO L432 AbstractCegarLoop]: Abstraction has 120 states and 149 transitions. [2018-01-25 05:43:27,221 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-25 05:43:27,221 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 149 transitions. [2018-01-25 05:43:27,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-25 05:43:27,221 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:43:27,221 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:43:27,221 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-25 05:43:27,222 INFO L82 PathProgramCache]: Analyzing trace with hash -747420669, now seen corresponding path program 1 times [2018-01-25 05:43:27,222 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:43:27,222 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:43:27,223 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:43:27,223 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:43:27,223 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:43:27,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:43:27,235 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:43:27,272 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 05:43:27,272 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:43:27,272 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 05:43:27,273 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:43:27,273 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 05:43:27,273 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 05:43:27,273 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 05:43:27,274 INFO L87 Difference]: Start difference. First operand 120 states and 149 transitions. Second operand 4 states. [2018-01-25 05:43:27,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:43:27,415 INFO L93 Difference]: Finished difference Result 145 states and 175 transitions. [2018-01-25 05:43:27,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-25 05:43:27,416 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-01-25 05:43:27,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:43:27,417 INFO L225 Difference]: With dead ends: 145 [2018-01-25 05:43:27,417 INFO L226 Difference]: Without dead ends: 137 [2018-01-25 05:43:27,417 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 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 05:43:27,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-01-25 05:43:27,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 112. [2018-01-25 05:43:27,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-01-25 05:43:27,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 134 transitions. [2018-01-25 05:43:27,426 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 134 transitions. Word has length 13 [2018-01-25 05:43:27,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:43:27,427 INFO L432 AbstractCegarLoop]: Abstraction has 112 states and 134 transitions. [2018-01-25 05:43:27,427 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 05:43:27,427 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 134 transitions. [2018-01-25 05:43:27,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-25 05:43:27,428 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:43:27,428 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:43:27,428 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-25 05:43:27,428 INFO L82 PathProgramCache]: Analyzing trace with hash -747420668, now seen corresponding path program 1 times [2018-01-25 05:43:27,428 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:43:27,429 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:43:27,429 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:43:27,429 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:43:27,429 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:43:27,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:43:27,441 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:43:27,499 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 05:43:27,499 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:43:27,499 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 05:43:27,499 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:43:27,500 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 05:43:27,500 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 05:43:27,500 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 05:43:27,500 INFO L87 Difference]: Start difference. First operand 112 states and 134 transitions. Second operand 4 states. [2018-01-25 05:43:27,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:43:27,600 INFO L93 Difference]: Finished difference Result 158 states and 185 transitions. [2018-01-25 05:43:27,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-25 05:43:27,601 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-01-25 05:43:27,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:43:27,602 INFO L225 Difference]: With dead ends: 158 [2018-01-25 05:43:27,602 INFO L226 Difference]: Without dead ends: 152 [2018-01-25 05:43:27,602 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 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 05:43:27,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-01-25 05:43:27,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 113. [2018-01-25 05:43:27,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-01-25 05:43:27,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 134 transitions. [2018-01-25 05:43:27,611 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 134 transitions. Word has length 13 [2018-01-25 05:43:27,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:43:27,611 INFO L432 AbstractCegarLoop]: Abstraction has 113 states and 134 transitions. [2018-01-25 05:43:27,611 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 05:43:27,611 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 134 transitions. [2018-01-25 05:43:27,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-25 05:43:27,612 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:43:27,612 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:43:27,612 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-25 05:43:27,612 INFO L82 PathProgramCache]: Analyzing trace with hash 2050240790, now seen corresponding path program 1 times [2018-01-25 05:43:27,612 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:43:27,613 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:43:27,614 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:43:27,614 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:43:27,614 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:43:27,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:43:27,642 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:43:27,759 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 05:43:27,760 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:43:27,760 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 05:43:27,760 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:43:27,761 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 05:43:27,761 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 05:43:27,761 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-01-25 05:43:27,762 INFO L87 Difference]: Start difference. First operand 113 states and 134 transitions. Second operand 5 states. [2018-01-25 05:43:27,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:43:27,909 INFO L93 Difference]: Finished difference Result 201 states and 225 transitions. [2018-01-25 05:43:27,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-25 05:43:27,909 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2018-01-25 05:43:27,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:43:27,911 INFO L225 Difference]: With dead ends: 201 [2018-01-25 05:43:27,911 INFO L226 Difference]: Without dead ends: 198 [2018-01-25 05:43:27,911 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-01-25 05:43:27,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2018-01-25 05:43:27,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 104. [2018-01-25 05:43:27,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-01-25 05:43:27,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 119 transitions. [2018-01-25 05:43:27,922 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 119 transitions. Word has length 25 [2018-01-25 05:43:27,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:43:27,923 INFO L432 AbstractCegarLoop]: Abstraction has 104 states and 119 transitions. [2018-01-25 05:43:27,923 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 05:43:27,923 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 119 transitions. [2018-01-25 05:43:27,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-25 05:43:27,924 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:43:27,924 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 05:43:27,924 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-25 05:43:27,925 INFO L82 PathProgramCache]: Analyzing trace with hash -867044953, now seen corresponding path program 1 times [2018-01-25 05:43:27,925 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:43:27,926 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:43:27,926 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:43:27,926 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:43:27,926 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:43:27,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:43:27,946 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:43:28,001 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 05:43:28,001 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:43:28,002 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 05:43:28,002 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:43:28,002 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 05:43:28,002 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 05:43:28,003 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 05:43:28,003 INFO L87 Difference]: Start difference. First operand 104 states and 119 transitions. Second operand 4 states. [2018-01-25 05:43:28,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:43:28,213 INFO L93 Difference]: Finished difference Result 156 states and 176 transitions. [2018-01-25 05:43:28,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-25 05:43:28,213 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2018-01-25 05:43:28,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:43:28,214 INFO L225 Difference]: With dead ends: 156 [2018-01-25 05:43:28,214 INFO L226 Difference]: Without dead ends: 152 [2018-01-25 05:43:28,215 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 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 05:43:28,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-01-25 05:43:28,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 100. [2018-01-25 05:43:28,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-01-25 05:43:28,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 111 transitions. [2018-01-25 05:43:28,222 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 111 transitions. Word has length 26 [2018-01-25 05:43:28,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:43:28,223 INFO L432 AbstractCegarLoop]: Abstraction has 100 states and 111 transitions. [2018-01-25 05:43:28,223 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 05:43:28,223 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 111 transitions. [2018-01-25 05:43:28,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-25 05:43:28,224 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:43:28,224 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 05:43:28,224 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-25 05:43:28,225 INFO L82 PathProgramCache]: Analyzing trace with hash -867044952, now seen corresponding path program 1 times [2018-01-25 05:43:28,225 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:43:28,226 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:43:28,226 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:43:28,226 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:43:28,226 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:43:28,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:43:28,243 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:43:28,312 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 05:43:28,312 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:43:28,312 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 05:43:28,313 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:43:28,313 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 05:43:28,313 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 05:43:28,313 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 05:43:28,314 INFO L87 Difference]: Start difference. First operand 100 states and 111 transitions. Second operand 4 states. [2018-01-25 05:43:28,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:43:28,398 INFO L93 Difference]: Finished difference Result 144 states and 160 transitions. [2018-01-25 05:43:28,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-25 05:43:28,399 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2018-01-25 05:43:28,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:43:28,400 INFO L225 Difference]: With dead ends: 144 [2018-01-25 05:43:28,400 INFO L226 Difference]: Without dead ends: 140 [2018-01-25 05:43:28,401 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 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 05:43:28,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-01-25 05:43:28,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 96. [2018-01-25 05:43:28,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-01-25 05:43:28,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 103 transitions. [2018-01-25 05:43:28,408 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 103 transitions. Word has length 26 [2018-01-25 05:43:28,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:43:28,409 INFO L432 AbstractCegarLoop]: Abstraction has 96 states and 103 transitions. [2018-01-25 05:43:28,409 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 05:43:28,409 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 103 transitions. [2018-01-25 05:43:28,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-25 05:43:28,410 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:43:28,410 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 05:43:28,410 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-25 05:43:28,410 INFO L82 PathProgramCache]: Analyzing trace with hash -2023715676, now seen corresponding path program 1 times [2018-01-25 05:43:28,410 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:43:28,411 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:43:28,411 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:43:28,411 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:43:28,411 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:43:28,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:43:28,425 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:43:28,472 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:43:28,473 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:43:28,473 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 05:43:28,473 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:43:28,473 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 05:43:28,474 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 05:43:28,474 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 05:43:28,474 INFO L87 Difference]: Start difference. First operand 96 states and 103 transitions. Second operand 4 states. [2018-01-25 05:43:28,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:43:28,577 INFO L93 Difference]: Finished difference Result 123 states and 129 transitions. [2018-01-25 05:43:28,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 05:43:28,578 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2018-01-25 05:43:28,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:43:28,579 INFO L225 Difference]: With dead ends: 123 [2018-01-25 05:43:28,579 INFO L226 Difference]: Without dead ends: 122 [2018-01-25 05:43:28,579 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 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 05:43:28,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-01-25 05:43:28,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 99. [2018-01-25 05:43:28,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-01-25 05:43:28,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 108 transitions. [2018-01-25 05:43:28,585 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 108 transitions. Word has length 28 [2018-01-25 05:43:28,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:43:28,586 INFO L432 AbstractCegarLoop]: Abstraction has 99 states and 108 transitions. [2018-01-25 05:43:28,586 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 05:43:28,586 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 108 transitions. [2018-01-25 05:43:28,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-25 05:43:28,586 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:43:28,587 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 05:43:28,587 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-25 05:43:28,587 INFO L82 PathProgramCache]: Analyzing trace with hash -2023715675, now seen corresponding path program 1 times [2018-01-25 05:43:28,587 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:43:28,588 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:43:28,588 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:43:28,588 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:43:28,588 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:43:28,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:43:28,598 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:43:28,719 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:43:28,719 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:43:28,719 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 05:43:28,719 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:43:28,719 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 05:43:28,719 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 05:43:28,720 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 05:43:28,720 INFO L87 Difference]: Start difference. First operand 99 states and 108 transitions. Second operand 5 states. [2018-01-25 05:43:28,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:43:28,885 INFO L93 Difference]: Finished difference Result 177 states and 196 transitions. [2018-01-25 05:43:28,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 05:43:28,885 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2018-01-25 05:43:28,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:43:28,889 INFO L225 Difference]: With dead ends: 177 [2018-01-25 05:43:28,889 INFO L226 Difference]: Without dead ends: 176 [2018-01-25 05:43:28,890 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-01-25 05:43:28,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-01-25 05:43:28,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 129. [2018-01-25 05:43:28,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-01-25 05:43:28,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 147 transitions. [2018-01-25 05:43:28,902 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 147 transitions. Word has length 28 [2018-01-25 05:43:28,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:43:28,902 INFO L432 AbstractCegarLoop]: Abstraction has 129 states and 147 transitions. [2018-01-25 05:43:28,902 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 05:43:28,903 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 147 transitions. [2018-01-25 05:43:28,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-25 05:43:28,903 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:43:28,904 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] [2018-01-25 05:43:28,904 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-25 05:43:28,904 INFO L82 PathProgramCache]: Analyzing trace with hash 1689322728, now seen corresponding path program 1 times [2018-01-25 05:43:28,904 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:43:28,905 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:43:28,905 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:43:28,905 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:43:28,905 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:43:28,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:43:28,919 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:43:28,973 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:43:28,973 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:43:28,974 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 05:43:28,974 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:43:28,974 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 05:43:28,974 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 05:43:28,974 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 05:43:28,975 INFO L87 Difference]: Start difference. First operand 129 states and 147 transitions. Second operand 5 states. [2018-01-25 05:43:29,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:43:29,043 INFO L93 Difference]: Finished difference Result 223 states and 252 transitions. [2018-01-25 05:43:29,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 05:43:29,043 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2018-01-25 05:43:29,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:43:29,044 INFO L225 Difference]: With dead ends: 223 [2018-01-25 05:43:29,044 INFO L226 Difference]: Without dead ends: 133 [2018-01-25 05:43:29,045 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-01-25 05:43:29,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-01-25 05:43:29,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 125. [2018-01-25 05:43:29,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-01-25 05:43:29,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 137 transitions. [2018-01-25 05:43:29,054 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 137 transitions. Word has length 29 [2018-01-25 05:43:29,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:43:29,055 INFO L432 AbstractCegarLoop]: Abstraction has 125 states and 137 transitions. [2018-01-25 05:43:29,055 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 05:43:29,055 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 137 transitions. [2018-01-25 05:43:29,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-25 05:43:29,056 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:43:29,056 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] [2018-01-25 05:43:29,056 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-25 05:43:29,057 INFO L82 PathProgramCache]: Analyzing trace with hash -202845861, now seen corresponding path program 1 times [2018-01-25 05:43:29,057 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:43:29,057 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:43:29,057 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:43:29,058 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:43:29,058 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:43:29,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:43:29,073 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:43:29,158 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 05:43:29,158 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:43:29,158 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 05:43:29,158 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:43:29,159 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 05:43:29,159 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 05:43:29,159 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-25 05:43:29,159 INFO L87 Difference]: Start difference. First operand 125 states and 137 transitions. Second operand 6 states. [2018-01-25 05:43:29,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:43:29,341 INFO L93 Difference]: Finished difference Result 195 states and 213 transitions. [2018-01-25 05:43:29,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-25 05:43:29,341 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2018-01-25 05:43:29,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:43:29,342 INFO L225 Difference]: With dead ends: 195 [2018-01-25 05:43:29,342 INFO L226 Difference]: Without dead ends: 194 [2018-01-25 05:43:29,342 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-01-25 05:43:29,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-01-25 05:43:29,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 144. [2018-01-25 05:43:29,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-01-25 05:43:29,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 159 transitions. [2018-01-25 05:43:29,349 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 159 transitions. Word has length 29 [2018-01-25 05:43:29,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:43:29,350 INFO L432 AbstractCegarLoop]: Abstraction has 144 states and 159 transitions. [2018-01-25 05:43:29,350 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 05:43:29,350 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 159 transitions. [2018-01-25 05:43:29,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-25 05:43:29,351 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:43:29,351 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] [2018-01-25 05:43:29,351 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-25 05:43:29,351 INFO L82 PathProgramCache]: Analyzing trace with hash -202845860, now seen corresponding path program 1 times [2018-01-25 05:43:29,351 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:43:29,352 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:43:29,352 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:43:29,352 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:43:29,353 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:43:29,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:43:29,365 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:43:29,749 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 05:43:29,750 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:43:29,750 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-25 05:43:29,750 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:43:29,750 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-25 05:43:29,750 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-25 05:43:29,750 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-01-25 05:43:29,751 INFO L87 Difference]: Start difference. First operand 144 states and 159 transitions. Second operand 10 states. [2018-01-25 05:43:30,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:43:30,228 INFO L93 Difference]: Finished difference Result 222 states and 239 transitions. [2018-01-25 05:43:30,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-25 05:43:30,228 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 29 [2018-01-25 05:43:30,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:43:30,230 INFO L225 Difference]: With dead ends: 222 [2018-01-25 05:43:30,230 INFO L226 Difference]: Without dead ends: 221 [2018-01-25 05:43:30,230 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=85, Invalid=295, Unknown=0, NotChecked=0, Total=380 [2018-01-25 05:43:30,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2018-01-25 05:43:30,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 144. [2018-01-25 05:43:30,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-01-25 05:43:30,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 157 transitions. [2018-01-25 05:43:30,241 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 157 transitions. Word has length 29 [2018-01-25 05:43:30,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:43:30,242 INFO L432 AbstractCegarLoop]: Abstraction has 144 states and 157 transitions. [2018-01-25 05:43:30,242 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-25 05:43:30,242 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 157 transitions. [2018-01-25 05:43:30,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-25 05:43:30,243 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:43:30,243 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] [2018-01-25 05:43:30,243 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-25 05:43:30,244 INFO L82 PathProgramCache]: Analyzing trace with hash 829423013, now seen corresponding path program 1 times [2018-01-25 05:43:30,244 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:43:30,245 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:43:30,245 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:43:30,245 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:43:30,245 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:43:30,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:43:30,257 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:43:30,289 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-25 05:43:30,289 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:43:30,289 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 05:43:30,289 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:43:30,290 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 05:43:30,290 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 05:43:30,290 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 05:43:30,290 INFO L87 Difference]: Start difference. First operand 144 states and 157 transitions. Second operand 4 states. [2018-01-25 05:43:30,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:43:30,360 INFO L93 Difference]: Finished difference Result 156 states and 170 transitions. [2018-01-25 05:43:30,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 05:43:30,360 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 30 [2018-01-25 05:43:30,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:43:30,361 INFO L225 Difference]: With dead ends: 156 [2018-01-25 05:43:30,361 INFO L226 Difference]: Without dead ends: 154 [2018-01-25 05:43:30,361 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 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 05:43:30,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-01-25 05:43:30,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 146. [2018-01-25 05:43:30,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-01-25 05:43:30,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 161 transitions. [2018-01-25 05:43:30,370 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 161 transitions. Word has length 30 [2018-01-25 05:43:30,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:43:30,370 INFO L432 AbstractCegarLoop]: Abstraction has 146 states and 161 transitions. [2018-01-25 05:43:30,370 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 05:43:30,370 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 161 transitions. [2018-01-25 05:43:30,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-25 05:43:30,371 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:43:30,371 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] [2018-01-25 05:43:30,372 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-25 05:43:30,372 INFO L82 PathProgramCache]: Analyzing trace with hash 829423014, now seen corresponding path program 1 times [2018-01-25 05:43:30,372 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:43:30,373 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:43:30,373 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:43:30,373 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:43:30,373 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:43:30,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:43:30,383 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:43:30,485 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:43:30,486 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:43:30,486 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 05:43:30,486 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:43:30,486 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 05:43:30,486 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 05:43:30,486 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-25 05:43:30,486 INFO L87 Difference]: Start difference. First operand 146 states and 161 transitions. Second operand 6 states. [2018-01-25 05:43:30,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:43:30,687 INFO L93 Difference]: Finished difference Result 214 states and 235 transitions. [2018-01-25 05:43:30,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-25 05:43:30,687 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2018-01-25 05:43:30,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:43:30,688 INFO L225 Difference]: With dead ends: 214 [2018-01-25 05:43:30,688 INFO L226 Difference]: Without dead ends: 212 [2018-01-25 05:43:30,688 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-01-25 05:43:30,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2018-01-25 05:43:30,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 158. [2018-01-25 05:43:30,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-01-25 05:43:30,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 180 transitions. [2018-01-25 05:43:30,699 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 180 transitions. Word has length 30 [2018-01-25 05:43:30,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:43:30,699 INFO L432 AbstractCegarLoop]: Abstraction has 158 states and 180 transitions. [2018-01-25 05:43:30,699 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 05:43:30,699 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 180 transitions. [2018-01-25 05:43:30,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-25 05:43:30,700 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:43:30,700 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] [2018-01-25 05:43:30,700 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-25 05:43:30,701 INFO L82 PathProgramCache]: Analyzing trace with hash -664393622, now seen corresponding path program 1 times [2018-01-25 05:43:30,701 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:43:30,701 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:43:30,702 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:43:30,702 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:43:30,702 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:43:30,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:43:30,713 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:43:30,883 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:43:30,883 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:43:30,883 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-25 05:43:30,883 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:43:30,884 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-25 05:43:30,884 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-25 05:43:30,884 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-25 05:43:30,884 INFO L87 Difference]: Start difference. First operand 158 states and 180 transitions. Second operand 7 states. [2018-01-25 05:43:31,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:43:31,272 INFO L93 Difference]: Finished difference Result 253 states and 291 transitions. [2018-01-25 05:43:31,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-25 05:43:31,272 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2018-01-25 05:43:31,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:43:31,273 INFO L225 Difference]: With dead ends: 253 [2018-01-25 05:43:31,273 INFO L226 Difference]: Without dead ends: 220 [2018-01-25 05:43:31,274 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-01-25 05:43:31,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2018-01-25 05:43:31,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 169. [2018-01-25 05:43:31,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2018-01-25 05:43:31,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 192 transitions. [2018-01-25 05:43:31,288 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 192 transitions. Word has length 34 [2018-01-25 05:43:31,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:43:31,288 INFO L432 AbstractCegarLoop]: Abstraction has 169 states and 192 transitions. [2018-01-25 05:43:31,289 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-25 05:43:31,289 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 192 transitions. [2018-01-25 05:43:31,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-25 05:43:31,290 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:43:31,290 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:43:31,290 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-25 05:43:31,290 INFO L82 PathProgramCache]: Analyzing trace with hash -1742572463, now seen corresponding path program 1 times [2018-01-25 05:43:31,290 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:43:31,291 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:43:31,291 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:43:31,291 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:43:31,291 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:43:31,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:43:31,304 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:43:31,421 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:43:31,421 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:43:31,421 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 05:43:31,422 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 38 with the following transitions: [2018-01-25 05:43:31,423 INFO L201 CegarAbsIntRunner]: [0], [4], [6], [9], [11], [12], [13], [18], [20], [23], [26], [29], [32], [35], [39], [41], [44], [84], [100], [106], [107], [108], [110], [111], [114], [118], [122], [135], [144], [145], [149], [150], [151] [2018-01-25 05:43:31,466 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 05:43:31,466 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) Received shutdown request... [2018-01-25 05:44:28,823 WARN L571 FixpointEngine]: Received timeout, aborting fixpoint engine [2018-01-25 05:44:28,824 WARN L157 AbstractInterpreter]: Abstract interpretation run out of time [2018-01-25 05:44:28,825 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-25 05:44:28,825 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:44:28,825 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 05:44:28,834 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:44:28,834 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 05:44:28,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:44:28,880 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:44:28,889 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-01-25 05:44:28,890 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-25 05:44:28,896 WARN L187 ceAbstractionStarter]: Timeout [2018-01-25 05:44:28,896 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.01 05:44:28 BoogieIcfgContainer [2018-01-25 05:44:28,897 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-25 05:44:28,898 INFO L168 Benchmark]: Toolchain (without parser) took 63052.65 ms. Allocated memory was 299.4 MB in the beginning and 2.3 GB in the end (delta: 2.0 GB). Free memory was 259.4 MB in the beginning and 1.5 GB in the end (delta: -1.2 GB). Peak memory consumption was 786.6 MB. Max. memory is 5.3 GB. [2018-01-25 05:44:28,899 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 299.4 MB. Free memory is still 265.4 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-25 05:44:28,900 INFO L168 Benchmark]: CACSL2BoogieTranslator took 217.17 ms. Allocated memory is still 299.4 MB. Free memory was 258.4 MB in the beginning and 247.4 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 5.3 GB. [2018-01-25 05:44:28,900 INFO L168 Benchmark]: Boogie Preprocessor took 41.16 ms. Allocated memory is still 299.4 MB. Free memory was 247.4 MB in the beginning and 245.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-25 05:44:28,900 INFO L168 Benchmark]: RCFGBuilder took 436.45 ms. Allocated memory is still 299.4 MB. Free memory was 245.4 MB in the beginning and 217.8 MB in the end (delta: 27.6 MB). Peak memory consumption was 27.6 MB. Max. memory is 5.3 GB. [2018-01-25 05:44:28,901 INFO L168 Benchmark]: TraceAbstraction took 62347.92 ms. Allocated memory was 299.4 MB in the beginning and 2.3 GB in the end (delta: 2.0 GB). Free memory was 217.8 MB in the beginning and 1.5 GB in the end (delta: -1.2 GB). Peak memory consumption was 745.0 MB. Max. memory is 5.3 GB. [2018-01-25 05:44:28,903 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.23 ms. Allocated memory is still 299.4 MB. Free memory is still 265.4 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 217.17 ms. Allocated memory is still 299.4 MB. Free memory was 258.4 MB in the beginning and 247.4 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 41.16 ms. Allocated memory is still 299.4 MB. Free memory was 247.4 MB in the beginning and 245.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 436.45 ms. Allocated memory is still 299.4 MB. Free memory was 245.4 MB in the beginning and 217.8 MB in the end (delta: 27.6 MB). Peak memory consumption was 27.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 62347.92 ms. Allocated memory was 299.4 MB in the beginning and 2.3 GB in the end (delta: 2.0 GB). Free memory was 217.8 MB in the beginning and 1.5 GB in the end (delta: -1.2 GB). Peak memory consumption was 745.0 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 639). Cancelled while BasicCegarLoop was analyzing trace of length 38 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 647). Cancelled while BasicCegarLoop was analyzing trace of length 38 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 672). Cancelled while BasicCegarLoop was analyzing trace of length 38 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 665). Cancelled while BasicCegarLoop was analyzing trace of length 38 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 669). Cancelled while BasicCegarLoop was analyzing trace of length 38 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 659). Cancelled while BasicCegarLoop was analyzing trace of length 38 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 649). Cancelled while BasicCegarLoop was analyzing trace of length 38 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 651). Cancelled while BasicCegarLoop was analyzing trace of length 38 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 637). Cancelled while BasicCegarLoop was analyzing trace of length 38 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 650). Cancelled while BasicCegarLoop was analyzing trace of length 38 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 666). Cancelled while BasicCegarLoop was analyzing trace of length 38 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 665). Cancelled while BasicCegarLoop was analyzing trace of length 38 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was analyzing trace of length 38 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 648). Cancelled while BasicCegarLoop was analyzing trace of length 38 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 648). Cancelled while BasicCegarLoop was analyzing trace of length 38 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 658). Cancelled while BasicCegarLoop was analyzing trace of length 38 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was analyzing trace of length 38 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 647). Cancelled while BasicCegarLoop was analyzing trace of length 38 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 640). Cancelled while BasicCegarLoop was analyzing trace of length 38 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 670). Cancelled while BasicCegarLoop was analyzing trace of length 38 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 649). Cancelled while BasicCegarLoop was analyzing trace of length 38 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 651). Cancelled while BasicCegarLoop was analyzing trace of length 38 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 669). Cancelled while BasicCegarLoop was analyzing trace of length 38 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 659). Cancelled while BasicCegarLoop was analyzing trace of length 38 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 637). Cancelled while BasicCegarLoop was analyzing trace of length 38 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 648). Cancelled while BasicCegarLoop was analyzing trace of length 38 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 641). Cancelled while BasicCegarLoop was analyzing trace of length 38 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 620]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 620). Cancelled while BasicCegarLoop was analyzing trace of length 38 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 666). Cancelled while BasicCegarLoop was analyzing trace of length 38 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 640). Cancelled while BasicCegarLoop was analyzing trace of length 38 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 650). Cancelled while BasicCegarLoop was analyzing trace of length 38 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 647). Cancelled while BasicCegarLoop was analyzing trace of length 38 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 658). Cancelled while BasicCegarLoop was analyzing trace of length 38 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 641). Cancelled while BasicCegarLoop was analyzing trace of length 38 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 647). Cancelled while BasicCegarLoop was analyzing trace of length 38 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 670). Cancelled while BasicCegarLoop was analyzing trace of length 38 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 639). Cancelled while BasicCegarLoop was analyzing trace of length 38 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 648). Cancelled while BasicCegarLoop was analyzing trace of length 38 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 672). Cancelled while BasicCegarLoop was analyzing trace of length 38 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 94 locations, 39 error locations. TIMEOUT Result, 62.2s OverallTime, 17 OverallIterations, 2 TraceHistogramMax, 2.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1076 SDtfs, 1775 SDslu, 1715 SDs, 0 SdLazy, 1529 SolverSat, 103 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 124 GetRequests, 34 SyntacticMatches, 11 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=169occurred in iteration=16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 57.4s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 16 MinimizatonAttempts, 596 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 375 NumberOfCodeBlocks, 375 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 359 ConstructedInterpolants, 0 QuantifiedInterpolants, 51611 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 18/18 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0504_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-25_05-44-28-913.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0504_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-25_05-44-28-913.csv Completed graceful shutdown