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/Problem15_label29_false-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-24 23:39:45,962 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-24 23:39:45,964 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-24 23:39:45,981 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-24 23:39:45,982 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-24 23:39:45,982 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-24 23:39:45,984 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-24 23:39:45,985 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-24 23:39:45,987 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-24 23:39:45,988 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-24 23:39:45,989 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-24 23:39:45,989 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-24 23:39:45,990 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-24 23:39:45,991 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-24 23:39:45,992 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-24 23:39:45,993 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-24 23:39:45,994 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-24 23:39:45,996 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-24 23:39:45,998 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-24 23:39:46,000 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-24 23:39:46,002 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-24 23:39:46,003 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-24 23:39:46,006 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-24 23:39:46,007 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-24 23:39:46,007 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-24 23:39:46,008 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-24 23:39:46,010 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-24 23:39:46,010 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-24 23:39:46,013 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-24 23:39:46,014 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-24 23:39:46,014 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-24 23:39:46,017 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-24 23:39:46,018 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-24 23:39:46,018 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-24 23:39:46,020 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-24 23:39:46,021 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-24 23:39:46,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-24 23:39:46,046 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-24 23:39:46,047 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-24 23:39:46,047 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-24 23:39:46,048 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-24 23:39:46,048 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-24 23:39:46,048 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-24 23:39:46,048 INFO L133 SettingsManager]: * Explicit value domain=true [2018-10-24 23:39:46,048 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-24 23:39:46,049 INFO L133 SettingsManager]: * Octagon Domain=false [2018-10-24 23:39:46,049 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-24 23:39:46,049 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-24 23:39:46,049 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-24 23:39:46,049 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-24 23:39:46,049 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-24 23:39:46,050 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-24 23:39:46,050 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-24 23:39:46,050 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-24 23:39:46,051 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-24 23:39:46,051 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-24 23:39:46,051 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-24 23:39:46,051 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-24 23:39:46,051 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-24 23:39:46,052 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-24 23:39:46,052 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-24 23:39:46,052 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-24 23:39:46,052 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-24 23:39:46,052 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-24 23:39:46,053 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-24 23:39:46,053 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-24 23:39:46,053 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-24 23:39:46,053 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-24 23:39:46,053 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-24 23:39:46,054 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-24 23:39:46,054 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-24 23:39:46,054 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-24 23:39:46,054 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-24 23:39:46,117 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-24 23:39:46,130 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-24 23:39:46,134 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-24 23:39:46,136 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-24 23:39:46,136 INFO L276 PluginConnector]: CDTParser initialized [2018-10-24 23:39:46,137 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem15_label29_false-unreach-call.c [2018-10-24 23:39:46,197 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/da117b0f6/c86d2dadf9dd4686a5128a8592db9334/FLAGed0004039 [2018-10-24 23:39:46,890 INFO L298 CDTParser]: Found 1 translation units. [2018-10-24 23:39:46,891 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem15_label29_false-unreach-call.c [2018-10-24 23:39:46,909 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/da117b0f6/c86d2dadf9dd4686a5128a8592db9334/FLAGed0004039 [2018-10-24 23:39:46,925 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/da117b0f6/c86d2dadf9dd4686a5128a8592db9334 [2018-10-24 23:39:46,936 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-24 23:39:46,937 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-24 23:39:46,938 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-24 23:39:46,939 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-24 23:39:46,942 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-24 23:39:46,943 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:39:46" (1/1) ... [2018-10-24 23:39:46,946 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ac71435 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:39:46, skipping insertion in model container [2018-10-24 23:39:46,947 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:39:46" (1/1) ... [2018-10-24 23:39:46,957 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-24 23:39:47,064 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-24 23:39:47,935 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 23:39:47,941 INFO L189 MainTranslator]: Completed pre-run [2018-10-24 23:39:48,271 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 23:39:48,293 INFO L193 MainTranslator]: Completed translation [2018-10-24 23:39:48,293 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:39:48 WrapperNode [2018-10-24 23:39:48,294 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-24 23:39:48,295 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-24 23:39:48,295 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-24 23:39:48,295 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-24 23:39:48,305 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:39:48" (1/1) ... [2018-10-24 23:39:48,352 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:39:48" (1/1) ... [2018-10-24 23:39:48,678 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-24 23:39:48,678 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-24 23:39:48,679 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-24 23:39:48,679 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-24 23:39:48,691 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:39:48" (1/1) ... [2018-10-24 23:39:48,691 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:39:48" (1/1) ... [2018-10-24 23:39:48,715 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:39:48" (1/1) ... [2018-10-24 23:39:48,715 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:39:48" (1/1) ... [2018-10-24 23:39:48,784 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:39:48" (1/1) ... [2018-10-24 23:39:48,800 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:39:48" (1/1) ... [2018-10-24 23:39:48,829 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:39:48" (1/1) ... [2018-10-24 23:39:48,849 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-24 23:39:48,850 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-24 23:39:48,850 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-24 23:39:48,850 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-24 23:39:48,851 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:39:48" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-24 23:39:48,916 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-24 23:39:48,916 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-24 23:39:48,916 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2018-10-24 23:39:48,916 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2018-10-24 23:39:48,917 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-10-24 23:39:48,917 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-10-24 23:39:48,917 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-24 23:39:48,917 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-24 23:39:48,917 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-24 23:39:48,917 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-24 23:39:55,774 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-24 23:39:55,775 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:39:55 BoogieIcfgContainer [2018-10-24 23:39:55,775 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-24 23:39:55,776 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-24 23:39:55,776 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-24 23:39:55,780 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-24 23:39:55,780 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 11:39:46" (1/3) ... [2018-10-24 23:39:55,781 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@788561bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:39:55, skipping insertion in model container [2018-10-24 23:39:55,781 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:39:48" (2/3) ... [2018-10-24 23:39:55,782 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@788561bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:39:55, skipping insertion in model container [2018-10-24 23:39:55,782 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:39:55" (3/3) ... [2018-10-24 23:39:55,784 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem15_label29_false-unreach-call.c [2018-10-24 23:39:55,793 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-24 23:39:55,801 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-24 23:39:55,818 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-24 23:39:55,865 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-24 23:39:55,865 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-24 23:39:55,865 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-24 23:39:55,865 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-24 23:39:55,866 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-24 23:39:55,867 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-24 23:39:55,867 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-24 23:39:55,867 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-24 23:39:55,905 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states. [2018-10-24 23:39:55,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-10-24 23:39:55,913 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 23:39:55,914 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] [2018-10-24 23:39:55,917 INFO L424 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 23:39:55,923 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:39:55,924 INFO L82 PathProgramCache]: Analyzing trace with hash -1800522660, now seen corresponding path program 1 times [2018-10-24 23:39:55,926 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 23:39:55,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:39:55,989 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 23:39:55,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:39:55,989 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 23:39:56,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 23:39:56,367 WARN L179 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-24 23:39:56,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 23:39:56,465 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 23:39:56,465 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 23:39:56,465 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 23:39:56,471 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 23:39:56,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 23:39:56,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 23:39:56,491 INFO L87 Difference]: Start difference. First operand 438 states. Second operand 3 states. [2018-10-24 23:40:02,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 23:40:02,046 INFO L93 Difference]: Finished difference Result 1194 states and 2152 transitions. [2018-10-24 23:40:02,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 23:40:02,048 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-10-24 23:40:02,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 23:40:02,072 INFO L225 Difference]: With dead ends: 1194 [2018-10-24 23:40:02,073 INFO L226 Difference]: Without dead ends: 754 [2018-10-24 23:40:02,084 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 23:40:02,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 754 states. [2018-10-24 23:40:02,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 754 to 752. [2018-10-24 23:40:02,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 752 states. [2018-10-24 23:40:02,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 752 states to 752 states and 1325 transitions. [2018-10-24 23:40:02,197 INFO L78 Accepts]: Start accepts. Automaton has 752 states and 1325 transitions. Word has length 28 [2018-10-24 23:40:02,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 23:40:02,198 INFO L481 AbstractCegarLoop]: Abstraction has 752 states and 1325 transitions. [2018-10-24 23:40:02,198 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 23:40:02,198 INFO L276 IsEmpty]: Start isEmpty. Operand 752 states and 1325 transitions. [2018-10-24 23:40:02,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-10-24 23:40:02,204 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 23:40:02,205 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 23:40:02,205 INFO L424 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 23:40:02,205 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:40:02,206 INFO L82 PathProgramCache]: Analyzing trace with hash 1795100031, now seen corresponding path program 1 times [2018-10-24 23:40:02,206 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 23:40:02,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:40:02,207 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 23:40:02,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:40:02,207 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 23:40:02,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 23:40:02,527 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 23:40:02,527 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 23:40:02,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-24 23:40:02,528 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 23:40:02,530 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-24 23:40:02,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-24 23:40:02,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-24 23:40:02,531 INFO L87 Difference]: Start difference. First operand 752 states and 1325 transitions. Second operand 6 states. [2018-10-24 23:40:20,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 23:40:20,375 INFO L93 Difference]: Finished difference Result 2838 states and 5159 transitions. [2018-10-24 23:40:20,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-24 23:40:20,378 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 102 [2018-10-24 23:40:20,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 23:40:20,402 INFO L225 Difference]: With dead ends: 2838 [2018-10-24 23:40:20,403 INFO L226 Difference]: Without dead ends: 2092 [2018-10-24 23:40:20,412 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-10-24 23:40:20,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2092 states. [2018-10-24 23:40:20,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2092 to 2056. [2018-10-24 23:40:20,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2056 states. [2018-10-24 23:40:20,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2056 states to 2056 states and 3405 transitions. [2018-10-24 23:40:20,527 INFO L78 Accepts]: Start accepts. Automaton has 2056 states and 3405 transitions. Word has length 102 [2018-10-24 23:40:20,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 23:40:20,528 INFO L481 AbstractCegarLoop]: Abstraction has 2056 states and 3405 transitions. [2018-10-24 23:40:20,528 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-24 23:40:20,529 INFO L276 IsEmpty]: Start isEmpty. Operand 2056 states and 3405 transitions. [2018-10-24 23:40:20,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-10-24 23:40:20,540 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 23:40:20,541 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 23:40:20,543 INFO L424 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 23:40:20,543 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:40:20,544 INFO L82 PathProgramCache]: Analyzing trace with hash 1736818506, now seen corresponding path program 1 times [2018-10-24 23:40:20,544 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 23:40:20,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:40:20,545 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 23:40:20,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:40:20,545 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 23:40:20,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 23:40:20,859 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 23:40:20,859 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 23:40:20,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-24 23:40:20,860 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 23:40:20,860 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-24 23:40:20,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-24 23:40:20,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-24 23:40:20,861 INFO L87 Difference]: Start difference. First operand 2056 states and 3405 transitions. Second operand 5 states. [2018-10-24 23:40:29,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 23:40:29,007 INFO L93 Difference]: Finished difference Result 6125 states and 10304 transitions. [2018-10-24 23:40:29,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-24 23:40:29,008 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 105 [2018-10-24 23:40:29,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 23:40:29,035 INFO L225 Difference]: With dead ends: 6125 [2018-10-24 23:40:29,035 INFO L226 Difference]: Without dead ends: 4075 [2018-10-24 23:40:29,046 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-10-24 23:40:29,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4075 states. [2018-10-24 23:40:29,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4075 to 3998. [2018-10-24 23:40:29,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3998 states. [2018-10-24 23:40:29,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3998 states to 3998 states and 5876 transitions. [2018-10-24 23:40:29,174 INFO L78 Accepts]: Start accepts. Automaton has 3998 states and 5876 transitions. Word has length 105 [2018-10-24 23:40:29,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 23:40:29,175 INFO L481 AbstractCegarLoop]: Abstraction has 3998 states and 5876 transitions. [2018-10-24 23:40:29,175 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-24 23:40:29,175 INFO L276 IsEmpty]: Start isEmpty. Operand 3998 states and 5876 transitions. [2018-10-24 23:40:29,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-10-24 23:40:29,178 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 23:40:29,179 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 23:40:29,179 INFO L424 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 23:40:29,179 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:40:29,179 INFO L82 PathProgramCache]: Analyzing trace with hash 895222520, now seen corresponding path program 1 times [2018-10-24 23:40:29,180 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 23:40:29,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:40:29,181 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 23:40:29,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:40:29,181 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 23:40:29,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 23:40:29,450 WARN L179 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-24 23:40:29,498 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 23:40:29,498 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 23:40:29,499 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-24 23:40:29,499 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 23:40:29,499 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-24 23:40:29,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-24 23:40:29,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-24 23:40:29,500 INFO L87 Difference]: Start difference. First operand 3998 states and 5876 transitions. Second operand 6 states. [2018-10-24 23:40:36,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 23:40:36,809 INFO L93 Difference]: Finished difference Result 11087 states and 16945 transitions. [2018-10-24 23:40:36,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-24 23:40:36,813 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 115 [2018-10-24 23:40:36,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 23:40:36,867 INFO L225 Difference]: With dead ends: 11087 [2018-10-24 23:40:36,867 INFO L226 Difference]: Without dead ends: 7095 [2018-10-24 23:40:36,907 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-24 23:40:36,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7095 states. [2018-10-24 23:40:37,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7095 to 6986. [2018-10-24 23:40:37,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6986 states. [2018-10-24 23:40:37,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6986 states to 6986 states and 9529 transitions. [2018-10-24 23:40:37,152 INFO L78 Accepts]: Start accepts. Automaton has 6986 states and 9529 transitions. Word has length 115 [2018-10-24 23:40:37,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 23:40:37,153 INFO L481 AbstractCegarLoop]: Abstraction has 6986 states and 9529 transitions. [2018-10-24 23:40:37,153 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-24 23:40:37,153 INFO L276 IsEmpty]: Start isEmpty. Operand 6986 states and 9529 transitions. [2018-10-24 23:40:37,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-10-24 23:40:37,156 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 23:40:37,156 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 23:40:37,157 INFO L424 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 23:40:37,160 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:40:37,160 INFO L82 PathProgramCache]: Analyzing trace with hash 1383361339, now seen corresponding path program 1 times [2018-10-24 23:40:37,160 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 23:40:37,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:40:37,162 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 23:40:37,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:40:37,162 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 23:40:37,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 23:40:37,642 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 23:40:37,643 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 23:40:37,643 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-24 23:40:37,643 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 23:40:37,644 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-24 23:40:37,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-24 23:40:37,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-24 23:40:37,645 INFO L87 Difference]: Start difference. First operand 6986 states and 9529 transitions. Second operand 5 states. [2018-10-24 23:40:53,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 23:40:53,145 INFO L93 Difference]: Finished difference Result 18670 states and 26332 transitions. [2018-10-24 23:40:53,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-24 23:40:53,146 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 125 [2018-10-24 23:40:53,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 23:40:53,210 INFO L225 Difference]: With dead ends: 18670 [2018-10-24 23:40:53,210 INFO L226 Difference]: Without dead ends: 11690 [2018-10-24 23:40:53,254 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-10-24 23:40:53,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11690 states. [2018-10-24 23:40:53,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11690 to 11531. [2018-10-24 23:40:53,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11531 states. [2018-10-24 23:40:53,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11531 states to 11531 states and 15507 transitions. [2018-10-24 23:40:53,577 INFO L78 Accepts]: Start accepts. Automaton has 11531 states and 15507 transitions. Word has length 125 [2018-10-24 23:40:53,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 23:40:53,578 INFO L481 AbstractCegarLoop]: Abstraction has 11531 states and 15507 transitions. [2018-10-24 23:40:53,578 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-24 23:40:53,578 INFO L276 IsEmpty]: Start isEmpty. Operand 11531 states and 15507 transitions. [2018-10-24 23:40:53,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-10-24 23:40:53,580 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 23:40:53,581 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 23:40:53,581 INFO L424 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 23:40:53,581 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:40:53,581 INFO L82 PathProgramCache]: Analyzing trace with hash -1389612834, now seen corresponding path program 1 times [2018-10-24 23:40:53,582 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 23:40:53,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:40:53,583 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 23:40:53,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:40:53,583 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 23:40:53,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 23:40:54,146 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 23:40:54,147 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 23:40:54,147 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 23:40:54,148 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 141 with the following transitions: [2018-10-24 23:40:54,150 INFO L202 CegarAbsIntRunner]: [0], [1], [74], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [197], [199], [202], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [498], [506], [514], [522], [530], [538], [546], [554], [562], [567], [571], [582], [586], [590], [594], [598], [602], [606], [610], [614], [618], [622], [626], [630], [641], [645], [649], [653], [657], [668], [672], [676], [680], [684], [688], [692], [696], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [755], [759], [762], [1635], [1639], [1643], [1649], [1653], [1655], [1662], [1663], [1664], [1666], [1667] [2018-10-24 23:40:54,199 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-24 23:40:54,199 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-24 23:40:54,689 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-24 23:40:54,691 INFO L272 AbstractInterpreter]: Visited 116 different actions 116 times. Never merged. Never widened. Never found a fixpoint. Largest state had 24 variables. [2018-10-24 23:40:54,723 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:40:54,724 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-24 23:40:55,125 INFO L232 lantSequenceWeakener]: Weakened 134 states. On average, predicates are now at 77.6% of their original sizes. [2018-10-24 23:40:55,125 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-24 23:40:55,238 INFO L413 sIntCurrentIteration]: We have 139 unified AI predicates [2018-10-24 23:40:55,238 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-24 23:40:55,239 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 23:40:55,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 11 [2018-10-24 23:40:55,239 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 23:40:55,240 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-24 23:40:55,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-24 23:40:55,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-24 23:40:55,241 INFO L87 Difference]: Start difference. First operand 11531 states and 15507 transitions. Second operand 6 states. [2018-10-24 23:41:35,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-24 23:41:35,613 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.DeterministicInterpolantAutomaton.addOtherSuccessors(DeterministicInterpolantAutomaton.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1066) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:968) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:188) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:673) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:602) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:473) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-10-24 23:41:35,618 INFO L168 Benchmark]: Toolchain (without parser) took 108681.76 ms. Allocated memory was 1.5 GB in the beginning and 4.2 GB in the end (delta: 2.7 GB). Free memory was 1.4 GB in the beginning and 3.1 GB in the end (delta: -1.7 GB). Peak memory consumption was 989.6 MB. Max. memory is 7.1 GB. [2018-10-24 23:41:35,620 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-24 23:41:35,620 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1355.71 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 105.9 MB). Peak memory consumption was 105.9 MB. Max. memory is 7.1 GB. [2018-10-24 23:41:35,621 INFO L168 Benchmark]: Boogie Procedure Inliner took 383.57 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 768.6 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -885.0 MB). Peak memory consumption was 33.3 MB. Max. memory is 7.1 GB. [2018-10-24 23:41:35,622 INFO L168 Benchmark]: Boogie Preprocessor took 170.79 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: 27.0 MB). Peak memory consumption was 27.0 MB. Max. memory is 7.1 GB. [2018-10-24 23:41:35,625 INFO L168 Benchmark]: RCFGBuilder took 6925.64 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 307.6 MB). Peak memory consumption was 307.6 MB. Max. memory is 7.1 GB. [2018-10-24 23:41:35,626 INFO L168 Benchmark]: TraceAbstraction took 99840.92 ms. Allocated memory was 2.3 GB in the beginning and 4.2 GB in the end (delta: 1.9 GB). Free memory was 1.9 GB in the beginning and 3.1 GB in the end (delta: -1.2 GB). Peak memory consumption was 665.5 MB. Max. memory is 7.1 GB. [2018-10-24 23:41:35,632 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.19 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 1355.71 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 105.9 MB). Peak memory consumption was 105.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 383.57 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 768.6 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -885.0 MB). Peak memory consumption was 33.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 170.79 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: 27.0 MB). Peak memory consumption was 27.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 6925.64 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 307.6 MB). Peak memory consumption was 307.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 99840.92 ms. Allocated memory was 2.3 GB in the beginning and 4.2 GB in the end (delta: 1.9 GB). Free memory was 1.9 GB in the beginning and 3.1 GB in the end (delta: -1.2 GB). Peak memory consumption was 665.5 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...