java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf -i ../../../trunk/examples/svcomp/forester-heap/dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 16:05:32,697 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 16:05:32,722 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 16:05:32,735 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 16:05:32,735 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 16:05:32,736 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 16:05:32,737 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 16:05:32,739 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 16:05:32,741 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 16:05:32,742 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 16:05:32,743 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 16:05:32,743 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 16:05:32,743 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 16:05:32,744 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 16:05:32,745 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 16:05:32,747 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 16:05:32,749 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 16:05:32,751 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 16:05:32,753 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 16:05:32,754 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 16:05:32,756 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 16:05:32,757 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 16:05:32,757 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 16:05:32,758 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 16:05:32,759 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 16:05:32,760 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 16:05:32,760 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 16:05:32,761 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 16:05:32,761 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 16:05:32,761 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 16:05:32,762 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 16:05:32,762 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf [2018-01-24 16:05:32,772 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 16:05:32,772 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 16:05:32,773 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 16:05:32,773 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 16:05:32,773 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 16:05:32,773 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 16:05:32,774 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 16:05:32,774 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 16:05:32,774 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 16:05:32,775 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 16:05:32,775 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 16:05:32,775 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 16:05:32,775 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 16:05:32,775 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 16:05:32,776 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 16:05:32,776 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 16:05:32,776 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 16:05:32,776 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 16:05:32,776 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 16:05:32,777 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 16:05:32,777 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 16:05:32,777 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 16:05:32,777 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 16:05:32,777 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 16:05:32,777 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 16:05:32,778 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 16:05:32,778 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 16:05:32,778 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 16:05:32,778 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-24 16:05:32,779 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 16:05:32,779 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 16:05:32,779 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 16:05:32,779 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-24 16:05:32,780 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 16:05:32,780 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 16:05:32,814 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 16:05:32,827 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 16:05:32,831 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 16:05:32,832 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 16:05:32,833 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 16:05:32,833 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-01-24 16:05:33,008 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 16:05:33,012 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 16:05:33,013 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 16:05:33,013 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 16:05:33,018 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 16:05:33,019 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 04:05:33" (1/1) ... [2018-01-24 16:05:33,021 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13ee3542 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:05:33, skipping insertion in model container [2018-01-24 16:05:33,021 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 04:05:33" (1/1) ... [2018-01-24 16:05:33,039 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 16:05:33,081 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 16:05:33,193 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 16:05:33,212 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 16:05:33,219 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:05:33 WrapperNode [2018-01-24 16:05:33,219 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 16:05:33,220 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 16:05:33,220 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 16:05:33,220 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 16:05:33,231 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:05:33" (1/1) ... [2018-01-24 16:05:33,232 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:05:33" (1/1) ... [2018-01-24 16:05:33,244 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:05:33" (1/1) ... [2018-01-24 16:05:33,244 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:05:33" (1/1) ... [2018-01-24 16:05:33,250 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:05:33" (1/1) ... [2018-01-24 16:05:33,255 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:05:33" (1/1) ... [2018-01-24 16:05:33,256 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:05:33" (1/1) ... [2018-01-24 16:05:33,258 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 16:05:33,258 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 16:05:33,259 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 16:05:33,259 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 16:05:33,260 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:05:33" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 16:05:33,307 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 16:05:33,307 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 16:05:33,307 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 16:05:33,308 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-24 16:05:33,308 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-24 16:05:33,308 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-24 16:05:33,308 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-24 16:05:33,308 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 16:05:33,308 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 16:05:33,309 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 16:05:33,309 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-24 16:05:33,309 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-24 16:05:33,309 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 16:05:33,309 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-01-24 16:05:33,309 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 16:05:33,310 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 16:05:33,310 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 16:05:33,816 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 16:05:33,817 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 04:05:33 BoogieIcfgContainer [2018-01-24 16:05:33,817 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 16:05:33,818 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 16:05:33,819 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 16:05:33,821 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 16:05:33,821 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 04:05:33" (1/3) ... [2018-01-24 16:05:33,822 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ce7f277 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 04:05:33, skipping insertion in model container [2018-01-24 16:05:33,823 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:05:33" (2/3) ... [2018-01-24 16:05:33,823 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ce7f277 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 04:05:33, skipping insertion in model container [2018-01-24 16:05:33,823 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 04:05:33" (3/3) ... [2018-01-24 16:05:33,825 INFO L105 eAbstractionObserver]: Analyzing ICFG dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-01-24 16:05:33,834 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 16:05:33,841 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 57 error locations. [2018-01-24 16:05:33,892 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 16:05:33,893 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 16:05:33,893 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 16:05:33,893 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 16:05:33,893 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 16:05:33,893 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 16:05:33,893 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 16:05:33,894 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 16:05:33,895 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 16:05:33,918 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states. [2018-01-24 16:05:33,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-01-24 16:05:33,924 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:05:33,925 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:05:33,926 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, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr56EnsuresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 16:05:33,931 INFO L82 PathProgramCache]: Analyzing trace with hash -2026691577, now seen corresponding path program 1 times [2018-01-24 16:05:33,933 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:05:33,980 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:05:33,980 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:05:33,980 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:05:33,981 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:05:34,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:05:34,031 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:05:34,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:05:34,095 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:05:34,095 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 16:05:34,095 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:05:34,098 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 16:05:34,187 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 16:05:34,188 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 16:05:34,190 INFO L87 Difference]: Start difference. First operand 133 states. Second operand 4 states. [2018-01-24 16:05:34,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:05:34,477 INFO L93 Difference]: Finished difference Result 270 states and 310 transitions. [2018-01-24 16:05:34,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 16:05:34,478 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-01-24 16:05:34,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:05:34,492 INFO L225 Difference]: With dead ends: 270 [2018-01-24 16:05:34,492 INFO L226 Difference]: Without dead ends: 166 [2018-01-24 16:05:34,496 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 16:05:34,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-01-24 16:05:34,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 124. [2018-01-24 16:05:34,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-01-24 16:05:34,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 131 transitions. [2018-01-24 16:05:34,531 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 131 transitions. Word has length 8 [2018-01-24 16:05:34,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:05:34,532 INFO L432 AbstractCegarLoop]: Abstraction has 124 states and 131 transitions. [2018-01-24 16:05:34,532 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 16:05:34,532 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 131 transitions. [2018-01-24 16:05:34,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-01-24 16:05:34,532 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:05:34,532 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:05:34,532 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, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr56EnsuresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 16:05:34,533 INFO L82 PathProgramCache]: Analyzing trace with hash -2026691576, now seen corresponding path program 1 times [2018-01-24 16:05:34,533 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:05:34,533 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:05:34,534 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:05:34,534 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:05:34,534 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:05:34,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:05:34,550 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:05:34,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:05:34,616 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:05:34,616 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 16:05:34,616 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:05:34,618 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 16:05:34,618 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 16:05:34,618 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 16:05:34,618 INFO L87 Difference]: Start difference. First operand 124 states and 131 transitions. Second operand 4 states. [2018-01-24 16:05:34,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:05:34,819 INFO L93 Difference]: Finished difference Result 154 states and 163 transitions. [2018-01-24 16:05:34,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 16:05:34,819 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-01-24 16:05:34,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:05:34,821 INFO L225 Difference]: With dead ends: 154 [2018-01-24 16:05:34,822 INFO L226 Difference]: Without dead ends: 151 [2018-01-24 16:05:34,822 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 16:05:34,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-01-24 16:05:34,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 121. [2018-01-24 16:05:34,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-01-24 16:05:34,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 128 transitions. [2018-01-24 16:05:34,835 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 128 transitions. Word has length 8 [2018-01-24 16:05:34,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:05:34,835 INFO L432 AbstractCegarLoop]: Abstraction has 121 states and 128 transitions. [2018-01-24 16:05:34,835 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 16:05:34,835 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 128 transitions. [2018-01-24 16:05:34,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-24 16:05:34,836 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:05:34,836 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:05:34,837 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, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr56EnsuresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 16:05:34,837 INFO L82 PathProgramCache]: Analyzing trace with hash 2141337492, now seen corresponding path program 1 times [2018-01-24 16:05:34,837 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:05:34,838 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:05:34,838 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:05:34,839 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:05:34,839 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:05:34,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:05:34,866 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:05:34,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:05:34,934 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:05:34,934 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 16:05:34,934 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:05:34,935 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 16:05:34,935 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 16:05:34,935 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 16:05:34,936 INFO L87 Difference]: Start difference. First operand 121 states and 128 transitions. Second operand 4 states. [2018-01-24 16:05:35,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:05:35,074 INFO L93 Difference]: Finished difference Result 141 states and 148 transitions. [2018-01-24 16:05:35,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 16:05:35,074 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-01-24 16:05:35,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:05:35,075 INFO L225 Difference]: With dead ends: 141 [2018-01-24 16:05:35,075 INFO L226 Difference]: Without dead ends: 122 [2018-01-24 16:05:35,076 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 16:05:35,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-01-24 16:05:35,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 115. [2018-01-24 16:05:35,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-01-24 16:05:35,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 127 transitions. [2018-01-24 16:05:35,084 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 127 transitions. Word has length 16 [2018-01-24 16:05:35,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:05:35,085 INFO L432 AbstractCegarLoop]: Abstraction has 115 states and 127 transitions. [2018-01-24 16:05:35,085 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 16:05:35,085 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 127 transitions. [2018-01-24 16:05:35,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-24 16:05:35,085 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:05:35,086 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:05:35,086 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, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr56EnsuresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 16:05:35,086 INFO L82 PathProgramCache]: Analyzing trace with hash 2141337493, now seen corresponding path program 1 times [2018-01-24 16:05:35,086 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:05:35,087 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:05:35,087 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:05:35,087 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:05:35,087 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:05:35,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:05:35,107 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:05:35,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:05:35,201 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:05:35,201 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 16:05:35,201 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:05:35,201 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-24 16:05:35,201 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-24 16:05:35,202 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-01-24 16:05:35,202 INFO L87 Difference]: Start difference. First operand 115 states and 127 transitions. Second operand 7 states. [2018-01-24 16:05:35,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:05:35,586 INFO L93 Difference]: Finished difference Result 208 states and 227 transitions. [2018-01-24 16:05:35,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 16:05:35,587 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2018-01-24 16:05:35,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:05:35,588 INFO L225 Difference]: With dead ends: 208 [2018-01-24 16:05:35,588 INFO L226 Difference]: Without dead ends: 193 [2018-01-24 16:05:35,589 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-01-24 16:05:35,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-01-24 16:05:35,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 161. [2018-01-24 16:05:35,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-01-24 16:05:35,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 191 transitions. [2018-01-24 16:05:35,606 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 191 transitions. Word has length 16 [2018-01-24 16:05:35,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:05:35,607 INFO L432 AbstractCegarLoop]: Abstraction has 161 states and 191 transitions. [2018-01-24 16:05:35,607 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-24 16:05:35,607 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 191 transitions. [2018-01-24 16:05:35,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-24 16:05:35,608 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:05:35,608 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:05:35,608 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, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr56EnsuresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 16:05:35,609 INFO L82 PathProgramCache]: Analyzing trace with hash 535994936, now seen corresponding path program 1 times [2018-01-24 16:05:35,609 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:05:35,610 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:05:35,610 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:05:35,610 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:05:35,610 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:05:35,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:05:35,627 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:05:35,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:05:35,693 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:05:35,693 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 16:05:35,693 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:05:35,693 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 16:05:35,693 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 16:05:35,693 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 16:05:35,694 INFO L87 Difference]: Start difference. First operand 161 states and 191 transitions. Second operand 5 states. [2018-01-24 16:05:35,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:05:35,990 INFO L93 Difference]: Finished difference Result 282 states and 338 transitions. [2018-01-24 16:05:35,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 16:05:35,991 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-01-24 16:05:35,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:05:35,992 INFO L225 Difference]: With dead ends: 282 [2018-01-24 16:05:35,993 INFO L226 Difference]: Without dead ends: 281 [2018-01-24 16:05:35,993 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-01-24 16:05:35,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2018-01-24 16:05:36,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 160. [2018-01-24 16:05:36,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-01-24 16:05:36,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 189 transitions. [2018-01-24 16:05:36,008 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 189 transitions. Word has length 18 [2018-01-24 16:05:36,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:05:36,008 INFO L432 AbstractCegarLoop]: Abstraction has 160 states and 189 transitions. [2018-01-24 16:05:36,009 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 16:05:36,009 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 189 transitions. [2018-01-24 16:05:36,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-24 16:05:36,009 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:05:36,010 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:05:36,010 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, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr56EnsuresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 16:05:36,010 INFO L82 PathProgramCache]: Analyzing trace with hash 535994935, now seen corresponding path program 1 times [2018-01-24 16:05:36,010 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:05:36,011 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:05:36,011 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:05:36,011 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:05:36,011 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:05:36,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:05:36,022 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:05:36,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:05:36,051 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:05:36,051 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 16:05:36,051 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:05:36,051 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 16:05:36,052 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 16:05:36,052 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 16:05:36,052 INFO L87 Difference]: Start difference. First operand 160 states and 189 transitions. Second operand 5 states. [2018-01-24 16:05:36,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:05:36,259 INFO L93 Difference]: Finished difference Result 274 states and 326 transitions. [2018-01-24 16:05:36,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 16:05:36,259 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-01-24 16:05:36,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:05:36,262 INFO L225 Difference]: With dead ends: 274 [2018-01-24 16:05:36,262 INFO L226 Difference]: Without dead ends: 273 [2018-01-24 16:05:36,263 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-01-24 16:05:36,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2018-01-24 16:05:36,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 159. [2018-01-24 16:05:36,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-01-24 16:05:36,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 187 transitions. [2018-01-24 16:05:36,276 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 187 transitions. Word has length 18 [2018-01-24 16:05:36,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:05:36,276 INFO L432 AbstractCegarLoop]: Abstraction has 159 states and 187 transitions. [2018-01-24 16:05:36,276 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 16:05:36,276 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 187 transitions. [2018-01-24 16:05:36,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-24 16:05:36,277 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:05:36,277 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:05:36,277 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, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr56EnsuresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 16:05:36,277 INFO L82 PathProgramCache]: Analyzing trace with hash -598321662, now seen corresponding path program 1 times [2018-01-24 16:05:36,277 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:05:36,278 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:05:36,278 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:05:36,278 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:05:36,278 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:05:36,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:05:36,289 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:05:36,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:05:36,309 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:05:36,309 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 16:05:36,309 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:05:36,310 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 16:05:36,310 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 16:05:36,310 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 16:05:36,310 INFO L87 Difference]: Start difference. First operand 159 states and 187 transitions. Second operand 4 states. [2018-01-24 16:05:36,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:05:36,417 INFO L93 Difference]: Finished difference Result 175 states and 194 transitions. [2018-01-24 16:05:36,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 16:05:36,417 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2018-01-24 16:05:36,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:05:36,418 INFO L225 Difference]: With dead ends: 175 [2018-01-24 16:05:36,418 INFO L226 Difference]: Without dead ends: 174 [2018-01-24 16:05:36,419 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 16:05:36,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-01-24 16:05:36,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 158. [2018-01-24 16:05:36,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-01-24 16:05:36,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 186 transitions. [2018-01-24 16:05:36,427 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 186 transitions. Word has length 19 [2018-01-24 16:05:36,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:05:36,427 INFO L432 AbstractCegarLoop]: Abstraction has 158 states and 186 transitions. [2018-01-24 16:05:36,427 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 16:05:36,427 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 186 transitions. [2018-01-24 16:05:36,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-24 16:05:36,428 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:05:36,428 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:05:36,428 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, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr56EnsuresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 16:05:36,428 INFO L82 PathProgramCache]: Analyzing trace with hash -598321661, now seen corresponding path program 1 times [2018-01-24 16:05:36,428 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:05:36,429 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:05:36,429 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:05:36,429 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:05:36,429 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:05:36,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:05:36,440 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:05:36,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:05:36,485 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:05:36,485 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 16:05:36,485 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:05:36,486 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 16:05:36,486 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 16:05:36,486 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 16:05:36,486 INFO L87 Difference]: Start difference. First operand 158 states and 186 transitions. Second operand 4 states. [2018-01-24 16:05:36,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:05:36,581 INFO L93 Difference]: Finished difference Result 177 states and 198 transitions. [2018-01-24 16:05:36,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 16:05:36,581 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2018-01-24 16:05:36,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:05:36,582 INFO L225 Difference]: With dead ends: 177 [2018-01-24 16:05:36,582 INFO L226 Difference]: Without dead ends: 174 [2018-01-24 16:05:36,582 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 16:05:36,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-01-24 16:05:36,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 155. [2018-01-24 16:05:36,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-01-24 16:05:36,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 183 transitions. [2018-01-24 16:05:36,591 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 183 transitions. Word has length 19 [2018-01-24 16:05:36,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:05:36,591 INFO L432 AbstractCegarLoop]: Abstraction has 155 states and 183 transitions. [2018-01-24 16:05:36,591 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 16:05:36,592 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 183 transitions. [2018-01-24 16:05:36,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-24 16:05:36,592 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:05:36,592 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:05:36,592 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, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr56EnsuresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 16:05:36,593 INFO L82 PathProgramCache]: Analyzing trace with hash -992339015, now seen corresponding path program 1 times [2018-01-24 16:05:36,593 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:05:36,593 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:05:36,593 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:05:36,593 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:05:36,593 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:05:36,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:05:36,603 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:05:36,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:05:36,704 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:05:36,704 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-24 16:05:36,704 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:05:36,704 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-24 16:05:36,705 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-24 16:05:36,705 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-01-24 16:05:36,705 INFO L87 Difference]: Start difference. First operand 155 states and 183 transitions. Second operand 9 states. [2018-01-24 16:05:37,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:05:37,097 INFO L93 Difference]: Finished difference Result 161 states and 185 transitions. [2018-01-24 16:05:37,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 16:05:37,097 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2018-01-24 16:05:37,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:05:37,098 INFO L225 Difference]: With dead ends: 161 [2018-01-24 16:05:37,099 INFO L226 Difference]: Without dead ends: 160 [2018-01-24 16:05:37,099 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2018-01-24 16:05:37,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-01-24 16:05:37,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 154. [2018-01-24 16:05:37,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-01-24 16:05:37,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 182 transitions. [2018-01-24 16:05:37,113 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 182 transitions. Word has length 22 [2018-01-24 16:05:37,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:05:37,114 INFO L432 AbstractCegarLoop]: Abstraction has 154 states and 182 transitions. [2018-01-24 16:05:37,114 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-24 16:05:37,114 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 182 transitions. [2018-01-24 16:05:37,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-24 16:05:37,115 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:05:37,115 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:05:37,116 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, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr56EnsuresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 16:05:37,116 INFO L82 PathProgramCache]: Analyzing trace with hash -992339014, now seen corresponding path program 1 times [2018-01-24 16:05:37,116 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:05:37,117 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:05:37,117 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:05:37,117 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:05:37,117 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:05:37,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:05:37,132 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:05:37,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:05:37,618 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:05:37,619 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-24 16:05:37,619 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:05:37,619 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-24 16:05:37,619 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-24 16:05:37,619 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-01-24 16:05:37,619 INFO L87 Difference]: Start difference. First operand 154 states and 182 transitions. Second operand 10 states. [2018-01-24 16:05:38,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:05:38,180 INFO L93 Difference]: Finished difference Result 165 states and 190 transitions. [2018-01-24 16:05:38,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-24 16:05:38,180 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2018-01-24 16:05:38,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:05:38,181 INFO L225 Difference]: With dead ends: 165 [2018-01-24 16:05:38,181 INFO L226 Difference]: Without dead ends: 160 [2018-01-24 16:05:38,182 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=129, Invalid=291, Unknown=0, NotChecked=0, Total=420 [2018-01-24 16:05:38,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-01-24 16:05:38,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 140. [2018-01-24 16:05:38,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-01-24 16:05:38,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 167 transitions. [2018-01-24 16:05:38,189 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 167 transitions. Word has length 22 [2018-01-24 16:05:38,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:05:38,190 INFO L432 AbstractCegarLoop]: Abstraction has 140 states and 167 transitions. [2018-01-24 16:05:38,190 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-24 16:05:38,190 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 167 transitions. [2018-01-24 16:05:38,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-24 16:05:38,191 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:05:38,191 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:05:38,191 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, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr56EnsuresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 16:05:38,192 INFO L82 PathProgramCache]: Analyzing trace with hash 325408366, now seen corresponding path program 1 times [2018-01-24 16:05:38,192 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:05:38,193 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:05:38,193 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:05:38,193 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:05:38,193 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:05:38,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:05:38,204 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:05:38,326 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:05:38,327 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:05:38,327 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 16:05:38,327 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:05:38,327 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 16:05:38,328 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 16:05:38,328 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 16:05:38,328 INFO L87 Difference]: Start difference. First operand 140 states and 167 transitions. Second operand 5 states. [2018-01-24 16:05:38,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:05:38,483 INFO L93 Difference]: Finished difference Result 241 states and 282 transitions. [2018-01-24 16:05:38,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 16:05:38,483 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2018-01-24 16:05:38,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:05:38,484 INFO L225 Difference]: With dead ends: 241 [2018-01-24 16:05:38,485 INFO L226 Difference]: Without dead ends: 157 [2018-01-24 16:05:38,485 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-01-24 16:05:38,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-01-24 16:05:38,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 148. [2018-01-24 16:05:38,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-01-24 16:05:38,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 177 transitions. [2018-01-24 16:05:38,498 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 177 transitions. Word has length 24 [2018-01-24 16:05:38,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:05:38,498 INFO L432 AbstractCegarLoop]: Abstraction has 148 states and 177 transitions. [2018-01-24 16:05:38,498 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 16:05:38,498 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 177 transitions. [2018-01-24 16:05:38,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-24 16:05:38,499 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:05:38,499 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:05:38,499 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, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr56EnsuresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 16:05:38,499 INFO L82 PathProgramCache]: Analyzing trace with hash -1282351166, now seen corresponding path program 1 times [2018-01-24 16:05:38,499 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:05:38,500 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:05:38,500 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:05:38,500 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:05:38,501 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:05:38,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:05:38,513 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:05:38,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:05:38,575 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:05:38,575 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 16:05:38,575 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:05:38,576 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 16:05:38,576 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 16:05:38,576 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 16:05:38,576 INFO L87 Difference]: Start difference. First operand 148 states and 177 transitions. Second operand 5 states. [2018-01-24 16:05:38,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:05:38,930 INFO L93 Difference]: Finished difference Result 185 states and 204 transitions. [2018-01-24 16:05:38,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 16:05:38,931 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2018-01-24 16:05:38,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:05:38,932 INFO L225 Difference]: With dead ends: 185 [2018-01-24 16:05:38,932 INFO L226 Difference]: Without dead ends: 180 [2018-01-24 16:05:38,932 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 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-24 16:05:38,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2018-01-24 16:05:38,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 126. [2018-01-24 16:05:38,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-01-24 16:05:38,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 142 transitions. [2018-01-24 16:05:38,939 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 142 transitions. Word has length 25 [2018-01-24 16:05:38,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:05:38,939 INFO L432 AbstractCegarLoop]: Abstraction has 126 states and 142 transitions. [2018-01-24 16:05:38,939 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 16:05:38,939 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 142 transitions. [2018-01-24 16:05:38,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-24 16:05:38,940 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:05:38,941 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:05:38,941 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, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr56EnsuresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 16:05:38,941 INFO L82 PathProgramCache]: Analyzing trace with hash 1416942161, now seen corresponding path program 1 times [2018-01-24 16:05:38,941 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:05:38,942 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:05:38,942 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:05:38,942 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:05:38,942 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:05:38,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:05:38,953 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:05:39,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:05:39,101 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:05:39,101 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 16:05:39,101 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:05:39,101 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 16:05:39,101 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 16:05:39,101 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 16:05:39,101 INFO L87 Difference]: Start difference. First operand 126 states and 142 transitions. Second operand 6 states. [2018-01-24 16:05:39,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:05:39,382 INFO L93 Difference]: Finished difference Result 248 states and 276 transitions. [2018-01-24 16:05:39,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-24 16:05:39,383 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2018-01-24 16:05:39,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:05:39,384 INFO L225 Difference]: With dead ends: 248 [2018-01-24 16:05:39,384 INFO L226 Difference]: Without dead ends: 193 [2018-01-24 16:05:39,384 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-24 16:05:39,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-01-24 16:05:39,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 139. [2018-01-24 16:05:39,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-01-24 16:05:39,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 159 transitions. [2018-01-24 16:05:39,395 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 159 transitions. Word has length 27 [2018-01-24 16:05:39,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:05:39,395 INFO L432 AbstractCegarLoop]: Abstraction has 139 states and 159 transitions. [2018-01-24 16:05:39,395 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 16:05:39,395 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 159 transitions. [2018-01-24 16:05:39,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-24 16:05:39,396 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:05:39,396 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:05:39,397 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, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr56EnsuresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 16:05:39,397 INFO L82 PathProgramCache]: Analyzing trace with hash -564778548, now seen corresponding path program 1 times [2018-01-24 16:05:39,397 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:05:39,398 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:05:39,398 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:05:39,398 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:05:39,398 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:05:39,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:05:39,412 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:05:39,577 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:05:39,578 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:05:39,578 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 16:05:39,580 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 31 with the following transitions: [2018-01-24 16:05:39,582 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [5], [8], [11], [15], [17], [20], [47], [50], [51], [52], [53], [56], [59], [62], [120], [124], [126], [128], [133], [134], [137], [213], [214], [218], [219], [220] [2018-01-24 16:05:39,646 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 16:05:39,646 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) Received shutdown request... [2018-01-24 16:06:32,356 WARN L571 FixpointEngine]: Received timeout, aborting fixpoint engine [2018-01-24 16:06:32,357 WARN L157 AbstractInterpreter]: Abstract interpretation run out of time [2018-01-24 16:06:32,358 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-24 16:06:32,358 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:06:32,359 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 16:06:32,364 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:06:32,365 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 16:06:32,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:06:32,407 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 16:06:32,413 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-01-24 16:06:32,413 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-24 16:06:32,419 WARN L187 ceAbstractionStarter]: Timeout [2018-01-24 16:06:32,420 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.01 04:06:32 BoogieIcfgContainer [2018-01-24 16:06:32,420 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-24 16:06:32,421 INFO L168 Benchmark]: Toolchain (without parser) took 59412.14 ms. Allocated memory was 308.3 MB in the beginning and 2.3 GB in the end (delta: 2.0 GB). Free memory was 268.2 MB in the beginning and 1.0 GB in the end (delta: -734.7 MB). Peak memory consumption was 1.3 GB. Max. memory is 5.3 GB. [2018-01-24 16:06:32,422 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 308.3 MB. Free memory is still 274.2 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 16:06:32,423 INFO L168 Benchmark]: CACSL2BoogieTranslator took 206.70 ms. Allocated memory is still 308.3 MB. Free memory was 267.2 MB in the beginning and 255.2 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 5.3 GB. [2018-01-24 16:06:32,423 INFO L168 Benchmark]: Boogie Preprocessor took 38.20 ms. Allocated memory is still 308.3 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-24 16:06:32,423 INFO L168 Benchmark]: RCFGBuilder took 559.10 ms. Allocated memory is still 308.3 MB. Free memory was 253.2 MB in the beginning and 217.9 MB in the end (delta: 35.2 MB). Peak memory consumption was 35.2 MB. Max. memory is 5.3 GB. [2018-01-24 16:06:32,424 INFO L168 Benchmark]: TraceAbstraction took 58601.55 ms. Allocated memory was 308.3 MB in the beginning and 2.3 GB in the end (delta: 2.0 GB). Free memory was 217.9 MB in the beginning and 1.0 GB in the end (delta: -784.9 MB). Peak memory consumption was 1.2 GB. Max. memory is 5.3 GB. [2018-01-24 16:06:32,426 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.19 ms. Allocated memory is still 308.3 MB. Free memory is still 274.2 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 206.70 ms. Allocated memory is still 308.3 MB. Free memory was 267.2 MB in the beginning and 255.2 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 38.20 ms. Allocated memory is still 308.3 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 559.10 ms. Allocated memory is still 308.3 MB. Free memory was 253.2 MB in the beginning and 217.9 MB in the end (delta: 35.2 MB). Peak memory consumption was 35.2 MB. Max. memory is 5.3 GB. * TraceAbstraction took 58601.55 ms. Allocated memory was 308.3 MB in the beginning and 2.3 GB in the end (delta: 2.0 GB). Free memory was 217.9 MB in the beginning and 1.0 GB in the end (delta: -784.9 MB). Peak memory consumption was 1.2 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 1052). Cancelled while BasicCegarLoop was analyzing trace of length 31 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1022). Cancelled while BasicCegarLoop was analyzing trace of length 31 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1061). Cancelled while BasicCegarLoop was analyzing trace of length 31 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1010). Cancelled while BasicCegarLoop was analyzing trace of length 31 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1012). Cancelled while BasicCegarLoop was analyzing trace of length 31 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1032). Cancelled while BasicCegarLoop was analyzing trace of length 31 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 990). Cancelled while BasicCegarLoop was analyzing trace of length 31 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1027). Cancelled while BasicCegarLoop was analyzing trace of length 31 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1047). Cancelled while BasicCegarLoop was analyzing trace of length 31 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1026). Cancelled while BasicCegarLoop was analyzing trace of length 31 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 991). Cancelled while BasicCegarLoop was analyzing trace of length 31 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1003). Cancelled while BasicCegarLoop was analyzing trace of length 31 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1050). Cancelled while BasicCegarLoop was analyzing trace of length 31 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1002). Cancelled while BasicCegarLoop was analyzing trace of length 31 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1000). Cancelled while BasicCegarLoop was analyzing trace of length 31 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1029). Cancelled while BasicCegarLoop was analyzing trace of length 31 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1061). Cancelled while BasicCegarLoop was analyzing trace of length 31 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1004). Cancelled while BasicCegarLoop was analyzing trace of length 31 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1041). Cancelled while BasicCegarLoop was analyzing trace of length 31 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1027). Cancelled while BasicCegarLoop was analyzing trace of length 31 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1001). Cancelled while BasicCegarLoop was analyzing trace of length 31 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1019). Cancelled while BasicCegarLoop was analyzing trace of length 31 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1043). Cancelled while BasicCegarLoop was analyzing trace of length 31 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1001). Cancelled while BasicCegarLoop was analyzing trace of length 31 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1041). Cancelled while BasicCegarLoop was analyzing trace of length 31 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 992). Cancelled while BasicCegarLoop was analyzing trace of length 31 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1052). Cancelled while BasicCegarLoop was analyzing trace of length 31 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1032). Cancelled while BasicCegarLoop was analyzing trace of length 31 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 992). Cancelled while BasicCegarLoop was analyzing trace of length 31 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1002). Cancelled while BasicCegarLoop was analyzing trace of length 31 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1032). Cancelled while BasicCegarLoop was analyzing trace of length 31 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1026). Cancelled while BasicCegarLoop was analyzing trace of length 31 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1028). Cancelled while BasicCegarLoop was analyzing trace of length 31 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1011). Cancelled while BasicCegarLoop was analyzing trace of length 31 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1033). Cancelled while BasicCegarLoop was analyzing trace of length 31 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1050). Cancelled while BasicCegarLoop was analyzing trace of length 31 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1032). Cancelled while BasicCegarLoop was analyzing trace of length 31 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1004). Cancelled while BasicCegarLoop was analyzing trace of length 31 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1019). Cancelled while BasicCegarLoop was analyzing trace of length 31 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 991). Cancelled while BasicCegarLoop was analyzing trace of length 31 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1060). Cancelled while BasicCegarLoop was analyzing trace of length 31 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1043). Cancelled while BasicCegarLoop was analyzing trace of length 31 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1010). Cancelled while BasicCegarLoop was analyzing trace of length 31 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1012). Cancelled while BasicCegarLoop was analyzing trace of length 31 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1028). Cancelled while BasicCegarLoop was analyzing trace of length 31 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1022). Cancelled while BasicCegarLoop was analyzing trace of length 31 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 990). Cancelled while BasicCegarLoop was analyzing trace of length 31 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1001). Cancelled while BasicCegarLoop was analyzing trace of length 31 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 986]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 986). Cancelled while BasicCegarLoop was analyzing trace of length 31 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1060). Cancelled while BasicCegarLoop was analyzing trace of length 31 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1000). Cancelled while BasicCegarLoop was analyzing trace of length 31 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1011). Cancelled while BasicCegarLoop was analyzing trace of length 31 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1001). Cancelled while BasicCegarLoop was analyzing trace of length 31 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1029). Cancelled while BasicCegarLoop was analyzing trace of length 31 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1047). Cancelled while BasicCegarLoop was analyzing trace of length 31 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1003). Cancelled while BasicCegarLoop was analyzing trace of length 31 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1033). Cancelled while BasicCegarLoop was analyzing trace of length 31 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 133 locations, 57 error locations. TIMEOUT Result, 58.5s OverallTime, 14 OverallIterations, 2 TraceHistogramMax, 3.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1170 SDtfs, 1973 SDslu, 1915 SDs, 0 SdLazy, 2956 SolverSat, 215 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 108 GetRequests, 18 SyntacticMatches, 7 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=161occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 52.7s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 524 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 242 NumberOfCodeBlocks, 242 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 229 ConstructedInterpolants, 0 QuantifiedInterpolants, 21139 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 2/2 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/dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_16-06-32-436.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-24_16-06-32-436.csv Completed graceful shutdown