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_label11_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-25 01:36:46,011 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-25 01:36:46,013 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-25 01:36:46,026 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-25 01:36:46,026 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-25 01:36:46,027 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-25 01:36:46,029 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-25 01:36:46,030 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-25 01:36:46,032 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-25 01:36:46,033 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-25 01:36:46,034 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-25 01:36:46,034 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-25 01:36:46,035 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-25 01:36:46,036 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-25 01:36:46,037 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-25 01:36:46,038 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-25 01:36:46,039 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-25 01:36:46,041 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-25 01:36:46,043 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-25 01:36:46,044 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-25 01:36:46,045 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-25 01:36:46,046 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-25 01:36:46,049 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-25 01:36:46,049 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-25 01:36:46,050 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-25 01:36:46,051 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-25 01:36:46,052 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-25 01:36:46,052 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-25 01:36:46,053 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-25 01:36:46,054 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-25 01:36:46,055 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-25 01:36:46,055 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-25 01:36:46,056 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-25 01:36:46,056 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-25 01:36:46,057 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-25 01:36:46,058 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-25 01:36:46,058 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:36:46,085 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-25 01:36:46,085 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-25 01:36:46,089 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-25 01:36:46,089 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-25 01:36:46,089 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-25 01:36:46,089 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-25 01:36:46,090 INFO L133 SettingsManager]: * Explicit value domain=true [2018-10-25 01:36:46,090 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-25 01:36:46,090 INFO L133 SettingsManager]: * Octagon Domain=false [2018-10-25 01:36:46,090 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-25 01:36:46,090 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-25 01:36:46,091 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-25 01:36:46,091 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-25 01:36:46,091 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-25 01:36:46,092 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-25 01:36:46,092 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-25 01:36:46,093 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-25 01:36:46,093 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-25 01:36:46,093 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-25 01:36:46,093 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-25 01:36:46,093 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-25 01:36:46,095 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-25 01:36:46,095 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-25 01:36:46,096 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-25 01:36:46,096 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-25 01:36:46,096 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-25 01:36:46,096 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-25 01:36:46,096 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-25 01:36:46,097 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-25 01:36:46,097 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-25 01:36:46,097 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-25 01:36:46,098 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-25 01:36:46,098 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-25 01:36:46,098 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-25 01:36:46,098 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-25 01:36:46,098 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-25 01:36:46,166 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-25 01:36:46,184 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-25 01:36:46,188 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-25 01:36:46,190 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-25 01:36:46,190 INFO L276 PluginConnector]: CDTParser initialized [2018-10-25 01:36:46,191 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem12_label11_true-unreach-call.c [2018-10-25 01:36:46,260 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/cdb46d2d7/4e43e8e319c8418cae563dac064d0b4c/FLAG5ba5f4eb8 [2018-10-25 01:36:47,072 INFO L298 CDTParser]: Found 1 translation units. [2018-10-25 01:36:47,073 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem12_label11_true-unreach-call.c [2018-10-25 01:36:47,104 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/cdb46d2d7/4e43e8e319c8418cae563dac064d0b4c/FLAG5ba5f4eb8 [2018-10-25 01:36:47,121 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/cdb46d2d7/4e43e8e319c8418cae563dac064d0b4c [2018-10-25 01:36:47,133 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-25 01:36:47,135 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-25 01:36:47,136 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-25 01:36:47,137 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-25 01:36:47,141 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-25 01:36:47,142 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 01:36:47" (1/1) ... [2018-10-25 01:36:47,147 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1822dfc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:36:47, skipping insertion in model container [2018-10-25 01:36:47,147 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 01:36:47" (1/1) ... [2018-10-25 01:36:47,158 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-25 01:36:47,340 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-25 01:36:48,612 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-25 01:36:48,618 INFO L189 MainTranslator]: Completed pre-run [2018-10-25 01:36:49,325 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-25 01:36:49,360 INFO L193 MainTranslator]: Completed translation [2018-10-25 01:36:49,361 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:36:49 WrapperNode [2018-10-25 01:36:49,361 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-25 01:36:49,362 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-25 01:36:49,363 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-25 01:36:49,363 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-25 01:36:49,374 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:36:49" (1/1) ... [2018-10-25 01:36:49,444 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:36:49" (1/1) ... [2018-10-25 01:36:49,860 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-25 01:36:49,861 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-25 01:36:49,861 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-25 01:36:49,861 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-25 01:36:49,872 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:36:49" (1/1) ... [2018-10-25 01:36:49,872 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:36:49" (1/1) ... [2018-10-25 01:36:49,899 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:36:49" (1/1) ... [2018-10-25 01:36:49,900 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:36:49" (1/1) ... [2018-10-25 01:36:50,032 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:36:49" (1/1) ... [2018-10-25 01:36:50,073 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:36:49" (1/1) ... [2018-10-25 01:36:50,108 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:36:49" (1/1) ... [2018-10-25 01:36:50,138 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-25 01:36:50,139 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-25 01:36:50,139 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-25 01:36:50,139 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-25 01:36:50,140 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:36:49" (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:36:50,208 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-25 01:36:50,208 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-25 01:36:50,208 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output4 [2018-10-25 01:36:50,208 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output4 [2018-10-25 01:36:50,209 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output3 [2018-10-25 01:36:50,209 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output3 [2018-10-25 01:36:50,209 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2018-10-25 01:36:50,209 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2018-10-25 01:36:50,209 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-10-25 01:36:50,210 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-10-25 01:36:50,210 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-25 01:36:50,210 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-25 01:36:50,210 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-25 01:36:50,211 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-25 01:37:00,942 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-25 01:37:00,943 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 01:37:00 BoogieIcfgContainer [2018-10-25 01:37:00,943 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-25 01:37:00,945 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-25 01:37:00,945 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-25 01:37:00,948 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-25 01:37:00,948 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.10 01:36:47" (1/3) ... [2018-10-25 01:37:00,949 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d92322e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 01:37:00, skipping insertion in model container [2018-10-25 01:37:00,949 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:36:49" (2/3) ... [2018-10-25 01:37:00,950 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d92322e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 01:37:00, skipping insertion in model container [2018-10-25 01:37:00,950 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 01:37:00" (3/3) ... [2018-10-25 01:37:00,953 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem12_label11_true-unreach-call.c [2018-10-25 01:37:00,963 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-25 01:37:00,973 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-25 01:37:00,990 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-25 01:37:01,035 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-25 01:37:01,035 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-25 01:37:01,035 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-25 01:37:01,035 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-25 01:37:01,036 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-25 01:37:01,036 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-25 01:37:01,036 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-25 01:37:01,036 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-25 01:37:01,074 INFO L276 IsEmpty]: Start isEmpty. Operand 840 states. [2018-10-25 01:37:01,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-10-25 01:37:01,083 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:37:01,085 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] [2018-10-25 01:37:01,088 INFO L424 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:37:01,096 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:37:01,096 INFO L82 PathProgramCache]: Analyzing trace with hash 527324292, now seen corresponding path program 1 times [2018-10-25 01:37:01,099 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:37:01,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:37:01,158 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:37:01,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:37:01,158 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:37:01,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:37:01,594 WARN L179 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-25 01:37:01,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:37:01,710 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:37:01,710 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-25 01:37:01,710 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:37:01,717 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-25 01:37:01,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-25 01:37:01,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-25 01:37:01,737 INFO L87 Difference]: Start difference. First operand 840 states. Second operand 3 states. [2018-10-25 01:37:09,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:37:09,742 INFO L93 Difference]: Finished difference Result 2446 states and 4700 transitions. [2018-10-25 01:37:09,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-25 01:37:09,748 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2018-10-25 01:37:09,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:37:09,784 INFO L225 Difference]: With dead ends: 2446 [2018-10-25 01:37:09,784 INFO L226 Difference]: Without dead ends: 1604 [2018-10-25 01:37:09,798 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-25 01:37:09,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1604 states. [2018-10-25 01:37:09,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1604 to 1604. [2018-10-25 01:37:09,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1604 states. [2018-10-25 01:37:09,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1604 states to 1604 states and 3014 transitions. [2018-10-25 01:37:09,968 INFO L78 Accepts]: Start accepts. Automaton has 1604 states and 3014 transitions. Word has length 46 [2018-10-25 01:37:09,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:37:09,968 INFO L481 AbstractCegarLoop]: Abstraction has 1604 states and 3014 transitions. [2018-10-25 01:37:09,969 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-25 01:37:09,969 INFO L276 IsEmpty]: Start isEmpty. Operand 1604 states and 3014 transitions. [2018-10-25 01:37:09,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-10-25 01:37:09,975 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:37:09,976 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09,976 INFO L424 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:37:09,977 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:37:09,977 INFO L82 PathProgramCache]: Analyzing trace with hash 760022770, now seen corresponding path program 1 times [2018-10-25 01:37:09,977 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:37:09,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:37:09,979 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:37:09,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:37:09,979 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:37:10,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:37:10,325 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:37:10,326 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:37:10,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-25 01:37:10,326 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:37:10,328 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-25 01:37:10,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-25 01:37:10,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-10-25 01:37:10,329 INFO L87 Difference]: Start difference. First operand 1604 states and 3014 transitions. Second operand 5 states. [2018-10-25 01:37:23,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:37:23,914 INFO L93 Difference]: Finished difference Result 4873 states and 9168 transitions. [2018-10-25 01:37:23,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-25 01:37:23,917 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 116 [2018-10-25 01:37:23,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:37:23,938 INFO L225 Difference]: With dead ends: 4873 [2018-10-25 01:37:23,938 INFO L226 Difference]: Without dead ends: 3275 [2018-10-25 01:37:23,945 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 01:37:23,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3275 states. [2018-10-25 01:37:24,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3275 to 3241. [2018-10-25 01:37:24,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3241 states. [2018-10-25 01:37:24,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3241 states to 3241 states and 5443 transitions. [2018-10-25 01:37:24,058 INFO L78 Accepts]: Start accepts. Automaton has 3241 states and 5443 transitions. Word has length 116 [2018-10-25 01:37:24,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:37:24,058 INFO L481 AbstractCegarLoop]: Abstraction has 3241 states and 5443 transitions. [2018-10-25 01:37:24,059 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-25 01:37:24,059 INFO L276 IsEmpty]: Start isEmpty. Operand 3241 states and 5443 transitions. [2018-10-25 01:37:24,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-10-25 01:37:24,063 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:37:24,063 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24,063 INFO L424 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:37:24,064 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:37:24,064 INFO L82 PathProgramCache]: Analyzing trace with hash -188199482, now seen corresponding path program 1 times [2018-10-25 01:37:24,064 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:37:24,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:37:24,065 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:37:24,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:37:24,065 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:37:24,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:37:24,188 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:37:24,189 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:37:24,189 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-25 01:37:24,189 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:37:24,190 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-25 01:37:24,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-25 01:37:24,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-25 01:37:24,190 INFO L87 Difference]: Start difference. First operand 3241 states and 5443 transitions. Second operand 4 states. [2018-10-25 01:37:35,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:37:35,328 INFO L93 Difference]: Finished difference Result 12687 states and 22043 transitions. [2018-10-25 01:37:35,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-25 01:37:35,329 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 122 [2018-10-25 01:37:35,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:37:35,384 INFO L225 Difference]: With dead ends: 12687 [2018-10-25 01:37:35,385 INFO L226 Difference]: Without dead ends: 9452 [2018-10-25 01:37:35,405 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 01:37:35,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9452 states. [2018-10-25 01:37:35,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9452 to 9452. [2018-10-25 01:37:35,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9452 states. [2018-10-25 01:37:35,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9452 states to 9452 states and 14496 transitions. [2018-10-25 01:37:35,655 INFO L78 Accepts]: Start accepts. Automaton has 9452 states and 14496 transitions. Word has length 122 [2018-10-25 01:37:35,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:37:35,656 INFO L481 AbstractCegarLoop]: Abstraction has 9452 states and 14496 transitions. [2018-10-25 01:37:35,656 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-25 01:37:35,656 INFO L276 IsEmpty]: Start isEmpty. Operand 9452 states and 14496 transitions. [2018-10-25 01:37:35,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-10-25 01:37:35,665 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:37:35,665 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 01:37:35,665 INFO L424 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:37:35,666 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:37:35,666 INFO L82 PathProgramCache]: Analyzing trace with hash -936516781, now seen corresponding path program 1 times [2018-10-25 01:37:35,666 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:37:35,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:37:35,667 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:37:35,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:37:35,667 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:37:35,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:37:36,292 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:37:36,292 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:37:36,293 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-25 01:37:36,293 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:37:36,294 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 01:37:36,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 01:37:36,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-10-25 01:37:36,294 INFO L87 Difference]: Start difference. First operand 9452 states and 14496 transitions. Second operand 6 states. [2018-10-25 01:37:55,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:37:55,182 INFO L93 Difference]: Finished difference Result 37982 states and 62849 transitions. [2018-10-25 01:37:55,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 01:37:55,183 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 173 [2018-10-25 01:37:55,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:37:55,333 INFO L225 Difference]: With dead ends: 37982 [2018-10-25 01:37:55,334 INFO L226 Difference]: Without dead ends: 28536 [2018-10-25 01:37:55,437 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-10-25 01:37:55,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28536 states. [2018-10-25 01:37:56,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28536 to 28474. [2018-10-25 01:37:56,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28474 states. [2018-10-25 01:37:56,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28474 states to 28474 states and 42853 transitions. [2018-10-25 01:37:56,268 INFO L78 Accepts]: Start accepts. Automaton has 28474 states and 42853 transitions. Word has length 173 [2018-10-25 01:37:56,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:37:56,269 INFO L481 AbstractCegarLoop]: Abstraction has 28474 states and 42853 transitions. [2018-10-25 01:37:56,269 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 01:37:56,269 INFO L276 IsEmpty]: Start isEmpty. Operand 28474 states and 42853 transitions. [2018-10-25 01:37:56,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2018-10-25 01:37:56,288 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:37:56,289 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 01:37:56,289 INFO L424 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:37:56,289 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:37:56,289 INFO L82 PathProgramCache]: Analyzing trace with hash 874053335, now seen corresponding path program 1 times [2018-10-25 01:37:56,290 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:37:56,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:37:56,291 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:37:56,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:37:56,291 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:37:56,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:37:56,681 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:57,156 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:37:57,156 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:37:57,157 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-25 01:37:57,157 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:37:57,157 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 01:37:57,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 01:37:57,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 01:37:57,160 INFO L87 Difference]: Start difference. First operand 28474 states and 42853 transitions. Second operand 6 states. [2018-10-25 01:38:05,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:38:05,612 INFO L93 Difference]: Finished difference Result 81793 states and 130019 transitions. [2018-10-25 01:38:05,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 01:38:05,612 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 251 [2018-10-25 01:38:05,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:38:05,891 INFO L225 Difference]: With dead ends: 81793 [2018-10-25 01:38:05,891 INFO L226 Difference]: Without dead ends: 53325 [2018-10-25 01:38:05,978 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-25 01:38:06,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53325 states. [2018-10-25 01:38:07,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53325 to 53195. [2018-10-25 01:38:07,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53195 states. [2018-10-25 01:38:07,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53195 states to 53195 states and 81477 transitions. [2018-10-25 01:38:07,322 INFO L78 Accepts]: Start accepts. Automaton has 53195 states and 81477 transitions. Word has length 251 [2018-10-25 01:38:07,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:38:07,323 INFO L481 AbstractCegarLoop]: Abstraction has 53195 states and 81477 transitions. [2018-10-25 01:38:07,323 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 01:38:07,323 INFO L276 IsEmpty]: Start isEmpty. Operand 53195 states and 81477 transitions. [2018-10-25 01:38:07,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2018-10-25 01:38:07,349 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:38:07,349 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, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-25 01:38:07,350 INFO L424 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:38:07,350 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:38:07,350 INFO L82 PathProgramCache]: Analyzing trace with hash 851199661, now seen corresponding path program 1 times [2018-10-25 01:38:07,351 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:38:07,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:38:07,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:38:07,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:38:07,352 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:38:07,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:38:08,091 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 78 proven. 65 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-10-25 01:38:08,091 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 01:38:08,091 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 01:38:08,092 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 270 with the following transitions: [2018-10-25 01:38:08,094 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], [2135], [2137], [2140], [2148], [2156], [2164], [2172], [2180], [2188], [2196], [2204], [2212], [2220], [2228], [2236], [2244], [2252], [2260], [2268], [2276], [2284], [2292], [2300], [2308], [2316], [2324], [2332], [2340], [2348], [2356], [2360], [2361], [2365], [2369], [2373], [2377], [2381], [2385], [2389], [2393], [2397], [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], [2517], [2521], [2525], [2529], [2533], [2537], [2541], [2545], [2549], [2553], [2557], [2561], [2565], [2569], [2573], [2577], [2581], [2585], [2589], [2593], [2597], [2601], [2605], [2609], [2613], [2617], [2621], [2625], [2629], [2633], [2637], [2641], [2645], [2649], [2653], [2657], [2661], [2665], [2669], [2673], [2677], [2681], [2685], [2689], [2692], [3240], [3244], [3248], [3254], [3258], [3260], [3271], [3272], [3273], [3275], [3276] [2018-10-25 01:38:08,149 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 01:38:08,150 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 01:38:08,863 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-25 01:38:08,865 INFO L272 AbstractInterpreter]: Visited 158 different actions 158 times. Never merged. Never widened. Never found a fixpoint. Largest state had 26 variables. [2018-10-25 01:38:08,909 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:38:08,910 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-25 01:38:09,613 INFO L232 lantSequenceWeakener]: Weakened 260 states. On average, predicates are now at 75.42% of their original sizes. [2018-10-25 01:38:09,613 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-25 01:38:09,879 INFO L413 sIntCurrentIteration]: We have 268 unified AI predicates [2018-10-25 01:38:09,883 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-25 01:38:09,884 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-25 01:38:09,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2018-10-25 01:38:09,885 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:38:09,885 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 01:38:09,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 01:38:09,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 01:38:09,886 INFO L87 Difference]: Start difference. First operand 53195 states and 81477 transitions. Second operand 6 states. [2018-10-25 01:38:38,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-25 01:38:38,859 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:38:38,864 INFO L168 Benchmark]: Toolchain (without parser) took 111730.20 ms. Allocated memory was 1.5 GB in the beginning and 4.0 GB in the end (delta: 2.4 GB). Free memory was 1.4 GB in the beginning and 2.6 GB in the end (delta: -1.2 GB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2018-10-25 01:38:38,866 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-25 01:38:38,866 INFO L168 Benchmark]: CACSL2BoogieTranslator took 2225.44 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:38:38,867 INFO L168 Benchmark]: Boogie Procedure Inliner took 498.20 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 793.8 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 69.0 MB. Max. memory is 7.1 GB. [2018-10-25 01:38:38,868 INFO L168 Benchmark]: Boogie Preprocessor took 277.52 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: 43.1 MB). Peak memory consumption was 43.1 MB. Max. memory is 7.1 GB. [2018-10-25 01:38:38,869 INFO L168 Benchmark]: RCFGBuilder took 10804.73 ms. Allocated memory was 2.3 GB in the beginning and 2.5 GB in the end (delta: 180.4 MB). Free memory was 2.2 GB in the beginning and 2.4 GB in the end (delta: -187.7 MB). Peak memory consumption was 659.2 MB. Max. memory is 7.1 GB. [2018-10-25 01:38:38,870 INFO L168 Benchmark]: TraceAbstraction took 97918.71 ms. Allocated memory was 2.5 GB in the beginning and 4.0 GB in the end (delta: 1.4 GB). Free memory was 2.4 GB in the beginning and 2.6 GB in the end (delta: -211.5 MB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2018-10-25 01:38:38,876 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.22 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 2225.44 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 498.20 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 793.8 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 69.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 277.52 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: 43.1 MB). Peak memory consumption was 43.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 10804.73 ms. Allocated memory was 2.3 GB in the beginning and 2.5 GB in the end (delta: 180.4 MB). Free memory was 2.2 GB in the beginning and 2.4 GB in the end (delta: -187.7 MB). Peak memory consumption was 659.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 97918.71 ms. Allocated memory was 2.5 GB in the beginning and 4.0 GB in the end (delta: 1.4 GB). Free memory was 2.4 GB in the beginning and 2.6 GB in the end (delta: -211.5 MB). Peak memory consumption was 1.2 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...