java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-EXP.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem12_label01_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-25 01:35:35,982 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-25 01:35:35,984 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-25 01:35:35,996 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-25 01:35:35,997 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-25 01:35:35,998 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-25 01:35:35,999 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-25 01:35:36,001 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-25 01:35:36,003 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-25 01:35:36,004 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-25 01:35:36,005 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-25 01:35:36,005 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-25 01:35:36,006 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-25 01:35:36,007 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-25 01:35:36,009 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-25 01:35:36,010 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-25 01:35:36,010 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-25 01:35:36,013 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-25 01:35:36,016 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-25 01:35:36,019 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-25 01:35:36,020 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-25 01:35:36,026 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-25 01:35:36,032 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-25 01:35:36,033 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-25 01:35:36,033 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-25 01:35:36,036 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-25 01:35:36,037 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-25 01:35:36,038 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-25 01:35:36,042 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-25 01:35:36,043 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-25 01:35:36,043 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-25 01:35:36,044 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-25 01:35:36,044 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-25 01:35:36,045 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-25 01:35:36,049 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-25 01:35:36,049 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-25 01:35:36,051 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:35:36,080 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-25 01:35:36,081 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-25 01:35:36,081 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-25 01:35:36,082 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-25 01:35:36,082 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-25 01:35:36,082 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-25 01:35:36,082 INFO L133 SettingsManager]: * Explicit value domain=true [2018-10-25 01:35:36,082 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-25 01:35:36,083 INFO L133 SettingsManager]: * Octagon Domain=false [2018-10-25 01:35:36,083 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-25 01:35:36,083 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-25 01:35:36,083 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-25 01:35:36,083 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-25 01:35:36,084 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-25 01:35:36,084 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-25 01:35:36,084 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-25 01:35:36,085 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-25 01:35:36,085 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-25 01:35:36,085 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-25 01:35:36,087 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-25 01:35:36,087 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-25 01:35:36,087 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-25 01:35:36,087 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-25 01:35:36,088 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-25 01:35:36,088 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-25 01:35:36,088 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-25 01:35:36,088 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-25 01:35:36,089 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-25 01:35:36,089 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-25 01:35:36,089 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-25 01:35:36,089 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-25 01:35:36,090 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-25 01:35:36,090 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-25 01:35:36,090 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-25 01:35:36,090 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-25 01:35:36,091 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-25 01:35:36,149 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-25 01:35:36,165 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-25 01:35:36,170 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-25 01:35:36,172 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-25 01:35:36,172 INFO L276 PluginConnector]: CDTParser initialized [2018-10-25 01:35:36,174 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem12_label01_true-unreach-call.c [2018-10-25 01:35:36,245 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/1738afe3e/9e40d0b7e58e4ca99a732a5b318ba17e/FLAG8abe3d54d [2018-10-25 01:35:36,974 INFO L298 CDTParser]: Found 1 translation units. [2018-10-25 01:35:36,975 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem12_label01_true-unreach-call.c [2018-10-25 01:35:37,017 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/1738afe3e/9e40d0b7e58e4ca99a732a5b318ba17e/FLAG8abe3d54d [2018-10-25 01:35:37,038 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/1738afe3e/9e40d0b7e58e4ca99a732a5b318ba17e [2018-10-25 01:35:37,051 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-25 01:35:37,053 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-25 01:35:37,055 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-25 01:35:37,055 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-25 01:35:37,062 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-25 01:35:37,063 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 01:35:37" (1/1) ... [2018-10-25 01:35:37,067 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46764b1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:35:37, skipping insertion in model container [2018-10-25 01:35:37,068 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 01:35:37" (1/1) ... [2018-10-25 01:35:37,079 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-25 01:35:37,254 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-25 01:35:38,553 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-25 01:35:38,559 INFO L189 MainTranslator]: Completed pre-run [2018-10-25 01:35:39,291 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-25 01:35:39,328 INFO L193 MainTranslator]: Completed translation [2018-10-25 01:35:39,328 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:35:39 WrapperNode [2018-10-25 01:35:39,328 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-25 01:35:39,329 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-25 01:35:39,330 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-25 01:35:39,330 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-25 01:35:39,340 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:35:39" (1/1) ... [2018-10-25 01:35:39,415 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:35:39" (1/1) ... [2018-10-25 01:35:39,894 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-25 01:35:39,894 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-25 01:35:39,894 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-25 01:35:39,895 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-25 01:35:39,907 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:35:39" (1/1) ... [2018-10-25 01:35:39,907 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:35:39" (1/1) ... [2018-10-25 01:35:39,936 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:35:39" (1/1) ... [2018-10-25 01:35:39,936 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:35:39" (1/1) ... [2018-10-25 01:35:40,072 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:35:39" (1/1) ... [2018-10-25 01:35:40,112 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:35:39" (1/1) ... [2018-10-25 01:35:40,166 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:35:39" (1/1) ... [2018-10-25 01:35:40,220 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-25 01:35:40,221 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-25 01:35:40,221 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-25 01:35:40,221 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-25 01:35:40,222 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:35:39" (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:35:40,296 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-25 01:35:40,296 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-25 01:35:40,296 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output4 [2018-10-25 01:35:40,297 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output4 [2018-10-25 01:35:40,297 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output3 [2018-10-25 01:35:40,297 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output3 [2018-10-25 01:35:40,297 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2018-10-25 01:35:40,298 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2018-10-25 01:35:40,298 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-10-25 01:35:40,298 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-10-25 01:35:40,298 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-25 01:35:40,299 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-25 01:35:40,299 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-25 01:35:40,299 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-25 01:35:54,867 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-25 01:35:54,868 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 01:35:54 BoogieIcfgContainer [2018-10-25 01:35:54,868 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-25 01:35:54,869 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-25 01:35:54,870 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-25 01:35:54,873 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-25 01:35:54,874 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.10 01:35:37" (1/3) ... [2018-10-25 01:35:54,874 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ef33c60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 01:35:54, skipping insertion in model container [2018-10-25 01:35:54,875 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:35:39" (2/3) ... [2018-10-25 01:35:54,875 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ef33c60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 01:35:54, skipping insertion in model container [2018-10-25 01:35:54,875 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 01:35:54" (3/3) ... [2018-10-25 01:35:54,877 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem12_label01_true-unreach-call.c [2018-10-25 01:35:54,888 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-25 01:35:54,898 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-25 01:35:54,916 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-25 01:35:54,963 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-25 01:35:54,963 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-25 01:35:54,964 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-25 01:35:54,964 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-25 01:35:54,964 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-25 01:35:54,964 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-25 01:35:54,964 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-25 01:35:54,964 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-25 01:35:55,008 INFO L276 IsEmpty]: Start isEmpty. Operand 840 states. [2018-10-25 01:35:55,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-10-25 01:35:55,018 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:35:55,020 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] [2018-10-25 01:35:55,022 INFO L424 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:35:55,027 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:35:55,028 INFO L82 PathProgramCache]: Analyzing trace with hash -1285582812, now seen corresponding path program 1 times [2018-10-25 01:35:55,030 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:35:55,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:35:55,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:35:55,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:35:55,088 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:35:55,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:35:55,539 WARN L179 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-25 01:35:55,657 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:35:55,660 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:35:55,660 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-25 01:35:55,661 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:35:55,667 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-25 01:35:55,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-25 01:35:55,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-25 01:35:55,687 INFO L87 Difference]: Start difference. First operand 840 states. Second operand 3 states. [2018-10-25 01:36:03,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:36:03,683 INFO L93 Difference]: Finished difference Result 2446 states and 4700 transitions. [2018-10-25 01:36:03,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-25 01:36:03,685 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2018-10-25 01:36:03,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:36:03,727 INFO L225 Difference]: With dead ends: 2446 [2018-10-25 01:36:03,727 INFO L226 Difference]: Without dead ends: 1604 [2018-10-25 01:36:03,746 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-25 01:36:03,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1604 states. [2018-10-25 01:36:03,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1604 to 1604. [2018-10-25 01:36:03,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1604 states. [2018-10-25 01:36:03,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1604 states to 1604 states and 3021 transitions. [2018-10-25 01:36:03,960 INFO L78 Accepts]: Start accepts. Automaton has 1604 states and 3021 transitions. Word has length 54 [2018-10-25 01:36:03,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:36:03,961 INFO L481 AbstractCegarLoop]: Abstraction has 1604 states and 3021 transitions. [2018-10-25 01:36:03,962 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-25 01:36:03,962 INFO L276 IsEmpty]: Start isEmpty. Operand 1604 states and 3021 transitions. [2018-10-25 01:36:03,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-10-25 01:36:03,974 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:36:03,974 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:03,975 INFO L424 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:36:03,975 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:36:03,976 INFO L82 PathProgramCache]: Analyzing trace with hash -175316350, now seen corresponding path program 1 times [2018-10-25 01:36:03,976 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:36:03,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:36:03,978 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:36:03,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:36:03,979 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:36:04,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:36:04,430 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:36:04,430 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:36:04,431 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-25 01:36:04,431 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:36:04,433 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 01:36:04,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 01:36:04,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 01:36:04,434 INFO L87 Difference]: Start difference. First operand 1604 states and 3021 transitions. Second operand 6 states. [2018-10-25 01:36:19,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:36:19,614 INFO L93 Difference]: Finished difference Result 6330 states and 12128 transitions. [2018-10-25 01:36:19,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 01:36:19,616 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 132 [2018-10-25 01:36:19,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:36:19,647 INFO L225 Difference]: With dead ends: 6330 [2018-10-25 01:36:19,648 INFO L226 Difference]: Without dead ends: 4732 [2018-10-25 01:36:19,658 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-25 01:36:19,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4732 states. [2018-10-25 01:36:19,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4732 to 4700. [2018-10-25 01:36:19,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4700 states. [2018-10-25 01:36:19,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4700 states to 4700 states and 7674 transitions. [2018-10-25 01:36:19,827 INFO L78 Accepts]: Start accepts. Automaton has 4700 states and 7674 transitions. Word has length 132 [2018-10-25 01:36:19,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:36:19,828 INFO L481 AbstractCegarLoop]: Abstraction has 4700 states and 7674 transitions. [2018-10-25 01:36:19,828 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 01:36:19,828 INFO L276 IsEmpty]: Start isEmpty. Operand 4700 states and 7674 transitions. [2018-10-25 01:36:19,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-10-25 01:36:19,840 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:36:19,846 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:19,846 INFO L424 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:36:19,847 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:36:19,847 INFO L82 PathProgramCache]: Analyzing trace with hash 2020767262, now seen corresponding path program 1 times [2018-10-25 01:36:19,847 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:36:19,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:36:19,851 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:36:19,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:36:19,852 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:36:19,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:36:20,195 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:36:20,196 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:36:20,196 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-25 01:36:20,196 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:36:20,197 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-25 01:36:20,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-25 01:36:20,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-10-25 01:36:20,198 INFO L87 Difference]: Start difference. First operand 4700 states and 7674 transitions. Second operand 5 states. [2018-10-25 01:36:29,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:36:29,283 INFO L93 Difference]: Finished difference Result 14300 states and 23670 transitions. [2018-10-25 01:36:29,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-25 01:36:29,290 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 134 [2018-10-25 01:36:29,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:36:29,345 INFO L225 Difference]: With dead ends: 14300 [2018-10-25 01:36:29,346 INFO L226 Difference]: Without dead ends: 9606 [2018-10-25 01:36:29,361 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 01:36:29,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9606 states. [2018-10-25 01:36:29,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9606 to 9524. [2018-10-25 01:36:29,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9524 states. [2018-10-25 01:36:29,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9524 states to 9524 states and 14353 transitions. [2018-10-25 01:36:29,627 INFO L78 Accepts]: Start accepts. Automaton has 9524 states and 14353 transitions. Word has length 134 [2018-10-25 01:36:29,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:36:29,628 INFO L481 AbstractCegarLoop]: Abstraction has 9524 states and 14353 transitions. [2018-10-25 01:36:29,628 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-25 01:36:29,628 INFO L276 IsEmpty]: Start isEmpty. Operand 9524 states and 14353 transitions. [2018-10-25 01:36:29,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-10-25 01:36:29,631 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:36:29,632 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:29,632 INFO L424 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:36:29,632 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:36:29,632 INFO L82 PathProgramCache]: Analyzing trace with hash -1670146821, now seen corresponding path program 1 times [2018-10-25 01:36:29,633 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:36:29,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:36:29,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:36:29,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:36:29,634 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:36:29,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:36:29,840 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:36:29,841 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:36:29,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-25 01:36:29,841 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:36:29,841 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 01:36:29,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 01:36:29,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-10-25 01:36:29,842 INFO L87 Difference]: Start difference. First operand 9524 states and 14353 transitions. Second operand 6 states. [2018-10-25 01:36:48,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:36:48,241 INFO L93 Difference]: Finished difference Result 38073 states and 60987 transitions. [2018-10-25 01:36:48,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 01:36:48,243 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 145 [2018-10-25 01:36:48,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:36:48,417 INFO L225 Difference]: With dead ends: 38073 [2018-10-25 01:36:48,418 INFO L226 Difference]: Without dead ends: 28555 [2018-10-25 01:36:48,495 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-10-25 01:36:48,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28555 states. [2018-10-25 01:36:49,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28555 to 28501. [2018-10-25 01:36:49,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28501 states. [2018-10-25 01:36:49,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28501 states to 28501 states and 41643 transitions. [2018-10-25 01:36:49,262 INFO L78 Accepts]: Start accepts. Automaton has 28501 states and 41643 transitions. Word has length 145 [2018-10-25 01:36:49,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:36:49,262 INFO L481 AbstractCegarLoop]: Abstraction has 28501 states and 41643 transitions. [2018-10-25 01:36:49,263 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 01:36:49,263 INFO L276 IsEmpty]: Start isEmpty. Operand 28501 states and 41643 transitions. [2018-10-25 01:36:49,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-10-25 01:36:49,266 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:36:49,267 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:49,267 INFO L424 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:36:49,267 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:36:49,267 INFO L82 PathProgramCache]: Analyzing trace with hash 160089495, now seen corresponding path program 1 times [2018-10-25 01:36:49,268 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:36:49,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:36:49,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:36:49,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:36:49,269 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:36:49,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:36:49,572 WARN L179 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-25 01:36:49,989 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:36:49,990 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:36:49,990 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-25 01:36:49,990 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:36:49,990 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 01:36:49,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 01:36:49,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 01:36:49,993 INFO L87 Difference]: Start difference. First operand 28501 states and 41643 transitions. Second operand 6 states. [2018-10-25 01:37:01,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:37:01,766 INFO L93 Difference]: Finished difference Result 76143 states and 117641 transitions. [2018-10-25 01:37:01,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 01:37:01,767 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 179 [2018-10-25 01:37:01,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:37:01,987 INFO L225 Difference]: With dead ends: 76143 [2018-10-25 01:37:01,987 INFO L226 Difference]: Without dead ends: 47648 [2018-10-25 01:37:02,096 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-25 01:37:02,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47648 states. [2018-10-25 01:37:03,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47648 to 47491. [2018-10-25 01:37:03,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47491 states. [2018-10-25 01:37:03,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47491 states to 47491 states and 66757 transitions. [2018-10-25 01:37:03,689 INFO L78 Accepts]: Start accepts. Automaton has 47491 states and 66757 transitions. Word has length 179 [2018-10-25 01:37:03,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:37:03,690 INFO L481 AbstractCegarLoop]: Abstraction has 47491 states and 66757 transitions. [2018-10-25 01:37:03,690 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 01:37:03,690 INFO L276 IsEmpty]: Start isEmpty. Operand 47491 states and 66757 transitions. [2018-10-25 01:37:03,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2018-10-25 01:37:03,703 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:37:03,704 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 01:37:03,704 INFO L424 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:37:03,704 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:37:03,704 INFO L82 PathProgramCache]: Analyzing trace with hash -957966671, now seen corresponding path program 1 times [2018-10-25 01:37:03,705 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:37:03,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:37:03,706 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:37:03,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:37:03,706 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:37:03,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:37:03,990 WARN L179 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-25 01:37:04,133 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 94 proven. 75 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-10-25 01:37:04,133 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 01:37:04,134 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 01:37:04,135 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 244 with the following transitions: [2018-10-25 01:37:04,137 INFO L202 CegarAbsIntRunner]: [0], [1], [1868], [1875], [1883], [1891], [1899], [1907], [1915], [1923], [1931], [1939], [1947], [1955], [1963], [1971], [1979], [1987], [1995], [2003], [2011], [2019], [2027], [2035], [2043], [2051], [2059], [2067], [2075], [2083], [2091], [2099], [2107], [2115], [2123], [2131], [2139], [2147], [2155], [2163], [2171], [2179], [2187], [2195], [2199], [2201], [2204], [2212], [2220], [2228], [2236], [2244], [2252], [2260], [2268], [2276], [2284], [2292], [2300], [2308], [2316], [2324], [2332], [2340], [2348], [2356], [2361], [2365], [2369], [2373], [2377], [2381], [2385], [2389], [2393], [2397], [2400], [2401], [2405], [2409], [2413], [2417], [2421], [2425], [2429], [2433], [2437], [2441], [2445], [2449], [2453], [2457], [2461], [2465], [2469], [2473], [2477], [2481], [2485], [2489], [2493], [2497], [2501], [2505], [2509], [2513], [2516], [3240], [3244], [3248], [3254], [3258], [3260], [3271], [3272], [3273], [3275], [3276] [2018-10-25 01:37:04,203 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 01:37:04,204 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 01:37:05,007 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-25 01:37:05,009 INFO L272 AbstractInterpreter]: Visited 114 different actions 114 times. Never merged. Never widened. Never found a fixpoint. Largest state had 26 variables. [2018-10-25 01:37:05,051 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:37:05,051 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-25 01:37:05,999 INFO L232 lantSequenceWeakener]: Weakened 234 states. On average, predicates are now at 75.61% of their original sizes. [2018-10-25 01:37:06,000 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-25 01:37:06,244 INFO L413 sIntCurrentIteration]: We have 242 unified AI predicates [2018-10-25 01:37:06,245 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-25 01:37:06,246 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-25 01:37:06,246 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2018-10-25 01:37:06,246 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:37:06,247 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 01:37:06,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 01:37:06,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 01:37:06,248 INFO L87 Difference]: Start difference. First operand 47491 states and 66757 transitions. Second operand 6 states. [2018-10-25 01:37:42,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-25 01:37:42,090 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-25 01:37:42,096 INFO L168 Benchmark]: Toolchain (without parser) took 125043.98 ms. Allocated memory was 1.5 GB in the beginning and 4.0 GB in the end (delta: 2.5 GB). Free memory was 1.4 GB in the beginning and 2.4 GB in the end (delta: -1.0 GB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. [2018-10-25 01:37:42,097 INFO L168 Benchmark]: CDTParser took 0.27 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:37:42,098 INFO L168 Benchmark]: CACSL2BoogieTranslator took 2274.03 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 200.8 MB). Peak memory consumption was 200.8 MB. Max. memory is 7.1 GB. [2018-10-25 01:37:42,099 INFO L168 Benchmark]: Boogie Procedure Inliner took 564.55 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 792.7 MB). Free memory was 1.2 GB in the beginning and 2.2 GB in the end (delta: -1.0 GB). Peak memory consumption was 68.8 MB. Max. memory is 7.1 GB. [2018-10-25 01:37:42,100 INFO L168 Benchmark]: Boogie Preprocessor took 325.98 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: 37.1 MB). Peak memory consumption was 37.1 MB. Max. memory is 7.1 GB. [2018-10-25 01:37:42,101 INFO L168 Benchmark]: RCFGBuilder took 14647.91 ms. Allocated memory was 2.3 GB in the beginning and 2.5 GB in the end (delta: 188.7 MB). Free memory was 2.2 GB in the beginning and 2.4 GB in the end (delta: -204.4 MB). Peak memory consumption was 683.5 MB. Max. memory is 7.1 GB. [2018-10-25 01:37:42,102 INFO L168 Benchmark]: TraceAbstraction took 107225.49 ms. Allocated memory was 2.5 GB in the beginning and 4.0 GB in the end (delta: 1.5 GB). Free memory was 2.4 GB in the beginning and 2.4 GB in the end (delta: -18.7 MB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. [2018-10-25 01:37:42,108 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.27 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 2274.03 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 200.8 MB). Peak memory consumption was 200.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 564.55 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 792.7 MB). Free memory was 1.2 GB in the beginning and 2.2 GB in the end (delta: -1.0 GB). Peak memory consumption was 68.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 325.98 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: 37.1 MB). Peak memory consumption was 37.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 14647.91 ms. Allocated memory was 2.3 GB in the beginning and 2.5 GB in the end (delta: 188.7 MB). Free memory was 2.2 GB in the beginning and 2.4 GB in the end (delta: -204.4 MB). Peak memory consumption was 683.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 107225.49 ms. Allocated memory was 2.5 GB in the beginning and 4.0 GB in the end (delta: 1.5 GB). Free memory was 2.4 GB in the beginning and 2.4 GB in the end (delta: -18.7 MB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: ArithmeticException: BigInteger: modulus not positive de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: ArithmeticException: BigInteger: modulus not positive: java.math.BigInteger.mod(BigInteger.java:2458) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...