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/Problem13_label18_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-25 01:41:51,329 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-25 01:41:51,331 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-25 01:41:51,350 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-25 01:41:51,350 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-25 01:41:51,351 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-25 01:41:51,353 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-25 01:41:51,354 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-25 01:41:51,356 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-25 01:41:51,357 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-25 01:41:51,358 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-25 01:41:51,358 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-25 01:41:51,359 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-25 01:41:51,360 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-25 01:41:51,361 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-25 01:41:51,362 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-25 01:41:51,363 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-25 01:41:51,365 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-25 01:41:51,367 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-25 01:41:51,368 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-25 01:41:51,369 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-25 01:41:51,370 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-25 01:41:51,379 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-25 01:41:51,379 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-25 01:41:51,379 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-25 01:41:51,380 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-25 01:41:51,382 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-25 01:41:51,383 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-25 01:41:51,385 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-25 01:41:51,386 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-25 01:41:51,386 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-25 01:41:51,388 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-25 01:41:51,388 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-25 01:41:51,389 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-25 01:41:51,390 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-25 01:41:51,390 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-25 01:41:51,391 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:41:51,420 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-25 01:41:51,421 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-25 01:41:51,422 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-25 01:41:51,422 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-25 01:41:51,422 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-25 01:41:51,422 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-25 01:41:51,423 INFO L133 SettingsManager]: * Explicit value domain=true [2018-10-25 01:41:51,423 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-25 01:41:51,423 INFO L133 SettingsManager]: * Octagon Domain=false [2018-10-25 01:41:51,423 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-25 01:41:51,424 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-25 01:41:51,424 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-25 01:41:51,424 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-25 01:41:51,424 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-25 01:41:51,425 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-25 01:41:51,425 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-25 01:41:51,426 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-25 01:41:51,426 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-25 01:41:51,426 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-25 01:41:51,426 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-25 01:41:51,426 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-25 01:41:51,426 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-25 01:41:51,427 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-25 01:41:51,427 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-25 01:41:51,427 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-25 01:41:51,427 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-25 01:41:51,428 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-25 01:41:51,429 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-25 01:41:51,429 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-25 01:41:51,429 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-25 01:41:51,430 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-25 01:41:51,430 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-25 01:41:51,430 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-25 01:41:51,430 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-25 01:41:51,430 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-25 01:41:51,431 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-25 01:41:51,489 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-25 01:41:51,508 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-25 01:41:51,512 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-25 01:41:51,513 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-25 01:41:51,514 INFO L276 PluginConnector]: CDTParser initialized [2018-10-25 01:41:51,514 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem13_label18_true-unreach-call.c [2018-10-25 01:41:51,576 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/00333116a/9fbec1c7b83549a4ae829dece78d984a/FLAGcd7a064c6 [2018-10-25 01:41:52,398 INFO L298 CDTParser]: Found 1 translation units. [2018-10-25 01:41:52,399 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem13_label18_true-unreach-call.c [2018-10-25 01:41:52,432 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/00333116a/9fbec1c7b83549a4ae829dece78d984a/FLAGcd7a064c6 [2018-10-25 01:41:52,454 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/00333116a/9fbec1c7b83549a4ae829dece78d984a [2018-10-25 01:41:52,467 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-25 01:41:52,471 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-25 01:41:52,473 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-25 01:41:52,473 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-25 01:41:52,477 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-25 01:41:52,479 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 01:41:52" (1/1) ... [2018-10-25 01:41:52,482 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46764b1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:41:52, skipping insertion in model container [2018-10-25 01:41:52,483 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 01:41:52" (1/1) ... [2018-10-25 01:41:52,493 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-25 01:41:52,696 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-25 01:41:54,122 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-25 01:41:54,129 INFO L189 MainTranslator]: Completed pre-run [2018-10-25 01:41:54,890 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-25 01:41:54,931 INFO L193 MainTranslator]: Completed translation [2018-10-25 01:41:54,932 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:41:54 WrapperNode [2018-10-25 01:41:54,932 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-25 01:41:54,933 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-25 01:41:54,934 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-25 01:41:54,934 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-25 01:41:54,945 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:41:54" (1/1) ... [2018-10-25 01:41:55,021 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:41:54" (1/1) ... [2018-10-25 01:41:55,481 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-25 01:41:55,481 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-25 01:41:55,482 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-25 01:41:55,482 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-25 01:41:55,493 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:41:54" (1/1) ... [2018-10-25 01:41:55,493 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:41:54" (1/1) ... [2018-10-25 01:41:55,523 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:41:54" (1/1) ... [2018-10-25 01:41:55,523 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:41:54" (1/1) ... [2018-10-25 01:41:55,639 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:41:54" (1/1) ... [2018-10-25 01:41:55,671 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:41:54" (1/1) ... [2018-10-25 01:41:55,706 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:41:54" (1/1) ... [2018-10-25 01:41:55,744 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-25 01:41:55,744 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-25 01:41:55,745 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-25 01:41:55,745 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-25 01:41:55,746 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:41:54" (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:41:55,810 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-25 01:41:55,811 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-25 01:41:55,811 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output4 [2018-10-25 01:41:55,811 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output4 [2018-10-25 01:41:55,811 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output3 [2018-10-25 01:41:55,811 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output3 [2018-10-25 01:41:55,811 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2018-10-25 01:41:55,812 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2018-10-25 01:41:55,812 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-10-25 01:41:55,812 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-10-25 01:41:55,812 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-25 01:41:55,812 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-25 01:41:55,813 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-25 01:41:55,814 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-25 01:42:06,786 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-25 01:42:06,787 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 01:42:06 BoogieIcfgContainer [2018-10-25 01:42:06,787 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-25 01:42:06,788 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-25 01:42:06,788 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-25 01:42:06,792 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-25 01:42:06,792 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.10 01:41:52" (1/3) ... [2018-10-25 01:42:06,793 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70a0bd13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 01:42:06, skipping insertion in model container [2018-10-25 01:42:06,793 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:41:54" (2/3) ... [2018-10-25 01:42:06,793 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70a0bd13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 01:42:06, skipping insertion in model container [2018-10-25 01:42:06,794 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 01:42:06" (3/3) ... [2018-10-25 01:42:06,795 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem13_label18_true-unreach-call.c [2018-10-25 01:42:06,805 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-25 01:42:06,815 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-25 01:42:06,833 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-25 01:42:06,882 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-25 01:42:06,883 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-25 01:42:06,883 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-25 01:42:06,883 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-25 01:42:06,883 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-25 01:42:06,883 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-25 01:42:06,883 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-25 01:42:06,884 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-25 01:42:06,933 INFO L276 IsEmpty]: Start isEmpty. Operand 1120 states. [2018-10-25 01:42:06,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-10-25 01:42:06,946 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:42:06,947 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 01:42:06,949 INFO L424 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:42:06,954 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:42:06,955 INFO L82 PathProgramCache]: Analyzing trace with hash -856257052, now seen corresponding path program 1 times [2018-10-25 01:42:06,957 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:42:07,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:42:07,005 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:42:07,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:42:07,006 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:42:07,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:42:07,444 WARN L179 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-25 01:42:07,570 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:42:07,573 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:42:07,573 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-25 01:42:07,574 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:42:07,580 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-25 01:42:07,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-25 01:42:07,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-25 01:42:07,599 INFO L87 Difference]: Start difference. First operand 1120 states. Second operand 3 states. [2018-10-25 01:42:15,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:42:15,927 INFO L93 Difference]: Finished difference Result 3097 states and 5707 transitions. [2018-10-25 01:42:15,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-25 01:42:15,929 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 70 [2018-10-25 01:42:15,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:42:15,967 INFO L225 Difference]: With dead ends: 3097 [2018-10-25 01:42:15,967 INFO L226 Difference]: Without dead ends: 1975 [2018-10-25 01:42:15,979 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 01:42:16,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1975 states. [2018-10-25 01:42:16,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1975 to 1974. [2018-10-25 01:42:16,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1974 states. [2018-10-25 01:42:16,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1974 states to 1974 states and 3284 transitions. [2018-10-25 01:42:16,189 INFO L78 Accepts]: Start accepts. Automaton has 1974 states and 3284 transitions. Word has length 70 [2018-10-25 01:42:16,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:42:16,190 INFO L481 AbstractCegarLoop]: Abstraction has 1974 states and 3284 transitions. [2018-10-25 01:42:16,190 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-25 01:42:16,190 INFO L276 IsEmpty]: Start isEmpty. Operand 1974 states and 3284 transitions. [2018-10-25 01:42:16,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-10-25 01:42:16,203 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:42:16,204 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 01:42:16,204 INFO L424 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:42:16,205 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:42:16,205 INFO L82 PathProgramCache]: Analyzing trace with hash -410471564, now seen corresponding path program 1 times [2018-10-25 01:42:16,205 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:42:16,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:42:16,209 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:42:16,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:42:16,209 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:42:16,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:42:16,513 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:42:16,513 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:42:16,513 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-25 01:42:16,514 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:42:16,516 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-25 01:42:16,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-25 01:42:16,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-25 01:42:16,517 INFO L87 Difference]: Start difference. First operand 1974 states and 3284 transitions. Second operand 5 states. [2018-10-25 01:42:36,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:42:36,871 INFO L93 Difference]: Finished difference Result 5736 states and 9691 transitions. [2018-10-25 01:42:36,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-25 01:42:36,872 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 146 [2018-10-25 01:42:36,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:42:36,902 INFO L225 Difference]: With dead ends: 5736 [2018-10-25 01:42:36,902 INFO L226 Difference]: Without dead ends: 3768 [2018-10-25 01:42:36,909 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 01:42:36,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3768 states. [2018-10-25 01:42:37,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3768 to 3686. [2018-10-25 01:42:37,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3686 states. [2018-10-25 01:42:37,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3686 states to 3686 states and 5660 transitions. [2018-10-25 01:42:37,029 INFO L78 Accepts]: Start accepts. Automaton has 3686 states and 5660 transitions. Word has length 146 [2018-10-25 01:42:37,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:42:37,030 INFO L481 AbstractCegarLoop]: Abstraction has 3686 states and 5660 transitions. [2018-10-25 01:42:37,030 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-25 01:42:37,030 INFO L276 IsEmpty]: Start isEmpty. Operand 3686 states and 5660 transitions. [2018-10-25 01:42:37,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-10-25 01:42:37,036 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:42:37,036 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 01:42:37,036 INFO L424 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:42:37,036 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:42:37,037 INFO L82 PathProgramCache]: Analyzing trace with hash 586688088, now seen corresponding path program 1 times [2018-10-25 01:42:37,037 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:42:37,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:42:37,038 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:42:37,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:42:37,038 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:42:37,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:42:37,218 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:42:37,218 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:42:37,218 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-25 01:42:37,219 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:42:37,219 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-25 01:42:37,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-25 01:42:37,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-25 01:42:37,220 INFO L87 Difference]: Start difference. First operand 3686 states and 5660 transitions. Second operand 5 states. [2018-10-25 01:43:02,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:43:02,835 INFO L93 Difference]: Finished difference Result 13666 states and 21764 transitions. [2018-10-25 01:43:02,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-25 01:43:02,836 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 160 [2018-10-25 01:43:02,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:43:02,894 INFO L225 Difference]: With dead ends: 13666 [2018-10-25 01:43:02,895 INFO L226 Difference]: Without dead ends: 9986 [2018-10-25 01:43:02,919 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-10-25 01:43:02,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9986 states. [2018-10-25 01:43:03,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9986 to 9796. [2018-10-25 01:43:03,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9796 states. [2018-10-25 01:43:03,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9796 states to 9796 states and 14504 transitions. [2018-10-25 01:43:03,201 INFO L78 Accepts]: Start accepts. Automaton has 9796 states and 14504 transitions. Word has length 160 [2018-10-25 01:43:03,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:43:03,201 INFO L481 AbstractCegarLoop]: Abstraction has 9796 states and 14504 transitions. [2018-10-25 01:43:03,201 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-25 01:43:03,202 INFO L276 IsEmpty]: Start isEmpty. Operand 9796 states and 14504 transitions. [2018-10-25 01:43:03,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-10-25 01:43:03,211 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:43:03,211 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 01:43:03,215 INFO L424 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:43:03,216 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:43:03,216 INFO L82 PathProgramCache]: Analyzing trace with hash 154081844, now seen corresponding path program 1 times [2018-10-25 01:43:03,216 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:43:03,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:43:03,218 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:43:03,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:43:03,218 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:43:03,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:43:03,507 WARN L179 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-25 01:43:03,669 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:43:03,669 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:43:03,669 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-25 01:43:03,669 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:43:03,670 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 01:43:03,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 01:43:03,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 01:43:03,671 INFO L87 Difference]: Start difference. First operand 9796 states and 14504 transitions. Second operand 6 states. [2018-10-25 01:43:22,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:43:22,136 INFO L93 Difference]: Finished difference Result 34193 states and 53815 transitions. [2018-10-25 01:43:22,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 01:43:22,137 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 178 [2018-10-25 01:43:22,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:43:22,260 INFO L225 Difference]: With dead ends: 34193 [2018-10-25 01:43:22,260 INFO L226 Difference]: Without dead ends: 24403 [2018-10-25 01:43:22,334 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 01:43:22,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24403 states. [2018-10-25 01:43:22,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24403 to 24170. [2018-10-25 01:43:22,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24170 states. [2018-10-25 01:43:22,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24170 states to 24170 states and 34077 transitions. [2018-10-25 01:43:22,932 INFO L78 Accepts]: Start accepts. Automaton has 24170 states and 34077 transitions. Word has length 178 [2018-10-25 01:43:22,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:43:22,933 INFO L481 AbstractCegarLoop]: Abstraction has 24170 states and 34077 transitions. [2018-10-25 01:43:22,933 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 01:43:22,933 INFO L276 IsEmpty]: Start isEmpty. Operand 24170 states and 34077 transitions. [2018-10-25 01:43:22,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2018-10-25 01:43:22,941 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:43:22,941 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 01:43:22,941 INFO L424 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:43:22,941 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:43:22,942 INFO L82 PathProgramCache]: Analyzing trace with hash -1234851793, now seen corresponding path program 1 times [2018-10-25 01:43:22,942 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:43:22,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:43:22,943 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:43:22,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:43:22,943 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:43:22,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:43:23,255 WARN L179 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-25 01:43:23,338 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:43:23,339 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:43:23,339 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-25 01:43:23,339 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:43:23,340 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 01:43:23,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 01:43:23,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 01:43:23,340 INFO L87 Difference]: Start difference. First operand 24170 states and 34077 transitions. Second operand 6 states. [2018-10-25 01:43:33,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:43:33,768 INFO L93 Difference]: Finished difference Result 62339 states and 97867 transitions. [2018-10-25 01:43:33,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 01:43:33,775 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 189 [2018-10-25 01:43:33,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:43:33,950 INFO L225 Difference]: With dead ends: 62339 [2018-10-25 01:43:33,950 INFO L226 Difference]: Without dead ends: 38175 [2018-10-25 01:43:34,020 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 01:43:34,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38175 states. [2018-10-25 01:43:34,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38175 to 37978. [2018-10-25 01:43:34,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37978 states. [2018-10-25 01:43:34,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37978 states to 37978 states and 54439 transitions. [2018-10-25 01:43:34,949 INFO L78 Accepts]: Start accepts. Automaton has 37978 states and 54439 transitions. Word has length 189 [2018-10-25 01:43:34,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:43:34,950 INFO L481 AbstractCegarLoop]: Abstraction has 37978 states and 54439 transitions. [2018-10-25 01:43:34,950 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 01:43:34,950 INFO L276 IsEmpty]: Start isEmpty. Operand 37978 states and 54439 transitions. [2018-10-25 01:43:34,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2018-10-25 01:43:34,961 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:43:34,961 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:34,962 INFO L424 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:43:34,962 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:43:34,962 INFO L82 PathProgramCache]: Analyzing trace with hash 1204068448, now seen corresponding path program 1 times [2018-10-25 01:43:34,962 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:43:34,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:43:34,963 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:43:34,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:43:34,964 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:43:35,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:43:35,261 WARN L179 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-25 01:43:35,676 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:43:35,677 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:43:35,677 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-25 01:43:35,677 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:43:35,678 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 01:43:35,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 01:43:35,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 01:43:35,678 INFO L87 Difference]: Start difference. First operand 37978 states and 54439 transitions. Second operand 6 states. [2018-10-25 01:43:46,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:43:46,387 INFO L93 Difference]: Finished difference Result 83934 states and 123837 transitions. [2018-10-25 01:43:46,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 01:43:46,397 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 217 [2018-10-25 01:43:46,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:43:46,573 INFO L225 Difference]: With dead ends: 83934 [2018-10-25 01:43:46,574 INFO L226 Difference]: Without dead ends: 45962 [2018-10-25 01:43:46,664 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:43:46,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45962 states. [2018-10-25 01:43:47,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45962 to 45860. [2018-10-25 01:43:47,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45860 states. [2018-10-25 01:43:47,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45860 states to 45860 states and 62661 transitions. [2018-10-25 01:43:47,582 INFO L78 Accepts]: Start accepts. Automaton has 45860 states and 62661 transitions. Word has length 217 [2018-10-25 01:43:47,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:43:47,583 INFO L481 AbstractCegarLoop]: Abstraction has 45860 states and 62661 transitions. [2018-10-25 01:43:47,583 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 01:43:47,583 INFO L276 IsEmpty]: Start isEmpty. Operand 45860 states and 62661 transitions. [2018-10-25 01:43:47,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2018-10-25 01:43:47,606 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:43:47,606 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:47,607 INFO L424 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:43:47,607 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:43:47,607 INFO L82 PathProgramCache]: Analyzing trace with hash 171861938, now seen corresponding path program 1 times [2018-10-25 01:43:47,607 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:43:47,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:43:47,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:43:47,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:43:47,608 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:43:47,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:43:47,888 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 200 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:43:47,889 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 01:43:47,889 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 01:43:47,890 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 268 with the following transitions: [2018-10-25 01:43:47,892 INFO L202 CegarAbsIntRunner]: [0], [1], [2628], [2635], [2643], [2651], [2659], [2667], [2675], [2683], [2691], [2699], [2707], [2715], [2723], [2731], [2739], [2747], [2755], [2763], [2771], [2779], [2787], [2795], [2803], [2811], [2819], [2827], [2835], [2843], [2851], [2859], [2867], [2875], [2883], [2891], [2899], [2907], [2915], [2923], [2931], [2939], [2947], [2955], [2963], [2971], [2979], [2987], [2995], [3003], [3011], [3019], [3027], [3035], [3043], [3051], [3059], [3067], [3075], [3083], [3087], [3089], [3092], [3100], [3108], [3116], [3121], [3125], [3129], [3133], [3137], [3148], [3151], [3152], [3156], [3160], [3164], [3168], [3179], [3183], [3187], [3191], [3195], [3199], [3203], [3207], [3218], [3222], [3226], [3230], [3234], [3238], [3242], [3246], [3250], [3254], [3258], [3262], [3266], [3270], [3274], [3278], [3282], [3286], [3290], [3294], [3305], [3309], [3313], [3317], [3321], [3325], [3329], [3333], [3344], [3355], [3358], [3361], [3365], [4238], [4242], [4246], [4252], [4256], [4258], [4269], [4270], [4271], [4273], [4274] [2018-10-25 01:43:47,955 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 01:43:47,956 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 01:43:48,594 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-25 01:43:48,595 INFO L272 AbstractInterpreter]: Visited 124 different actions 124 times. Never merged. Never widened. Never found a fixpoint. Largest state had 26 variables. [2018-10-25 01:43:48,640 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:43:48,641 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-25 01:43:49,347 INFO L232 lantSequenceWeakener]: Weakened 256 states. On average, predicates are now at 71.58% of their original sizes. [2018-10-25 01:43:49,347 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-25 01:43:49,593 INFO L413 sIntCurrentIteration]: We have 266 unified AI predicates [2018-10-25 01:43:49,593 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-25 01:43:49,595 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-25 01:43:49,595 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2018-10-25 01:43:49,595 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:43:49,596 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 01:43:49,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 01:43:49,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 01:43:49,597 INFO L87 Difference]: Start difference. First operand 45860 states and 62661 transitions. Second operand 6 states. [2018-10-25 01:43:54,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-25 01:43:54,903 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.ArithmeticException: BigInteger: modulus not positive at java.math.BigInteger.mod(BigInteger.java:2458) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.explicit.ExplicitValueValue.modulo(ExplicitValueValue.java:154) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.explicit.ExplicitValueValue.modulo(ExplicitValueValue.java:1) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:125) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:100) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:92) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:93) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:92) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:92) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.ConditionalEvaluator.evaluate(ConditionalEvaluator.java:78) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.ConditionalEvaluator.evaluate(ConditionalEvaluator.java:1) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:92) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:93) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.handleAssumeStatement(NonrelationalStatementProcessor.java:363) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.processStatement(NonrelationalStatementProcessor.java:160) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.process(NonrelationalStatementProcessor.java:142) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.process(NonrelationalStatementProcessor.java:128) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.handleInternalTransition(NonrelationalPostOperator.java:362) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.handleInternalTransition(NonrelationalPostOperator.java:353) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.apply(NonrelationalPostOperator.java:125) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.apply(NonrelationalPostOperator.java:1) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.compound.CompoundDomainPostOperator.applyInternally(CompoundDomainPostOperator.java:306) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.compound.CompoundDomainPostOperator.apply(CompoundDomainPostOperator.java:131) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.compound.CompoundDomainPostOperator.apply(CompoundDomainPostOperator.java:1) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.applyPost(TermConjunctEvaluator.java:305) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.lambda$4(TermConjunctEvaluator.java:178) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.computeFixpoint(TermConjunctEvaluator.java:198) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.lambda$1(TermConjunctEvaluator.java:150) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.computePost(TermConjunctEvaluator.java:93) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormanCachedPostOperation.applyPost(PoormanCachedPostOperation.java:308) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormansAbstractPostOperator.applyPost(PoormansAbstractPostOperator.java:217) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormansAbstractPostOperator.apply(PoormansAbstractPostOperator.java:119) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormansAbstractPostOperator.apply(PoormansAbstractPostOperator.java:1) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.DisjunctiveAbstractState.lambda$17(DisjunctiveAbstractState.java:369) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.DisjunctiveAbstractState.mapCollection(DisjunctiveAbstractState.java:537) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.DisjunctiveAbstractState.apply(DisjunctiveAbstractState.java:369) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.AbsIntHoareTripleChecker.checkInternalTransitionWithValidState(AbsIntHoareTripleChecker.java:352) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.AbsIntHoareTripleChecker.checkInternalAbsInt(AbsIntHoareTripleChecker.java:249) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.AbsIntHoareTripleChecker.checkInternal(AbsIntHoareTripleChecker.java:181) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.CachingHoareTripleChecker.checkInternal(CachingHoareTripleChecker.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton$InternalSuccessorComputationHelper.computeSuccWithSolver(AbstractInterpolantAutomaton.java:359) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.chooseFalseSuccessor2(BasicAbstractInterpolantAutomaton.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:72) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1066) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:968) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:188) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:673) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:602) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:473) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-10-25 01:43:54,913 INFO L168 Benchmark]: Toolchain (without parser) took 122445.58 ms. Allocated memory was 1.5 GB in the beginning and 3.3 GB in the end (delta: 1.7 GB). Free memory was 1.4 GB in the beginning and 2.9 GB in the end (delta: -1.4 GB). Peak memory consumption was 280.0 MB. Max. memory is 7.1 GB. [2018-10-25 01:43:54,917 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 01:43:54,917 INFO L168 Benchmark]: CACSL2BoogieTranslator took 2459.68 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: 253.7 MB). Peak memory consumption was 253.7 MB. Max. memory is 7.1 GB. [2018-10-25 01:43:54,918 INFO L168 Benchmark]: Boogie Procedure Inliner took 547.87 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 838.3 MB). Free memory was 1.2 GB in the beginning and 2.3 GB in the end (delta: -1.1 GB). Peak memory consumption was 73.2 MB. Max. memory is 7.1 GB. [2018-10-25 01:43:54,919 INFO L168 Benchmark]: Boogie Preprocessor took 262.61 ms. Allocated memory is still 2.4 GB. Free memory was 2.3 GB in the beginning and 2.2 GB in the end (delta: 48.9 MB). Peak memory consumption was 48.9 MB. Max. memory is 7.1 GB. [2018-10-25 01:43:54,920 INFO L168 Benchmark]: RCFGBuilder took 11042.97 ms. Allocated memory was 2.4 GB in the beginning and 2.5 GB in the end (delta: 164.1 MB). Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 49.0 MB). Peak memory consumption was 637.1 MB. Max. memory is 7.1 GB. [2018-10-25 01:43:54,922 INFO L168 Benchmark]: TraceAbstraction took 108124.29 ms. Allocated memory was 2.5 GB in the beginning and 3.3 GB in the end (delta: 713.0 MB). Free memory was 2.2 GB in the beginning and 2.9 GB in the end (delta: -674.0 MB). Peak memory consumption was 39.1 MB. Max. memory is 7.1 GB. [2018-10-25 01:43:54,929 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 2459.68 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: 253.7 MB). Peak memory consumption was 253.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 547.87 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 838.3 MB). Free memory was 1.2 GB in the beginning and 2.3 GB in the end (delta: -1.1 GB). Peak memory consumption was 73.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 262.61 ms. Allocated memory is still 2.4 GB. Free memory was 2.3 GB in the beginning and 2.2 GB in the end (delta: 48.9 MB). Peak memory consumption was 48.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 11042.97 ms. Allocated memory was 2.4 GB in the beginning and 2.5 GB in the end (delta: 164.1 MB). Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 49.0 MB). Peak memory consumption was 637.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 108124.29 ms. Allocated memory was 2.5 GB in the beginning and 3.3 GB in the end (delta: 713.0 MB). Free memory was 2.2 GB in the beginning and 2.9 GB in the end (delta: -674.0 MB). Peak memory consumption was 39.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...