java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf -i ../../../trunk/examples/svcomp/memsafety/test-0513_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-25 05:43:35,310 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-25 05:43:35,313 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-25 05:43:35,326 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-25 05:43:35,326 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-25 05:43:35,327 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-25 05:43:35,328 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-25 05:43:35,329 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-25 05:43:35,331 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-25 05:43:35,331 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-25 05:43:35,332 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-25 05:43:35,332 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-25 05:43:35,333 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-25 05:43:35,334 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-25 05:43:35,334 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-25 05:43:35,337 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-25 05:43:35,339 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-25 05:43:35,341 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-25 05:43:35,342 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-25 05:43:35,343 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-25 05:43:35,346 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-25 05:43:35,346 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-25 05:43:35,346 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-25 05:43:35,348 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-25 05:43:35,348 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-25 05:43:35,350 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-25 05:43:35,350 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-25 05:43:35,351 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-25 05:43:35,351 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-25 05:43:35,351 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-25 05:43:35,352 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-25 05:43:35,352 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf [2018-01-25 05:43:35,362 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-25 05:43:35,363 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-25 05:43:35,363 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-25 05:43:35,364 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-25 05:43:35,364 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-25 05:43:35,364 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-25 05:43:35,364 INFO L133 SettingsManager]: * Precise comparison operator=true [2018-01-25 05:43:35,364 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-25 05:43:35,365 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-25 05:43:35,365 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-25 05:43:35,365 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-25 05:43:35,366 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-25 05:43:35,366 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-25 05:43:35,366 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-25 05:43:35,366 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-25 05:43:35,366 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-25 05:43:35,367 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-25 05:43:35,367 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-25 05:43:35,367 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-25 05:43:35,367 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-25 05:43:35,367 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-25 05:43:35,367 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-25 05:43:35,368 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-25 05:43:35,368 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-25 05:43:35,368 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-25 05:43:35,368 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-25 05:43:35,368 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-25 05:43:35,369 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-25 05:43:35,369 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-25 05:43:35,369 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-25 05:43:35,369 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-25 05:43:35,369 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-25 05:43:35,370 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-25 05:43:35,370 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-25 05:43:35,371 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-25 05:43:35,371 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-25 05:43:35,406 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-25 05:43:35,420 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-25 05:43:35,424 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-25 05:43:35,426 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-25 05:43:35,426 INFO L276 PluginConnector]: CDTParser initialized [2018-01-25 05:43:35,427 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/test-0513_true-valid-memsafety.i [2018-01-25 05:43:35,624 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-25 05:43:35,628 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-25 05:43:35,629 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-25 05:43:35,629 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-25 05:43:35,635 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-25 05:43:35,636 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 05:43:35" (1/1) ... [2018-01-25 05:43:35,638 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@376b2429 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:43:35, skipping insertion in model container [2018-01-25 05:43:35,639 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 05:43:35" (1/1) ... [2018-01-25 05:43:35,652 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 05:43:35,694 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 05:43:35,818 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 05:43:35,839 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 05:43:35,849 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:43:35 WrapperNode [2018-01-25 05:43:35,850 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-25 05:43:35,850 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-25 05:43:35,850 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-25 05:43:35,851 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-25 05:43:35,862 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:43:35" (1/1) ... [2018-01-25 05:43:35,862 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:43:35" (1/1) ... [2018-01-25 05:43:35,872 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:43:35" (1/1) ... [2018-01-25 05:43:35,872 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:43:35" (1/1) ... [2018-01-25 05:43:35,881 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:43:35" (1/1) ... [2018-01-25 05:43:35,885 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:43:35" (1/1) ... [2018-01-25 05:43:35,887 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:43:35" (1/1) ... [2018-01-25 05:43:35,890 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-25 05:43:35,891 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-25 05:43:35,891 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-25 05:43:35,891 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-25 05:43:35,892 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:43:35" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-25 05:43:35,942 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-25 05:43:35,943 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-25 05:43:35,943 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-25 05:43:35,943 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-25 05:43:35,943 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-25 05:43:35,943 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-25 05:43:35,943 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-25 05:43:35,944 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-25 05:43:35,944 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-25 05:43:35,944 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-25 05:43:35,944 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-25 05:43:35,944 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-25 05:43:35,944 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-01-25 05:43:35,945 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-25 05:43:35,945 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-25 05:43:35,945 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-25 05:43:35,945 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-25 05:43:36,489 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-25 05:43:36,489 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 05:43:36 BoogieIcfgContainer [2018-01-25 05:43:36,490 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-25 05:43:36,491 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-25 05:43:36,491 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-25 05:43:36,494 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-25 05:43:36,494 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.01 05:43:35" (1/3) ... [2018-01-25 05:43:36,496 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22c51d50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 05:43:36, skipping insertion in model container [2018-01-25 05:43:36,496 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:43:35" (2/3) ... [2018-01-25 05:43:36,496 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22c51d50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 05:43:36, skipping insertion in model container [2018-01-25 05:43:36,497 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 05:43:36" (3/3) ... [2018-01-25 05:43:36,499 INFO L105 eAbstractionObserver]: Analyzing ICFG test-0513_true-valid-memsafety.i [2018-01-25 05:43:36,508 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-25 05:43:36,517 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 59 error locations. [2018-01-25 05:43:36,571 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-25 05:43:36,572 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-25 05:43:36,572 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-25 05:43:36,572 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-25 05:43:36,572 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-25 05:43:36,572 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-25 05:43:36,572 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-25 05:43:36,573 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-25 05:43:36,574 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-25 05:43:36,599 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states. [2018-01-25 05:43:36,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-01-25 05:43:36,607 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:43:36,608 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:43:36,608 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr58EnsuresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-25 05:43:36,614 INFO L82 PathProgramCache]: Analyzing trace with hash -894299951, now seen corresponding path program 1 times [2018-01-25 05:43:36,617 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:43:36,678 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:43:36,678 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:43:36,679 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:43:36,679 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:43:36,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:43:36,736 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:43:36,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:43:36,770 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:43:36,770 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-25 05:43:36,771 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:43:36,774 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-25 05:43:36,792 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-25 05:43:36,793 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-25 05:43:36,796 INFO L87 Difference]: Start difference. First operand 137 states. Second operand 2 states. [2018-01-25 05:43:36,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:43:36,918 INFO L93 Difference]: Finished difference Result 268 states and 294 transitions. [2018-01-25 05:43:36,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-25 05:43:36,919 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 9 [2018-01-25 05:43:36,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:43:36,929 INFO L225 Difference]: With dead ends: 268 [2018-01-25 05:43:36,929 INFO L226 Difference]: Without dead ends: 134 [2018-01-25 05:43:36,932 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-25 05:43:36,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-01-25 05:43:36,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2018-01-25 05:43:36,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-01-25 05:43:36,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 142 transitions. [2018-01-25 05:43:36,969 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 142 transitions. Word has length 9 [2018-01-25 05:43:36,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:43:36,969 INFO L432 AbstractCegarLoop]: Abstraction has 134 states and 142 transitions. [2018-01-25 05:43:36,969 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-25 05:43:36,969 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 142 transitions. [2018-01-25 05:43:36,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-01-25 05:43:36,970 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:43:36,970 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:43:36,970 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr58EnsuresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-25 05:43:36,970 INFO L82 PathProgramCache]: Analyzing trace with hash -477652767, now seen corresponding path program 1 times [2018-01-25 05:43:36,970 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:43:36,971 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:43:36,971 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:43:36,972 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:43:36,972 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:43:36,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:43:36,985 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:43:37,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:43:37,023 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:43:37,023 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-25 05:43:37,023 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:43:37,025 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-25 05:43:37,025 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-25 05:43:37,025 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-25 05:43:37,025 INFO L87 Difference]: Start difference. First operand 134 states and 142 transitions. Second operand 3 states. [2018-01-25 05:43:37,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:43:37,191 INFO L93 Difference]: Finished difference Result 178 states and 188 transitions. [2018-01-25 05:43:37,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-25 05:43:37,191 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-01-25 05:43:37,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:43:37,193 INFO L225 Difference]: With dead ends: 178 [2018-01-25 05:43:37,193 INFO L226 Difference]: Without dead ends: 176 [2018-01-25 05:43:37,194 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-25 05:43:37,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-01-25 05:43:37,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 138. [2018-01-25 05:43:37,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-01-25 05:43:37,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 147 transitions. [2018-01-25 05:43:37,204 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 147 transitions. Word has length 11 [2018-01-25 05:43:37,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:43:37,204 INFO L432 AbstractCegarLoop]: Abstraction has 138 states and 147 transitions. [2018-01-25 05:43:37,204 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-25 05:43:37,204 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 147 transitions. [2018-01-25 05:43:37,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-01-25 05:43:37,205 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:43:37,205 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:43:37,205 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr58EnsuresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-25 05:43:37,205 INFO L82 PathProgramCache]: Analyzing trace with hash -1922337046, now seen corresponding path program 1 times [2018-01-25 05:43:37,205 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:43:37,207 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:43:37,207 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:43:37,207 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:43:37,207 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:43:37,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:43:37,218 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:43:37,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:43:37,248 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:43:37,248 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 05:43:37,249 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:43:37,249 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-25 05:43:37,249 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-25 05:43:37,249 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-25 05:43:37,249 INFO L87 Difference]: Start difference. First operand 138 states and 147 transitions. Second operand 3 states. [2018-01-25 05:43:37,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:43:37,328 INFO L93 Difference]: Finished difference Result 282 states and 299 transitions. [2018-01-25 05:43:37,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-25 05:43:37,329 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-01-25 05:43:37,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:43:37,330 INFO L225 Difference]: With dead ends: 282 [2018-01-25 05:43:37,331 INFO L226 Difference]: Without dead ends: 153 [2018-01-25 05:43:37,332 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-25 05:43:37,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-01-25 05:43:37,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 147. [2018-01-25 05:43:37,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-01-25 05:43:37,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 159 transitions. [2018-01-25 05:43:37,345 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 159 transitions. Word has length 12 [2018-01-25 05:43:37,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:43:37,345 INFO L432 AbstractCegarLoop]: Abstraction has 147 states and 159 transitions. [2018-01-25 05:43:37,345 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-25 05:43:37,345 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 159 transitions. [2018-01-25 05:43:37,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-25 05:43:37,346 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:43:37,346 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:43:37,346 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr58EnsuresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-25 05:43:37,347 INFO L82 PathProgramCache]: Analyzing trace with hash 537460283, now seen corresponding path program 1 times [2018-01-25 05:43:37,347 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:43:37,348 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:43:37,348 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:43:37,348 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:43:37,348 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:43:37,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:43:37,362 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:43:37,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:43:37,401 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:43:37,401 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 05:43:37,401 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:43:37,401 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 05:43:37,402 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 05:43:37,402 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 05:43:37,402 INFO L87 Difference]: Start difference. First operand 147 states and 159 transitions. Second operand 4 states. [2018-01-25 05:43:37,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:43:37,701 INFO L93 Difference]: Finished difference Result 223 states and 239 transitions. [2018-01-25 05:43:37,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 05:43:37,701 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-01-25 05:43:37,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:43:37,705 INFO L225 Difference]: With dead ends: 223 [2018-01-25 05:43:37,705 INFO L226 Difference]: Without dead ends: 219 [2018-01-25 05:43:37,706 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-25 05:43:37,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2018-01-25 05:43:37,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 149. [2018-01-25 05:43:37,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-01-25 05:43:37,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 163 transitions. [2018-01-25 05:43:37,719 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 163 transitions. Word has length 13 [2018-01-25 05:43:37,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:43:37,719 INFO L432 AbstractCegarLoop]: Abstraction has 149 states and 163 transitions. [2018-01-25 05:43:37,719 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 05:43:37,720 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 163 transitions. [2018-01-25 05:43:37,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-25 05:43:37,720 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:43:37,720 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:43:37,720 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr58EnsuresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-25 05:43:37,721 INFO L82 PathProgramCache]: Analyzing trace with hash 537460284, now seen corresponding path program 1 times [2018-01-25 05:43:37,721 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:43:37,722 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:43:37,722 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:43:37,722 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:43:37,722 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:43:37,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:43:37,735 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:43:37,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:43:37,793 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:43:37,793 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 05:43:37,793 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:43:37,794 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 05:43:37,794 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 05:43:37,794 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 05:43:37,794 INFO L87 Difference]: Start difference. First operand 149 states and 163 transitions. Second operand 4 states. [2018-01-25 05:43:37,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:43:37,924 INFO L93 Difference]: Finished difference Result 149 states and 163 transitions. [2018-01-25 05:43:37,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-25 05:43:37,924 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-01-25 05:43:37,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:43:37,925 INFO L225 Difference]: With dead ends: 149 [2018-01-25 05:43:37,925 INFO L226 Difference]: Without dead ends: 147 [2018-01-25 05:43:37,925 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-25 05:43:37,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-01-25 05:43:37,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2018-01-25 05:43:37,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-01-25 05:43:37,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 159 transitions. [2018-01-25 05:43:37,933 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 159 transitions. Word has length 13 [2018-01-25 05:43:37,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:43:37,934 INFO L432 AbstractCegarLoop]: Abstraction has 147 states and 159 transitions. [2018-01-25 05:43:37,934 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 05:43:37,934 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 159 transitions. [2018-01-25 05:43:37,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-25 05:43:37,934 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:43:37,934 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-25 05:43:37,935 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr58EnsuresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-25 05:43:37,935 INFO L82 PathProgramCache]: Analyzing trace with hash 632206755, now seen corresponding path program 1 times [2018-01-25 05:43:37,935 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:43:37,936 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:43:37,936 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:43:37,936 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:43:37,936 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:43:37,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:43:37,951 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:43:37,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:43:37,981 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:43:37,981 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 05:43:37,981 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:43:37,981 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 05:43:37,981 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 05:43:37,981 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 05:43:37,982 INFO L87 Difference]: Start difference. First operand 147 states and 159 transitions. Second operand 4 states. [2018-01-25 05:43:38,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:43:38,102 INFO L93 Difference]: Finished difference Result 185 states and 198 transitions. [2018-01-25 05:43:38,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 05:43:38,103 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-01-25 05:43:38,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:43:38,104 INFO L225 Difference]: With dead ends: 185 [2018-01-25 05:43:38,104 INFO L226 Difference]: Without dead ends: 181 [2018-01-25 05:43:38,104 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-25 05:43:38,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2018-01-25 05:43:38,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 143. [2018-01-25 05:43:38,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-01-25 05:43:38,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 155 transitions. [2018-01-25 05:43:38,112 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 155 transitions. Word has length 20 [2018-01-25 05:43:38,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:43:38,112 INFO L432 AbstractCegarLoop]: Abstraction has 143 states and 155 transitions. [2018-01-25 05:43:38,112 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 05:43:38,112 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 155 transitions. [2018-01-25 05:43:38,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-25 05:43:38,113 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:43:38,113 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-25 05:43:38,114 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr58EnsuresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-25 05:43:38,114 INFO L82 PathProgramCache]: Analyzing trace with hash 632206756, now seen corresponding path program 1 times [2018-01-25 05:43:38,114 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:43:38,115 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:43:38,115 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:43:38,115 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:43:38,115 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:43:38,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:43:38,129 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:43:38,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:43:38,173 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:43:38,173 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 05:43:38,173 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:43:38,173 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 05:43:38,173 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 05:43:38,174 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 05:43:38,174 INFO L87 Difference]: Start difference. First operand 143 states and 155 transitions. Second operand 4 states. [2018-01-25 05:43:38,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:43:38,280 INFO L93 Difference]: Finished difference Result 143 states and 155 transitions. [2018-01-25 05:43:38,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-25 05:43:38,281 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-01-25 05:43:38,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:43:38,282 INFO L225 Difference]: With dead ends: 143 [2018-01-25 05:43:38,282 INFO L226 Difference]: Without dead ends: 140 [2018-01-25 05:43:38,283 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-25 05:43:38,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-01-25 05:43:38,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2018-01-25 05:43:38,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-01-25 05:43:38,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 152 transitions. [2018-01-25 05:43:38,290 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 152 transitions. Word has length 20 [2018-01-25 05:43:38,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:43:38,291 INFO L432 AbstractCegarLoop]: Abstraction has 140 states and 152 transitions. [2018-01-25 05:43:38,291 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 05:43:38,291 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 152 transitions. [2018-01-25 05:43:38,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-25 05:43:38,292 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:43:38,292 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:43:38,292 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr58EnsuresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-25 05:43:38,292 INFO L82 PathProgramCache]: Analyzing trace with hash -145487102, now seen corresponding path program 1 times [2018-01-25 05:43:38,292 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:43:38,293 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:43:38,293 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:43:38,294 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:43:38,294 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:43:38,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:43:38,307 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:43:38,359 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:43:38,359 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:43:38,360 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 05:43:38,360 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:43:38,360 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 05:43:38,360 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 05:43:38,361 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 05:43:38,361 INFO L87 Difference]: Start difference. First operand 140 states and 152 transitions. Second operand 5 states. [2018-01-25 05:43:38,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:43:38,531 INFO L93 Difference]: Finished difference Result 355 states and 389 transitions. [2018-01-25 05:43:38,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 05:43:38,532 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2018-01-25 05:43:38,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:43:38,533 INFO L225 Difference]: With dead ends: 355 [2018-01-25 05:43:38,533 INFO L226 Difference]: Without dead ends: 234 [2018-01-25 05:43:38,534 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 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-25 05:43:38,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2018-01-25 05:43:38,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 140. [2018-01-25 05:43:38,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-01-25 05:43:38,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 150 transitions. [2018-01-25 05:43:38,541 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 150 transitions. Word has length 28 [2018-01-25 05:43:38,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:43:38,542 INFO L432 AbstractCegarLoop]: Abstraction has 140 states and 150 transitions. [2018-01-25 05:43:38,542 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 05:43:38,542 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 150 transitions. [2018-01-25 05:43:38,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-25 05:43:38,542 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:43:38,542 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:43:38,546 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr58EnsuresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-25 05:43:38,547 INFO L82 PathProgramCache]: Analyzing trace with hash -215136023, now seen corresponding path program 1 times [2018-01-25 05:43:38,547 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:43:38,548 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:43:38,548 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:43:38,548 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:43:38,548 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:43:38,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:43:38,564 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:43:38,604 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:43:38,604 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:43:38,604 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 05:43:38,604 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:43:38,604 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 05:43:38,604 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 05:43:38,605 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-25 05:43:38,605 INFO L87 Difference]: Start difference. First operand 140 states and 150 transitions. Second operand 5 states. [2018-01-25 05:43:38,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:43:38,763 INFO L93 Difference]: Finished difference Result 146 states and 156 transitions. [2018-01-25 05:43:38,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 05:43:38,763 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2018-01-25 05:43:38,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:43:38,764 INFO L225 Difference]: With dead ends: 146 [2018-01-25 05:43:38,764 INFO L226 Difference]: Without dead ends: 137 [2018-01-25 05:43:38,765 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-01-25 05:43:38,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-01-25 05:43:38,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 134. [2018-01-25 05:43:38,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-01-25 05:43:38,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 145 transitions. [2018-01-25 05:43:38,770 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 145 transitions. Word has length 29 [2018-01-25 05:43:38,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:43:38,771 INFO L432 AbstractCegarLoop]: Abstraction has 134 states and 145 transitions. [2018-01-25 05:43:38,771 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 05:43:38,771 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 145 transitions. [2018-01-25 05:43:38,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-25 05:43:38,771 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:43:38,772 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:43:38,772 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr58EnsuresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-25 05:43:38,772 INFO L82 PathProgramCache]: Analyzing trace with hash -215136022, now seen corresponding path program 1 times [2018-01-25 05:43:38,772 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:43:38,773 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:43:38,773 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:43:38,773 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:43:38,773 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:43:38,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:43:38,786 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:43:38,878 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:43:38,878 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:43:38,878 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 05:43:38,878 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:43:38,879 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 05:43:38,879 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 05:43:38,879 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 05:43:38,879 INFO L87 Difference]: Start difference. First operand 134 states and 145 transitions. Second operand 5 states. [2018-01-25 05:43:39,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:43:39,105 INFO L93 Difference]: Finished difference Result 220 states and 239 transitions. [2018-01-25 05:43:39,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 05:43:39,105 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2018-01-25 05:43:39,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:43:39,106 INFO L225 Difference]: With dead ends: 220 [2018-01-25 05:43:39,106 INFO L226 Difference]: Without dead ends: 210 [2018-01-25 05:43:39,107 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-01-25 05:43:39,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2018-01-25 05:43:39,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 174. [2018-01-25 05:43:39,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-01-25 05:43:39,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 216 transitions. [2018-01-25 05:43:39,114 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 216 transitions. Word has length 29 [2018-01-25 05:43:39,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:43:39,114 INFO L432 AbstractCegarLoop]: Abstraction has 174 states and 216 transitions. [2018-01-25 05:43:39,114 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 05:43:39,115 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 216 transitions. [2018-01-25 05:43:39,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-25 05:43:39,116 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:43:39,116 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:43:39,116 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr58EnsuresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-25 05:43:39,116 INFO L82 PathProgramCache]: Analyzing trace with hash 1844152872, now seen corresponding path program 1 times [2018-01-25 05:43:39,117 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:43:39,117 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:43:39,118 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:43:39,118 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:43:39,118 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:43:39,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:43:39,137 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:43:39,385 WARN L146 SmtUtils]: Spent 116ms on a formula simplification. DAG size of input: 26 DAG size of output 21 [2018-01-25 05:43:39,457 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:43:39,457 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:43:39,458 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-25 05:43:39,458 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:43:39,458 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 05:43:39,458 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 05:43:39,459 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-25 05:43:39,459 INFO L87 Difference]: Start difference. First operand 174 states and 216 transitions. Second operand 6 states. [2018-01-25 05:43:39,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:43:39,635 INFO L93 Difference]: Finished difference Result 329 states and 413 transitions. [2018-01-25 05:43:39,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 05:43:39,635 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2018-01-25 05:43:39,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:43:39,637 INFO L225 Difference]: With dead ends: 329 [2018-01-25 05:43:39,637 INFO L226 Difference]: Without dead ends: 202 [2018-01-25 05:43:39,638 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-01-25 05:43:39,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2018-01-25 05:43:39,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 183. [2018-01-25 05:43:39,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-01-25 05:43:39,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 226 transitions. [2018-01-25 05:43:39,648 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 226 transitions. Word has length 34 [2018-01-25 05:43:39,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:43:39,648 INFO L432 AbstractCegarLoop]: Abstraction has 183 states and 226 transitions. [2018-01-25 05:43:39,649 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 05:43:39,649 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 226 transitions. [2018-01-25 05:43:39,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-01-25 05:43:39,650 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:43:39,650 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] [2018-01-25 05:43:39,650 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr58EnsuresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-25 05:43:39,650 INFO L82 PathProgramCache]: Analyzing trace with hash -525574038, now seen corresponding path program 1 times [2018-01-25 05:43:39,650 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:43:39,651 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:43:39,651 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:43:39,651 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:43:39,652 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:43:39,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:43:39,670 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:43:39,937 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:43:39,937 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:43:39,938 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-01-25 05:43:39,938 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:43:39,938 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-25 05:43:39,938 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-25 05:43:39,939 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-01-25 05:43:39,939 INFO L87 Difference]: Start difference. First operand 183 states and 226 transitions. Second operand 11 states. [2018-01-25 05:43:40,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:43:40,530 INFO L93 Difference]: Finished difference Result 246 states and 291 transitions. [2018-01-25 05:43:40,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-01-25 05:43:40,530 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 36 [2018-01-25 05:43:40,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:43:40,532 INFO L225 Difference]: With dead ends: 246 [2018-01-25 05:43:40,532 INFO L226 Difference]: Without dead ends: 245 [2018-01-25 05:43:40,533 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=119, Invalid=343, Unknown=0, NotChecked=0, Total=462 [2018-01-25 05:43:40,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2018-01-25 05:43:40,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 189. [2018-01-25 05:43:40,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-01-25 05:43:40,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 234 transitions. [2018-01-25 05:43:40,544 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 234 transitions. Word has length 36 [2018-01-25 05:43:40,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:43:40,545 INFO L432 AbstractCegarLoop]: Abstraction has 189 states and 234 transitions. [2018-01-25 05:43:40,545 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-25 05:43:40,545 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 234 transitions. [2018-01-25 05:43:40,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-01-25 05:43:40,546 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:43:40,546 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] [2018-01-25 05:43:40,546 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr58EnsuresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-25 05:43:40,546 INFO L82 PathProgramCache]: Analyzing trace with hash -525574037, now seen corresponding path program 1 times [2018-01-25 05:43:40,547 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:43:40,548 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:43:40,548 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:43:40,548 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:43:40,548 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:43:40,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:43:40,565 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:43:40,873 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:43:40,874 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:43:40,874 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-01-25 05:43:40,874 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:43:40,874 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-25 05:43:40,874 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-25 05:43:40,874 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-01-25 05:43:40,875 INFO L87 Difference]: Start difference. First operand 189 states and 234 transitions. Second operand 11 states. [2018-01-25 05:43:41,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:43:41,321 INFO L93 Difference]: Finished difference Result 222 states and 265 transitions. [2018-01-25 05:43:41,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-25 05:43:41,321 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 36 [2018-01-25 05:43:41,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:43:41,323 INFO L225 Difference]: With dead ends: 222 [2018-01-25 05:43:41,323 INFO L226 Difference]: Without dead ends: 221 [2018-01-25 05:43:41,323 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=154, Invalid=398, Unknown=0, NotChecked=0, Total=552 [2018-01-25 05:43:41,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2018-01-25 05:43:41,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 189. [2018-01-25 05:43:41,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-01-25 05:43:41,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 233 transitions. [2018-01-25 05:43:41,330 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 233 transitions. Word has length 36 [2018-01-25 05:43:41,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:43:41,330 INFO L432 AbstractCegarLoop]: Abstraction has 189 states and 233 transitions. [2018-01-25 05:43:41,330 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-25 05:43:41,331 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 233 transitions. [2018-01-25 05:43:41,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-25 05:43:41,331 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:43:41,331 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:43:41,332 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr58EnsuresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-25 05:43:41,332 INFO L82 PathProgramCache]: Analyzing trace with hash 887072562, now seen corresponding path program 1 times [2018-01-25 05:43:41,332 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:43:41,333 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:43:41,333 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:43:41,333 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:43:41,333 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:43:41,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:43:41,345 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:43:41,698 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:43:41,698 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:43:41,698 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-01-25 05:43:41,698 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:43:41,699 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-25 05:43:41,699 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-25 05:43:41,699 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-01-25 05:43:41,699 INFO L87 Difference]: Start difference. First operand 189 states and 233 transitions. Second operand 10 states. [2018-01-25 05:43:41,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:43:41,940 INFO L93 Difference]: Finished difference Result 209 states and 252 transitions. [2018-01-25 05:43:41,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-25 05:43:41,940 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 37 [2018-01-25 05:43:41,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:43:41,942 INFO L225 Difference]: With dead ends: 209 [2018-01-25 05:43:41,942 INFO L226 Difference]: Without dead ends: 206 [2018-01-25 05:43:41,943 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=98, Invalid=244, Unknown=0, NotChecked=0, Total=342 [2018-01-25 05:43:41,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2018-01-25 05:43:41,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 189. [2018-01-25 05:43:41,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-01-25 05:43:41,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 232 transitions. [2018-01-25 05:43:41,952 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 232 transitions. Word has length 37 [2018-01-25 05:43:41,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:43:41,952 INFO L432 AbstractCegarLoop]: Abstraction has 189 states and 232 transitions. [2018-01-25 05:43:41,952 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-25 05:43:41,952 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 232 transitions. [2018-01-25 05:43:41,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-01-25 05:43:41,953 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:43:41,953 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] [2018-01-25 05:43:41,953 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr58EnsuresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-25 05:43:41,953 INFO L82 PathProgramCache]: Analyzing trace with hash 1729495531, now seen corresponding path program 1 times [2018-01-25 05:43:41,953 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:43:41,954 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:43:41,954 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:43:41,954 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:43:41,954 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:43:41,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:43:41,968 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:43:42,352 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:43:42,352 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:43:42,353 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-01-25 05:43:42,353 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:43:42,353 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-25 05:43:42,353 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-25 05:43:42,353 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-01-25 05:43:42,354 INFO L87 Difference]: Start difference. First operand 189 states and 232 transitions. Second operand 11 states. [2018-01-25 05:43:42,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:43:42,699 INFO L93 Difference]: Finished difference Result 242 states and 287 transitions. [2018-01-25 05:43:42,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-25 05:43:42,699 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 38 [2018-01-25 05:43:42,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:43:42,701 INFO L225 Difference]: With dead ends: 242 [2018-01-25 05:43:42,701 INFO L226 Difference]: Without dead ends: 241 [2018-01-25 05:43:42,702 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=147, Invalid=405, Unknown=0, NotChecked=0, Total=552 [2018-01-25 05:43:42,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2018-01-25 05:43:42,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 191. [2018-01-25 05:43:42,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-01-25 05:43:42,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 235 transitions. [2018-01-25 05:43:42,713 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 235 transitions. Word has length 38 [2018-01-25 05:43:42,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:43:42,713 INFO L432 AbstractCegarLoop]: Abstraction has 191 states and 235 transitions. [2018-01-25 05:43:42,713 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-25 05:43:42,713 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 235 transitions. [2018-01-25 05:43:42,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-01-25 05:43:42,714 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:43:42,714 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] [2018-01-25 05:43:42,714 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr58EnsuresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-25 05:43:42,714 INFO L82 PathProgramCache]: Analyzing trace with hash 1729495532, now seen corresponding path program 1 times [2018-01-25 05:43:42,715 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:43:42,715 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:43:42,716 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:43:42,716 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:43:42,716 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:43:42,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:43:42,727 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:43:42,749 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-25 05:43:42,749 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:43:42,749 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 05:43:42,750 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:43:42,750 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 05:43:42,750 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 05:43:42,750 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 05:43:42,750 INFO L87 Difference]: Start difference. First operand 191 states and 235 transitions. Second operand 4 states. [2018-01-25 05:43:42,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:43:42,883 INFO L93 Difference]: Finished difference Result 247 states and 305 transitions. [2018-01-25 05:43:42,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 05:43:42,883 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 38 [2018-01-25 05:43:42,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:43:42,884 INFO L225 Difference]: With dead ends: 247 [2018-01-25 05:43:42,884 INFO L226 Difference]: Without dead ends: 244 [2018-01-25 05:43:42,884 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-25 05:43:42,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2018-01-25 05:43:42,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 197. [2018-01-25 05:43:42,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-01-25 05:43:42,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 247 transitions. [2018-01-25 05:43:42,894 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 247 transitions. Word has length 38 [2018-01-25 05:43:42,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:43:42,894 INFO L432 AbstractCegarLoop]: Abstraction has 197 states and 247 transitions. [2018-01-25 05:43:42,894 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 05:43:42,894 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 247 transitions. [2018-01-25 05:43:42,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-01-25 05:43:42,895 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:43:42,895 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:43:42,895 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr58EnsuresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-25 05:43:42,895 INFO L82 PathProgramCache]: Analyzing trace with hash 973830348, now seen corresponding path program 1 times [2018-01-25 05:43:42,895 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:43:42,896 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:43:42,896 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:43:42,896 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:43:42,897 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:43:42,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:43:42,913 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:43:43,424 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:43:43,424 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:43:43,424 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 05:43:43,425 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 42 with the following transitions: [2018-01-25 05:43:43,427 INFO L201 CegarAbsIntRunner]: [0], [4], [6], [9], [11], [12], [13], [18], [20], [23], [24], [27], [28], [29], [44], [45], [48], [50], [53], [60], [64], [66], [71], [170], [173], [174], [180], [186], [187], [188], [190], [191], [200], [201], [205], [206], [207] [2018-01-25 05:43:43,482 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 05:43:43,482 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) Received shutdown request... [2018-01-25 05:44:33,428 WARN L571 FixpointEngine]: Received timeout, aborting fixpoint engine [2018-01-25 05:44:33,428 WARN L157 AbstractInterpreter]: Abstract interpretation run out of time [2018-01-25 05:44:33,429 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-25 05:44:33,429 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:44:33,429 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-25 05:44:33,436 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:44:33,436 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 05:44:33,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:44:33,494 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:44:33,509 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-01-25 05:44:33,510 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-25 05:44:33,518 WARN L187 ceAbstractionStarter]: Timeout [2018-01-25 05:44:33,519 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.01 05:44:33 BoogieIcfgContainer [2018-01-25 05:44:33,519 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-25 05:44:33,520 INFO L168 Benchmark]: Toolchain (without parser) took 57895.26 ms. Allocated memory was 307.2 MB in the beginning and 2.3 GB in the end (delta: 2.0 GB). Free memory was 267.3 MB in the beginning and 450.7 MB in the end (delta: -183.4 MB). Peak memory consumption was 1.8 GB. Max. memory is 5.3 GB. [2018-01-25 05:44:33,522 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 307.2 MB. Free memory is still 273.3 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-25 05:44:33,522 INFO L168 Benchmark]: CACSL2BoogieTranslator took 221.16 ms. Allocated memory is still 307.2 MB. Free memory was 266.3 MB in the beginning and 255.2 MB in the end (delta: 11.1 MB). Peak memory consumption was 11.1 MB. Max. memory is 5.3 GB. [2018-01-25 05:44:33,522 INFO L168 Benchmark]: Boogie Preprocessor took 39.71 ms. Allocated memory is still 307.2 MB. Free memory was 255.2 MB in the beginning and 253.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-25 05:44:33,523 INFO L168 Benchmark]: RCFGBuilder took 599.29 ms. Allocated memory is still 307.2 MB. Free memory was 253.2 MB in the beginning and 218.5 MB in the end (delta: 34.7 MB). Peak memory consumption was 34.7 MB. Max. memory is 5.3 GB. [2018-01-25 05:44:33,523 INFO L168 Benchmark]: TraceAbstraction took 57028.32 ms. Allocated memory was 307.2 MB in the beginning and 2.3 GB in the end (delta: 2.0 GB). Free memory was 217.5 MB in the beginning and 450.8 MB in the end (delta: -233.2 MB). Peak memory consumption was 1.8 GB. Max. memory is 5.3 GB. [2018-01-25 05:44:33,525 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.22 ms. Allocated memory is still 307.2 MB. Free memory is still 273.3 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 221.16 ms. Allocated memory is still 307.2 MB. Free memory was 266.3 MB in the beginning and 255.2 MB in the end (delta: 11.1 MB). Peak memory consumption was 11.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 39.71 ms. Allocated memory is still 307.2 MB. Free memory was 255.2 MB in the beginning and 253.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 599.29 ms. Allocated memory is still 307.2 MB. Free memory was 253.2 MB in the beginning and 218.5 MB in the end (delta: 34.7 MB). Peak memory consumption was 34.7 MB. Max. memory is 5.3 GB. * TraceAbstraction took 57028.32 ms. Allocated memory was 307.2 MB in the beginning and 2.3 GB in the end (delta: 2.0 GB). Free memory was 217.5 MB in the beginning and 450.8 MB in the end (delta: -233.2 MB). Peak memory consumption was 1.8 GB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 679). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 16 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 656). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 16 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 683). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 16 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 654). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 16 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 655). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 16 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 664). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 16 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 636). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 16 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 660). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 16 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 673). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 16 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 657). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 16 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 637). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 16 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 652). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 16 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 677). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 16 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 646). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 16 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 640). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 16 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 661). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 16 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 683). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 16 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 653). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 16 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 667). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 16 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 660). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 16 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 643). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 16 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 684). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 16 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 656). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 16 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 670). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 16 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 643). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 16 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 667). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 16 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 640). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 16 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 679). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 16 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 662). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 16 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 640). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 16 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 646). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 16 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 662). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 16 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 657). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 16 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 660). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 16 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 654). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 16 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 665). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 16 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 684). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 16 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 677). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 16 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 664). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 16 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 653). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 16 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 656). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 16 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 637). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 16 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 680). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 16 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 670). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 16 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 654). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 16 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 655). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 16 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 660). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 16 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 656). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 16 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 636). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 16 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 641). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 16 known predicates. - TimeoutResultAtElement [Line: 628]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 628). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 16 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 680). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 16 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 640). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 16 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 654). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 16 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 641). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 16 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 661). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 16 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 673). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 16 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 652). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 16 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 665). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 16 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 137 locations, 59 error locations. TIMEOUT Result, 56.9s OverallTime, 17 OverallIterations, 2 TraceHistogramMax, 3.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1718 SDtfs, 2388 SDslu, 2628 SDs, 0 SdLazy, 2693 SolverSat, 131 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 163 GetRequests, 32 SyntacticMatches, 12 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 323 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=197occurred in iteration=16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 50.0s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 16 MinimizatonAttempts, 506 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 403 NumberOfCodeBlocks, 403 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 387 ConstructedInterpolants, 0 QuantifiedInterpolants, 64960 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 27/27 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0513_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-25_05-44-33-537.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0513_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-25_05-44-33-537.csv Completed graceful shutdown