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/Problem18_label45_false-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-24 23:52:41,027 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-24 23:52:41,029 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-24 23:52:41,041 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-24 23:52:41,041 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-24 23:52:41,042 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-24 23:52:41,044 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-24 23:52:41,046 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-24 23:52:41,047 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-24 23:52:41,048 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-24 23:52:41,049 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-24 23:52:41,049 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-24 23:52:41,050 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-24 23:52:41,051 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-24 23:52:41,053 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-24 23:52:41,053 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-24 23:52:41,054 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-24 23:52:41,056 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-24 23:52:41,058 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-24 23:52:41,060 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-24 23:52:41,061 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-24 23:52:41,063 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-24 23:52:41,065 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-24 23:52:41,066 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-24 23:52:41,066 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-24 23:52:41,067 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-24 23:52:41,068 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-24 23:52:41,069 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-24 23:52:41,070 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-24 23:52:41,071 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-24 23:52:41,071 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-24 23:52:41,072 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-24 23:52:41,073 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-24 23:52:41,073 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-24 23:52:41,074 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-24 23:52:41,075 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-24 23:52:41,075 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-24 23:52:41,092 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-24 23:52:41,092 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-24 23:52:41,093 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-24 23:52:41,093 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-24 23:52:41,094 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-24 23:52:41,094 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-24 23:52:41,094 INFO L133 SettingsManager]: * Explicit value domain=true [2018-10-24 23:52:41,094 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-24 23:52:41,095 INFO L133 SettingsManager]: * Octagon Domain=false [2018-10-24 23:52:41,095 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-24 23:52:41,095 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-24 23:52:41,096 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-24 23:52:41,096 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-24 23:52:41,096 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-24 23:52:41,097 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-24 23:52:41,097 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-24 23:52:41,098 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-24 23:52:41,098 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-24 23:52:41,098 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-24 23:52:41,098 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-24 23:52:41,099 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-24 23:52:41,099 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-24 23:52:41,099 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-24 23:52:41,099 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-24 23:52:41,100 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-24 23:52:41,100 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-24 23:52:41,100 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-24 23:52:41,100 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-24 23:52:41,101 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-24 23:52:41,101 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-24 23:52:41,101 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-24 23:52:41,101 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-24 23:52:41,102 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-24 23:52:41,102 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-24 23:52:41,102 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-24 23:52:41,102 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-24 23:52:41,149 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-24 23:52:41,169 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-24 23:52:41,173 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-24 23:52:41,175 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-24 23:52:41,175 INFO L276 PluginConnector]: CDTParser initialized [2018-10-24 23:52:41,176 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem18_label45_false-unreach-call.c [2018-10-24 23:52:41,255 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/1b0049870/a46838268c9f47419f3f048be4a69a5e/FLAG0538a675c [2018-10-24 23:52:41,978 INFO L298 CDTParser]: Found 1 translation units. [2018-10-24 23:52:41,978 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem18_label45_false-unreach-call.c [2018-10-24 23:52:42,007 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/1b0049870/a46838268c9f47419f3f048be4a69a5e/FLAG0538a675c [2018-10-24 23:52:42,029 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/1b0049870/a46838268c9f47419f3f048be4a69a5e [2018-10-24 23:52:42,041 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-24 23:52:42,044 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-24 23:52:42,049 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-24 23:52:42,050 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-24 23:52:42,054 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-24 23:52:42,055 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:52:42" (1/1) ... [2018-10-24 23:52:42,059 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6354d7d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:52:42, skipping insertion in model container [2018-10-24 23:52:42,061 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:52:42" (1/1) ... [2018-10-24 23:52:42,072 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-24 23:52:42,206 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-24 23:52:43,324 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 23:52:43,329 INFO L189 MainTranslator]: Completed pre-run [2018-10-24 23:52:43,809 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 23:52:43,843 INFO L193 MainTranslator]: Completed translation [2018-10-24 23:52:43,843 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:52:43 WrapperNode [2018-10-24 23:52:43,844 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-24 23:52:43,845 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-24 23:52:43,845 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-24 23:52:43,846 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-24 23:52:43,856 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:52:43" (1/1) ... [2018-10-24 23:52:43,919 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:52:43" (1/1) ... [2018-10-24 23:52:44,247 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-24 23:52:44,247 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-24 23:52:44,247 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-24 23:52:44,248 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-24 23:52:44,263 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:52:43" (1/1) ... [2018-10-24 23:52:44,263 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:52:43" (1/1) ... [2018-10-24 23:52:44,288 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:52:43" (1/1) ... [2018-10-24 23:52:44,289 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:52:43" (1/1) ... [2018-10-24 23:52:44,384 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:52:43" (1/1) ... [2018-10-24 23:52:44,418 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:52:43" (1/1) ... [2018-10-24 23:52:44,442 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:52:43" (1/1) ... [2018-10-24 23:52:44,466 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-24 23:52:44,466 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-24 23:52:44,467 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-24 23:52:44,467 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-24 23:52:44,468 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:52:43" (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-24 23:52:44,535 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-24 23:52:44,536 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-24 23:52:44,536 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output3 [2018-10-24 23:52:44,536 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output3 [2018-10-24 23:52:44,536 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2018-10-24 23:52:44,537 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2018-10-24 23:52:44,537 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-10-24 23:52:44,537 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-10-24 23:52:44,537 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-24 23:52:44,537 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-24 23:52:44,538 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-24 23:52:44,539 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-24 23:52:52,993 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-24 23:52:52,995 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:52:52 BoogieIcfgContainer [2018-10-24 23:52:52,995 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-24 23:52:52,997 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-24 23:52:52,997 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-24 23:52:53,001 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-24 23:52:53,001 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 11:52:42" (1/3) ... [2018-10-24 23:52:53,002 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c329f4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:52:53, skipping insertion in model container [2018-10-24 23:52:53,002 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:52:43" (2/3) ... [2018-10-24 23:52:53,003 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c329f4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:52:53, skipping insertion in model container [2018-10-24 23:52:53,003 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:52:52" (3/3) ... [2018-10-24 23:52:53,005 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem18_label45_false-unreach-call.c [2018-10-24 23:52:53,015 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-24 23:52:53,025 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-24 23:52:53,043 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-24 23:52:53,089 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-24 23:52:53,089 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-24 23:52:53,089 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-24 23:52:53,089 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-24 23:52:53,090 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-24 23:52:53,090 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-24 23:52:53,090 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-24 23:52:53,090 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-24 23:52:53,131 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states. [2018-10-24 23:52:53,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-10-24 23:52:53,140 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 23:52:53,142 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] [2018-10-24 23:52:53,145 INFO L424 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 23:52:53,151 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:52:53,152 INFO L82 PathProgramCache]: Analyzing trace with hash -1137979268, now seen corresponding path program 1 times [2018-10-24 23:52:53,154 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 23:52:53,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:52:53,213 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 23:52:53,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:52:53,214 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 23:52:53,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 23:52:53,672 WARN L179 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-24 23:52:53,754 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-24 23:52:53,759 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 23:52:53,760 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 23:52:53,760 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 23:52:53,767 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 23:52:53,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 23:52:53,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 23:52:53,783 INFO L87 Difference]: Start difference. First operand 775 states. Second operand 3 states. [2018-10-24 23:53:00,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 23:53:00,410 INFO L93 Difference]: Finished difference Result 2251 states and 4322 transitions. [2018-10-24 23:53:00,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 23:53:00,413 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-10-24 23:53:00,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 23:53:00,445 INFO L225 Difference]: With dead ends: 2251 [2018-10-24 23:53:00,445 INFO L226 Difference]: Without dead ends: 1474 [2018-10-24 23:53:00,457 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 23:53:00,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1474 states. [2018-10-24 23:53:00,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1474 to 1474. [2018-10-24 23:53:00,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1474 states. [2018-10-24 23:53:00,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1474 states to 1474 states and 2721 transitions. [2018-10-24 23:53:00,606 INFO L78 Accepts]: Start accepts. Automaton has 1474 states and 2721 transitions. Word has length 36 [2018-10-24 23:53:00,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 23:53:00,607 INFO L481 AbstractCegarLoop]: Abstraction has 1474 states and 2721 transitions. [2018-10-24 23:53:00,608 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 23:53:00,608 INFO L276 IsEmpty]: Start isEmpty. Operand 1474 states and 2721 transitions. [2018-10-24 23:53:00,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-10-24 23:53:00,617 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 23:53:00,620 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 23:53:00,620 INFO L424 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 23:53:00,620 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:53:00,621 INFO L82 PathProgramCache]: Analyzing trace with hash 1760382179, now seen corresponding path program 1 times [2018-10-24 23:53:00,621 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 23:53:00,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:53:00,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 23:53:00,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:53:00,623 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 23:53:00,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 23:53:00,986 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 23:53:00,987 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 23:53:00,987 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-24 23:53:00,987 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 23:53:00,989 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-24 23:53:00,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-24 23:53:00,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-24 23:53:00,990 INFO L87 Difference]: Start difference. First operand 1474 states and 2721 transitions. Second operand 6 states. [2018-10-24 23:53:11,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 23:53:11,244 INFO L93 Difference]: Finished difference Result 4419 states and 8244 transitions. [2018-10-24 23:53:11,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-24 23:53:11,245 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 125 [2018-10-24 23:53:11,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 23:53:11,268 INFO L225 Difference]: With dead ends: 4419 [2018-10-24 23:53:11,268 INFO L226 Difference]: Without dead ends: 2951 [2018-10-24 23:53:11,274 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-24 23:53:11,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2951 states. [2018-10-24 23:53:11,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2951 to 2928. [2018-10-24 23:53:11,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2928 states. [2018-10-24 23:53:11,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2928 states to 2928 states and 5087 transitions. [2018-10-24 23:53:11,378 INFO L78 Accepts]: Start accepts. Automaton has 2928 states and 5087 transitions. Word has length 125 [2018-10-24 23:53:11,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 23:53:11,379 INFO L481 AbstractCegarLoop]: Abstraction has 2928 states and 5087 transitions. [2018-10-24 23:53:11,379 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-24 23:53:11,379 INFO L276 IsEmpty]: Start isEmpty. Operand 2928 states and 5087 transitions. [2018-10-24 23:53:11,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-10-24 23:53:11,387 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 23:53:11,388 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 23:53:11,388 INFO L424 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 23:53:11,388 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:53:11,388 INFO L82 PathProgramCache]: Analyzing trace with hash 439541734, now seen corresponding path program 1 times [2018-10-24 23:53:11,389 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 23:53:11,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:53:11,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 23:53:11,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:53:11,390 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 23:53:11,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 23:53:11,670 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 23:53:11,671 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 23:53:11,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-24 23:53:11,671 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 23:53:11,672 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-24 23:53:11,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-24 23:53:11,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-24 23:53:11,672 INFO L87 Difference]: Start difference. First operand 2928 states and 5087 transitions. Second operand 6 states. [2018-10-24 23:53:20,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 23:53:20,501 INFO L93 Difference]: Finished difference Result 10194 states and 17948 transitions. [2018-10-24 23:53:20,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-24 23:53:20,503 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 172 [2018-10-24 23:53:20,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 23:53:20,554 INFO L225 Difference]: With dead ends: 10194 [2018-10-24 23:53:20,554 INFO L226 Difference]: Without dead ends: 7272 [2018-10-24 23:53:20,572 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-24 23:53:20,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7272 states. [2018-10-24 23:53:20,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7272 to 7208. [2018-10-24 23:53:20,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7208 states. [2018-10-24 23:53:20,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7208 states to 7208 states and 11881 transitions. [2018-10-24 23:53:20,809 INFO L78 Accepts]: Start accepts. Automaton has 7208 states and 11881 transitions. Word has length 172 [2018-10-24 23:53:20,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 23:53:20,810 INFO L481 AbstractCegarLoop]: Abstraction has 7208 states and 11881 transitions. [2018-10-24 23:53:20,810 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-24 23:53:20,810 INFO L276 IsEmpty]: Start isEmpty. Operand 7208 states and 11881 transitions. [2018-10-24 23:53:20,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-10-24 23:53:20,815 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 23:53:20,815 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 23:53:20,816 INFO L424 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 23:53:20,816 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:53:20,816 INFO L82 PathProgramCache]: Analyzing trace with hash 1837933570, now seen corresponding path program 1 times [2018-10-24 23:53:20,816 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 23:53:20,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:53:20,819 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 23:53:20,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:53:20,819 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 23:53:20,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 23:53:21,145 WARN L179 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-24 23:53:21,306 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 23:53:21,307 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 23:53:21,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-24 23:53:21,307 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 23:53:21,308 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-24 23:53:21,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-24 23:53:21,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-24 23:53:21,309 INFO L87 Difference]: Start difference. First operand 7208 states and 11881 transitions. Second operand 6 states. [2018-10-24 23:53:26,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 23:53:26,756 INFO L93 Difference]: Finished difference Result 17365 states and 29107 transitions. [2018-10-24 23:53:26,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-24 23:53:26,757 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 174 [2018-10-24 23:53:26,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 23:53:26,808 INFO L225 Difference]: With dead ends: 17365 [2018-10-24 23:53:26,808 INFO L226 Difference]: Without dead ends: 10163 [2018-10-24 23:53:26,835 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-24 23:53:26,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10163 states. [2018-10-24 23:53:27,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10163 to 10108. [2018-10-24 23:53:27,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10108 states. [2018-10-24 23:53:27,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10108 states to 10108 states and 14258 transitions. [2018-10-24 23:53:27,066 INFO L78 Accepts]: Start accepts. Automaton has 10108 states and 14258 transitions. Word has length 174 [2018-10-24 23:53:27,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 23:53:27,067 INFO L481 AbstractCegarLoop]: Abstraction has 10108 states and 14258 transitions. [2018-10-24 23:53:27,067 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-24 23:53:27,067 INFO L276 IsEmpty]: Start isEmpty. Operand 10108 states and 14258 transitions. [2018-10-24 23:53:27,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2018-10-24 23:53:27,073 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 23:53:27,074 INFO L375 BasicCegarLoop]: trace histogram [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, 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, 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] [2018-10-24 23:53:27,074 INFO L424 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 23:53:27,074 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:53:27,075 INFO L82 PathProgramCache]: Analyzing trace with hash 268481184, now seen corresponding path program 1 times [2018-10-24 23:53:27,075 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 23:53:27,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:53:27,076 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 23:53:27,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:53:27,076 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 23:53:27,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 23:53:27,335 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2018-10-24 23:53:27,336 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 23:53:27,336 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 23:53:27,336 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 23:53:27,336 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 23:53:27,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 23:53:27,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 23:53:27,337 INFO L87 Difference]: Start difference. First operand 10108 states and 14258 transitions. Second operand 4 states. [2018-10-24 23:53:35,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 23:53:35,223 INFO L93 Difference]: Finished difference Result 28811 states and 41798 transitions. [2018-10-24 23:53:35,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 23:53:35,231 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 232 [2018-10-24 23:53:35,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 23:53:35,304 INFO L225 Difference]: With dead ends: 28811 [2018-10-24 23:53:35,305 INFO L226 Difference]: Without dead ends: 18709 [2018-10-24 23:53:35,353 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-24 23:53:35,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18709 states. [2018-10-24 23:53:35,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18709 to 18709. [2018-10-24 23:53:35,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18709 states. [2018-10-24 23:53:35,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18709 states to 18709 states and 25926 transitions. [2018-10-24 23:53:35,755 INFO L78 Accepts]: Start accepts. Automaton has 18709 states and 25926 transitions. Word has length 232 [2018-10-24 23:53:35,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 23:53:35,756 INFO L481 AbstractCegarLoop]: Abstraction has 18709 states and 25926 transitions. [2018-10-24 23:53:35,756 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 23:53:35,757 INFO L276 IsEmpty]: Start isEmpty. Operand 18709 states and 25926 transitions. [2018-10-24 23:53:35,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2018-10-24 23:53:35,779 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 23:53:35,780 INFO L375 BasicCegarLoop]: trace histogram [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, 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, 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-24 23:53:35,780 INFO L424 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 23:53:35,780 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:53:35,781 INFO L82 PathProgramCache]: Analyzing trace with hash -418391288, now seen corresponding path program 1 times [2018-10-24 23:53:35,781 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 23:53:35,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:53:35,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 23:53:35,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:53:35,782 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 23:53:35,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 23:53:36,209 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 133 proven. 27 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-10-24 23:53:36,209 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 23:53:36,209 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 23:53:36,212 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 277 with the following transitions: [2018-10-24 23:53:36,217 INFO L202 CegarAbsIntRunner]: [0], [1], [1624], [1631], [1639], [1647], [1655], [1663], [1671], [1679], [1687], [1695], [1703], [1711], [1719], [1727], [1735], [1743], [1751], [1759], [1767], [1775], [1783], [1791], [1799], [1807], [1811], [1813], [1816], [1824], [1832], [1840], [1848], [1856], [1864], [1872], [1880], [1888], [1896], [1904], [1912], [1920], [1928], [1936], [1944], [1952], [1960], [1968], [1976], [1984], [1992], [2000], [2008], [2016], [2024], [2032], [2040], [2048], [2056], [2064], [2072], [2080], [2088], [2096], [2104], [2112], [2117], [2121], [2125], [2129], [2133], [2137], [2141], [2145], [2149], [2153], [2157], [2161], [2165], [2169], [2173], [2177], [2181], [2185], [2189], [2193], [2197], [2201], [2205], [2209], [2213], [2217], [2221], [2225], [2229], [2233], [2237], [2241], [2245], [2249], [2253], [2257], [2261], [2264], [2265], [2269], [2273], [2277], [2281], [2285], [2289], [2293], [2297], [2301], [2305], [2309], [2313], [2317], [2321], [2325], [2329], [2333], [2337], [2341], [2345], [2349], [2353], [2357], [2361], [2365], [2368], [2996], [3000], [3004], [3010], [3014], [3016], [3025], [3026], [3027], [3029], [3030] [2018-10-24 23:53:36,276 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-24 23:53:36,276 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-24 23:53:36,856 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-24 23:53:36,859 INFO L272 AbstractInterpreter]: Visited 138 different actions 138 times. Never merged. Never widened. Never found a fixpoint. Largest state had 24 variables. [2018-10-24 23:53:36,879 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:53:36,879 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-24 23:53:37,593 INFO L232 lantSequenceWeakener]: Weakened 267 states. On average, predicates are now at 77.61% of their original sizes. [2018-10-24 23:53:37,594 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-24 23:53:37,867 INFO L413 sIntCurrentIteration]: We have 275 unified AI predicates [2018-10-24 23:53:37,867 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-24 23:53:37,868 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 23:53:37,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [5] total 9 [2018-10-24 23:53:37,868 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 23:53:37,869 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-24 23:53:37,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-24 23:53:37,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-24 23:53:37,870 INFO L87 Difference]: Start difference. First operand 18709 states and 25926 transitions. Second operand 6 states. [2018-10-24 23:53:56,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-24 23:53:56,252 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: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: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.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-24 23:53:56,257 INFO L168 Benchmark]: Toolchain (without parser) took 74214.81 ms. Allocated memory was 1.5 GB in the beginning and 3.8 GB in the end (delta: 2.2 GB). Free memory was 1.4 GB in the beginning and 1.7 GB in the end (delta: -238.3 MB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. [2018-10-24 23:53:56,259 INFO L168 Benchmark]: CDTParser took 0.20 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-24 23:53:56,259 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1795.22 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 148.0 MB). Peak memory consumption was 148.0 MB. Max. memory is 7.1 GB. [2018-10-24 23:53:56,260 INFO L168 Benchmark]: Boogie Procedure Inliner took 401.89 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 775.9 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -950.9 MB). Peak memory consumption was 45.0 MB. Max. memory is 7.1 GB. [2018-10-24 23:53:56,261 INFO L168 Benchmark]: Boogie Preprocessor took 218.84 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.9 MB). Peak memory consumption was 13.9 MB. Max. memory is 7.1 GB. [2018-10-24 23:53:56,262 INFO L168 Benchmark]: RCFGBuilder took 8529.20 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.7 GB in the end (delta: 503.8 MB). Peak memory consumption was 503.8 MB. Max. memory is 7.1 GB. [2018-10-24 23:53:56,263 INFO L168 Benchmark]: TraceAbstraction took 63259.99 ms. Allocated memory was 2.3 GB in the beginning and 3.8 GB in the end (delta: 1.4 GB). Free memory was 1.7 GB in the beginning and 1.7 GB in the end (delta: 46.9 MB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. [2018-10-24 23:53:56,269 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.20 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 1795.22 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 148.0 MB). Peak memory consumption was 148.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 401.89 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 775.9 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -950.9 MB). Peak memory consumption was 45.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 218.84 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.9 MB). Peak memory consumption was 13.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 8529.20 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.7 GB in the end (delta: 503.8 MB). Peak memory consumption was 503.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 63259.99 ms. Allocated memory was 2.3 GB in the beginning and 3.8 GB in the end (delta: 1.4 GB). Free memory was 1.7 GB in the beginning and 1.7 GB in the end (delta: 46.9 MB). Peak memory consumption was 1.5 GB. 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...