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_label53_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-25 01:44:17,403 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-25 01:44:17,405 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-25 01:44:17,425 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-25 01:44:17,425 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-25 01:44:17,427 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-25 01:44:17,428 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-25 01:44:17,431 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-25 01:44:17,433 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-25 01:44:17,434 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-25 01:44:17,435 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-25 01:44:17,435 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-25 01:44:17,436 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-25 01:44:17,437 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-25 01:44:17,438 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-25 01:44:17,439 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-25 01:44:17,439 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-25 01:44:17,441 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-25 01:44:17,443 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-25 01:44:17,445 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-25 01:44:17,449 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-25 01:44:17,450 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-25 01:44:17,455 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-25 01:44:17,456 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-25 01:44:17,456 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-25 01:44:17,457 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-25 01:44:17,458 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-25 01:44:17,459 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-25 01:44:17,460 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-25 01:44:17,461 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-25 01:44:17,461 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-25 01:44:17,462 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-25 01:44:17,462 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-25 01:44:17,462 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-25 01:44:17,463 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-25 01:44:17,464 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-25 01:44:17,464 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:44:17,479 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-25 01:44:17,479 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-25 01:44:17,480 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-25 01:44:17,480 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-25 01:44:17,480 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-25 01:44:17,480 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-25 01:44:17,481 INFO L133 SettingsManager]: * Explicit value domain=true [2018-10-25 01:44:17,481 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-25 01:44:17,481 INFO L133 SettingsManager]: * Octagon Domain=false [2018-10-25 01:44:17,481 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-25 01:44:17,481 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-25 01:44:17,482 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-25 01:44:17,482 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-25 01:44:17,482 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-25 01:44:17,483 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-25 01:44:17,483 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-25 01:44:17,483 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-25 01:44:17,483 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-25 01:44:17,484 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-25 01:44:17,484 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-25 01:44:17,484 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-25 01:44:17,484 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-25 01:44:17,484 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-25 01:44:17,485 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-25 01:44:17,485 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-25 01:44:17,485 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-25 01:44:17,485 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-25 01:44:17,485 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-25 01:44:17,486 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-25 01:44:17,486 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-25 01:44:17,486 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-25 01:44:17,486 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-25 01:44:17,486 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-25 01:44:17,487 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-25 01:44:17,487 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-25 01:44:17,487 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-25 01:44:17,540 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-25 01:44:17,558 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-25 01:44:17,563 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-25 01:44:17,565 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-25 01:44:17,565 INFO L276 PluginConnector]: CDTParser initialized [2018-10-25 01:44:17,566 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem13_label53_true-unreach-call.c [2018-10-25 01:44:17,635 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/1bb2aaa1f/89689cd0b988483dad627ac0f00bc2a0/FLAG84342eb5a [2018-10-25 01:44:18,430 INFO L298 CDTParser]: Found 1 translation units. [2018-10-25 01:44:18,431 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem13_label53_true-unreach-call.c [2018-10-25 01:44:18,465 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/1bb2aaa1f/89689cd0b988483dad627ac0f00bc2a0/FLAG84342eb5a [2018-10-25 01:44:18,486 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/1bb2aaa1f/89689cd0b988483dad627ac0f00bc2a0 [2018-10-25 01:44:18,498 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-25 01:44:18,501 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-25 01:44:18,504 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-25 01:44:18,504 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-25 01:44:18,511 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-25 01:44:18,513 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 01:44:18" (1/1) ... [2018-10-25 01:44:18,517 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c2b5a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:44:18, skipping insertion in model container [2018-10-25 01:44:18,518 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 01:44:18" (1/1) ... [2018-10-25 01:44:18,528 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-25 01:44:18,733 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-25 01:44:20,255 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-25 01:44:20,262 INFO L189 MainTranslator]: Completed pre-run [2018-10-25 01:44:21,065 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-25 01:44:21,110 INFO L193 MainTranslator]: Completed translation [2018-10-25 01:44:21,111 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:44:21 WrapperNode [2018-10-25 01:44:21,111 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-25 01:44:21,113 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-25 01:44:21,114 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-25 01:44:21,114 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-25 01:44:21,124 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:44:21" (1/1) ... [2018-10-25 01:44:21,225 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:44:21" (1/1) ... [2018-10-25 01:44:21,700 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-25 01:44:21,700 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-25 01:44:21,700 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-25 01:44:21,701 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-25 01:44:21,712 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:44:21" (1/1) ... [2018-10-25 01:44:21,712 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:44:21" (1/1) ... [2018-10-25 01:44:21,742 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:44:21" (1/1) ... [2018-10-25 01:44:21,743 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:44:21" (1/1) ... [2018-10-25 01:44:21,849 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:44:21" (1/1) ... [2018-10-25 01:44:21,889 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:44:21" (1/1) ... [2018-10-25 01:44:21,928 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:44:21" (1/1) ... [2018-10-25 01:44:21,974 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-25 01:44:21,975 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-25 01:44:21,975 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-25 01:44:21,975 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-25 01:44:21,976 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:44:21" (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:44:22,045 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-25 01:44:22,046 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-25 01:44:22,046 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output4 [2018-10-25 01:44:22,046 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output4 [2018-10-25 01:44:22,046 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output3 [2018-10-25 01:44:22,046 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output3 [2018-10-25 01:44:22,047 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2018-10-25 01:44:22,047 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2018-10-25 01:44:22,047 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-10-25 01:44:22,048 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-10-25 01:44:22,048 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-25 01:44:22,048 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-25 01:44:22,048 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-25 01:44:22,050 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-25 01:44:33,704 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-25 01:44:33,705 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 01:44:33 BoogieIcfgContainer [2018-10-25 01:44:33,705 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-25 01:44:33,706 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-25 01:44:33,706 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-25 01:44:33,709 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-25 01:44:33,710 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.10 01:44:18" (1/3) ... [2018-10-25 01:44:33,711 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ce385eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 01:44:33, skipping insertion in model container [2018-10-25 01:44:33,711 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:44:21" (2/3) ... [2018-10-25 01:44:33,711 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ce385eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 01:44:33, skipping insertion in model container [2018-10-25 01:44:33,711 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 01:44:33" (3/3) ... [2018-10-25 01:44:33,713 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem13_label53_true-unreach-call.c [2018-10-25 01:44:33,723 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-25 01:44:33,733 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-25 01:44:33,751 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-25 01:44:33,799 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-25 01:44:33,799 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-25 01:44:33,800 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-25 01:44:33,800 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-25 01:44:33,800 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-25 01:44:33,800 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-25 01:44:33,800 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-25 01:44:33,800 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-25 01:44:33,852 INFO L276 IsEmpty]: Start isEmpty. Operand 1120 states. [2018-10-25 01:44:33,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-10-25 01:44:33,864 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:44:33,866 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] [2018-10-25 01:44:33,868 INFO L424 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:44:33,877 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:44:33,877 INFO L82 PathProgramCache]: Analyzing trace with hash 403353444, now seen corresponding path program 1 times [2018-10-25 01:44:33,880 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:44:33,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:44:33,941 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:44:33,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:44:33,941 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:44:34,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:44:34,353 WARN L179 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-25 01:44:34,403 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:44:34,407 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:44:34,408 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-25 01:44:34,408 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:44:34,414 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-25 01:44:34,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-25 01:44:34,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-25 01:44:34,434 INFO L87 Difference]: Start difference. First operand 1120 states. Second operand 3 states. [2018-10-25 01:44:45,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:44:45,149 INFO L93 Difference]: Finished difference Result 3093 states and 5715 transitions. [2018-10-25 01:44:45,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-25 01:44:45,151 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2018-10-25 01:44:45,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:44:45,188 INFO L225 Difference]: With dead ends: 3093 [2018-10-25 01:44:45,188 INFO L226 Difference]: Without dead ends: 1971 [2018-10-25 01:44:45,204 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:44:45,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1971 states. [2018-10-25 01:44:45,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1971 to 1957. [2018-10-25 01:44:45,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1957 states. [2018-10-25 01:44:45,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1957 states to 1957 states and 3535 transitions. [2018-10-25 01:44:45,400 INFO L78 Accepts]: Start accepts. Automaton has 1957 states and 3535 transitions. Word has length 38 [2018-10-25 01:44:45,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:44:45,401 INFO L481 AbstractCegarLoop]: Abstraction has 1957 states and 3535 transitions. [2018-10-25 01:44:45,401 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-25 01:44:45,401 INFO L276 IsEmpty]: Start isEmpty. Operand 1957 states and 3535 transitions. [2018-10-25 01:44:45,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-10-25 01:44:45,409 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:44:45,409 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:45,410 INFO L424 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:44:45,410 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:44:45,410 INFO L82 PathProgramCache]: Analyzing trace with hash 1014320268, now seen corresponding path program 1 times [2018-10-25 01:44:45,410 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:44:45,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:44:45,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:44:45,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:44:45,412 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:44:45,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:44:45,861 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:44:45,862 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:44:45,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-25 01:44:45,862 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:44:45,864 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 01:44:45,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 01:44:45,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 01:44:45,865 INFO L87 Difference]: Start difference. First operand 1957 states and 3535 transitions. Second operand 6 states. [2018-10-25 01:45:01,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:45:01,081 INFO L93 Difference]: Finished difference Result 5627 states and 10356 transitions. [2018-10-25 01:45:01,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 01:45:01,082 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 121 [2018-10-25 01:45:01,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:45:01,108 INFO L225 Difference]: With dead ends: 5627 [2018-10-25 01:45:01,109 INFO L226 Difference]: Without dead ends: 3676 [2018-10-25 01:45:01,116 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:45:01,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3676 states. [2018-10-25 01:45:01,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3676 to 3643. [2018-10-25 01:45:01,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3643 states. [2018-10-25 01:45:01,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3643 states to 3643 states and 5987 transitions. [2018-10-25 01:45:01,237 INFO L78 Accepts]: Start accepts. Automaton has 3643 states and 5987 transitions. Word has length 121 [2018-10-25 01:45:01,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:45:01,238 INFO L481 AbstractCegarLoop]: Abstraction has 3643 states and 5987 transitions. [2018-10-25 01:45:01,238 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 01:45:01,238 INFO L276 IsEmpty]: Start isEmpty. Operand 3643 states and 5987 transitions. [2018-10-25 01:45:01,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-10-25 01:45:01,255 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:45:01,256 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:01,256 INFO L424 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:45:01,256 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:45:01,256 INFO L82 PathProgramCache]: Analyzing trace with hash -504039204, now seen corresponding path program 1 times [2018-10-25 01:45:01,256 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:45:01,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:45:01,258 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:45:01,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:45:01,261 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:45:01,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:45:01,600 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:45:01,601 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:45:01,601 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-25 01:45:01,601 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:45:01,602 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-25 01:45:01,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-25 01:45:01,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-25 01:45:01,603 INFO L87 Difference]: Start difference. First operand 3643 states and 5987 transitions. Second operand 5 states. [2018-10-25 01:45:15,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:45:15,959 INFO L93 Difference]: Finished difference Result 10958 states and 18516 transitions. [2018-10-25 01:45:15,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-25 01:45:15,960 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 137 [2018-10-25 01:45:15,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:45:16,002 INFO L225 Difference]: With dead ends: 10958 [2018-10-25 01:45:16,002 INFO L226 Difference]: Without dead ends: 7321 [2018-10-25 01:45:16,016 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:45:16,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7321 states. [2018-10-25 01:45:16,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7321 to 7130. [2018-10-25 01:45:16,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7130 states. [2018-10-25 01:45:16,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7130 states to 7130 states and 10922 transitions. [2018-10-25 01:45:16,210 INFO L78 Accepts]: Start accepts. Automaton has 7130 states and 10922 transitions. Word has length 137 [2018-10-25 01:45:16,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:45:16,211 INFO L481 AbstractCegarLoop]: Abstraction has 7130 states and 10922 transitions. [2018-10-25 01:45:16,211 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-25 01:45:16,211 INFO L276 IsEmpty]: Start isEmpty. Operand 7130 states and 10922 transitions. [2018-10-25 01:45:16,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-10-25 01:45:16,214 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:45:16,215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:16,215 INFO L424 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:45:16,215 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:45:16,215 INFO L82 PathProgramCache]: Analyzing trace with hash -1493608594, now seen corresponding path program 1 times [2018-10-25 01:45:16,215 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:45:16,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:45:16,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:45:16,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:45:16,217 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:45:16,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:45:16,527 WARN L179 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-25 01:45:16,732 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:45:16,732 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:45:16,732 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-25 01:45:16,732 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:45:16,733 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 01:45:16,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 01:45:16,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 01:45:16,734 INFO L87 Difference]: Start difference. First operand 7130 states and 10922 transitions. Second operand 6 states. [2018-10-25 01:45:30,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:45:30,763 INFO L93 Difference]: Finished difference Result 20571 states and 32614 transitions. [2018-10-25 01:45:30,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 01:45:30,768 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 174 [2018-10-25 01:45:30,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:45:30,840 INFO L225 Difference]: With dead ends: 20571 [2018-10-25 01:45:30,840 INFO L226 Difference]: Without dead ends: 13447 [2018-10-25 01:45:30,881 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-25 01:45:30,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13447 states. [2018-10-25 01:45:31,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13447 to 13244. [2018-10-25 01:45:31,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13244 states. [2018-10-25 01:45:31,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13244 states to 13244 states and 19356 transitions. [2018-10-25 01:45:31,221 INFO L78 Accepts]: Start accepts. Automaton has 13244 states and 19356 transitions. Word has length 174 [2018-10-25 01:45:31,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:45:31,221 INFO L481 AbstractCegarLoop]: Abstraction has 13244 states and 19356 transitions. [2018-10-25 01:45:31,222 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 01:45:31,222 INFO L276 IsEmpty]: Start isEmpty. Operand 13244 states and 19356 transitions. [2018-10-25 01:45:31,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-10-25 01:45:31,226 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:45:31,226 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:31,227 INFO L424 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:45:31,227 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:45:31,227 INFO L82 PathProgramCache]: Analyzing trace with hash -1047575411, now seen corresponding path program 1 times [2018-10-25 01:45:31,227 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:45:31,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:45:31,228 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:45:31,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:45:31,229 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:45:31,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:45:31,830 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:45:31,831 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:45:31,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-25 01:45:31,831 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:45:31,832 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 01:45:31,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 01:45:31,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-25 01:45:31,832 INFO L87 Difference]: Start difference. First operand 13244 states and 19356 transitions. Second operand 6 states. [2018-10-25 01:45:49,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:45:49,463 INFO L93 Difference]: Finished difference Result 44572 states and 72288 transitions. [2018-10-25 01:45:49,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-25 01:45:49,465 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 196 [2018-10-25 01:45:49,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:45:49,644 INFO L225 Difference]: With dead ends: 44572 [2018-10-25 01:45:49,644 INFO L226 Difference]: Without dead ends: 31334 [2018-10-25 01:45:49,727 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-10-25 01:45:49,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31334 states. [2018-10-25 01:45:50,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31334 to 31095. [2018-10-25 01:45:50,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31095 states. [2018-10-25 01:45:51,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31095 states to 31095 states and 45240 transitions. [2018-10-25 01:45:51,001 INFO L78 Accepts]: Start accepts. Automaton has 31095 states and 45240 transitions. Word has length 196 [2018-10-25 01:45:51,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:45:51,002 INFO L481 AbstractCegarLoop]: Abstraction has 31095 states and 45240 transitions. [2018-10-25 01:45:51,002 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 01:45:51,002 INFO L276 IsEmpty]: Start isEmpty. Operand 31095 states and 45240 transitions. [2018-10-25 01:45:51,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2018-10-25 01:45:51,009 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:45:51,009 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:51,009 INFO L424 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:45:51,010 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:45:51,010 INFO L82 PathProgramCache]: Analyzing trace with hash -1056237497, now seen corresponding path program 1 times [2018-10-25 01:45:51,010 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:45:51,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:45:51,011 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:45:51,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:45:51,011 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:45:51,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:45:51,338 WARN L179 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-25 01:45:51,762 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:45:51,763 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:45:51,763 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-25 01:45:51,763 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:45:51,764 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 01:45:51,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 01:45:51,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 01:45:51,764 INFO L87 Difference]: Start difference. First operand 31095 states and 45240 transitions. Second operand 6 states. [2018-10-25 01:46:05,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:46:05,319 INFO L93 Difference]: Finished difference Result 75420 states and 118479 transitions. [2018-10-25 01:46:05,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 01:46:05,320 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 219 [2018-10-25 01:46:05,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:46:05,487 INFO L225 Difference]: With dead ends: 75420 [2018-10-25 01:46:05,488 INFO L226 Difference]: Without dead ends: 44331 [2018-10-25 01:46:05,603 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:46:05,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44331 states. [2018-10-25 01:46:06,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44331 to 44016. [2018-10-25 01:46:06,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44016 states. [2018-10-25 01:46:06,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44016 states to 44016 states and 62507 transitions. [2018-10-25 01:46:06,576 INFO L78 Accepts]: Start accepts. Automaton has 44016 states and 62507 transitions. Word has length 219 [2018-10-25 01:46:06,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:46:06,577 INFO L481 AbstractCegarLoop]: Abstraction has 44016 states and 62507 transitions. [2018-10-25 01:46:06,577 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 01:46:06,577 INFO L276 IsEmpty]: Start isEmpty. Operand 44016 states and 62507 transitions. [2018-10-25 01:46:06,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2018-10-25 01:46:06,587 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:46:06,587 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-25 01:46:06,587 INFO L424 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:46:06,588 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:46:06,588 INFO L82 PathProgramCache]: Analyzing trace with hash 342183432, now seen corresponding path program 1 times [2018-10-25 01:46:06,588 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:46:06,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:46:06,594 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:46:06,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:46:06,594 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:46:06,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:46:06,956 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 62 proven. 94 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-10-25 01:46:06,956 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 01:46:06,957 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 01:46:06,959 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 244 with the following transitions: [2018-10-25 01:46:06,963 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], [2831], [2833], [2836], [2844], [2852], [2860], [2868], [2876], [2884], [2892], [2900], [2908], [2916], [2924], [2932], [2940], [2948], [2956], [2964], [2972], [2980], [2988], [2996], [3004], [3012], [3020], [3028], [3036], [3044], [3052], [3060], [3068], [3076], [3084], [3092], [3100], [3108], [3116], [3121], [3125], [3129], [3133], [3137], [3148], [3152], [3156], [3160], [3164], [3168], [3179], [3183], [3187], [3191], [3195], [3199], [3203], [3207], [3218], [3222], [3226], [3230], [3234], [3238], [3242], [3246], [3250], [3254], [3257], [3258], [3262], [3266], [3270], [3274], [3278], [3282], [3285], [4238], [4242], [4246], [4252], [4256], [4258], [4269], [4270], [4271], [4273], [4274] [2018-10-25 01:46:07,036 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 01:46:07,037 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 01:46:07,677 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-25 01:46:07,679 INFO L272 AbstractInterpreter]: Visited 111 different actions 111 times. Never merged. Never widened. Never found a fixpoint. Largest state had 26 variables. [2018-10-25 01:46:07,722 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:46:07,723 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-25 01:46:08,246 INFO L232 lantSequenceWeakener]: Weakened 234 states. On average, predicates are now at 71.08% of their original sizes. [2018-10-25 01:46:08,247 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-25 01:46:08,521 INFO L413 sIntCurrentIteration]: We have 242 unified AI predicates [2018-10-25 01:46:08,521 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-25 01:46:08,522 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-25 01:46:08,522 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [5] total 9 [2018-10-25 01:46:08,522 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:46:08,523 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 01:46:08,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 01:46:08,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 01:46:08,523 INFO L87 Difference]: Start difference. First operand 44016 states and 62507 transitions. Second operand 6 states. [2018-10-25 01:46:12,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-25 01:46:12,438 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:46:12,451 INFO L168 Benchmark]: Toolchain (without parser) took 113952.23 ms. Allocated memory was 1.5 GB in the beginning and 3.3 GB in the end (delta: 1.8 GB). Free memory was 1.4 GB in the beginning and 1.8 GB in the end (delta: -406.9 MB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. [2018-10-25 01:46:12,457 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:46:12,458 INFO L168 Benchmark]: CACSL2BoogieTranslator took 2608.89 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:46:12,458 INFO L168 Benchmark]: Boogie Procedure Inliner took 586.76 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 816.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.1 MB. Max. memory is 7.1 GB. [2018-10-25 01:46:12,459 INFO L168 Benchmark]: Boogie Preprocessor took 274.32 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: 44.0 MB). Peak memory consumption was 44.0 MB. Max. memory is 7.1 GB. [2018-10-25 01:46:12,460 INFO L168 Benchmark]: RCFGBuilder took 11730.06 ms. Allocated memory was 2.4 GB in the beginning and 2.5 GB in the end (delta: 186.6 MB). Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 26.9 MB). Peak memory consumption was 653.1 MB. Max. memory is 7.1 GB. [2018-10-25 01:46:12,461 INFO L168 Benchmark]: TraceAbstraction took 98744.69 ms. Allocated memory was 2.5 GB in the beginning and 3.3 GB in the end (delta: 764.9 MB). Free memory was 2.2 GB in the beginning and 1.8 GB in the end (delta: 356.2 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2018-10-25 01:46:12,473 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 2608.89 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 586.76 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 816.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.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 274.32 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: 44.0 MB). Peak memory consumption was 44.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 11730.06 ms. Allocated memory was 2.4 GB in the beginning and 2.5 GB in the end (delta: 186.6 MB). Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 26.9 MB). Peak memory consumption was 653.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 98744.69 ms. Allocated memory was 2.5 GB in the beginning and 3.3 GB in the end (delta: 764.9 MB). Free memory was 2.2 GB in the beginning and 1.8 GB in the end (delta: 356.2 MB). Peak memory consumption was 1.1 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...