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/Problem12_label15_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-25 01:37:20,142 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-25 01:37:20,144 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-25 01:37:20,156 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-25 01:37:20,157 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-25 01:37:20,158 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-25 01:37:20,159 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-25 01:37:20,161 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-25 01:37:20,162 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-25 01:37:20,163 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-25 01:37:20,164 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-25 01:37:20,164 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-25 01:37:20,165 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-25 01:37:20,166 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-25 01:37:20,167 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-25 01:37:20,168 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-25 01:37:20,169 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-25 01:37:20,171 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-25 01:37:20,173 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-25 01:37:20,175 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-25 01:37:20,176 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-25 01:37:20,177 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-25 01:37:20,179 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-25 01:37:20,179 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-25 01:37:20,180 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-25 01:37:20,181 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-25 01:37:20,181 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-25 01:37:20,182 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-25 01:37:20,183 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-25 01:37:20,184 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-25 01:37:20,184 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-25 01:37:20,185 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-25 01:37:20,185 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-25 01:37:20,185 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-25 01:37:20,186 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-25 01:37:20,187 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-25 01:37:20,187 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:37:20,203 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-25 01:37:20,203 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-25 01:37:20,204 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-25 01:37:20,204 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-25 01:37:20,204 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-25 01:37:20,205 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-25 01:37:20,205 INFO L133 SettingsManager]: * Explicit value domain=true [2018-10-25 01:37:20,205 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-25 01:37:20,205 INFO L133 SettingsManager]: * Octagon Domain=false [2018-10-25 01:37:20,205 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-25 01:37:20,206 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-25 01:37:20,206 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-25 01:37:20,206 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-25 01:37:20,206 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-25 01:37:20,207 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-25 01:37:20,207 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-25 01:37:20,207 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-25 01:37:20,207 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-25 01:37:20,208 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-25 01:37:20,208 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-25 01:37:20,208 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-25 01:37:20,208 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-25 01:37:20,208 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-25 01:37:20,209 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-25 01:37:20,209 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-25 01:37:20,209 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-25 01:37:20,209 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-25 01:37:20,209 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-25 01:37:20,210 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-25 01:37:20,210 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-25 01:37:20,210 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-25 01:37:20,210 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-25 01:37:20,210 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-25 01:37:20,211 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-25 01:37:20,211 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-25 01:37:20,211 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-25 01:37:20,258 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-25 01:37:20,271 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-25 01:37:20,274 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-25 01:37:20,276 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-25 01:37:20,276 INFO L276 PluginConnector]: CDTParser initialized [2018-10-25 01:37:20,277 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem12_label15_true-unreach-call.c [2018-10-25 01:37:20,334 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/4f79ddd47/b1acc99220364adaba0e0ca1c998ef80/FLAG8ee150d53 [2018-10-25 01:37:21,087 INFO L298 CDTParser]: Found 1 translation units. [2018-10-25 01:37:21,089 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem12_label15_true-unreach-call.c [2018-10-25 01:37:21,121 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/4f79ddd47/b1acc99220364adaba0e0ca1c998ef80/FLAG8ee150d53 [2018-10-25 01:37:21,142 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/4f79ddd47/b1acc99220364adaba0e0ca1c998ef80 [2018-10-25 01:37:21,154 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-25 01:37:21,156 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-25 01:37:21,157 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-25 01:37:21,157 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-25 01:37:21,165 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-25 01:37:21,166 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 01:37:21" (1/1) ... [2018-10-25 01:37:21,170 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b326c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:37:21, skipping insertion in model container [2018-10-25 01:37:21,170 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 01:37:21" (1/1) ... [2018-10-25 01:37:21,181 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-25 01:37:21,324 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-25 01:37:22,618 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-25 01:37:22,623 INFO L189 MainTranslator]: Completed pre-run [2018-10-25 01:37:23,312 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-25 01:37:23,349 INFO L193 MainTranslator]: Completed translation [2018-10-25 01:37:23,350 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:37:23 WrapperNode [2018-10-25 01:37:23,350 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-25 01:37:23,352 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-25 01:37:23,352 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-25 01:37:23,352 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-25 01:37:23,362 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:37:23" (1/1) ... [2018-10-25 01:37:23,440 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:37:23" (1/1) ... [2018-10-25 01:37:23,852 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-25 01:37:23,853 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-25 01:37:23,853 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-25 01:37:23,853 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-25 01:37:23,864 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:37:23" (1/1) ... [2018-10-25 01:37:23,865 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:37:23" (1/1) ... [2018-10-25 01:37:23,898 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:37:23" (1/1) ... [2018-10-25 01:37:23,898 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:37:23" (1/1) ... [2018-10-25 01:37:24,037 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:37:23" (1/1) ... [2018-10-25 01:37:24,081 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:37:23" (1/1) ... [2018-10-25 01:37:24,143 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:37:23" (1/1) ... [2018-10-25 01:37:24,201 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-25 01:37:24,202 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-25 01:37:24,202 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-25 01:37:24,202 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-25 01:37:24,203 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:37:23" (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:37:24,267 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-25 01:37:24,267 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-25 01:37:24,267 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output4 [2018-10-25 01:37:24,267 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output4 [2018-10-25 01:37:24,268 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output3 [2018-10-25 01:37:24,269 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output3 [2018-10-25 01:37:24,269 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2018-10-25 01:37:24,269 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2018-10-25 01:37:24,269 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-10-25 01:37:24,269 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-10-25 01:37:24,270 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-25 01:37:24,270 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-25 01:37:24,270 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-25 01:37:24,271 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-25 01:37:35,432 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-25 01:37:35,433 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 01:37:35 BoogieIcfgContainer [2018-10-25 01:37:35,433 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-25 01:37:35,434 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-25 01:37:35,434 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-25 01:37:35,439 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-25 01:37:35,440 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.10 01:37:21" (1/3) ... [2018-10-25 01:37:35,441 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@279b73a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 01:37:35, skipping insertion in model container [2018-10-25 01:37:35,441 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:37:23" (2/3) ... [2018-10-25 01:37:35,442 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@279b73a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 01:37:35, skipping insertion in model container [2018-10-25 01:37:35,442 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 01:37:35" (3/3) ... [2018-10-25 01:37:35,444 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem12_label15_true-unreach-call.c [2018-10-25 01:37:35,454 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-25 01:37:35,464 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-25 01:37:35,481 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-25 01:37:35,526 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-25 01:37:35,527 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-25 01:37:35,527 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-25 01:37:35,527 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-25 01:37:35,527 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-25 01:37:35,527 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-25 01:37:35,527 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-25 01:37:35,528 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-25 01:37:35,565 INFO L276 IsEmpty]: Start isEmpty. Operand 840 states. [2018-10-25 01:37:35,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-10-25 01:37:35,576 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:37:35,577 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 01:37:35,580 INFO L424 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:37:35,585 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:37:35,586 INFO L82 PathProgramCache]: Analyzing trace with hash 394736435, now seen corresponding path program 1 times [2018-10-25 01:37:35,589 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:37:35,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:37:35,645 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:37:35,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:37:35,646 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:37:35,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:37:36,161 WARN L179 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-25 01:37:36,296 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:37:36,298 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:37:36,298 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-25 01:37:36,299 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:37:36,304 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-25 01:37:36,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-25 01:37:36,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-25 01:37:36,323 INFO L87 Difference]: Start difference. First operand 840 states. Second operand 3 states. [2018-10-25 01:37:45,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:37:45,356 INFO L93 Difference]: Finished difference Result 2446 states and 4700 transitions. [2018-10-25 01:37:45,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-25 01:37:45,358 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2018-10-25 01:37:45,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:37:45,404 INFO L225 Difference]: With dead ends: 2446 [2018-10-25 01:37:45,405 INFO L226 Difference]: Without dead ends: 1604 [2018-10-25 01:37:45,420 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-25 01:37:45,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1604 states. [2018-10-25 01:37:45,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1604 to 1604. [2018-10-25 01:37:45,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1604 states. [2018-10-25 01:37:45,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1604 states to 1604 states and 2909 transitions. [2018-10-25 01:37:45,621 INFO L78 Accepts]: Start accepts. Automaton has 1604 states and 2909 transitions. Word has length 61 [2018-10-25 01:37:45,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:37:45,622 INFO L481 AbstractCegarLoop]: Abstraction has 1604 states and 2909 transitions. [2018-10-25 01:37:45,622 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-25 01:37:45,623 INFO L276 IsEmpty]: Start isEmpty. Operand 1604 states and 2909 transitions. [2018-10-25 01:37:45,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-10-25 01:37:45,636 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:37:45,636 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, 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] [2018-10-25 01:37:45,636 INFO L424 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:37:45,637 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:37:45,637 INFO L82 PathProgramCache]: Analyzing trace with hash -2085230804, now seen corresponding path program 1 times [2018-10-25 01:37:45,637 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:37:45,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:37:45,639 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:37:45,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:37:45,640 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:37:45,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:37:46,008 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:37:46,008 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:37:46,009 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-25 01:37:46,009 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:37:46,011 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-25 01:37:46,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-25 01:37:46,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-25 01:37:46,012 INFO L87 Difference]: Start difference. First operand 1604 states and 2909 transitions. Second operand 5 states. [2018-10-25 01:37:56,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:37:56,265 INFO L93 Difference]: Finished difference Result 4818 states and 8826 transitions. [2018-10-25 01:37:56,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 01:37:56,267 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 135 [2018-10-25 01:37:56,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:37:56,292 INFO L225 Difference]: With dead ends: 4818 [2018-10-25 01:37:56,293 INFO L226 Difference]: Without dead ends: 3220 [2018-10-25 01:37:56,299 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:37:56,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3220 states. [2018-10-25 01:37:56,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3220 to 3186. [2018-10-25 01:37:56,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3186 states. [2018-10-25 01:37:56,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3186 states to 3186 states and 5594 transitions. [2018-10-25 01:37:56,419 INFO L78 Accepts]: Start accepts. Automaton has 3186 states and 5594 transitions. Word has length 135 [2018-10-25 01:37:56,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:37:56,419 INFO L481 AbstractCegarLoop]: Abstraction has 3186 states and 5594 transitions. [2018-10-25 01:37:56,420 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-25 01:37:56,420 INFO L276 IsEmpty]: Start isEmpty. Operand 3186 states and 5594 transitions. [2018-10-25 01:37:56,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-10-25 01:37:56,424 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:37:56,424 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, 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] [2018-10-25 01:37:56,425 INFO L424 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:37:56,425 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:37:56,425 INFO L82 PathProgramCache]: Analyzing trace with hash -1091528155, now seen corresponding path program 1 times [2018-10-25 01:37:56,425 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:37:56,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:37:56,426 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:37:56,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:37:56,427 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:37:56,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:37:56,727 WARN L179 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-25 01:37:56,796 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:37:56,796 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:37:56,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-25 01:37:56,797 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:37:56,798 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 01:37:56,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 01:37:56,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 01:37:56,798 INFO L87 Difference]: Start difference. First operand 3186 states and 5594 transitions. Second operand 6 states. [2018-10-25 01:38:09,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:38:09,301 INFO L93 Difference]: Finished difference Result 11148 states and 19850 transitions. [2018-10-25 01:38:09,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 01:38:09,303 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 140 [2018-10-25 01:38:09,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:38:09,359 INFO L225 Difference]: With dead ends: 11148 [2018-10-25 01:38:09,360 INFO L226 Difference]: Without dead ends: 7968 [2018-10-25 01:38:09,376 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-25 01:38:09,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7968 states. [2018-10-25 01:38:09,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7968 to 7924. [2018-10-25 01:38:09,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7924 states. [2018-10-25 01:38:09,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7924 states to 7924 states and 13424 transitions. [2018-10-25 01:38:09,601 INFO L78 Accepts]: Start accepts. Automaton has 7924 states and 13424 transitions. Word has length 140 [2018-10-25 01:38:09,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:38:09,602 INFO L481 AbstractCegarLoop]: Abstraction has 7924 states and 13424 transitions. [2018-10-25 01:38:09,602 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 01:38:09,602 INFO L276 IsEmpty]: Start isEmpty. Operand 7924 states and 13424 transitions. [2018-10-25 01:38:09,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-10-25 01:38:09,605 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:38:09,605 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, 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] [2018-10-25 01:38:09,606 INFO L424 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:38:09,606 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:38:09,606 INFO L82 PathProgramCache]: Analyzing trace with hash 266956725, now seen corresponding path program 1 times [2018-10-25 01:38:09,606 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:38:09,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:38:09,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:38:09,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:38:09,608 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:38:09,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:38:09,879 WARN L179 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-25 01:38:09,953 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:38:09,953 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:38:09,954 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-25 01:38:09,954 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:38:09,954 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 01:38:09,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 01:38:09,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 01:38:09,955 INFO L87 Difference]: Start difference. First operand 7924 states and 13424 transitions. Second operand 6 states. [2018-10-25 01:38:19,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:38:19,478 INFO L93 Difference]: Finished difference Result 22224 states and 38004 transitions. [2018-10-25 01:38:19,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 01:38:19,478 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 148 [2018-10-25 01:38:19,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:38:19,542 INFO L225 Difference]: With dead ends: 22224 [2018-10-25 01:38:19,543 INFO L226 Difference]: Without dead ends: 14306 [2018-10-25 01:38:19,578 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-25 01:38:19,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14306 states. [2018-10-25 01:38:19,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14306 to 14219. [2018-10-25 01:38:19,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14219 states. [2018-10-25 01:38:19,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14219 states to 14219 states and 21550 transitions. [2018-10-25 01:38:19,920 INFO L78 Accepts]: Start accepts. Automaton has 14219 states and 21550 transitions. Word has length 148 [2018-10-25 01:38:19,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:38:19,920 INFO L481 AbstractCegarLoop]: Abstraction has 14219 states and 21550 transitions. [2018-10-25 01:38:19,921 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 01:38:19,921 INFO L276 IsEmpty]: Start isEmpty. Operand 14219 states and 21550 transitions. [2018-10-25 01:38:19,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2018-10-25 01:38:19,928 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:38:19,929 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, 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] [2018-10-25 01:38:19,929 INFO L424 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:38:19,929 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:38:19,929 INFO L82 PathProgramCache]: Analyzing trace with hash -1611009688, now seen corresponding path program 1 times [2018-10-25 01:38:19,930 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:38:19,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:38:19,931 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:38:19,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:38:19,931 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:38:19,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:38:20,215 WARN L179 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-25 01:38:20,629 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:38:20,629 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:38:20,629 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-25 01:38:20,632 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:38:20,633 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 01:38:20,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 01:38:20,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 01:38:20,634 INFO L87 Difference]: Start difference. First operand 14219 states and 21550 transitions. Second operand 6 states. [2018-10-25 01:38:34,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:38:34,903 INFO L93 Difference]: Finished difference Result 35956 states and 55845 transitions. [2018-10-25 01:38:34,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 01:38:34,904 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 181 [2018-10-25 01:38:34,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:38:34,990 INFO L225 Difference]: With dead ends: 35956 [2018-10-25 01:38:34,990 INFO L226 Difference]: Without dead ends: 21743 [2018-10-25 01:38:35,038 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:38:35,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21743 states. [2018-10-25 01:38:35,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21743 to 21651. [2018-10-25 01:38:35,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21651 states. [2018-10-25 01:38:35,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21651 states to 21651 states and 30247 transitions. [2018-10-25 01:38:35,483 INFO L78 Accepts]: Start accepts. Automaton has 21651 states and 30247 transitions. Word has length 181 [2018-10-25 01:38:35,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:38:35,484 INFO L481 AbstractCegarLoop]: Abstraction has 21651 states and 30247 transitions. [2018-10-25 01:38:35,484 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 01:38:35,484 INFO L276 IsEmpty]: Start isEmpty. Operand 21651 states and 30247 transitions. [2018-10-25 01:38:35,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2018-10-25 01:38:35,499 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:38:35,499 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, 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, 1, 1, 1, 1, 1, 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:38:35,500 INFO L424 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:38:35,500 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:38:35,500 INFO L82 PathProgramCache]: Analyzing trace with hash -849945464, now seen corresponding path program 1 times [2018-10-25 01:38:35,500 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:38:35,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:38:35,501 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:38:35,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:38:35,501 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:38:35,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:38:36,130 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 111 proven. 67 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-25 01:38:36,132 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 01:38:36,132 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 01:38:36,133 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 233 with the following transitions: [2018-10-25 01:38:36,136 INFO L202 CegarAbsIntRunner]: [0], [1], [1868], [1875], [1883], [1891], [1899], [1907], [1915], [1923], [1931], [1939], [1947], [1955], [1963], [1971], [1979], [1987], [1995], [2003], [2011], [2019], [2027], [2035], [2043], [2051], [2059], [2067], [2075], [2083], [2091], [2099], [2107], [2115], [2123], [2131], [2139], [2147], [2155], [2163], [2171], [2179], [2187], [2195], [2203], [2211], [2219], [2227], [2235], [2243], [2251], [2255], [2257], [2260], [2268], [2276], [2284], [2292], [2300], [2308], [2316], [2324], [2332], [2340], [2348], [2356], [2361], [2365], [2369], [2373], [2377], [2381], [2384], [2385], [2389], [2393], [2397], [2401], [2405], [2409], [2413], [2417], [2421], [2425], [2429], [2433], [2437], [2441], [2445], [2449], [2453], [2457], [2460], [3240], [3244], [3248], [3254], [3258], [3260], [3271], [3272], [3273], [3275], [3276] [2018-10-25 01:38:36,201 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 01:38:36,201 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 01:38:36,924 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-25 01:38:36,926 INFO L272 AbstractInterpreter]: Visited 103 different actions 199 times. Merged at 4 different actions 4 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 26 variables. [2018-10-25 01:38:36,967 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:38:36,967 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-25 01:38:38,149 INFO L232 lantSequenceWeakener]: Weakened 140 states. On average, predicates are now at 76.44% of their original sizes. [2018-10-25 01:38:38,149 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-25 01:38:38,613 INFO L413 sIntCurrentIteration]: We have 231 unified AI predicates [2018-10-25 01:38:38,613 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-25 01:38:38,614 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-25 01:38:38,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [6] total 19 [2018-10-25 01:38:38,615 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:38:38,615 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-25 01:38:38,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-25 01:38:38,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2018-10-25 01:38:38,616 INFO L87 Difference]: Start difference. First operand 21651 states and 30247 transitions. Second operand 15 states. [2018-10-25 01:38:51,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-25 01:38:51,922 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: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.BasicAbstractInterpolantAutomaton.chooseFalseSuccessor2(BasicAbstractInterpolantAutomaton.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:72) 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:38:51,930 INFO L168 Benchmark]: Toolchain (without parser) took 90775.00 ms. Allocated memory was 1.5 GB in the beginning and 3.2 GB in the end (delta: 1.7 GB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -694.0 MB). Peak memory consumption was 972.7 MB. Max. memory is 7.1 GB. [2018-10-25 01:38:51,931 INFO L168 Benchmark]: CDTParser took 0.18 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:38:51,932 INFO L168 Benchmark]: CACSL2BoogieTranslator took 2193.92 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 190.3 MB). Peak memory consumption was 190.3 MB. Max. memory is 7.1 GB. [2018-10-25 01:38:51,933 INFO L168 Benchmark]: Boogie Procedure Inliner took 501.00 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 756.0 MB). Free memory was 1.2 GB in the beginning and 2.2 GB in the end (delta: -998.5 MB). Peak memory consumption was 68.9 MB. Max. memory is 7.1 GB. [2018-10-25 01:38:51,934 INFO L168 Benchmark]: Boogie Preprocessor took 348.46 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: 35.2 MB). Peak memory consumption was 35.2 MB. Max. memory is 7.1 GB. [2018-10-25 01:38:51,935 INFO L168 Benchmark]: RCFGBuilder took 11231.39 ms. Allocated memory was 2.3 GB in the beginning and 2.5 GB in the end (delta: 177.7 MB). Free memory was 2.2 GB in the beginning and 2.3 GB in the end (delta: -161.1 MB). Peak memory consumption was 651.2 MB. Max. memory is 7.1 GB. [2018-10-25 01:38:51,936 INFO L168 Benchmark]: TraceAbstraction took 76495.19 ms. Allocated memory was 2.5 GB in the beginning and 3.2 GB in the end (delta: 733.0 MB). Free memory was 2.3 GB in the beginning and 2.1 GB in the end (delta: 240.1 MB). Peak memory consumption was 973.1 MB. Max. memory is 7.1 GB. [2018-10-25 01:38:51,942 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.18 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 2193.92 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 190.3 MB). Peak memory consumption was 190.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 501.00 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 756.0 MB). Free memory was 1.2 GB in the beginning and 2.2 GB in the end (delta: -998.5 MB). Peak memory consumption was 68.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 348.46 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: 35.2 MB). Peak memory consumption was 35.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 11231.39 ms. Allocated memory was 2.3 GB in the beginning and 2.5 GB in the end (delta: 177.7 MB). Free memory was 2.2 GB in the beginning and 2.3 GB in the end (delta: -161.1 MB). Peak memory consumption was 651.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 76495.19 ms. Allocated memory was 2.5 GB in the beginning and 3.2 GB in the end (delta: 733.0 MB). Free memory was 2.3 GB in the beginning and 2.1 GB in the end (delta: 240.1 MB). Peak memory consumption was 973.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...