java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf -i ../../../trunk/examples/svcomp/forester-heap/sll-01_true-unreach-call_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 16:12:04,313 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 16:12:04,315 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 16:12:04,330 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 16:12:04,331 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 16:12:04,332 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 16:12:04,333 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 16:12:04,335 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 16:12:04,337 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 16:12:04,338 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 16:12:04,339 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 16:12:04,340 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 16:12:04,341 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 16:12:04,342 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 16:12:04,343 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 16:12:04,346 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 16:12:04,348 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 16:12:04,350 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 16:12:04,352 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 16:12:04,353 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 16:12:04,356 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 16:12:04,356 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 16:12:04,356 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 16:12:04,357 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 16:12:04,358 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 16:12:04,360 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 16:12:04,360 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 16:12:04,361 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 16:12:04,361 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 16:12:04,361 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 16:12:04,362 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 16:12:04,362 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf [2018-01-24 16:12:04,373 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 16:12:04,373 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 16:12:04,374 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 16:12:04,374 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 16:12:04,375 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 16:12:04,375 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 16:12:04,375 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 16:12:04,376 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 16:12:04,376 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 16:12:04,376 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 16:12:04,376 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 16:12:04,376 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 16:12:04,377 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 16:12:04,377 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 16:12:04,377 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 16:12:04,377 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 16:12:04,377 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 16:12:04,378 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 16:12:04,378 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 16:12:04,378 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 16:12:04,378 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 16:12:04,379 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 16:12:04,379 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 16:12:04,379 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 16:12:04,379 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 16:12:04,379 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 16:12:04,380 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 16:12:04,380 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 16:12:04,380 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-24 16:12:04,380 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 16:12:04,380 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 16:12:04,381 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 16:12:04,381 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-24 16:12:04,382 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 16:12:04,382 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 16:12:04,419 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 16:12:04,432 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 16:12:04,436 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 16:12:04,438 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 16:12:04,438 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 16:12:04,439 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/sll-01_true-unreach-call_true-valid-memsafety.i [2018-01-24 16:12:04,622 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 16:12:04,627 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 16:12:04,628 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 16:12:04,628 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 16:12:04,633 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 16:12:04,634 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 04:12:04" (1/1) ... [2018-01-24 16:12:04,637 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30b6da95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:12:04, skipping insertion in model container [2018-01-24 16:12:04,731 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 04:12:04" (1/1) ... [2018-01-24 16:12:04,745 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 16:12:04,787 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 16:12:04,911 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 16:12:04,939 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 16:12:04,947 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:12:04 WrapperNode [2018-01-24 16:12:04,947 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 16:12:04,948 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 16:12:04,948 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 16:12:04,948 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 16:12:04,962 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:12:04" (1/1) ... [2018-01-24 16:12:04,962 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:12:04" (1/1) ... [2018-01-24 16:12:04,973 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:12:04" (1/1) ... [2018-01-24 16:12:04,973 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:12:04" (1/1) ... [2018-01-24 16:12:04,984 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:12:04" (1/1) ... [2018-01-24 16:12:04,991 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:12:04" (1/1) ... [2018-01-24 16:12:04,993 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:12:04" (1/1) ... [2018-01-24 16:12:04,996 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 16:12:04,997 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 16:12:04,997 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 16:12:04,997 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 16:12:04,998 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:12:04" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 16:12:05,051 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 16:12:05,051 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 16:12:05,051 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 16:12:05,051 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-24 16:12:05,051 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-24 16:12:05,052 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 16:12:05,052 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 16:12:05,052 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 16:12:05,052 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-24 16:12:05,052 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-24 16:12:05,052 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 16:12:05,053 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-01-24 16:12:05,053 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 16:12:05,053 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 16:12:05,053 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 16:12:05,865 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 16:12:05,865 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 04:12:05 BoogieIcfgContainer [2018-01-24 16:12:05,866 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 16:12:05,867 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 16:12:05,907 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 16:12:05,909 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 16:12:05,910 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 04:12:04" (1/3) ... [2018-01-24 16:12:05,911 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f910267 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 04:12:05, skipping insertion in model container [2018-01-24 16:12:05,912 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:12:04" (2/3) ... [2018-01-24 16:12:05,912 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f910267 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 04:12:05, skipping insertion in model container [2018-01-24 16:12:05,912 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 04:12:05" (3/3) ... [2018-01-24 16:12:05,914 INFO L105 eAbstractionObserver]: Analyzing ICFG sll-01_true-unreach-call_true-valid-memsafety.i [2018-01-24 16:12:05,924 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 16:12:05,933 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 63 error locations. [2018-01-24 16:12:05,978 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 16:12:05,979 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 16:12:05,979 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 16:12:05,979 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 16:12:05,979 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 16:12:05,979 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 16:12:05,980 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 16:12:05,980 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 16:12:05,981 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 16:12:06,007 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states. [2018-01-24 16:12:06,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-01-24 16:12:06,014 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:12:06,015 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:12:06,015 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 16:12:06,020 INFO L82 PathProgramCache]: Analyzing trace with hash 1781428784, now seen corresponding path program 1 times [2018-01-24 16:12:06,021 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:12:06,065 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:12:06,065 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:12:06,065 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:12:06,066 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:12:06,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:12:06,107 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:12:06,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:12:06,172 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:12:06,172 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 16:12:06,172 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:12:06,175 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 16:12:06,188 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 16:12:06,189 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 16:12:06,191 INFO L87 Difference]: Start difference. First operand 183 states. Second operand 4 states. [2018-01-24 16:12:06,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:12:06,555 INFO L93 Difference]: Finished difference Result 384 states and 511 transitions. [2018-01-24 16:12:06,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 16:12:06,557 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-01-24 16:12:06,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:12:06,572 INFO L225 Difference]: With dead ends: 384 [2018-01-24 16:12:06,573 INFO L226 Difference]: Without dead ends: 206 [2018-01-24 16:12:06,577 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-24 16:12:06,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2018-01-24 16:12:06,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 176. [2018-01-24 16:12:06,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-01-24 16:12:06,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 188 transitions. [2018-01-24 16:12:06,621 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 188 transitions. Word has length 8 [2018-01-24 16:12:06,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:12:06,622 INFO L432 AbstractCegarLoop]: Abstraction has 176 states and 188 transitions. [2018-01-24 16:12:06,622 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 16:12:06,622 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 188 transitions. [2018-01-24 16:12:06,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-01-24 16:12:06,622 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:12:06,622 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:12:06,622 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 16:12:06,623 INFO L82 PathProgramCache]: Analyzing trace with hash 1781428785, now seen corresponding path program 1 times [2018-01-24 16:12:06,623 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:12:06,624 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:12:06,624 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:12:06,624 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:12:06,624 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:12:06,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:12:06,649 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:12:06,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:12:06,757 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:12:06,758 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 16:12:06,758 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:12:06,759 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 16:12:06,760 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 16:12:06,760 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 16:12:06,760 INFO L87 Difference]: Start difference. First operand 176 states and 188 transitions. Second operand 4 states. [2018-01-24 16:12:06,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:12:06,970 INFO L93 Difference]: Finished difference Result 209 states and 221 transitions. [2018-01-24 16:12:06,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 16:12:06,970 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-01-24 16:12:06,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:12:06,972 INFO L225 Difference]: With dead ends: 209 [2018-01-24 16:12:06,972 INFO L226 Difference]: Without dead ends: 199 [2018-01-24 16:12:06,973 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-24 16:12:06,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2018-01-24 16:12:06,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 188. [2018-01-24 16:12:06,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-01-24 16:12:06,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 207 transitions. [2018-01-24 16:12:06,986 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 207 transitions. Word has length 8 [2018-01-24 16:12:06,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:12:06,987 INFO L432 AbstractCegarLoop]: Abstraction has 188 states and 207 transitions. [2018-01-24 16:12:06,987 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 16:12:06,987 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 207 transitions. [2018-01-24 16:12:06,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-24 16:12:06,987 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:12:06,988 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:12:06,988 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 16:12:06,988 INFO L82 PathProgramCache]: Analyzing trace with hash 1247402511, now seen corresponding path program 1 times [2018-01-24 16:12:06,988 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:12:06,989 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:12:06,989 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:12:06,989 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:12:06,989 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:12:07,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:12:07,018 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:12:07,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:12:07,068 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:12:07,068 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 16:12:07,068 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:12:07,068 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 16:12:07,069 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 16:12:07,069 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 16:12:07,069 INFO L87 Difference]: Start difference. First operand 188 states and 207 transitions. Second operand 5 states. [2018-01-24 16:12:07,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:12:07,711 INFO L93 Difference]: Finished difference Result 320 states and 347 transitions. [2018-01-24 16:12:07,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 16:12:07,712 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-01-24 16:12:07,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:12:07,714 INFO L225 Difference]: With dead ends: 320 [2018-01-24 16:12:07,715 INFO L226 Difference]: Without dead ends: 319 [2018-01-24 16:12:07,717 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-01-24 16:12:07,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2018-01-24 16:12:07,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 187. [2018-01-24 16:12:07,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2018-01-24 16:12:07,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 206 transitions. [2018-01-24 16:12:07,745 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 206 transitions. Word has length 17 [2018-01-24 16:12:07,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:12:07,745 INFO L432 AbstractCegarLoop]: Abstraction has 187 states and 206 transitions. [2018-01-24 16:12:07,746 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 16:12:07,746 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 206 transitions. [2018-01-24 16:12:07,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-24 16:12:07,746 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:12:07,747 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:12:07,747 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 16:12:07,747 INFO L82 PathProgramCache]: Analyzing trace with hash 1247402512, now seen corresponding path program 1 times [2018-01-24 16:12:07,747 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:12:07,748 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:12:07,748 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:12:07,749 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:12:07,749 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:12:07,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:12:07,768 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:12:07,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:12:07,859 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:12:07,859 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 16:12:07,859 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:12:07,859 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 16:12:07,859 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 16:12:07,859 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 16:12:07,860 INFO L87 Difference]: Start difference. First operand 187 states and 206 transitions. Second operand 5 states. [2018-01-24 16:12:08,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:12:08,313 INFO L93 Difference]: Finished difference Result 349 states and 386 transitions. [2018-01-24 16:12:08,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 16:12:08,313 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-01-24 16:12:08,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:12:08,316 INFO L225 Difference]: With dead ends: 349 [2018-01-24 16:12:08,316 INFO L226 Difference]: Without dead ends: 348 [2018-01-24 16:12:08,316 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-01-24 16:12:08,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2018-01-24 16:12:08,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 186. [2018-01-24 16:12:08,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-01-24 16:12:08,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 205 transitions. [2018-01-24 16:12:08,331 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 205 transitions. Word has length 17 [2018-01-24 16:12:08,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:12:08,332 INFO L432 AbstractCegarLoop]: Abstraction has 186 states and 205 transitions. [2018-01-24 16:12:08,332 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 16:12:08,332 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 205 transitions. [2018-01-24 16:12:08,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-24 16:12:08,333 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:12:08,333 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] [2018-01-24 16:12:08,333 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 16:12:08,334 INFO L82 PathProgramCache]: Analyzing trace with hash 1311177125, now seen corresponding path program 1 times [2018-01-24 16:12:08,334 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:12:08,335 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:12:08,335 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:12:08,335 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:12:08,335 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:12:08,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:12:08,355 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:12:08,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:12:08,511 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:12:08,512 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 16:12:08,512 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:12:08,512 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 16:12:08,512 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 16:12:08,513 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-24 16:12:08,513 INFO L87 Difference]: Start difference. First operand 186 states and 205 transitions. Second operand 8 states. [2018-01-24 16:12:10,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:12:10,348 INFO L93 Difference]: Finished difference Result 323 states and 348 transitions. [2018-01-24 16:12:10,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 16:12:10,350 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2018-01-24 16:12:10,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:12:10,352 INFO L225 Difference]: With dead ends: 323 [2018-01-24 16:12:10,352 INFO L226 Difference]: Without dead ends: 322 [2018-01-24 16:12:10,353 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2018-01-24 16:12:10,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2018-01-24 16:12:10,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 185. [2018-01-24 16:12:10,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-01-24 16:12:10,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 204 transitions. [2018-01-24 16:12:10,367 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 204 transitions. Word has length 20 [2018-01-24 16:12:10,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:12:10,367 INFO L432 AbstractCegarLoop]: Abstraction has 185 states and 204 transitions. [2018-01-24 16:12:10,367 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 16:12:10,368 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 204 transitions. [2018-01-24 16:12:10,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-24 16:12:10,368 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:12:10,369 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] [2018-01-24 16:12:10,369 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 16:12:10,369 INFO L82 PathProgramCache]: Analyzing trace with hash 1311177126, now seen corresponding path program 1 times [2018-01-24 16:12:10,369 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:12:10,370 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:12:10,371 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:12:10,373 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:12:10,373 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:12:10,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:12:10,396 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:12:10,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:12:10,590 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:12:10,590 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 16:12:10,590 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:12:10,590 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 16:12:10,590 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 16:12:10,591 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-24 16:12:10,591 INFO L87 Difference]: Start difference. First operand 185 states and 204 transitions. Second operand 8 states. [2018-01-24 16:12:11,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:12:11,302 INFO L93 Difference]: Finished difference Result 325 states and 350 transitions. [2018-01-24 16:12:11,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 16:12:11,302 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2018-01-24 16:12:11,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:12:11,304 INFO L225 Difference]: With dead ends: 325 [2018-01-24 16:12:11,304 INFO L226 Difference]: Without dead ends: 324 [2018-01-24 16:12:11,304 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2018-01-24 16:12:11,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2018-01-24 16:12:11,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 184. [2018-01-24 16:12:11,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-01-24 16:12:11,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 203 transitions. [2018-01-24 16:12:11,314 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 203 transitions. Word has length 20 [2018-01-24 16:12:11,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:12:11,314 INFO L432 AbstractCegarLoop]: Abstraction has 184 states and 203 transitions. [2018-01-24 16:12:11,314 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 16:12:11,314 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 203 transitions. [2018-01-24 16:12:11,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-24 16:12:11,315 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:12:11,315 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-24 16:12:11,315 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 16:12:11,316 INFO L82 PathProgramCache]: Analyzing trace with hash -1745739826, now seen corresponding path program 1 times [2018-01-24 16:12:11,316 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:12:11,316 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:12:11,317 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:12:11,317 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:12:11,317 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:12:11,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:12:11,329 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:12:11,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:12:11,386 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:12:11,386 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 16:12:11,386 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:12:11,387 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 16:12:11,387 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 16:12:11,387 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 16:12:11,387 INFO L87 Difference]: Start difference. First operand 184 states and 203 transitions. Second operand 5 states. [2018-01-24 16:12:11,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:12:11,552 INFO L93 Difference]: Finished difference Result 428 states and 470 transitions. [2018-01-24 16:12:11,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 16:12:11,553 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2018-01-24 16:12:11,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:12:11,554 INFO L225 Difference]: With dead ends: 428 [2018-01-24 16:12:11,554 INFO L226 Difference]: Without dead ends: 272 [2018-01-24 16:12:11,556 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-01-24 16:12:11,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2018-01-24 16:12:11,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 188. [2018-01-24 16:12:11,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-01-24 16:12:11,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 207 transitions. [2018-01-24 16:12:11,567 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 207 transitions. Word has length 26 [2018-01-24 16:12:11,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:12:11,568 INFO L432 AbstractCegarLoop]: Abstraction has 188 states and 207 transitions. [2018-01-24 16:12:11,568 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 16:12:11,568 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 207 transitions. [2018-01-24 16:12:11,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-24 16:12:11,569 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:12:11,569 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:12:11,569 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 16:12:11,569 INFO L82 PathProgramCache]: Analyzing trace with hash 33879827, now seen corresponding path program 1 times [2018-01-24 16:12:11,569 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:12:11,570 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:12:11,570 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:12:11,571 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:12:11,571 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:12:11,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:12:11,584 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:12:11,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:12:11,668 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:12:11,668 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 16:12:11,668 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:12:11,669 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 16:12:11,669 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 16:12:11,669 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 16:12:11,669 INFO L87 Difference]: Start difference. First operand 188 states and 207 transitions. Second operand 5 states. [2018-01-24 16:12:11,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:12:11,796 INFO L93 Difference]: Finished difference Result 210 states and 224 transitions. [2018-01-24 16:12:11,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-24 16:12:11,796 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2018-01-24 16:12:11,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:12:11,797 INFO L225 Difference]: With dead ends: 210 [2018-01-24 16:12:11,797 INFO L226 Difference]: Without dead ends: 198 [2018-01-24 16:12:11,798 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-01-24 16:12:11,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2018-01-24 16:12:11,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 180. [2018-01-24 16:12:11,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-01-24 16:12:11,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 199 transitions. [2018-01-24 16:12:11,807 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 199 transitions. Word has length 28 [2018-01-24 16:12:11,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:12:11,808 INFO L432 AbstractCegarLoop]: Abstraction has 180 states and 199 transitions. [2018-01-24 16:12:11,808 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 16:12:11,808 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 199 transitions. [2018-01-24 16:12:11,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-24 16:12:11,808 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:12:11,808 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:12:11,809 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 16:12:11,809 INFO L82 PathProgramCache]: Analyzing trace with hash 33879828, now seen corresponding path program 1 times [2018-01-24 16:12:11,809 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:12:11,810 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:12:11,810 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:12:11,810 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:12:11,810 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:12:11,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:12:11,822 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:12:11,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:12:11,918 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:12:11,918 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 16:12:11,918 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:12:11,918 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-24 16:12:11,918 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-24 16:12:11,919 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-01-24 16:12:11,919 INFO L87 Difference]: Start difference. First operand 180 states and 199 transitions. Second operand 7 states. [2018-01-24 16:12:12,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:12:12,261 INFO L93 Difference]: Finished difference Result 236 states and 251 transitions. [2018-01-24 16:12:12,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 16:12:12,261 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 28 [2018-01-24 16:12:12,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:12:12,262 INFO L225 Difference]: With dead ends: 236 [2018-01-24 16:12:12,262 INFO L226 Difference]: Without dead ends: 232 [2018-01-24 16:12:12,263 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-01-24 16:12:12,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2018-01-24 16:12:12,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 207. [2018-01-24 16:12:12,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2018-01-24 16:12:12,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 234 transitions. [2018-01-24 16:12:12,272 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 234 transitions. Word has length 28 [2018-01-24 16:12:12,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:12:12,273 INFO L432 AbstractCegarLoop]: Abstraction has 207 states and 234 transitions. [2018-01-24 16:12:12,273 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-24 16:12:12,273 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 234 transitions. [2018-01-24 16:12:12,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-24 16:12:12,274 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:12:12,274 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:12:12,274 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 16:12:12,274 INFO L82 PathProgramCache]: Analyzing trace with hash -3315817, now seen corresponding path program 1 times [2018-01-24 16:12:12,274 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:12:12,275 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:12:12,275 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:12:12,276 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:12:12,276 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:12:12,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:12:12,287 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:12:12,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:12:12,324 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:12:12,324 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 16:12:12,324 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:12:12,325 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 16:12:12,325 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 16:12:12,325 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 16:12:12,325 INFO L87 Difference]: Start difference. First operand 207 states and 234 transitions. Second operand 6 states. [2018-01-24 16:12:12,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:12:12,809 INFO L93 Difference]: Finished difference Result 296 states and 336 transitions. [2018-01-24 16:12:12,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-24 16:12:12,809 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2018-01-24 16:12:12,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:12:12,811 INFO L225 Difference]: With dead ends: 296 [2018-01-24 16:12:12,811 INFO L226 Difference]: Without dead ends: 295 [2018-01-24 16:12:12,811 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-01-24 16:12:12,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2018-01-24 16:12:12,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 206. [2018-01-24 16:12:12,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2018-01-24 16:12:12,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 233 transitions. [2018-01-24 16:12:12,827 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 233 transitions. Word has length 31 [2018-01-24 16:12:12,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:12:12,828 INFO L432 AbstractCegarLoop]: Abstraction has 206 states and 233 transitions. [2018-01-24 16:12:12,828 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 16:12:12,828 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 233 transitions. [2018-01-24 16:12:12,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-24 16:12:12,829 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:12:12,830 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:12:12,830 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 16:12:12,830 INFO L82 PathProgramCache]: Analyzing trace with hash -3315816, now seen corresponding path program 1 times [2018-01-24 16:12:12,830 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:12:12,831 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:12:12,831 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:12:12,831 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:12:12,831 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:12:12,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:12:12,850 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:12:12,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:12:12,986 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:12:12,986 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 16:12:12,986 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:12:12,986 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 16:12:12,987 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 16:12:12,987 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 16:12:12,987 INFO L87 Difference]: Start difference. First operand 206 states and 233 transitions. Second operand 6 states. [2018-01-24 16:12:13,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:12:13,704 INFO L93 Difference]: Finished difference Result 326 states and 374 transitions. [2018-01-24 16:12:13,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 16:12:13,704 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2018-01-24 16:12:13,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:12:13,706 INFO L225 Difference]: With dead ends: 326 [2018-01-24 16:12:13,706 INFO L226 Difference]: Without dead ends: 317 [2018-01-24 16:12:13,706 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-01-24 16:12:13,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2018-01-24 16:12:13,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 191. [2018-01-24 16:12:13,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-01-24 16:12:13,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 217 transitions. [2018-01-24 16:12:13,718 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 217 transitions. Word has length 31 [2018-01-24 16:12:13,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:12:13,718 INFO L432 AbstractCegarLoop]: Abstraction has 191 states and 217 transitions. [2018-01-24 16:12:13,719 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 16:12:13,719 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 217 transitions. [2018-01-24 16:12:13,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-01-24 16:12:13,720 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:12:13,720 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:12:13,720 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 16:12:13,721 INFO L82 PathProgramCache]: Analyzing trace with hash 253584673, now seen corresponding path program 1 times [2018-01-24 16:12:13,721 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:12:13,725 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:12:13,725 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:12:13,725 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:12:13,725 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:12:13,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:12:13,737 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:12:13,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:12:13,806 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:12:13,806 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 16:12:13,807 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:12:13,807 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 16:12:13,807 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 16:12:13,807 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 16:12:13,807 INFO L87 Difference]: Start difference. First operand 191 states and 217 transitions. Second operand 5 states. [2018-01-24 16:12:14,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:12:14,042 INFO L93 Difference]: Finished difference Result 269 states and 294 transitions. [2018-01-24 16:12:14,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 16:12:14,042 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 36 [2018-01-24 16:12:14,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:12:14,044 INFO L225 Difference]: With dead ends: 269 [2018-01-24 16:12:14,044 INFO L226 Difference]: Without dead ends: 212 [2018-01-24 16:12:14,044 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-01-24 16:12:14,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2018-01-24 16:12:14,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 191. [2018-01-24 16:12:14,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-01-24 16:12:14,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 215 transitions. [2018-01-24 16:12:14,053 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 215 transitions. Word has length 36 [2018-01-24 16:12:14,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:12:14,053 INFO L432 AbstractCegarLoop]: Abstraction has 191 states and 215 transitions. [2018-01-24 16:12:14,053 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 16:12:14,053 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 215 transitions. [2018-01-24 16:12:14,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-01-24 16:12:14,054 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:12:14,055 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:12:14,055 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 16:12:14,055 INFO L82 PathProgramCache]: Analyzing trace with hash 1898871922, now seen corresponding path program 1 times [2018-01-24 16:12:14,055 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:12:14,056 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:12:14,056 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:12:14,056 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:12:14,056 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:12:14,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:12:14,067 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:12:14,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:12:14,563 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:12:14,564 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-01-24 16:12:14,564 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:12:14,564 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-24 16:12:14,564 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-24 16:12:14,564 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-01-24 16:12:14,565 INFO L87 Difference]: Start difference. First operand 191 states and 215 transitions. Second operand 10 states. [2018-01-24 16:12:15,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:12:15,065 INFO L93 Difference]: Finished difference Result 420 states and 467 transitions. [2018-01-24 16:12:15,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-24 16:12:15,066 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 42 [2018-01-24 16:12:15,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:12:15,067 INFO L225 Difference]: With dead ends: 420 [2018-01-24 16:12:15,067 INFO L226 Difference]: Without dead ends: 309 [2018-01-24 16:12:15,068 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=112, Invalid=308, Unknown=0, NotChecked=0, Total=420 [2018-01-24 16:12:15,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2018-01-24 16:12:15,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 232. [2018-01-24 16:12:15,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2018-01-24 16:12:15,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 260 transitions. [2018-01-24 16:12:15,080 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 260 transitions. Word has length 42 [2018-01-24 16:12:15,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:12:15,081 INFO L432 AbstractCegarLoop]: Abstraction has 232 states and 260 transitions. [2018-01-24 16:12:15,081 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-24 16:12:15,081 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 260 transitions. [2018-01-24 16:12:15,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-01-24 16:12:15,082 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:12:15,082 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:12:15,082 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 16:12:15,083 INFO L82 PathProgramCache]: Analyzing trace with hash 1781092500, now seen corresponding path program 1 times [2018-01-24 16:12:15,083 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:12:15,083 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:12:15,084 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:12:15,084 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:12:15,084 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:12:15,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:12:15,097 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:12:15,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:12:15,164 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:12:15,165 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 16:12:15,165 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:12:15,165 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 16:12:15,165 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 16:12:15,165 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 16:12:15,165 INFO L87 Difference]: Start difference. First operand 232 states and 260 transitions. Second operand 5 states. [2018-01-24 16:12:15,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:12:15,376 INFO L93 Difference]: Finished difference Result 344 states and 387 transitions. [2018-01-24 16:12:15,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 16:12:15,376 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2018-01-24 16:12:15,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:12:15,377 INFO L225 Difference]: With dead ends: 344 [2018-01-24 16:12:15,377 INFO L226 Difference]: Without dead ends: 343 [2018-01-24 16:12:15,378 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-01-24 16:12:15,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2018-01-24 16:12:15,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 231. [2018-01-24 16:12:15,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2018-01-24 16:12:15,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 259 transitions. [2018-01-24 16:12:15,392 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 259 transitions. Word has length 43 [2018-01-24 16:12:15,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:12:15,393 INFO L432 AbstractCegarLoop]: Abstraction has 231 states and 259 transitions. [2018-01-24 16:12:15,393 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 16:12:15,393 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 259 transitions. [2018-01-24 16:12:15,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-01-24 16:12:15,394 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:12:15,394 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:12:15,394 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 16:12:15,394 INFO L82 PathProgramCache]: Analyzing trace with hash 1781092501, now seen corresponding path program 1 times [2018-01-24 16:12:15,394 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:12:15,395 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:12:15,395 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:12:15,395 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:12:15,395 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:12:15,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:12:15,406 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:12:15,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:12:15,487 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:12:15,488 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 16:12:15,488 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:12:15,488 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 16:12:15,488 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 16:12:15,488 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 16:12:15,489 INFO L87 Difference]: Start difference. First operand 231 states and 259 transitions. Second operand 5 states. [2018-01-24 16:12:16,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:12:16,178 INFO L93 Difference]: Finished difference Result 376 states and 426 transitions. [2018-01-24 16:12:16,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 16:12:16,179 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2018-01-24 16:12:16,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:12:16,181 INFO L225 Difference]: With dead ends: 376 [2018-01-24 16:12:16,182 INFO L226 Difference]: Without dead ends: 375 [2018-01-24 16:12:16,182 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-01-24 16:12:16,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2018-01-24 16:12:16,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 230. [2018-01-24 16:12:16,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2018-01-24 16:12:16,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 258 transitions. [2018-01-24 16:12:16,211 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 258 transitions. Word has length 43 [2018-01-24 16:12:16,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:12:16,211 INFO L432 AbstractCegarLoop]: Abstraction has 230 states and 258 transitions. [2018-01-24 16:12:16,211 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 16:12:16,211 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 258 transitions. [2018-01-24 16:12:16,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-01-24 16:12:16,212 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:12:16,212 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:12:16,213 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 16:12:16,213 INFO L82 PathProgramCache]: Analyzing trace with hash -661031902, now seen corresponding path program 1 times [2018-01-24 16:12:16,213 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:12:16,214 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:12:16,215 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:12:16,215 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:12:16,215 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:12:16,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:12:16,242 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:12:16,636 WARN L146 SmtUtils]: Spent 257ms on a formula simplification. DAG size of input: 20 DAG size of output 16 [2018-01-24 16:12:16,737 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:12:16,738 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:12:16,738 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 16:12:16,739 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 45 with the following transitions: [2018-01-24 16:12:16,745 INFO L201 CegarAbsIntRunner]: [0], [1], [5], [6], [7], [13], [18], [22], [28], [31], [32], [58], [59], [62], [67], [68], [71], [77], [81], [87], [91], [93], [96], [207], [211], [216], [220], [228], [234], [235], [236], [238], [242], [246], [321], [326], [330], [336], [339], [438], [439], [440] [2018-01-24 16:12:16,807 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 16:12:16,807 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 16:12:31,826 INFO L262 AbstractInterpreter]: Error location(s) were unreachable [2018-01-24 16:12:31,828 INFO L268 AbstractInterpreter]: Visited 42 different actions 44 times. Merged at 2 different actions 2 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 32 variables. [2018-01-24 16:12:31,853 INFO L395 sIntCurrentIteration]: Generating AbsInt predicates Received shutdown request... [2018-01-24 16:13:01,481 INFO L232 lantSequenceWeakener]: Weakened 1 states. On average, predicates are now at 88.24% of their original sizes. [2018-01-24 16:13:01,481 INFO L408 sIntCurrentIteration]: Unifying AI predicates [2018-01-24 16:13:01,488 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-24 16:13:01,494 WARN L187 ceAbstractionStarter]: Timeout [2018-01-24 16:13:01,494 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.01 04:13:01 BoogieIcfgContainer [2018-01-24 16:13:01,495 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-24 16:13:01,495 INFO L168 Benchmark]: Toolchain (without parser) took 56873.02 ms. Allocated memory was 305.1 MB in the beginning and 2.3 GB in the end (delta: 2.0 GB). Free memory was 264.0 MB in the beginning and 996.4 MB in the end (delta: -732.3 MB). Peak memory consumption was 1.3 GB. Max. memory is 5.3 GB. [2018-01-24 16:13:01,496 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 305.1 MB. Free memory is still 270.0 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 16:13:01,496 INFO L168 Benchmark]: CACSL2BoogieTranslator took 319.88 ms. Allocated memory is still 305.1 MB. Free memory was 264.0 MB in the beginning and 250.0 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 5.3 GB. [2018-01-24 16:13:01,496 INFO L168 Benchmark]: Boogie Preprocessor took 48.24 ms. Allocated memory is still 305.1 MB. Free memory was 250.0 MB in the beginning and 248.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-24 16:13:01,497 INFO L168 Benchmark]: RCFGBuilder took 869.18 ms. Allocated memory is still 305.1 MB. Free memory was 248.1 MB in the beginning and 207.1 MB in the end (delta: 40.9 MB). Peak memory consumption was 40.9 MB. Max. memory is 5.3 GB. [2018-01-24 16:13:01,497 INFO L168 Benchmark]: TraceAbstraction took 55627.90 ms. Allocated memory was 305.1 MB in the beginning and 2.3 GB in the end (delta: 2.0 GB). Free memory was 205.1 MB in the beginning and 996.4 MB in the end (delta: -791.2 MB). Peak memory consumption was 1.2 GB. Max. memory is 5.3 GB. [2018-01-24 16:13:01,498 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 305.1 MB. Free memory is still 270.0 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 319.88 ms. Allocated memory is still 305.1 MB. Free memory was 264.0 MB in the beginning and 250.0 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 48.24 ms. Allocated memory is still 305.1 MB. Free memory was 250.0 MB in the beginning and 248.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 869.18 ms. Allocated memory is still 305.1 MB. Free memory was 248.1 MB in the beginning and 207.1 MB in the end (delta: 40.9 MB). Peak memory consumption was 40.9 MB. Max. memory is 5.3 GB. * TraceAbstraction took 55627.90 ms. Allocated memory was 305.1 MB in the beginning and 2.3 GB in the end (delta: 2.0 GB). Free memory was 205.1 MB in the beginning and 996.4 MB in the end (delta: -791.2 MB). Peak memory consumption was 1.2 GB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 40 LocStat_MAX_WEQGRAPH_SIZE : 22 LocStat_MAX_SIZEOF_WEQEDGELABEL : 6 LocStat_NO_SUPPORTING_EQUALITIES : 574 LocStat_NO_SUPPORTING_DISEQUALITIES : 140 LocStat_NO_DISJUNCTIONS : -80 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 46 TransStat_MAX_WEQGRAPH_SIZE : 12 TransStat_MAX_SIZEOF_WEQEDGELABEL : 3 TransStat_NO_SUPPORTING_EQUALITIES : 66 TransStat_NO_SUPPORTING_DISEQUALITIES : 16 TransStat_NO_DISJUNCTIONS : 53 TransStat_MAX_NO_DISJUNCTIONS : 3 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 293.057801 RENAME_VARIABLES(MILLISECONDS) : 83.566788 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 148.925244 PROJECTAWAY(MILLISECONDS) : 0.127462 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.100384 DISJOIN(MILLISECONDS) : 33.150397 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 83.623244 ADD_EQUALITY(MILLISECONDS) : 0.009737 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.016982 #CONJOIN_DISJUNCTIVE : 71 #RENAME_VARIABLES : 108 #UNFREEZE : 0 #CONJOIN : 125 #PROJECTAWAY : 100 #ADD_WEAK_EQUALITY : 11 #DISJOIN : 2 #RENAME_VARIABLES_DISJUNCTIVE : 99 #ADD_EQUALITY : 67 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 13 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1037). Cancelled while BasicCegarLoop was analyzing trace of length 45 with TraceHistMax 2, while AbsIntCurrentIteration was generating AI predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 3 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1005). Cancelled while BasicCegarLoop was analyzing trace of length 45 with TraceHistMax 2, while AbsIntCurrentIteration was generating AI predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 3 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1043). Cancelled while BasicCegarLoop was analyzing trace of length 45 with TraceHistMax 2, while AbsIntCurrentIteration was generating AI predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 3 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1001). Cancelled while BasicCegarLoop was analyzing trace of length 45 with TraceHistMax 2, while AbsIntCurrentIteration was generating AI predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 3 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1003). Cancelled while BasicCegarLoop was analyzing trace of length 45 with TraceHistMax 2, while AbsIntCurrentIteration was generating AI predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 3 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1005). Cancelled while BasicCegarLoop was analyzing trace of length 45 with TraceHistMax 2, while AbsIntCurrentIteration was generating AI predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 3 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 992). Cancelled while BasicCegarLoop was analyzing trace of length 45 with TraceHistMax 2, while AbsIntCurrentIteration was generating AI predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 3 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1005). Cancelled while BasicCegarLoop was analyzing trace of length 45 with TraceHistMax 2, while AbsIntCurrentIteration was generating AI predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 3 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1027). Cancelled while BasicCegarLoop was analyzing trace of length 45 with TraceHistMax 2, while AbsIntCurrentIteration was generating AI predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 3 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1005). Cancelled while BasicCegarLoop was analyzing trace of length 45 with TraceHistMax 2, while AbsIntCurrentIteration was generating AI predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 3 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 993). Cancelled while BasicCegarLoop was analyzing trace of length 45 with TraceHistMax 2, while AbsIntCurrentIteration was generating AI predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 3 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1047). Cancelled while BasicCegarLoop was analyzing trace of length 45 with TraceHistMax 2, while AbsIntCurrentIteration was generating AI predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 3 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 993). Cancelled while BasicCegarLoop was analyzing trace of length 45 with TraceHistMax 2, while AbsIntCurrentIteration was generating AI predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 3 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1031). Cancelled while BasicCegarLoop was analyzing trace of length 45 with TraceHistMax 2, while AbsIntCurrentIteration was generating AI predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 3 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 993). Cancelled while BasicCegarLoop was analyzing trace of length 45 with TraceHistMax 2, while AbsIntCurrentIteration was generating AI predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 3 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 993). Cancelled while BasicCegarLoop was analyzing trace of length 45 with TraceHistMax 2, while AbsIntCurrentIteration was generating AI predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 3 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1005). Cancelled while BasicCegarLoop was analyzing trace of length 45 with TraceHistMax 2, while AbsIntCurrentIteration was generating AI predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 3 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1043). Cancelled while BasicCegarLoop was analyzing trace of length 45 with TraceHistMax 2, while AbsIntCurrentIteration was generating AI predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 3 known predicates. - TimeoutResultAtElement [Line: 988]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 988). Cancelled while BasicCegarLoop was analyzing trace of length 45 with TraceHistMax 2, while AbsIntCurrentIteration was generating AI predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 3 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 993). Cancelled while BasicCegarLoop was analyzing trace of length 45 with TraceHistMax 2, while AbsIntCurrentIteration was generating AI predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 3 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1025). Cancelled while BasicCegarLoop was analyzing trace of length 45 with TraceHistMax 2, while AbsIntCurrentIteration was generating AI predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 3 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1005). Cancelled while BasicCegarLoop was analyzing trace of length 45 with TraceHistMax 2, while AbsIntCurrentIteration was generating AI predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 3 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 993). Cancelled while BasicCegarLoop was analyzing trace of length 45 with TraceHistMax 2, while AbsIntCurrentIteration was generating AI predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 3 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1044). Cancelled while BasicCegarLoop was analyzing trace of length 45 with TraceHistMax 2, while AbsIntCurrentIteration was generating AI predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 3 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1005). Cancelled while BasicCegarLoop was analyzing trace of length 45 with TraceHistMax 2, while AbsIntCurrentIteration was generating AI predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 3 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1026). Cancelled while BasicCegarLoop was analyzing trace of length 45 with TraceHistMax 2, while AbsIntCurrentIteration was generating AI predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 3 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 993). Cancelled while BasicCegarLoop was analyzing trace of length 45 with TraceHistMax 2, while AbsIntCurrentIteration was generating AI predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 3 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1025). Cancelled while BasicCegarLoop was analyzing trace of length 45 with TraceHistMax 2, while AbsIntCurrentIteration was generating AI predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 3 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 993). Cancelled while BasicCegarLoop was analyzing trace of length 45 with TraceHistMax 2, while AbsIntCurrentIteration was generating AI predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 3 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1037). Cancelled while BasicCegarLoop was analyzing trace of length 45 with TraceHistMax 2, while AbsIntCurrentIteration was generating AI predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 3 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1005). Cancelled while BasicCegarLoop was analyzing trace of length 45 with TraceHistMax 2, while AbsIntCurrentIteration was generating AI predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 3 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 993). Cancelled while BasicCegarLoop was analyzing trace of length 45 with TraceHistMax 2, while AbsIntCurrentIteration was generating AI predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 3 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 993). Cancelled while BasicCegarLoop was analyzing trace of length 45 with TraceHistMax 2, while AbsIntCurrentIteration was generating AI predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 3 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1005). Cancelled while BasicCegarLoop was analyzing trace of length 45 with TraceHistMax 2, while AbsIntCurrentIteration was generating AI predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 3 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1048). Cancelled while BasicCegarLoop was analyzing trace of length 45 with TraceHistMax 2, while AbsIntCurrentIteration was generating AI predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 3 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1047). Cancelled while BasicCegarLoop was analyzing trace of length 45 with TraceHistMax 2, while AbsIntCurrentIteration was generating AI predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 3 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1005). Cancelled while BasicCegarLoop was analyzing trace of length 45 with TraceHistMax 2, while AbsIntCurrentIteration was generating AI predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 3 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1005). Cancelled while BasicCegarLoop was analyzing trace of length 45 with TraceHistMax 2, while AbsIntCurrentIteration was generating AI predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 3 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1002). Cancelled while BasicCegarLoop was analyzing trace of length 45 with TraceHistMax 2, while AbsIntCurrentIteration was generating AI predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 3 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1017). Cancelled while BasicCegarLoop was analyzing trace of length 45 with TraceHistMax 2, while AbsIntCurrentIteration was generating AI predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 3 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1044). Cancelled while BasicCegarLoop was analyzing trace of length 45 with TraceHistMax 2, while AbsIntCurrentIteration was generating AI predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 3 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1031). Cancelled while BasicCegarLoop was analyzing trace of length 45 with TraceHistMax 2, while AbsIntCurrentIteration was generating AI predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 3 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1005). Cancelled while BasicCegarLoop was analyzing trace of length 45 with TraceHistMax 2, while AbsIntCurrentIteration was generating AI predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 3 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 993). Cancelled while BasicCegarLoop was analyzing trace of length 45 with TraceHistMax 2, while AbsIntCurrentIteration was generating AI predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 3 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1005). Cancelled while BasicCegarLoop was analyzing trace of length 45 with TraceHistMax 2, while AbsIntCurrentIteration was generating AI predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 3 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 993). Cancelled while BasicCegarLoop was analyzing trace of length 45 with TraceHistMax 2, while AbsIntCurrentIteration was generating AI predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 3 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1042). Cancelled while BasicCegarLoop was analyzing trace of length 45 with TraceHistMax 2, while AbsIntCurrentIteration was generating AI predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 3 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1026). Cancelled while BasicCegarLoop was analyzing trace of length 45 with TraceHistMax 2, while AbsIntCurrentIteration was generating AI predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 3 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1001). Cancelled while BasicCegarLoop was analyzing trace of length 45 with TraceHistMax 2, while AbsIntCurrentIteration was generating AI predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 3 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1003). Cancelled while BasicCegarLoop was analyzing trace of length 45 with TraceHistMax 2, while AbsIntCurrentIteration was generating AI predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 3 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1005). Cancelled while BasicCegarLoop was analyzing trace of length 45 with TraceHistMax 2, while AbsIntCurrentIteration was generating AI predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 3 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1005). Cancelled while BasicCegarLoop was analyzing trace of length 45 with TraceHistMax 2, while AbsIntCurrentIteration was generating AI predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 3 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 992). Cancelled while BasicCegarLoop was analyzing trace of length 45 with TraceHistMax 2, while AbsIntCurrentIteration was generating AI predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 3 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1048). Cancelled while BasicCegarLoop was analyzing trace of length 45 with TraceHistMax 2, while AbsIntCurrentIteration was generating AI predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 3 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 993). Cancelled while BasicCegarLoop was analyzing trace of length 45 with TraceHistMax 2, while AbsIntCurrentIteration was generating AI predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 3 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1042). Cancelled while BasicCegarLoop was analyzing trace of length 45 with TraceHistMax 2, while AbsIntCurrentIteration was generating AI predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 3 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 993). Cancelled while BasicCegarLoop was analyzing trace of length 45 with TraceHistMax 2, while AbsIntCurrentIteration was generating AI predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 3 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1002). Cancelled while BasicCegarLoop was analyzing trace of length 45 with TraceHistMax 2, while AbsIntCurrentIteration was generating AI predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 3 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 993). Cancelled while BasicCegarLoop was analyzing trace of length 45 with TraceHistMax 2, while AbsIntCurrentIteration was generating AI predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 3 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1005). Cancelled while BasicCegarLoop was analyzing trace of length 45 with TraceHistMax 2, while AbsIntCurrentIteration was generating AI predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 3 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1027). Cancelled while BasicCegarLoop was analyzing trace of length 45 with TraceHistMax 2, while AbsIntCurrentIteration was generating AI predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 3 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 993). Cancelled while BasicCegarLoop was analyzing trace of length 45 with TraceHistMax 2, while AbsIntCurrentIteration was generating AI predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 3 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1017). Cancelled while BasicCegarLoop was analyzing trace of length 45 with TraceHistMax 2, while AbsIntCurrentIteration was generating AI predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 3 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 183 locations, 63 error locations. TIMEOUT Result, 55.5s OverallTime, 16 OverallIterations, 2 TraceHistogramMax, 7.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2535 SDtfs, 4514 SDslu, 5832 SDs, 0 SdLazy, 4300 SolverSat, 194 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 137 GetRequests, 22 SyntacticMatches, 4 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=232occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 15.1s AbstIntTime, 1 AbstIntIterations, 1 AbstIntStrong, 0.9515652589065001 AbsIntWeakeningRatio, 0.6976744186046512 AbsIntAvgWeakeningVarsNumRemoved, 23.558139534883722 AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 15 MinimizatonAttempts, 1309 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 398 NumberOfCodeBlocks, 398 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 383 ConstructedInterpolants, 0 QuantifiedInterpolants, 51217 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 0/0 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/sll-01_true-unreach-call_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_16-13-01-508.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/sll-01_true-unreach-call_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-VPDomainBenchmark-0-2018-01-24_16-13-01-508.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/sll-01_true-unreach-call_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-0-2018-01-24_16-13-01-508.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/sll-01_true-unreach-call_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-24_16-13-01-508.csv Completed graceful shutdown