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/Problem10_label34_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-25 01:24:40,948 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-25 01:24:40,950 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-25 01:24:40,965 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-25 01:24:40,965 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-25 01:24:40,967 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-25 01:24:40,968 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-25 01:24:40,970 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-25 01:24:40,974 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-25 01:24:40,975 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-25 01:24:40,983 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-25 01:24:40,984 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-25 01:24:40,988 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-25 01:24:40,989 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-25 01:24:40,992 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-25 01:24:40,993 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-25 01:24:40,994 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-25 01:24:40,999 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-25 01:24:41,003 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-25 01:24:41,005 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-25 01:24:41,007 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-25 01:24:41,008 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-25 01:24:41,011 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-25 01:24:41,011 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-25 01:24:41,014 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-25 01:24:41,015 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-25 01:24:41,016 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-25 01:24:41,017 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-25 01:24:41,017 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-25 01:24:41,018 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-25 01:24:41,019 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-25 01:24:41,019 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-25 01:24:41,020 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-25 01:24:41,020 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-25 01:24:41,021 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-25 01:24:41,022 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-25 01:24:41,022 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:24:41,038 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-25 01:24:41,038 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-25 01:24:41,039 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-25 01:24:41,039 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-25 01:24:41,039 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-25 01:24:41,039 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-25 01:24:41,040 INFO L133 SettingsManager]: * Explicit value domain=true [2018-10-25 01:24:41,040 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-25 01:24:41,040 INFO L133 SettingsManager]: * Octagon Domain=false [2018-10-25 01:24:41,040 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-25 01:24:41,040 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-25 01:24:41,041 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-25 01:24:41,041 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-25 01:24:41,041 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-25 01:24:41,042 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-25 01:24:41,042 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-25 01:24:41,042 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-25 01:24:41,043 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-25 01:24:41,043 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-25 01:24:41,043 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-25 01:24:41,043 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-25 01:24:41,043 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-25 01:24:41,044 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-25 01:24:41,044 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-25 01:24:41,044 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-25 01:24:41,044 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-25 01:24:41,044 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-25 01:24:41,045 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-25 01:24:41,045 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-25 01:24:41,045 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-25 01:24:41,045 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-25 01:24:41,045 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-25 01:24:41,045 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-25 01:24:41,046 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-25 01:24:41,046 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-25 01:24:41,046 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-25 01:24:41,090 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-25 01:24:41,103 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-25 01:24:41,107 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-25 01:24:41,109 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-25 01:24:41,109 INFO L276 PluginConnector]: CDTParser initialized [2018-10-25 01:24:41,110 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem10_label34_true-unreach-call.c [2018-10-25 01:24:41,172 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/7e500e264/53379f4c34f24e3b80e76cd168250d3a/FLAG9c66fd4b4 [2018-10-25 01:24:41,817 INFO L298 CDTParser]: Found 1 translation units. [2018-10-25 01:24:41,821 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem10_label34_true-unreach-call.c [2018-10-25 01:24:41,845 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/7e500e264/53379f4c34f24e3b80e76cd168250d3a/FLAG9c66fd4b4 [2018-10-25 01:24:41,867 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/7e500e264/53379f4c34f24e3b80e76cd168250d3a [2018-10-25 01:24:41,882 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-25 01:24:41,884 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-25 01:24:41,885 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-25 01:24:41,885 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-25 01:24:41,889 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-25 01:24:41,891 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 01:24:41" (1/1) ... [2018-10-25 01:24:41,895 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b21ccce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:24:41, skipping insertion in model container [2018-10-25 01:24:41,896 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 01:24:41" (1/1) ... [2018-10-25 01:24:41,907 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-25 01:24:41,997 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-25 01:24:42,498 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-25 01:24:42,504 INFO L189 MainTranslator]: Completed pre-run [2018-10-25 01:24:42,676 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-25 01:24:42,695 INFO L193 MainTranslator]: Completed translation [2018-10-25 01:24:42,695 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:24:42 WrapperNode [2018-10-25 01:24:42,696 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-25 01:24:42,697 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-25 01:24:42,697 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-25 01:24:42,697 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-25 01:24:42,710 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:24:42" (1/1) ... [2018-10-25 01:24:42,737 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:24:42" (1/1) ... [2018-10-25 01:24:42,917 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-25 01:24:42,917 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-25 01:24:42,918 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-25 01:24:42,918 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-25 01:24:42,930 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:24:42" (1/1) ... [2018-10-25 01:24:42,930 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:24:42" (1/1) ... [2018-10-25 01:24:42,938 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:24:42" (1/1) ... [2018-10-25 01:24:42,939 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:24:42" (1/1) ... [2018-10-25 01:24:42,972 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:24:42" (1/1) ... [2018-10-25 01:24:42,999 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:24:42" (1/1) ... [2018-10-25 01:24:43,013 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:24:42" (1/1) ... [2018-10-25 01:24:43,026 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-25 01:24:43,027 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-25 01:24:43,027 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-25 01:24:43,028 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-25 01:24:43,029 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:24:42" (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:24:43,110 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-25 01:24:43,110 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-25 01:24:43,110 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-10-25 01:24:43,111 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-10-25 01:24:43,111 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-25 01:24:43,111 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-25 01:24:43,111 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-25 01:24:43,111 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-25 01:24:46,356 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-25 01:24:46,357 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 01:24:46 BoogieIcfgContainer [2018-10-25 01:24:46,357 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-25 01:24:46,358 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-25 01:24:46,358 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-25 01:24:46,361 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-25 01:24:46,362 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.10 01:24:41" (1/3) ... [2018-10-25 01:24:46,363 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1582630b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 01:24:46, skipping insertion in model container [2018-10-25 01:24:46,363 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:24:42" (2/3) ... [2018-10-25 01:24:46,363 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1582630b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 01:24:46, skipping insertion in model container [2018-10-25 01:24:46,364 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 01:24:46" (3/3) ... [2018-10-25 01:24:46,365 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem10_label34_true-unreach-call.c [2018-10-25 01:24:46,376 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-25 01:24:46,385 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-25 01:24:46,404 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-25 01:24:46,444 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-25 01:24:46,445 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-25 01:24:46,445 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-25 01:24:46,445 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-25 01:24:46,445 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-25 01:24:46,446 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-25 01:24:46,446 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-25 01:24:46,446 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-25 01:24:46,475 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states. [2018-10-25 01:24:46,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-10-25 01:24:46,487 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:24:46,488 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 01:24:46,491 INFO L424 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:24:46,497 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:24:46,498 INFO L82 PathProgramCache]: Analyzing trace with hash 427988964, now seen corresponding path program 1 times [2018-10-25 01:24:46,501 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:24:46,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:24:46,556 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:24:46,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:24:46,557 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:24:46,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:24:47,126 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 6 DAG size of output: 3 [2018-10-25 01:24:47,149 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:24:47,151 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:24:47,152 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-25 01:24:47,152 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:24:47,161 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-25 01:24:47,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-25 01:24:47,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-25 01:24:47,180 INFO L87 Difference]: Start difference. First operand 216 states. Second operand 4 states. [2018-10-25 01:24:50,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:24:50,022 INFO L93 Difference]: Finished difference Result 737 states and 1298 transitions. [2018-10-25 01:24:50,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-25 01:24:50,024 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 70 [2018-10-25 01:24:50,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:24:50,047 INFO L225 Difference]: With dead ends: 737 [2018-10-25 01:24:50,047 INFO L226 Difference]: Without dead ends: 515 [2018-10-25 01:24:50,056 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-25 01:24:50,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2018-10-25 01:24:50,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 515. [2018-10-25 01:24:50,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 515 states. [2018-10-25 01:24:50,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 848 transitions. [2018-10-25 01:24:50,154 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 848 transitions. Word has length 70 [2018-10-25 01:24:50,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:24:50,155 INFO L481 AbstractCegarLoop]: Abstraction has 515 states and 848 transitions. [2018-10-25 01:24:50,155 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-25 01:24:50,155 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 848 transitions. [2018-10-25 01:24:50,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-10-25 01:24:50,179 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:24:50,180 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, 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] [2018-10-25 01:24:50,180 INFO L424 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:24:50,180 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:24:50,182 INFO L82 PathProgramCache]: Analyzing trace with hash 453720075, now seen corresponding path program 1 times [2018-10-25 01:24:50,182 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:24:50,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:24:50,185 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:24:50,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:24:50,185 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:24:50,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:24:50,561 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:24:50,561 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:24:50,562 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-25 01:24:50,562 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:24:50,564 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 01:24:50,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 01:24:50,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 01:24:50,565 INFO L87 Difference]: Start difference. First operand 515 states and 848 transitions. Second operand 6 states. [2018-10-25 01:24:53,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:24:53,328 INFO L93 Difference]: Finished difference Result 1863 states and 3251 transitions. [2018-10-25 01:24:53,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 01:24:53,329 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 145 [2018-10-25 01:24:53,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:24:53,347 INFO L225 Difference]: With dead ends: 1863 [2018-10-25 01:24:53,347 INFO L226 Difference]: Without dead ends: 1354 [2018-10-25 01:24:53,355 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-25 01:24:53,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1354 states. [2018-10-25 01:24:53,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1354 to 1331. [2018-10-25 01:24:53,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1331 states. [2018-10-25 01:24:53,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1331 states to 1331 states and 2051 transitions. [2018-10-25 01:24:53,471 INFO L78 Accepts]: Start accepts. Automaton has 1331 states and 2051 transitions. Word has length 145 [2018-10-25 01:24:53,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:24:53,472 INFO L481 AbstractCegarLoop]: Abstraction has 1331 states and 2051 transitions. [2018-10-25 01:24:53,473 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 01:24:53,473 INFO L276 IsEmpty]: Start isEmpty. Operand 1331 states and 2051 transitions. [2018-10-25 01:24:53,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-10-25 01:24:53,484 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:24:53,485 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, 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] [2018-10-25 01:24:53,485 INFO L424 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:24:53,486 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:24:53,486 INFO L82 PathProgramCache]: Analyzing trace with hash -1203594976, now seen corresponding path program 1 times [2018-10-25 01:24:53,486 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:24:53,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:24:53,488 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:24:53,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:24:53,489 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:24:53,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:24:53,864 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:24:53,864 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:24:53,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-25 01:24:53,865 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:24:53,865 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 01:24:53,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 01:24:53,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 01:24:53,866 INFO L87 Difference]: Start difference. First operand 1331 states and 2051 transitions. Second operand 6 states. [2018-10-25 01:24:56,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:24:56,878 INFO L93 Difference]: Finished difference Result 3539 states and 5767 transitions. [2018-10-25 01:24:56,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 01:24:56,879 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 178 [2018-10-25 01:24:56,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:24:56,901 INFO L225 Difference]: With dead ends: 3539 [2018-10-25 01:24:56,901 INFO L226 Difference]: Without dead ends: 2214 [2018-10-25 01:24:56,914 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-25 01:24:56,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2214 states. [2018-10-25 01:24:56,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2214 to 2179. [2018-10-25 01:24:56,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2179 states. [2018-10-25 01:24:57,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2179 states to 2179 states and 3196 transitions. [2018-10-25 01:24:57,009 INFO L78 Accepts]: Start accepts. Automaton has 2179 states and 3196 transitions. Word has length 178 [2018-10-25 01:24:57,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:24:57,009 INFO L481 AbstractCegarLoop]: Abstraction has 2179 states and 3196 transitions. [2018-10-25 01:24:57,009 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 01:24:57,010 INFO L276 IsEmpty]: Start isEmpty. Operand 2179 states and 3196 transitions. [2018-10-25 01:24:57,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2018-10-25 01:24:57,027 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:24:57,028 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, 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, 1, 1, 1, 1, 1, 1, 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:24:57,028 INFO L424 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:24:57,029 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:24:57,029 INFO L82 PathProgramCache]: Analyzing trace with hash -932170556, now seen corresponding path program 1 times [2018-10-25 01:24:57,029 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:24:57,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:24:57,030 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:24:57,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:24:57,031 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:24:57,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:24:57,462 WARN L179 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-25 01:24:57,800 INFO L134 CoverageAnalysis]: Checked inductivity of 214 backedges. 0 proven. 118 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2018-10-25 01:24:57,801 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 01:24:57,801 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 01:24:57,802 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 267 with the following transitions: [2018-10-25 01:24:57,805 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [461], [463], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [566], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [646], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-10-25 01:24:57,879 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 01:24:57,879 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 01:24:58,498 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-25 01:24:58,500 INFO L272 AbstractInterpreter]: Visited 113 different actions 113 times. Never merged. Never widened. Never found a fixpoint. Largest state had 24 variables. [2018-10-25 01:24:58,544 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:24:58,545 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-25 01:24:59,191 INFO L232 lantSequenceWeakener]: Weakened 257 states. On average, predicates are now at 73.6% of their original sizes. [2018-10-25 01:24:59,191 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-25 01:24:59,449 INFO L413 sIntCurrentIteration]: We have 265 unified AI predicates [2018-10-25 01:24:59,449 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-25 01:24:59,454 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-25 01:24:59,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [4] total 8 [2018-10-25 01:24:59,454 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:24:59,455 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 01:24:59,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 01:24:59,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 01:24:59,456 INFO L87 Difference]: Start difference. First operand 2179 states and 3196 transitions. Second operand 6 states. [2018-10-25 01:25:39,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:25:39,317 INFO L93 Difference]: Finished difference Result 4498 states and 6607 transitions. [2018-10-25 01:25:39,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-25 01:25:39,317 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 266 [2018-10-25 01:25:39,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:25:39,331 INFO L225 Difference]: With dead ends: 4498 [2018-10-25 01:25:39,332 INFO L226 Difference]: Without dead ends: 2325 [2018-10-25 01:25:39,341 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 266 GetRequests, 261 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-10-25 01:25:39,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2325 states. [2018-10-25 01:25:39,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2325 to 2323. [2018-10-25 01:25:39,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2323 states. [2018-10-25 01:25:39,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2323 states to 2323 states and 3348 transitions. [2018-10-25 01:25:39,408 INFO L78 Accepts]: Start accepts. Automaton has 2323 states and 3348 transitions. Word has length 266 [2018-10-25 01:25:39,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:25:39,408 INFO L481 AbstractCegarLoop]: Abstraction has 2323 states and 3348 transitions. [2018-10-25 01:25:39,408 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 01:25:39,409 INFO L276 IsEmpty]: Start isEmpty. Operand 2323 states and 3348 transitions. [2018-10-25 01:25:39,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2018-10-25 01:25:39,425 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:25:39,425 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-10-25 01:25:39,426 INFO L424 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:25:39,426 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:25:39,426 INFO L82 PathProgramCache]: Analyzing trace with hash 238222643, now seen corresponding path program 1 times [2018-10-25 01:25:39,426 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:25:39,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:25:39,428 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:25:39,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:25:39,430 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:25:39,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:25:39,970 WARN L179 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-10-25 01:25:40,161 WARN L179 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-10-25 01:25:40,875 INFO L134 CoverageAnalysis]: Checked inductivity of 419 backedges. 263 proven. 87 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2018-10-25 01:25:40,876 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 01:25:40,876 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 01:25:40,876 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 338 with the following transitions: [2018-10-25 01:25:40,876 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [461], [463], [466], [474], [482], [490], [495], [498], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [566], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [646], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-10-25 01:25:40,881 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 01:25:40,881 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 01:25:46,778 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-25 01:25:46,779 INFO L272 AbstractInterpreter]: Visited 117 different actions 474 times. Merged at 8 different actions 39 times. Widened at 1 different actions 1 times. Found 7 fixpoints after 2 different actions. Largest state had 24 variables. [2018-10-25 01:25:46,812 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:25:46,812 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-25 01:25:49,688 INFO L232 lantSequenceWeakener]: Weakened 64 states. On average, predicates are now at 77.44% of their original sizes. [2018-10-25 01:25:49,688 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-25 01:25:50,702 INFO L413 sIntCurrentIteration]: We have 336 unified AI predicates [2018-10-25 01:25:50,702 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-25 01:25:50,703 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-25 01:25:50,703 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [14] total 27 [2018-10-25 01:25:50,703 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:25:50,703 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-25 01:25:50,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-25 01:25:50,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2018-10-25 01:25:50,704 INFO L87 Difference]: Start difference. First operand 2323 states and 3348 transitions. Second operand 15 states. [2018-10-25 01:27:21,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-25 01:27:21,830 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:93) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:92) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:92) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.ConditionalEvaluator.evaluate(ConditionalEvaluator.java:78) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.ConditionalEvaluator.evaluate(ConditionalEvaluator.java:1) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:93) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.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.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:27:21,836 INFO L168 Benchmark]: Toolchain (without parser) took 159953.47 ms. Allocated memory was 1.5 GB in the beginning and 4.2 GB in the end (delta: 2.6 GB). Free memory was 1.4 GB in the beginning and 2.0 GB in the end (delta: -571.5 MB). Peak memory consumption was 2.1 GB. Max. memory is 7.1 GB. [2018-10-25 01:27:21,837 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-25 01:27:21,838 INFO L168 Benchmark]: CACSL2BoogieTranslator took 811.27 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-10-25 01:27:21,839 INFO L168 Benchmark]: Boogie Procedure Inliner took 220.08 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 735.6 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -808.0 MB). Peak memory consumption was 19.0 MB. Max. memory is 7.1 GB. [2018-10-25 01:27:21,840 INFO L168 Benchmark]: Boogie Preprocessor took 109.44 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-25 01:27:21,840 INFO L168 Benchmark]: RCFGBuilder took 3329.69 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 116.6 MB). Peak memory consumption was 116.6 MB. Max. memory is 7.1 GB. [2018-10-25 01:27:21,841 INFO L168 Benchmark]: TraceAbstraction took 155477.01 ms. Allocated memory was 2.3 GB in the beginning and 4.2 GB in the end (delta: 1.9 GB). Free memory was 2.1 GB in the beginning and 2.0 GB in the end (delta: 88.1 MB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. [2018-10-25 01:27:21,847 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 811.27 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 220.08 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 735.6 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -808.0 MB). Peak memory consumption was 19.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 109.44 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 3329.69 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 116.6 MB). Peak memory consumption was 116.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 155477.01 ms. Allocated memory was 2.3 GB in the beginning and 4.2 GB in the end (delta: 1.9 GB). Free memory was 2.1 GB in the beginning and 2.0 GB in the end (delta: 88.1 MB). Peak memory consumption was 2.0 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...