java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-EXP.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem18_label16_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-25 02:05:01,957 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-25 02:05:01,959 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-25 02:05:01,975 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-25 02:05:01,976 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-25 02:05:01,977 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-25 02:05:01,978 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-25 02:05:01,980 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-25 02:05:01,983 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-25 02:05:01,984 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-25 02:05:01,985 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-25 02:05:01,986 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-25 02:05:01,988 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-25 02:05:01,989 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-25 02:05:01,996 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-25 02:05:01,997 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-25 02:05:01,999 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-25 02:05:02,001 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-25 02:05:02,005 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-25 02:05:02,007 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-25 02:05:02,012 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-25 02:05:02,013 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-25 02:05:02,016 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-25 02:05:02,016 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-25 02:05:02,016 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-25 02:05:02,017 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-25 02:05:02,019 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-25 02:05:02,020 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-25 02:05:02,021 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-25 02:05:02,022 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-25 02:05:02,022 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-25 02:05:02,023 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-25 02:05:02,024 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-25 02:05:02,024 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-25 02:05:02,025 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-25 02:05:02,026 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-25 02:05:02,027 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 02:05:02,058 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-25 02:05:02,058 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-25 02:05:02,060 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-25 02:05:02,060 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-25 02:05:02,060 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-25 02:05:02,060 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-25 02:05:02,060 INFO L133 SettingsManager]: * Explicit value domain=true [2018-10-25 02:05:02,061 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-25 02:05:02,061 INFO L133 SettingsManager]: * Octagon Domain=false [2018-10-25 02:05:02,061 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-25 02:05:02,061 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-25 02:05:02,061 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-25 02:05:02,061 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-25 02:05:02,062 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-25 02:05:02,063 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-25 02:05:02,063 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-25 02:05:02,063 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-25 02:05:02,063 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-25 02:05:02,064 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-25 02:05:02,064 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-25 02:05:02,064 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-25 02:05:02,064 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-25 02:05:02,064 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-25 02:05:02,065 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-25 02:05:02,066 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-25 02:05:02,066 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-25 02:05:02,067 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-25 02:05:02,067 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-25 02:05:02,067 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-25 02:05:02,067 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-25 02:05:02,067 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-25 02:05:02,067 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-25 02:05:02,068 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-25 02:05:02,068 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-25 02:05:02,068 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-25 02:05:02,068 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-25 02:05:02,130 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-25 02:05:02,148 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-25 02:05:02,151 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-25 02:05:02,153 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-25 02:05:02,153 INFO L276 PluginConnector]: CDTParser initialized [2018-10-25 02:05:02,154 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem18_label16_true-unreach-call.c [2018-10-25 02:05:02,226 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/b6263acab/dfbf6f282a6a4ce183ecac9832d0ffe9/FLAG7351a706f [2018-10-25 02:05:02,934 INFO L298 CDTParser]: Found 1 translation units. [2018-10-25 02:05:02,935 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem18_label16_true-unreach-call.c [2018-10-25 02:05:02,964 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/b6263acab/dfbf6f282a6a4ce183ecac9832d0ffe9/FLAG7351a706f [2018-10-25 02:05:02,986 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/b6263acab/dfbf6f282a6a4ce183ecac9832d0ffe9 [2018-10-25 02:05:03,000 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-25 02:05:03,002 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-25 02:05:03,003 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-25 02:05:03,004 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-25 02:05:03,009 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-25 02:05:03,011 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 02:05:02" (1/1) ... [2018-10-25 02:05:03,015 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31cb433d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 02:05:03, skipping insertion in model container [2018-10-25 02:05:03,015 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 02:05:02" (1/1) ... [2018-10-25 02:05:03,026 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-25 02:05:03,161 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-25 02:05:04,519 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-25 02:05:04,523 INFO L189 MainTranslator]: Completed pre-run [2018-10-25 02:05:04,987 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-25 02:05:05,016 INFO L193 MainTranslator]: Completed translation [2018-10-25 02:05:05,017 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 02:05:05 WrapperNode [2018-10-25 02:05:05,017 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-25 02:05:05,019 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-25 02:05:05,019 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-25 02:05:05,019 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-25 02:05:05,029 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 02:05:05" (1/1) ... [2018-10-25 02:05:05,079 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 02:05:05" (1/1) ... [2018-10-25 02:05:05,450 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-25 02:05:05,450 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-25 02:05:05,450 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-25 02:05:05,451 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-25 02:05:05,463 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 02:05:05" (1/1) ... [2018-10-25 02:05:05,464 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 02:05:05" (1/1) ... [2018-10-25 02:05:05,478 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 02:05:05" (1/1) ... [2018-10-25 02:05:05,479 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 02:05:05" (1/1) ... [2018-10-25 02:05:05,578 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 02:05:05" (1/1) ... [2018-10-25 02:05:05,624 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 02:05:05" (1/1) ... [2018-10-25 02:05:05,661 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 02:05:05" (1/1) ... [2018-10-25 02:05:05,704 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-25 02:05:05,704 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-25 02:05:05,705 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-25 02:05:05,705 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-25 02:05:05,706 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 02:05:05" (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 02:05:05,785 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-25 02:05:05,785 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-25 02:05:05,785 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output3 [2018-10-25 02:05:05,786 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output3 [2018-10-25 02:05:05,786 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2018-10-25 02:05:05,786 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2018-10-25 02:05:05,786 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-10-25 02:05:05,786 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-10-25 02:05:05,787 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-25 02:05:05,787 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-25 02:05:05,787 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-25 02:05:05,787 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-25 02:05:13,930 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-25 02:05:13,932 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 02:05:13 BoogieIcfgContainer [2018-10-25 02:05:13,932 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-25 02:05:13,933 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-25 02:05:13,933 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-25 02:05:13,937 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-25 02:05:13,937 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.10 02:05:02" (1/3) ... [2018-10-25 02:05:13,938 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1840258f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 02:05:13, skipping insertion in model container [2018-10-25 02:05:13,938 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 02:05:05" (2/3) ... [2018-10-25 02:05:13,939 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1840258f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 02:05:13, skipping insertion in model container [2018-10-25 02:05:13,939 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 02:05:13" (3/3) ... [2018-10-25 02:05:13,941 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem18_label16_true-unreach-call.c [2018-10-25 02:05:13,951 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-25 02:05:13,961 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-25 02:05:13,979 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-25 02:05:14,024 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-25 02:05:14,025 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-25 02:05:14,025 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-25 02:05:14,025 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-25 02:05:14,025 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-25 02:05:14,025 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-25 02:05:14,026 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-25 02:05:14,026 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-25 02:05:14,065 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states. [2018-10-25 02:05:14,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-10-25 02:05:14,074 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 02:05:14,076 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] [2018-10-25 02:05:14,078 INFO L424 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 02:05:14,085 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 02:05:14,085 INFO L82 PathProgramCache]: Analyzing trace with hash -83199201, now seen corresponding path program 1 times [2018-10-25 02:05:14,088 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 02:05:14,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:05:14,148 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 02:05:14,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:05:14,148 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 02:05:14,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 02:05:14,632 WARN L179 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-25 02:05:14,763 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 02:05:14,766 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 02:05:14,766 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-25 02:05:14,766 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 02:05:14,777 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-25 02:05:14,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-25 02:05:14,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-25 02:05:14,805 INFO L87 Difference]: Start difference. First operand 775 states. Second operand 3 states. [2018-10-25 02:05:23,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 02:05:23,116 INFO L93 Difference]: Finished difference Result 2251 states and 4322 transitions. [2018-10-25 02:05:23,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-25 02:05:23,119 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2018-10-25 02:05:23,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 02:05:23,168 INFO L225 Difference]: With dead ends: 2251 [2018-10-25 02:05:23,169 INFO L226 Difference]: Without dead ends: 1474 [2018-10-25 02:05:23,184 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-25 02:05:23,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1474 states. [2018-10-25 02:05:23,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1474 to 1474. [2018-10-25 02:05:23,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1474 states. [2018-10-25 02:05:23,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1474 states to 1474 states and 2801 transitions. [2018-10-25 02:05:23,363 INFO L78 Accepts]: Start accepts. Automaton has 1474 states and 2801 transitions. Word has length 53 [2018-10-25 02:05:23,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 02:05:23,364 INFO L481 AbstractCegarLoop]: Abstraction has 1474 states and 2801 transitions. [2018-10-25 02:05:23,364 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-25 02:05:23,364 INFO L276 IsEmpty]: Start isEmpty. Operand 1474 states and 2801 transitions. [2018-10-25 02:05:23,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-10-25 02:05:23,372 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 02:05:23,372 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:05:23,373 INFO L424 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 02:05:23,373 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 02:05:23,373 INFO L82 PathProgramCache]: Analyzing trace with hash -159843752, now seen corresponding path program 1 times [2018-10-25 02:05:23,373 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 02:05:23,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:05:23,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 02:05:23,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:05:23,375 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 02:05:23,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 02:05:23,722 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-25 02:05:23,774 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 02:05:23,774 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 02:05:23,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-25 02:05:23,774 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 02:05:23,776 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 02:05:23,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 02:05:23,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 02:05:23,777 INFO L87 Difference]: Start difference. First operand 1474 states and 2801 transitions. Second operand 6 states. [2018-10-25 02:05:35,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 02:05:35,358 INFO L93 Difference]: Finished difference Result 5789 states and 11192 transitions. [2018-10-25 02:05:35,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 02:05:35,365 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 127 [2018-10-25 02:05:35,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 02:05:35,397 INFO L225 Difference]: With dead ends: 5789 [2018-10-25 02:05:35,398 INFO L226 Difference]: Without dead ends: 4321 [2018-10-25 02:05:35,407 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-25 02:05:35,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4321 states. [2018-10-25 02:05:35,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4321 to 4295. [2018-10-25 02:05:35,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4295 states. [2018-10-25 02:05:35,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4295 states to 4295 states and 7032 transitions. [2018-10-25 02:05:35,561 INFO L78 Accepts]: Start accepts. Automaton has 4295 states and 7032 transitions. Word has length 127 [2018-10-25 02:05:35,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 02:05:35,562 INFO L481 AbstractCegarLoop]: Abstraction has 4295 states and 7032 transitions. [2018-10-25 02:05:35,562 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 02:05:35,562 INFO L276 IsEmpty]: Start isEmpty. Operand 4295 states and 7032 transitions. [2018-10-25 02:05:35,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-10-25 02:05:35,571 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 02:05:35,571 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:05:35,572 INFO L424 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 02:05:35,572 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 02:05:35,572 INFO L82 PathProgramCache]: Analyzing trace with hash -204584991, now seen corresponding path program 1 times [2018-10-25 02:05:35,572 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 02:05:35,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:05:35,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 02:05:35,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:05:35,576 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 02:05:35,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 02:05:35,774 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 02:05:35,775 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 02:05:35,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-25 02:05:35,775 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 02:05:35,776 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-25 02:05:35,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-25 02:05:35,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-25 02:05:35,777 INFO L87 Difference]: Start difference. First operand 4295 states and 7032 transitions. Second operand 5 states. [2018-10-25 02:05:47,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 02:05:47,363 INFO L93 Difference]: Finished difference Result 14334 states and 23470 transitions. [2018-10-25 02:05:47,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-25 02:05:47,364 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 130 [2018-10-25 02:05:47,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 02:05:47,413 INFO L225 Difference]: With dead ends: 14334 [2018-10-25 02:05:47,414 INFO L226 Difference]: Without dead ends: 10045 [2018-10-25 02:05:47,433 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-25 02:05:47,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10045 states. [2018-10-25 02:05:47,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10045 to 9941. [2018-10-25 02:05:47,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9941 states. [2018-10-25 02:05:47,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9941 states to 9941 states and 14581 transitions. [2018-10-25 02:05:47,678 INFO L78 Accepts]: Start accepts. Automaton has 9941 states and 14581 transitions. Word has length 130 [2018-10-25 02:05:47,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 02:05:47,678 INFO L481 AbstractCegarLoop]: Abstraction has 9941 states and 14581 transitions. [2018-10-25 02:05:47,679 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-25 02:05:47,679 INFO L276 IsEmpty]: Start isEmpty. Operand 9941 states and 14581 transitions. [2018-10-25 02:05:47,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-10-25 02:05:47,682 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 02:05:47,683 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:05:47,683 INFO L424 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 02:05:47,683 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 02:05:47,683 INFO L82 PathProgramCache]: Analyzing trace with hash -167780547, now seen corresponding path program 1 times [2018-10-25 02:05:47,683 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 02:05:47,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:05:47,685 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 02:05:47,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:05:47,685 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 02:05:47,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 02:05:47,842 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 02:05:47,843 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 02:05:47,843 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-25 02:05:47,843 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 02:05:47,844 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-25 02:05:47,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-25 02:05:47,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-25 02:05:47,844 INFO L87 Difference]: Start difference. First operand 9941 states and 14581 transitions. Second operand 4 states. [2018-10-25 02:05:54,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 02:05:54,971 INFO L93 Difference]: Finished difference Result 26974 states and 40918 transitions. [2018-10-25 02:05:54,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-25 02:05:54,971 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 160 [2018-10-25 02:05:54,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 02:05:55,054 INFO L225 Difference]: With dead ends: 26974 [2018-10-25 02:05:55,054 INFO L226 Difference]: Without dead ends: 17039 [2018-10-25 02:05:55,088 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-25 02:05:55,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17039 states. [2018-10-25 02:05:55,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17039 to 17039. [2018-10-25 02:05:55,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17039 states. [2018-10-25 02:05:55,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17039 states to 17039 states and 24194 transitions. [2018-10-25 02:05:55,468 INFO L78 Accepts]: Start accepts. Automaton has 17039 states and 24194 transitions. Word has length 160 [2018-10-25 02:05:55,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 02:05:55,469 INFO L481 AbstractCegarLoop]: Abstraction has 17039 states and 24194 transitions. [2018-10-25 02:05:55,469 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-25 02:05:55,469 INFO L276 IsEmpty]: Start isEmpty. Operand 17039 states and 24194 transitions. [2018-10-25 02:05:55,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2018-10-25 02:05:55,477 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 02:05:55,477 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:05:55,477 INFO L424 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 02:05:55,478 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 02:05:55,478 INFO L82 PathProgramCache]: Analyzing trace with hash -1307894223, now seen corresponding path program 1 times [2018-10-25 02:05:55,478 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 02:05:55,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:05:55,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 02:05:55,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:05:55,479 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 02:05:55,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 02:05:55,776 WARN L179 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-25 02:05:55,897 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 02:05:55,897 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 02:05:55,898 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-25 02:05:55,898 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 02:05:55,899 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 02:05:55,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 02:05:55,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 02:05:55,899 INFO L87 Difference]: Start difference. First operand 17039 states and 24194 transitions. Second operand 6 states. [2018-10-25 02:06:02,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 02:06:02,506 INFO L93 Difference]: Finished difference Result 44481 states and 66728 transitions. [2018-10-25 02:06:02,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 02:06:02,507 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 234 [2018-10-25 02:06:02,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 02:06:02,623 INFO L225 Difference]: With dead ends: 44481 [2018-10-25 02:06:02,624 INFO L226 Difference]: Without dead ends: 27448 [2018-10-25 02:06:02,673 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-25 02:06:02,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27448 states. [2018-10-25 02:06:03,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27448 to 26619. [2018-10-25 02:06:03,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26619 states. [2018-10-25 02:06:03,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26619 states to 26619 states and 37801 transitions. [2018-10-25 02:06:03,271 INFO L78 Accepts]: Start accepts. Automaton has 26619 states and 37801 transitions. Word has length 234 [2018-10-25 02:06:03,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 02:06:03,271 INFO L481 AbstractCegarLoop]: Abstraction has 26619 states and 37801 transitions. [2018-10-25 02:06:03,271 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 02:06:03,272 INFO L276 IsEmpty]: Start isEmpty. Operand 26619 states and 37801 transitions. [2018-10-25 02:06:03,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2018-10-25 02:06:03,289 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 02:06:03,289 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-25 02:06:03,289 INFO L424 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 02:06:03,290 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 02:06:03,290 INFO L82 PathProgramCache]: Analyzing trace with hash 1787372292, now seen corresponding path program 1 times [2018-10-25 02:06:03,290 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 02:06:03,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:06:03,291 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 02:06:03,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:06:03,291 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 02:06:03,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 02:06:03,613 WARN L179 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-25 02:06:04,076 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 92 proven. 118 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-10-25 02:06:04,077 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 02:06:04,077 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 02:06:04,079 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 315 with the following transitions: [2018-10-25 02:06:04,082 INFO L202 CegarAbsIntRunner]: [0], [1], [1624], [1631], [1639], [1647], [1655], [1663], [1671], [1679], [1687], [1695], [1703], [1711], [1719], [1727], [1735], [1743], [1751], [1759], [1767], [1775], [1783], [1791], [1799], [1807], [1815], [1823], [1831], [1839], [1847], [1855], [1863], [1871], [1879], [1887], [1895], [1903], [1911], [1919], [1927], [1935], [1943], [1947], [1949], [1952], [1960], [1968], [1976], [1984], [1992], [2000], [2008], [2016], [2024], [2032], [2040], [2048], [2056], [2064], [2072], [2080], [2088], [2096], [2104], [2112], [2117], [2121], [2125], [2129], [2133], [2137], [2141], [2145], [2149], [2153], [2157], [2161], [2165], [2169], [2173], [2177], [2181], [2185], [2189], [2193], [2197], [2201], [2205], [2209], [2213], [2217], [2221], [2225], [2229], [2233], [2237], [2241], [2245], [2249], [2253], [2257], [2261], [2265], [2269], [2273], [2277], [2281], [2285], [2289], [2293], [2297], [2301], [2305], [2309], [2313], [2317], [2321], [2325], [2328], [2329], [2333], [2337], [2341], [2345], [2349], [2353], [2357], [2361], [2365], [2369], [2373], [2377], [2381], [2385], [2388], [2996], [3000], [3004], [3010], [3014], [3016], [3025], [3026], [3027], [3029], [3030] [2018-10-25 02:06:04,151 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 02:06:04,152 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 02:06:04,835 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-25 02:06:04,837 INFO L272 AbstractInterpreter]: Visited 143 different actions 143 times. Never merged. Never widened. Never found a fixpoint. Largest state had 24 variables. [2018-10-25 02:06:04,877 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 02:06:04,877 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-25 02:06:05,658 INFO L232 lantSequenceWeakener]: Weakened 305 states. On average, predicates are now at 77.82% of their original sizes. [2018-10-25 02:06:05,658 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-25 02:06:05,919 INFO L413 sIntCurrentIteration]: We have 313 unified AI predicates [2018-10-25 02:06:05,920 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-25 02:06:05,920 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-25 02:06:05,921 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2018-10-25 02:06:05,921 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 02:06:05,922 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 02:06:05,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 02:06:05,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 02:06:05,922 INFO L87 Difference]: Start difference. First operand 26619 states and 37801 transitions. Second operand 6 states. [2018-10-25 02:08:46,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-25 02:08:46,218 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.ArithmeticException: BigInteger: modulus not positive at java.math.BigInteger.mod(BigInteger.java:2458) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.explicit.ExplicitValueValue.modulo(ExplicitValueValue.java:154) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.explicit.ExplicitValueValue.modulo(ExplicitValueValue.java:1) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:125) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:100) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:92) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:92) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:92) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.ConditionalEvaluator.evaluate(ConditionalEvaluator.java:78) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.ConditionalEvaluator.evaluate(ConditionalEvaluator.java:1) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:92) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:93) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.handleAssumeStatement(NonrelationalStatementProcessor.java:363) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.processStatement(NonrelationalStatementProcessor.java:160) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.process(NonrelationalStatementProcessor.java:142) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.process(NonrelationalStatementProcessor.java:128) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.handleInternalTransition(NonrelationalPostOperator.java:362) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.handleInternalTransition(NonrelationalPostOperator.java:353) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.apply(NonrelationalPostOperator.java:125) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.apply(NonrelationalPostOperator.java:1) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.compound.CompoundDomainPostOperator.applyInternally(CompoundDomainPostOperator.java:306) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.compound.CompoundDomainPostOperator.apply(CompoundDomainPostOperator.java:131) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.compound.CompoundDomainPostOperator.apply(CompoundDomainPostOperator.java:1) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.applyPost(TermConjunctEvaluator.java:305) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.lambda$4(TermConjunctEvaluator.java:178) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.computeFixpoint(TermConjunctEvaluator.java:198) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.lambda$1(TermConjunctEvaluator.java:150) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.computePost(TermConjunctEvaluator.java:93) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormanCachedPostOperation.applyPost(PoormanCachedPostOperation.java:308) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormansAbstractPostOperator.applyPost(PoormansAbstractPostOperator.java:217) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormansAbstractPostOperator.apply(PoormansAbstractPostOperator.java:119) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormansAbstractPostOperator.apply(PoormansAbstractPostOperator.java:1) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.DisjunctiveAbstractState.lambda$17(DisjunctiveAbstractState.java:369) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.DisjunctiveAbstractState.mapCollection(DisjunctiveAbstractState.java:537) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.DisjunctiveAbstractState.apply(DisjunctiveAbstractState.java:369) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.AbsIntHoareTripleChecker.checkInternalTransitionWithValidState(AbsIntHoareTripleChecker.java:352) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.AbsIntHoareTripleChecker.checkInternalAbsInt(AbsIntHoareTripleChecker.java:249) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.AbsIntHoareTripleChecker.checkInternal(AbsIntHoareTripleChecker.java:181) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.CachingHoareTripleChecker.checkInternal(CachingHoareTripleChecker.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton$InternalSuccessorComputationHelper.computeSuccWithSolver(AbstractInterpolantAutomaton.java:359) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.addOtherSuccessors(DeterministicInterpolantAutomaton.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1066) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:968) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:188) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:673) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:602) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:473) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-10-25 02:08:46,224 INFO L168 Benchmark]: Toolchain (without parser) took 223222.98 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.6 GB in the end (delta: -2.1 GB). Peak memory consumption was 537.6 MB. Max. memory is 7.1 GB. [2018-10-25 02:08:46,225 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-25 02:08:46,226 INFO L168 Benchmark]: CACSL2BoogieTranslator took 2014.93 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 148.0 MB). Peak memory consumption was 148.0 MB. Max. memory is 7.1 GB. [2018-10-25 02:08:46,227 INFO L168 Benchmark]: Boogie Procedure Inliner took 431.28 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 763.9 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -939.4 MB). Peak memory consumption was 45.1 MB. Max. memory is 7.1 GB. [2018-10-25 02:08:46,228 INFO L168 Benchmark]: Boogie Preprocessor took 253.68 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.5 MB). Peak memory consumption was 27.5 MB. Max. memory is 7.1 GB. [2018-10-25 02:08:46,229 INFO L168 Benchmark]: RCFGBuilder took 8227.56 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.7 GB in the end (delta: 509.5 MB). Peak memory consumption was 509.5 MB. Max. memory is 7.1 GB. [2018-10-25 02:08:46,229 INFO L168 Benchmark]: TraceAbstraction took 212289.81 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.7 GB in the beginning and 3.6 GB in the end (delta: -1.9 GB). Peak memory consumption was 28.1 MB. Max. memory is 7.1 GB. [2018-10-25 02:08:46,235 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 2014.93 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 148.0 MB). Peak memory consumption was 148.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 431.28 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 763.9 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -939.4 MB). Peak memory consumption was 45.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 253.68 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.5 MB). Peak memory consumption was 27.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 8227.56 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.7 GB in the end (delta: 509.5 MB). Peak memory consumption was 509.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 212289.81 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.7 GB in the beginning and 3.6 GB in the end (delta: -1.9 GB). Peak memory consumption was 28.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: ArithmeticException: BigInteger: modulus not positive de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: ArithmeticException: BigInteger: modulus not positive: java.math.BigInteger.mod(BigInteger.java:2458) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...