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/Problem16_label45_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-25 01:53:41,955 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-25 01:53:41,958 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-25 01:53:41,979 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-25 01:53:41,979 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-25 01:53:41,981 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-25 01:53:41,983 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-25 01:53:41,986 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-25 01:53:41,988 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-25 01:53:41,990 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-25 01:53:41,998 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-25 01:53:41,998 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-25 01:53:42,000 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-25 01:53:42,003 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-25 01:53:42,005 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-25 01:53:42,006 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-25 01:53:42,007 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-25 01:53:42,011 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-25 01:53:42,013 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-25 01:53:42,014 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-25 01:53:42,019 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-25 01:53:42,021 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-25 01:53:42,026 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-25 01:53:42,027 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-25 01:53:42,027 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-25 01:53:42,028 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-25 01:53:42,029 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-25 01:53:42,030 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-25 01:53:42,032 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-25 01:53:42,033 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-25 01:53:42,033 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-25 01:53:42,035 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-25 01:53:42,035 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-25 01:53:42,036 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-25 01:53:42,036 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-25 01:53:42,040 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-25 01:53:42,040 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:53:42,060 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-25 01:53:42,062 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-25 01:53:42,063 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-25 01:53:42,064 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-25 01:53:42,064 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-25 01:53:42,064 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-25 01:53:42,064 INFO L133 SettingsManager]: * Explicit value domain=true [2018-10-25 01:53:42,064 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-25 01:53:42,065 INFO L133 SettingsManager]: * Octagon Domain=false [2018-10-25 01:53:42,065 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-25 01:53:42,065 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-25 01:53:42,065 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-25 01:53:42,065 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-25 01:53:42,065 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-25 01:53:42,066 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-25 01:53:42,066 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-25 01:53:42,067 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-25 01:53:42,067 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-25 01:53:42,067 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-25 01:53:42,068 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-25 01:53:42,068 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-25 01:53:42,068 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-25 01:53:42,068 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-25 01:53:42,068 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-25 01:53:42,068 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-25 01:53:42,069 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-25 01:53:42,069 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-25 01:53:42,069 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-25 01:53:42,069 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-25 01:53:42,069 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-25 01:53:42,070 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-25 01:53:42,071 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-25 01:53:42,071 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-25 01:53:42,071 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-25 01:53:42,071 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-25 01:53:42,071 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-25 01:53:42,123 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-25 01:53:42,137 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-25 01:53:42,142 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-25 01:53:42,143 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-25 01:53:42,144 INFO L276 PluginConnector]: CDTParser initialized [2018-10-25 01:53:42,144 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem16_label45_true-unreach-call.c [2018-10-25 01:53:42,200 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/a5405b258/bf2e2316667747ab97c2045ba00be9df/FLAGba8d35921 [2018-10-25 01:53:42,901 INFO L298 CDTParser]: Found 1 translation units. [2018-10-25 01:53:42,902 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem16_label45_true-unreach-call.c [2018-10-25 01:53:42,924 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/a5405b258/bf2e2316667747ab97c2045ba00be9df/FLAGba8d35921 [2018-10-25 01:53:42,946 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/a5405b258/bf2e2316667747ab97c2045ba00be9df [2018-10-25 01:53:42,959 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-25 01:53:42,960 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-25 01:53:42,964 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-25 01:53:42,964 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-25 01:53:42,970 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-25 01:53:42,972 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 01:53:42" (1/1) ... [2018-10-25 01:53:42,976 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7bc5d6a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:53:42, skipping insertion in model container [2018-10-25 01:53:42,976 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 01:53:42" (1/1) ... [2018-10-25 01:53:42,987 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-25 01:53:43,092 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-25 01:53:43,838 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-25 01:53:43,842 INFO L189 MainTranslator]: Completed pre-run [2018-10-25 01:53:44,131 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-25 01:53:44,152 INFO L193 MainTranslator]: Completed translation [2018-10-25 01:53:44,153 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:53:44 WrapperNode [2018-10-25 01:53:44,153 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-25 01:53:44,154 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-25 01:53:44,155 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-25 01:53:44,155 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-25 01:53:44,165 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:53:44" (1/1) ... [2018-10-25 01:53:44,199 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:53:44" (1/1) ... [2018-10-25 01:53:44,460 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-25 01:53:44,460 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-25 01:53:44,461 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-25 01:53:44,461 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-25 01:53:44,472 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:53:44" (1/1) ... [2018-10-25 01:53:44,472 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:53:44" (1/1) ... [2018-10-25 01:53:44,485 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:53:44" (1/1) ... [2018-10-25 01:53:44,487 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:53:44" (1/1) ... [2018-10-25 01:53:44,549 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:53:44" (1/1) ... [2018-10-25 01:53:44,582 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:53:44" (1/1) ... [2018-10-25 01:53:44,624 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:53:44" (1/1) ... [2018-10-25 01:53:44,651 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-25 01:53:44,652 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-25 01:53:44,652 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-25 01:53:44,652 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-25 01:53:44,653 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:53:44" (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:53:44,722 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-25 01:53:44,722 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-25 01:53:44,722 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2018-10-25 01:53:44,723 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2018-10-25 01:53:44,723 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-10-25 01:53:44,723 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-10-25 01:53:44,723 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-25 01:53:44,723 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-25 01:53:44,724 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-25 01:53:44,724 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-25 01:53:51,245 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-25 01:53:51,245 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 01:53:51 BoogieIcfgContainer [2018-10-25 01:53:51,246 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-25 01:53:51,247 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-25 01:53:51,247 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-25 01:53:51,251 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-25 01:53:51,251 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.10 01:53:42" (1/3) ... [2018-10-25 01:53:51,252 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d2ffccb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 01:53:51, skipping insertion in model container [2018-10-25 01:53:51,252 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:53:44" (2/3) ... [2018-10-25 01:53:51,253 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d2ffccb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 01:53:51, skipping insertion in model container [2018-10-25 01:53:51,253 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 01:53:51" (3/3) ... [2018-10-25 01:53:51,255 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem16_label45_true-unreach-call.c [2018-10-25 01:53:51,265 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-25 01:53:51,278 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-25 01:53:51,296 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-25 01:53:51,340 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-25 01:53:51,340 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-25 01:53:51,340 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-25 01:53:51,341 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-25 01:53:51,341 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-25 01:53:51,341 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-25 01:53:51,341 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-25 01:53:51,341 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-25 01:53:51,375 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states. [2018-10-25 01:53:51,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-10-25 01:53:51,385 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:53:51,387 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] [2018-10-25 01:53:51,389 INFO L424 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:53:51,395 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:53:51,395 INFO L82 PathProgramCache]: Analyzing trace with hash -1570242596, now seen corresponding path program 1 times [2018-10-25 01:53:51,397 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:53:51,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:53:51,448 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:53:51,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:53:51,448 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:53:51,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:53:51,934 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:53:51,937 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:53:51,937 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-25 01:53:51,937 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:53:51,944 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-25 01:53:51,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-25 01:53:51,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-25 01:53:51,964 INFO L87 Difference]: Start difference. First operand 410 states. Second operand 4 states. [2018-10-25 01:53:58,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:53:58,654 INFO L93 Difference]: Finished difference Result 1513 states and 2838 transitions. [2018-10-25 01:53:58,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-25 01:53:58,656 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2018-10-25 01:53:58,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:53:58,686 INFO L225 Difference]: With dead ends: 1513 [2018-10-25 01:53:58,687 INFO L226 Difference]: Without dead ends: 1097 [2018-10-25 01:53:58,698 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-25 01:53:58,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1097 states. [2018-10-25 01:53:58,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1097 to 744. [2018-10-25 01:53:58,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 744 states. [2018-10-25 01:53:58,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 744 states to 744 states and 1301 transitions. [2018-10-25 01:53:58,824 INFO L78 Accepts]: Start accepts. Automaton has 744 states and 1301 transitions. Word has length 60 [2018-10-25 01:53:58,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:53:58,826 INFO L481 AbstractCegarLoop]: Abstraction has 744 states and 1301 transitions. [2018-10-25 01:53:58,827 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-25 01:53:58,827 INFO L276 IsEmpty]: Start isEmpty. Operand 744 states and 1301 transitions. [2018-10-25 01:53:58,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-10-25 01:53:58,842 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:53:58,842 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, 1, 1, 1, 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:53:58,843 INFO L424 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:53:58,843 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:53:58,843 INFO L82 PathProgramCache]: Analyzing trace with hash -1372196061, now seen corresponding path program 1 times [2018-10-25 01:53:58,843 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:53:58,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:53:58,846 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:53:58,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:53:58,846 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:53:58,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:53:59,144 WARN L179 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-25 01:53:59,212 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:53:59,212 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:53:59,212 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-25 01:53:59,212 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:53:59,216 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 01:53:59,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 01:53:59,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 01:53:59,217 INFO L87 Difference]: Start difference. First operand 744 states and 1301 transitions. Second operand 6 states. [2018-10-25 01:54:04,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:54:04,572 INFO L93 Difference]: Finished difference Result 2196 states and 3924 transitions. [2018-10-25 01:54:04,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 01:54:04,581 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 131 [2018-10-25 01:54:04,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:54:04,594 INFO L225 Difference]: With dead ends: 2196 [2018-10-25 01:54:04,594 INFO L226 Difference]: Without dead ends: 1458 [2018-10-25 01:54:04,598 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:54:04,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1458 states. [2018-10-25 01:54:04,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1458 to 1438. [2018-10-25 01:54:04,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1438 states. [2018-10-25 01:54:04,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1438 states to 1438 states and 2463 transitions. [2018-10-25 01:54:04,684 INFO L78 Accepts]: Start accepts. Automaton has 1438 states and 2463 transitions. Word has length 131 [2018-10-25 01:54:04,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:54:04,684 INFO L481 AbstractCegarLoop]: Abstraction has 1438 states and 2463 transitions. [2018-10-25 01:54:04,684 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 01:54:04,685 INFO L276 IsEmpty]: Start isEmpty. Operand 1438 states and 2463 transitions. [2018-10-25 01:54:04,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-10-25 01:54:04,691 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:54:04,691 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, 1, 1, 1, 1, 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:54:04,692 INFO L424 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:54:04,692 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:54:04,692 INFO L82 PathProgramCache]: Analyzing trace with hash 822565126, now seen corresponding path program 1 times [2018-10-25 01:54:04,692 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:54:04,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:54:04,694 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:54:04,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:54:04,694 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:54:04,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:54:04,942 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:54:04,942 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:54:04,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-25 01:54:04,942 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:54:04,943 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-25 01:54:04,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-25 01:54:04,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-25 01:54:04,944 INFO L87 Difference]: Start difference. First operand 1438 states and 2463 transitions. Second operand 5 states. [2018-10-25 01:54:09,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:54:09,390 INFO L93 Difference]: Finished difference Result 3597 states and 6200 transitions. [2018-10-25 01:54:09,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 01:54:09,399 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 132 [2018-10-25 01:54:09,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:54:09,418 INFO L225 Difference]: With dead ends: 3597 [2018-10-25 01:54:09,418 INFO L226 Difference]: Without dead ends: 2165 [2018-10-25 01:54:09,425 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 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:54:09,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2165 states. [2018-10-25 01:54:09,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2165 to 2145. [2018-10-25 01:54:09,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2145 states. [2018-10-25 01:54:09,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2145 states to 2145 states and 3126 transitions. [2018-10-25 01:54:09,512 INFO L78 Accepts]: Start accepts. Automaton has 2145 states and 3126 transitions. Word has length 132 [2018-10-25 01:54:09,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:54:09,513 INFO L481 AbstractCegarLoop]: Abstraction has 2145 states and 3126 transitions. [2018-10-25 01:54:09,513 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-25 01:54:09,513 INFO L276 IsEmpty]: Start isEmpty. Operand 2145 states and 3126 transitions. [2018-10-25 01:54:09,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2018-10-25 01:54:09,519 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:54:09,519 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54:09,521 INFO L424 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:54:09,521 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:54:09,521 INFO L82 PathProgramCache]: Analyzing trace with hash 9848590, now seen corresponding path program 1 times [2018-10-25 01:54:09,522 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:54:09,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:54:09,523 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:54:09,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:54:09,523 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:54:09,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:54:09,911 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:54:09,911 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:54:09,912 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-25 01:54:09,912 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:54:09,912 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 01:54:09,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 01:54:09,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 01:54:09,913 INFO L87 Difference]: Start difference. First operand 2145 states and 3126 transitions. Second operand 6 states. [2018-10-25 01:54:14,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:54:14,184 INFO L93 Difference]: Finished difference Result 7058 states and 10436 transitions. [2018-10-25 01:54:14,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 01:54:14,185 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 224 [2018-10-25 01:54:14,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:54:14,219 INFO L225 Difference]: With dead ends: 7058 [2018-10-25 01:54:14,219 INFO L226 Difference]: Without dead ends: 4919 [2018-10-25 01:54:14,237 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-25 01:54:14,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4919 states. [2018-10-25 01:54:14,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4919 to 4879. [2018-10-25 01:54:14,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4879 states. [2018-10-25 01:54:14,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4879 states to 4879 states and 6857 transitions. [2018-10-25 01:54:14,418 INFO L78 Accepts]: Start accepts. Automaton has 4879 states and 6857 transitions. Word has length 224 [2018-10-25 01:54:14,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:54:14,418 INFO L481 AbstractCegarLoop]: Abstraction has 4879 states and 6857 transitions. [2018-10-25 01:54:14,420 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 01:54:14,420 INFO L276 IsEmpty]: Start isEmpty. Operand 4879 states and 6857 transitions. [2018-10-25 01:54:14,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2018-10-25 01:54:14,425 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:54:14,425 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54:14,426 INFO L424 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:54:14,426 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:54:14,426 INFO L82 PathProgramCache]: Analyzing trace with hash 433783590, now seen corresponding path program 1 times [2018-10-25 01:54:14,426 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:54:14,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:54:14,428 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:54:14,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:54:14,428 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:54:14,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:54:14,766 WARN L179 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-25 01:54:14,973 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:54:14,974 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:54:14,974 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-25 01:54:14,974 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:54:14,975 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 01:54:14,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 01:54:14,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 01:54:14,976 INFO L87 Difference]: Start difference. First operand 4879 states and 6857 transitions. Second operand 6 states. [2018-10-25 01:54:19,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:54:19,494 INFO L93 Difference]: Finished difference Result 12216 states and 17406 transitions. [2018-10-25 01:54:19,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 01:54:19,494 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 244 [2018-10-25 01:54:19,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:54:19,534 INFO L225 Difference]: With dead ends: 12216 [2018-10-25 01:54:19,534 INFO L226 Difference]: Without dead ends: 7343 [2018-10-25 01:54:19,565 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:54:19,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7343 states. [2018-10-25 01:54:19,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7343 to 7306. [2018-10-25 01:54:19,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7306 states. [2018-10-25 01:54:19,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7306 states to 7306 states and 9825 transitions. [2018-10-25 01:54:19,757 INFO L78 Accepts]: Start accepts. Automaton has 7306 states and 9825 transitions. Word has length 244 [2018-10-25 01:54:19,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:54:19,758 INFO L481 AbstractCegarLoop]: Abstraction has 7306 states and 9825 transitions. [2018-10-25 01:54:19,758 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 01:54:19,758 INFO L276 IsEmpty]: Start isEmpty. Operand 7306 states and 9825 transitions. [2018-10-25 01:54:19,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 425 [2018-10-25 01:54:19,776 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:54:19,777 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54:19,777 INFO L424 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:54:19,777 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:54:19,777 INFO L82 PathProgramCache]: Analyzing trace with hash -860566542, now seen corresponding path program 1 times [2018-10-25 01:54:19,778 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:54:19,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:54:19,779 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:54:19,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:54:19,779 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:54:19,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:54:20,685 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 184 proven. 37 refuted. 0 times theorem prover too weak. 208 trivial. 0 not checked. [2018-10-25 01:54:20,685 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 01:54:20,685 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 01:54:20,686 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 425 with the following transitions: [2018-10-25 01:54:20,689 INFO L202 CegarAbsIntRunner]: [0], [1], [180], [187], [195], [203], [211], [219], [227], [235], [243], [251], [259], [267], [275], [283], [291], [299], [307], [315], [323], [331], [339], [347], [355], [363], [371], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [559], [561], [564], [572], [580], [588], [596], [604], [612], [620], [628], [636], [644], [652], [660], [668], [672], [673], [677], [681], [685], [689], [693], [697], [701], [705], [709], [713], [717], [721], [725], [729], [733], [737], [741], [745], [749], [753], [757], [761], [765], [769], [773], [777], [781], [785], [789], [793], [797], [801], [805], [809], [813], [817], [821], [825], [829], [833], [837], [841], [845], [849], [853], [857], [861], [865], [869], [873], [877], [881], [885], [889], [893], [897], [901], [905], [909], [912], [913], [917], [921], [925], [929], [933], [937], [941], [945], [949], [953], [957], [961], [965], [969], [973], [977], [981], [985], [989], [993], [997], [1001], [1005], [1009], [1013], [1017], [1021], [1025], [1029], [1033], [1037], [1041], [1045], [1048], [1552], [1556], [1560], [1566], [1570], [1572], [1579], [1580], [1581], [1583], [1584] [2018-10-25 01:54:20,742 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 01:54:20,742 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 01:54:21,550 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-25 01:54:21,552 INFO L272 AbstractInterpreter]: Visited 170 different actions 170 times. Never merged. Never widened. Never found a fixpoint. Largest state had 24 variables. [2018-10-25 01:54:21,595 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:54:21,596 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-25 01:54:22,486 INFO L232 lantSequenceWeakener]: Weakened 412 states. On average, predicates are now at 77.78% of their original sizes. [2018-10-25 01:54:22,487 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-25 01:54:22,754 INFO L413 sIntCurrentIteration]: We have 423 unified AI predicates [2018-10-25 01:54:22,754 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-25 01:54:22,755 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-25 01:54:22,755 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 12 [2018-10-25 01:54:22,756 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:54:22,756 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 01:54:22,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 01:54:22,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 01:54:22,757 INFO L87 Difference]: Start difference. First operand 7306 states and 9825 transitions. Second operand 6 states. [2018-10-25 01:54:44,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-25 01:54:44,723 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.ArithmeticException: BigInteger: modulus not positive at java.math.BigInteger.mod(BigInteger.java:2458) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.explicit.ExplicitValueValue.modulo(ExplicitValueValue.java:154) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.explicit.ExplicitValueValue.modulo(ExplicitValueValue.java:1) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:125) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:100) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:92) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:92) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:93) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.ConditionalEvaluator.evaluate(ConditionalEvaluator.java:78) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.ConditionalEvaluator.evaluate(ConditionalEvaluator.java:1) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:93) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:92) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:92) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.ConditionalEvaluator.evaluate(ConditionalEvaluator.java:78) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.ConditionalEvaluator.evaluate(ConditionalEvaluator.java:1) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:93) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.handleAssumeStatement(NonrelationalStatementProcessor.java:363) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.processStatement(NonrelationalStatementProcessor.java:160) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.process(NonrelationalStatementProcessor.java:142) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.process(NonrelationalStatementProcessor.java:128) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.handleInternalTransition(NonrelationalPostOperator.java:362) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.handleInternalTransition(NonrelationalPostOperator.java:353) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.apply(NonrelationalPostOperator.java:125) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.apply(NonrelationalPostOperator.java:1) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.compound.CompoundDomainPostOperator.applyInternally(CompoundDomainPostOperator.java:306) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.compound.CompoundDomainPostOperator.apply(CompoundDomainPostOperator.java:131) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.compound.CompoundDomainPostOperator.apply(CompoundDomainPostOperator.java:1) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.applyPost(TermConjunctEvaluator.java:305) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.lambda$4(TermConjunctEvaluator.java:178) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.computeFixpoint(TermConjunctEvaluator.java:198) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.lambda$1(TermConjunctEvaluator.java:150) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.computePost(TermConjunctEvaluator.java:93) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormanCachedPostOperation.applyPost(PoormanCachedPostOperation.java:308) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormansAbstractPostOperator.applyPost(PoormansAbstractPostOperator.java:217) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormansAbstractPostOperator.apply(PoormansAbstractPostOperator.java:119) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormansAbstractPostOperator.apply(PoormansAbstractPostOperator.java:1) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.DisjunctiveAbstractState.lambda$17(DisjunctiveAbstractState.java:369) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.DisjunctiveAbstractState.mapCollection(DisjunctiveAbstractState.java:537) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.DisjunctiveAbstractState.apply(DisjunctiveAbstractState.java:369) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.AbsIntHoareTripleChecker.checkInternalTransitionWithValidState(AbsIntHoareTripleChecker.java:352) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.AbsIntHoareTripleChecker.checkInternalAbsInt(AbsIntHoareTripleChecker.java:249) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.AbsIntHoareTripleChecker.checkInternal(AbsIntHoareTripleChecker.java:181) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.CachingHoareTripleChecker.checkInternal(CachingHoareTripleChecker.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton$InternalSuccessorComputationHelper.computeSuccWithSolver(AbstractInterpolantAutomaton.java:359) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.addOtherSuccessors(DeterministicInterpolantAutomaton.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1066) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:968) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:188) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:673) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:602) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:473) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-10-25 01:54:44,737 INFO L168 Benchmark]: Toolchain (without parser) took 61777.66 ms. Allocated memory was 1.5 GB in the beginning and 4.1 GB in the end (delta: 2.6 GB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -766.9 MB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. [2018-10-25 01:54:44,738 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:54:44,740 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1190.18 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 84.6 MB). Peak memory consumption was 84.6 MB. Max. memory is 7.1 GB. [2018-10-25 01:54:44,741 INFO L168 Benchmark]: Boogie Procedure Inliner took 305.88 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 754.5 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -875.6 MB). Peak memory consumption was 28.6 MB. Max. memory is 7.1 GB. [2018-10-25 01:54:44,742 INFO L168 Benchmark]: Boogie Preprocessor took 191.24 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 13.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 7.1 GB. [2018-10-25 01:54:44,743 INFO L168 Benchmark]: RCFGBuilder took 6593.79 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 266.9 MB). Peak memory consumption was 266.9 MB. Max. memory is 7.1 GB. [2018-10-25 01:54:44,744 INFO L168 Benchmark]: TraceAbstraction took 53489.29 ms. Allocated memory was 2.3 GB in the beginning and 4.1 GB in the end (delta: 1.8 GB). Free memory was 1.9 GB in the beginning and 2.2 GB in the end (delta: -256.3 MB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. [2018-10-25 01:54:44,749 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 1190.18 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 84.6 MB). Peak memory consumption was 84.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 305.88 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 754.5 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -875.6 MB). Peak memory consumption was 28.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 191.24 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 13.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 6593.79 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 266.9 MB). Peak memory consumption was 266.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 53489.29 ms. Allocated memory was 2.3 GB in the beginning and 4.1 GB in the end (delta: 1.8 GB). Free memory was 1.9 GB in the beginning and 2.2 GB in the end (delta: -256.3 MB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: ArithmeticException: BigInteger: modulus not positive de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: ArithmeticException: BigInteger: modulus not positive: java.math.BigInteger.mod(BigInteger.java:2458) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...