java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-EXP.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem16_label19_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-25 01:52:31,988 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-25 01:52:31,990 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-25 01:52:32,009 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-25 01:52:32,010 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-25 01:52:32,011 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-25 01:52:32,012 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-25 01:52:32,014 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-25 01:52:32,016 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-25 01:52:32,016 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-25 01:52:32,017 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-25 01:52:32,018 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-25 01:52:32,020 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-25 01:52:32,023 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-25 01:52:32,024 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-25 01:52:32,027 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-25 01:52:32,029 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-25 01:52:32,035 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-25 01:52:32,038 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-25 01:52:32,039 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-25 01:52:32,043 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-25 01:52:32,045 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-25 01:52:32,048 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-25 01:52:32,049 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-25 01:52:32,049 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-25 01:52:32,050 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-25 01:52:32,051 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-25 01:52:32,052 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-25 01:52:32,056 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-25 01:52:32,057 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-25 01:52:32,058 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-25 01:52:32,060 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-25 01:52:32,060 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-25 01:52:32,061 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-25 01:52:32,064 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-25 01:52:32,065 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-25 01:52:32,065 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-EXP.epf [2018-10-25 01:52:32,092 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-25 01:52:32,092 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-25 01:52:32,099 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-25 01:52:32,099 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-25 01:52:32,100 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-25 01:52:32,100 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-25 01:52:32,100 INFO L133 SettingsManager]: * Explicit value domain=true [2018-10-25 01:52:32,100 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-25 01:52:32,100 INFO L133 SettingsManager]: * Octagon Domain=false [2018-10-25 01:52:32,101 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-25 01:52:32,101 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-25 01:52:32,101 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-25 01:52:32,102 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-25 01:52:32,102 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-25 01:52:32,103 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-25 01:52:32,103 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-25 01:52:32,103 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-25 01:52:32,103 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-25 01:52:32,103 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-25 01:52:32,104 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-25 01:52:32,104 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-25 01:52:32,104 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-25 01:52:32,104 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-25 01:52:32,105 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-25 01:52:32,105 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-25 01:52:32,105 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-25 01:52:32,105 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-25 01:52:32,105 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-25 01:52:32,106 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-25 01:52:32,106 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-25 01:52:32,106 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-25 01:52:32,106 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-25 01:52:32,106 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-25 01:52:32,106 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-25 01:52:32,109 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-25 01:52:32,109 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-25 01:52:32,154 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-25 01:52:32,168 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-25 01:52:32,173 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-25 01:52:32,175 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-25 01:52:32,176 INFO L276 PluginConnector]: CDTParser initialized [2018-10-25 01:52:32,177 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem16_label19_true-unreach-call.c [2018-10-25 01:52:32,251 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/7c48b2f8d/2e5cdae1d4df46b8831635c4a8cdd4e0/FLAG957814e91 [2018-10-25 01:52:32,956 INFO L298 CDTParser]: Found 1 translation units. [2018-10-25 01:52:32,957 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem16_label19_true-unreach-call.c [2018-10-25 01:52:32,984 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/7c48b2f8d/2e5cdae1d4df46b8831635c4a8cdd4e0/FLAG957814e91 [2018-10-25 01:52:33,003 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/7c48b2f8d/2e5cdae1d4df46b8831635c4a8cdd4e0 [2018-10-25 01:52:33,016 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-25 01:52:33,018 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-25 01:52:33,019 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-25 01:52:33,019 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-25 01:52:33,025 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-25 01:52:33,026 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 01:52:33" (1/1) ... [2018-10-25 01:52:33,030 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2be2f573 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:52:33, skipping insertion in model container [2018-10-25 01:52:33,031 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 01:52:33" (1/1) ... [2018-10-25 01:52:33,041 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-25 01:52:33,141 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-25 01:52:34,033 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-25 01:52:34,039 INFO L189 MainTranslator]: Completed pre-run [2018-10-25 01:52:34,279 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-25 01:52:34,299 INFO L193 MainTranslator]: Completed translation [2018-10-25 01:52:34,300 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:52:34 WrapperNode [2018-10-25 01:52:34,300 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-25 01:52:34,301 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-25 01:52:34,301 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-25 01:52:34,301 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-25 01:52:34,312 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:52:34" (1/1) ... [2018-10-25 01:52:34,363 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:52:34" (1/1) ... [2018-10-25 01:52:34,648 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-25 01:52:34,648 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-25 01:52:34,648 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-25 01:52:34,648 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-25 01:52:34,659 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:52:34" (1/1) ... [2018-10-25 01:52:34,660 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:52:34" (1/1) ... [2018-10-25 01:52:34,670 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:52:34" (1/1) ... [2018-10-25 01:52:34,671 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:52:34" (1/1) ... [2018-10-25 01:52:34,722 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:52:34" (1/1) ... [2018-10-25 01:52:34,757 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:52:34" (1/1) ... [2018-10-25 01:52:34,774 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:52:34" (1/1) ... [2018-10-25 01:52:34,790 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-25 01:52:34,790 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-25 01:52:34,791 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-25 01:52:34,791 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-25 01:52:34,792 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:52:34" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-25 01:52:34,865 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-25 01:52:34,866 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-25 01:52:34,866 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2018-10-25 01:52:34,866 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2018-10-25 01:52:34,866 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-10-25 01:52:34,866 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-10-25 01:52:34,867 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-25 01:52:34,867 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-25 01:52:34,867 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-25 01:52:34,868 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-25 01:52:41,383 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-25 01:52:41,385 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 01:52:41 BoogieIcfgContainer [2018-10-25 01:52:41,385 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-25 01:52:41,387 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-25 01:52:41,387 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-25 01:52:41,390 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-25 01:52:41,391 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.10 01:52:33" (1/3) ... [2018-10-25 01:52:41,391 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19696270 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 01:52:41, skipping insertion in model container [2018-10-25 01:52:41,392 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:52:34" (2/3) ... [2018-10-25 01:52:41,392 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19696270 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 01:52:41, skipping insertion in model container [2018-10-25 01:52:41,392 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 01:52:41" (3/3) ... [2018-10-25 01:52:41,394 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem16_label19_true-unreach-call.c [2018-10-25 01:52:41,405 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-25 01:52:41,414 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-25 01:52:41,433 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-25 01:52:41,475 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-25 01:52:41,476 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-25 01:52:41,476 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-25 01:52:41,476 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-25 01:52:41,476 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-25 01:52:41,476 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-25 01:52:41,477 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-25 01:52:41,477 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-25 01:52:41,515 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states. [2018-10-25 01:52:41,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-10-25 01:52:41,524 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:52:41,525 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 01:52:41,527 INFO L424 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:52:41,534 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:52:41,534 INFO L82 PathProgramCache]: Analyzing trace with hash -1096400812, now seen corresponding path program 1 times [2018-10-25 01:52:41,537 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:52:41,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:52:41,598 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:52:41,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:52:41,598 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:52:41,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:52:42,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:52:42,083 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:52:42,083 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-25 01:52:42,084 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:52:42,092 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-25 01:52:42,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-25 01:52:42,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-25 01:52:42,115 INFO L87 Difference]: Start difference. First operand 410 states. Second operand 4 states. [2018-10-25 01:52:47,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:52:47,841 INFO L93 Difference]: Finished difference Result 1513 states and 2838 transitions. [2018-10-25 01:52:47,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-25 01:52:47,843 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2018-10-25 01:52:47,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:52:47,874 INFO L225 Difference]: With dead ends: 1513 [2018-10-25 01:52:47,874 INFO L226 Difference]: Without dead ends: 1097 [2018-10-25 01:52:47,885 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-25 01:52:47,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1097 states. [2018-10-25 01:52:47,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1097 to 744. [2018-10-25 01:52:47,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 744 states. [2018-10-25 01:52:47,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 744 states to 744 states and 1357 transitions. [2018-10-25 01:52:47,990 INFO L78 Accepts]: Start accepts. Automaton has 744 states and 1357 transitions. Word has length 50 [2018-10-25 01:52:47,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:52:47,991 INFO L481 AbstractCegarLoop]: Abstraction has 744 states and 1357 transitions. [2018-10-25 01:52:47,991 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-25 01:52:47,992 INFO L276 IsEmpty]: Start isEmpty. Operand 744 states and 1357 transitions. [2018-10-25 01:52:47,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-10-25 01:52:47,999 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:52:48,000 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 01:52:48,000 INFO L424 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:52:48,000 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:52:48,000 INFO L82 PathProgramCache]: Analyzing trace with hash -214706174, now seen corresponding path program 1 times [2018-10-25 01:52:48,001 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:52:48,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:52:48,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:52:48,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:52:48,004 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:52:48,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:52:48,327 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:52:48,327 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:52:48,328 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-25 01:52:48,328 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:52:48,330 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-25 01:52:48,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-25 01:52:48,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-25 01:52:48,331 INFO L87 Difference]: Start difference. First operand 744 states and 1357 transitions. Second operand 5 states. [2018-10-25 01:52:55,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:52:55,184 INFO L93 Difference]: Finished difference Result 2196 states and 4092 transitions. [2018-10-25 01:52:55,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 01:52:55,187 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 120 [2018-10-25 01:52:55,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:52:55,200 INFO L225 Difference]: With dead ends: 2196 [2018-10-25 01:52:55,200 INFO L226 Difference]: Without dead ends: 1458 [2018-10-25 01:52:55,204 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-10-25 01:52:55,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1458 states. [2018-10-25 01:52:55,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1458 to 1438. [2018-10-25 01:52:55,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1438 states. [2018-10-25 01:52:55,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1438 states to 1438 states and 2551 transitions. [2018-10-25 01:52:55,282 INFO L78 Accepts]: Start accepts. Automaton has 1438 states and 2551 transitions. Word has length 120 [2018-10-25 01:52:55,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:52:55,283 INFO L481 AbstractCegarLoop]: Abstraction has 1438 states and 2551 transitions. [2018-10-25 01:52:55,283 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-25 01:52:55,283 INFO L276 IsEmpty]: Start isEmpty. Operand 1438 states and 2551 transitions. [2018-10-25 01:52:55,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-10-25 01:52:55,295 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:52:55,295 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 01:52:55,296 INFO L424 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:52:55,296 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:52:55,296 INFO L82 PathProgramCache]: Analyzing trace with hash 668921751, now seen corresponding path program 1 times [2018-10-25 01:52:55,296 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:52:55,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:52:55,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:52:55,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:52:55,299 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:52:55,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:52:55,535 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:52:55,536 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:52:55,536 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-25 01:52:55,536 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:52:55,537 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 01:52:55,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 01:52:55,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 01:52:55,538 INFO L87 Difference]: Start difference. First operand 1438 states and 2551 transitions. Second operand 6 states. [2018-10-25 01:53:00,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:53:00,836 INFO L93 Difference]: Finished difference Result 4237 states and 7540 transitions. [2018-10-25 01:53:00,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 01:53:00,836 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 123 [2018-10-25 01:53:00,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:53:00,854 INFO L225 Difference]: With dead ends: 4237 [2018-10-25 01:53:00,855 INFO L226 Difference]: Without dead ends: 2805 [2018-10-25 01:53:00,865 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-25 01:53:00,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2805 states. [2018-10-25 01:53:00,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2805 to 2785. [2018-10-25 01:53:00,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2785 states. [2018-10-25 01:53:00,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2785 states to 2785 states and 4352 transitions. [2018-10-25 01:53:00,944 INFO L78 Accepts]: Start accepts. Automaton has 2785 states and 4352 transitions. Word has length 123 [2018-10-25 01:53:00,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:53:00,944 INFO L481 AbstractCegarLoop]: Abstraction has 2785 states and 4352 transitions. [2018-10-25 01:53:00,944 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 01:53:00,944 INFO L276 IsEmpty]: Start isEmpty. Operand 2785 states and 4352 transitions. [2018-10-25 01:53:00,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-10-25 01:53:00,947 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:53:00,947 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 01:53:00,947 INFO L424 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:53:00,947 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:53:00,948 INFO L82 PathProgramCache]: Analyzing trace with hash -575505094, now seen corresponding path program 1 times [2018-10-25 01:53:00,948 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:53:00,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:53:00,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:53:00,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:53:00,949 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:53:00,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:53:01,171 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:53:01,171 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:53:01,171 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-25 01:53:01,171 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:53:01,172 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 01:53:01,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 01:53:01,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 01:53:01,173 INFO L87 Difference]: Start difference. First operand 2785 states and 4352 transitions. Second operand 6 states. [2018-10-25 01:53:05,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:53:05,662 INFO L93 Difference]: Finished difference Result 6952 states and 11048 transitions. [2018-10-25 01:53:05,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 01:53:05,669 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 124 [2018-10-25 01:53:05,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:53:05,691 INFO L225 Difference]: With dead ends: 6952 [2018-10-25 01:53:05,691 INFO L226 Difference]: Without dead ends: 4173 [2018-10-25 01:53:05,708 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-25 01:53:05,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4173 states. [2018-10-25 01:53:05,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4173 to 4153. [2018-10-25 01:53:05,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4153 states. [2018-10-25 01:53:05,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4153 states to 4153 states and 5896 transitions. [2018-10-25 01:53:05,820 INFO L78 Accepts]: Start accepts. Automaton has 4153 states and 5896 transitions. Word has length 124 [2018-10-25 01:53:05,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:53:05,820 INFO L481 AbstractCegarLoop]: Abstraction has 4153 states and 5896 transitions. [2018-10-25 01:53:05,820 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 01:53:05,821 INFO L276 IsEmpty]: Start isEmpty. Operand 4153 states and 5896 transitions. [2018-10-25 01:53:05,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-10-25 01:53:05,822 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:53:05,823 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 01:53:05,823 INFO L424 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:53:05,823 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:53:05,823 INFO L82 PathProgramCache]: Analyzing trace with hash 1067040591, now seen corresponding path program 1 times [2018-10-25 01:53:05,823 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:53:05,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:53:05,825 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:53:05,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:53:05,825 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:53:05,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:53:06,075 WARN L179 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-25 01:53:06,481 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:53:06,482 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:53:06,482 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-25 01:53:06,482 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:53:06,483 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 01:53:06,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 01:53:06,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 01:53:06,484 INFO L87 Difference]: Start difference. First operand 4153 states and 5896 transitions. Second operand 6 states. [2018-10-25 01:53:10,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:53:10,931 INFO L93 Difference]: Finished difference Result 11374 states and 16767 transitions. [2018-10-25 01:53:10,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 01:53:10,931 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 127 [2018-10-25 01:53:10,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:53:10,967 INFO L225 Difference]: With dead ends: 11374 [2018-10-25 01:53:10,967 INFO L226 Difference]: Without dead ends: 7227 [2018-10-25 01:53:10,997 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-25 01:53:11,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7227 states. [2018-10-25 01:53:11,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7227 to 7152. [2018-10-25 01:53:11,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7152 states. [2018-10-25 01:53:11,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7152 states to 7152 states and 9826 transitions. [2018-10-25 01:53:11,170 INFO L78 Accepts]: Start accepts. Automaton has 7152 states and 9826 transitions. Word has length 127 [2018-10-25 01:53:11,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:53:11,170 INFO L481 AbstractCegarLoop]: Abstraction has 7152 states and 9826 transitions. [2018-10-25 01:53:11,170 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 01:53:11,170 INFO L276 IsEmpty]: Start isEmpty. Operand 7152 states and 9826 transitions. [2018-10-25 01:53:11,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-10-25 01:53:11,173 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:53:11,173 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 01:53:11,173 INFO L424 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:53:11,173 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:53:11,174 INFO L82 PathProgramCache]: Analyzing trace with hash -1217167681, now seen corresponding path program 1 times [2018-10-25 01:53:11,174 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:53:11,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:53:11,175 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:53:11,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:53:11,175 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:53:11,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:53:11,404 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:53:11,405 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:53:11,405 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-25 01:53:11,405 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:53:11,405 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 01:53:11,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 01:53:11,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 01:53:11,406 INFO L87 Difference]: Start difference. First operand 7152 states and 9826 transitions. Second operand 6 states. [2018-10-25 01:53:14,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:53:14,481 INFO L93 Difference]: Finished difference Result 17771 states and 25546 transitions. [2018-10-25 01:53:14,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 01:53:14,481 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 135 [2018-10-25 01:53:14,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:53:14,536 INFO L225 Difference]: With dead ends: 17771 [2018-10-25 01:53:14,538 INFO L226 Difference]: Without dead ends: 10625 [2018-10-25 01:53:14,562 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-25 01:53:14,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10625 states. [2018-10-25 01:53:14,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10625 to 10585. [2018-10-25 01:53:14,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10585 states. [2018-10-25 01:53:14,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10585 states to 10585 states and 13819 transitions. [2018-10-25 01:53:14,936 INFO L78 Accepts]: Start accepts. Automaton has 10585 states and 13819 transitions. Word has length 135 [2018-10-25 01:53:14,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:53:14,939 INFO L481 AbstractCegarLoop]: Abstraction has 10585 states and 13819 transitions. [2018-10-25 01:53:14,939 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 01:53:14,939 INFO L276 IsEmpty]: Start isEmpty. Operand 10585 states and 13819 transitions. [2018-10-25 01:53:14,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-10-25 01:53:14,941 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:53:14,941 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 01:53:14,942 INFO L424 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:53:14,942 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:53:14,942 INFO L82 PathProgramCache]: Analyzing trace with hash -1713053514, now seen corresponding path program 1 times [2018-10-25 01:53:14,942 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:53:14,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:53:14,950 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:53:14,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:53:14,950 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:53:14,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:53:15,147 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:53:15,147 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:53:15,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-25 01:53:15,147 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:53:15,149 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-25 01:53:15,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-25 01:53:15,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-25 01:53:15,149 INFO L87 Difference]: Start difference. First operand 10585 states and 13819 transitions. Second operand 4 states. [2018-10-25 01:53:18,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:53:18,269 INFO L93 Difference]: Finished difference Result 22178 states and 28983 transitions. [2018-10-25 01:53:18,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-25 01:53:18,272 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 142 [2018-10-25 01:53:18,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:53:18,298 INFO L225 Difference]: With dead ends: 22178 [2018-10-25 01:53:18,298 INFO L226 Difference]: Without dead ends: 8917 [2018-10-25 01:53:18,327 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-25 01:53:18,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8917 states. [2018-10-25 01:53:18,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8917 to 8917. [2018-10-25 01:53:18,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8917 states. [2018-10-25 01:53:18,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8917 states to 8917 states and 9927 transitions. [2018-10-25 01:53:18,495 INFO L78 Accepts]: Start accepts. Automaton has 8917 states and 9927 transitions. Word has length 142 [2018-10-25 01:53:18,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:53:18,495 INFO L481 AbstractCegarLoop]: Abstraction has 8917 states and 9927 transitions. [2018-10-25 01:53:18,495 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-25 01:53:18,495 INFO L276 IsEmpty]: Start isEmpty. Operand 8917 states and 9927 transitions. [2018-10-25 01:53:18,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 599 [2018-10-25 01:53:18,517 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:53:18,518 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 01:53:18,518 INFO L424 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:53:18,518 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:53:18,519 INFO L82 PathProgramCache]: Analyzing trace with hash -593629262, now seen corresponding path program 1 times [2018-10-25 01:53:18,519 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:53:18,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:53:18,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:53:18,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:53:18,520 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:53:18,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:53:19,228 INFO L134 CoverageAnalysis]: Checked inductivity of 491 backedges. 248 proven. 115 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2018-10-25 01:53:19,228 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 01:53:19,228 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 01:53:19,230 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 599 with the following transitions: [2018-10-25 01:53:19,232 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [33], [179], [180], [187], [195], [203], [211], [219], [227], [235], [243], [251], [259], [267], [275], [283], [291], [299], [307], [315], [323], [331], [339], [347], [355], [363], [371], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [479], [481], [484], [492], [500], [508], [516], [524], [532], [540], [548], [556], [564], [572], [580], [588], [596], [604], [612], [620], [628], [636], [644], [652], [660], [668], [673], [677], [681], [685], [689], [693], [697], [701], [705], [709], [713], [717], [721], [725], [729], [733], [737], [741], [745], [749], [753], [757], [761], [765], [769], [773], [777], [781], [785], [789], [793], [797], [801], [805], [809], [813], [817], [821], [825], [829], [833], [837], [841], [845], [849], [853], [856], [857], [861], [865], [869], [873], [877], [881], [885], [889], [893], [897], [901], [905], [909], [912], [913], [917], [921], [925], [929], [933], [937], [941], [945], [949], [953], [957], [961], [965], [969], [973], [977], [981], [985], [989], [993], [997], [1001], [1005], [1009], [1013], [1017], [1021], [1025], [1029], [1033], [1037], [1041], [1045], [1049], [1053], [1057], [1061], [1065], [1069], [1073], [1077], [1081], [1085], [1089], [1093], [1097], [1101], [1105], [1109], [1113], [1117], [1121], [1125], [1129], [1133], [1137], [1141], [1145], [1149], [1153], [1157], [1161], [1165], [1169], [1173], [1177], [1181], [1185], [1189], [1193], [1197], [1201], [1205], [1209], [1213], [1217], [1221], [1225], [1229], [1233], [1237], [1241], [1245], [1249], [1253], [1257], [1261], [1265], [1269], [1273], [1277], [1281], [1285], [1289], [1293], [1297], [1301], [1305], [1309], [1313], [1317], [1321], [1325], [1329], [1333], [1337], [1341], [1345], [1349], [1353], [1357], [1361], [1365], [1369], [1373], [1377], [1381], [1385], [1389], [1393], [1397], [1401], [1405], [1409], [1413], [1417], [1421], [1425], [1429], [1433], [1437], [1441], [1445], [1449], [1453], [1457], [1461], [1465], [1469], [1473], [1477], [1481], [1485], [1489], [1493], [1497], [1501], [1505], [1509], [1513], [1517], [1521], [1525], [1529], [1533], [1537], [1541], [1545], [1549], [1551], [1552], [1556], [1560], [1566], [1570], [1572], [1577], [1578], [1579], [1580], [1581], [1583], [1584] [2018-10-25 01:53:19,299 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 01:53:19,299 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 01:53:20,358 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-25 01:53:20,359 INFO L272 AbstractInterpreter]: Visited 305 different actions 305 times. Never merged. Never widened. Never found a fixpoint. Largest state had 24 variables. [2018-10-25 01:53:20,404 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:53:20,404 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-25 01:53:21,398 INFO L232 lantSequenceWeakener]: Weakened 583 states. On average, predicates are now at 77.55% of their original sizes. [2018-10-25 01:53:21,398 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-25 01:53:21,785 INFO L413 sIntCurrentIteration]: We have 597 unified AI predicates [2018-10-25 01:53:21,786 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-25 01:53:21,787 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-25 01:53:21,787 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [6] total 12 [2018-10-25 01:53:21,787 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:53:21,788 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-25 01:53:21,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-25 01:53:21,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-10-25 01:53:21,790 INFO L87 Difference]: Start difference. First operand 8917 states and 9927 transitions. Second operand 8 states. [2018-10-25 01:53:35,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-25 01:53:35,663 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.ArithmeticException: BigInteger: modulus not positive at java.math.BigInteger.mod(BigInteger.java:2458) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.explicit.ExplicitValueValue.modulo(ExplicitValueValue.java:154) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.explicit.ExplicitValueValue.modulo(ExplicitValueValue.java:1) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:125) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:100) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:92) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:92) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:93) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.ConditionalEvaluator.evaluate(ConditionalEvaluator.java:78) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.ConditionalEvaluator.evaluate(ConditionalEvaluator.java:1) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:93) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:92) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:92) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.ConditionalEvaluator.evaluate(ConditionalEvaluator.java:78) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.ConditionalEvaluator.evaluate(ConditionalEvaluator.java:1) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:93) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.handleAssumeStatement(NonrelationalStatementProcessor.java:363) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.processStatement(NonrelationalStatementProcessor.java:160) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.process(NonrelationalStatementProcessor.java:142) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.process(NonrelationalStatementProcessor.java:128) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.handleInternalTransition(NonrelationalPostOperator.java:362) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.handleInternalTransition(NonrelationalPostOperator.java:353) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.apply(NonrelationalPostOperator.java:125) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.apply(NonrelationalPostOperator.java:1) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.compound.CompoundDomainPostOperator.applyInternally(CompoundDomainPostOperator.java:306) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.compound.CompoundDomainPostOperator.apply(CompoundDomainPostOperator.java:131) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.compound.CompoundDomainPostOperator.apply(CompoundDomainPostOperator.java:1) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.applyPost(TermConjunctEvaluator.java:305) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.lambda$4(TermConjunctEvaluator.java:178) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.computeFixpoint(TermConjunctEvaluator.java:198) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.lambda$1(TermConjunctEvaluator.java:150) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.computePost(TermConjunctEvaluator.java:93) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormanCachedPostOperation.applyPost(PoormanCachedPostOperation.java:308) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormansAbstractPostOperator.applyPost(PoormansAbstractPostOperator.java:217) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormansAbstractPostOperator.apply(PoormansAbstractPostOperator.java:119) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormansAbstractPostOperator.apply(PoormansAbstractPostOperator.java:1) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.DisjunctiveAbstractState.lambda$17(DisjunctiveAbstractState.java:369) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.DisjunctiveAbstractState.mapCollection(DisjunctiveAbstractState.java:537) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.DisjunctiveAbstractState.apply(DisjunctiveAbstractState.java:369) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.AbsIntHoareTripleChecker.checkInternalTransitionWithValidState(AbsIntHoareTripleChecker.java:352) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.AbsIntHoareTripleChecker.checkInternalAbsInt(AbsIntHoareTripleChecker.java:249) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.AbsIntHoareTripleChecker.checkInternal(AbsIntHoareTripleChecker.java:181) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.CachingHoareTripleChecker.checkInternal(CachingHoareTripleChecker.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton$InternalSuccessorComputationHelper.computeSuccWithSolver(AbstractInterpolantAutomaton.java:359) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.addOtherSuccessors(DeterministicInterpolantAutomaton.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1066) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:968) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:188) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:673) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:602) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:473) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-10-25 01:53:35,668 INFO L168 Benchmark]: Toolchain (without parser) took 62652.02 ms. Allocated memory was 1.5 GB in the beginning and 3.1 GB in the end (delta: 1.6 GB). Free memory was 1.4 GB in the beginning and 2.6 GB in the end (delta: -1.2 GB). Peak memory consumption was 406.8 MB. Max. memory is 7.1 GB. [2018-10-25 01:53:35,670 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-25 01:53:35,670 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1281.15 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 74.0 MB). Peak memory consumption was 74.0 MB. Max. memory is 7.1 GB. [2018-10-25 01:53:35,671 INFO L168 Benchmark]: Boogie Procedure Inliner took 347.12 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 766.5 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -869.6 MB). Peak memory consumption was 28.7 MB. Max. memory is 7.1 GB. [2018-10-25 01:53:35,672 INFO L168 Benchmark]: Boogie Preprocessor took 141.94 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 13.7 MB). Peak memory consumption was 13.7 MB. Max. memory is 7.1 GB. [2018-10-25 01:53:35,673 INFO L168 Benchmark]: RCFGBuilder took 6595.03 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 270.0 MB). Peak memory consumption was 270.0 MB. Max. memory is 7.1 GB. [2018-10-25 01:53:35,674 INFO L168 Benchmark]: TraceAbstraction took 54281.14 ms. Allocated memory was 2.3 GB in the beginning and 3.1 GB in the end (delta: 812.1 MB). Free memory was 1.9 GB in the beginning and 2.6 GB in the end (delta: -660.0 MB). Peak memory consumption was 152.1 MB. Max. memory is 7.1 GB. [2018-10-25 01:53:35,679 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1281.15 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 74.0 MB). Peak memory consumption was 74.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 347.12 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 766.5 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -869.6 MB). Peak memory consumption was 28.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 141.94 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 13.7 MB). Peak memory consumption was 13.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 6595.03 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 270.0 MB). Peak memory consumption was 270.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 54281.14 ms. Allocated memory was 2.3 GB in the beginning and 3.1 GB in the end (delta: 812.1 MB). Free memory was 1.9 GB in the beginning and 2.6 GB in the end (delta: -660.0 MB). Peak memory consumption was 152.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: ArithmeticException: BigInteger: modulus not positive de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: ArithmeticException: BigInteger: modulus not positive: java.math.BigInteger.mod(BigInteger.java:2458) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...