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_label00_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-25 01:40:37,262 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-25 01:40:37,264 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-25 01:40:37,276 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-25 01:40:37,276 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-25 01:40:37,277 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-25 01:40:37,279 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-25 01:40:37,281 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-25 01:40:37,283 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-25 01:40:37,284 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-25 01:40:37,285 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-25 01:40:37,285 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-25 01:40:37,286 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-25 01:40:37,287 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-25 01:40:37,288 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-25 01:40:37,289 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-25 01:40:37,290 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-25 01:40:37,292 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-25 01:40:37,294 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-25 01:40:37,296 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-25 01:40:37,297 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-25 01:40:37,298 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-25 01:40:37,301 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-25 01:40:37,301 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-25 01:40:37,302 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-25 01:40:37,303 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-25 01:40:37,304 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-25 01:40:37,305 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-25 01:40:37,305 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-25 01:40:37,307 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-25 01:40:37,307 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-25 01:40:37,308 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-25 01:40:37,308 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-25 01:40:37,309 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-25 01:40:37,310 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-25 01:40:37,310 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-25 01:40:37,311 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:40:37,327 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-25 01:40:37,327 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-25 01:40:37,328 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-25 01:40:37,329 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-25 01:40:37,329 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-25 01:40:37,329 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-25 01:40:37,329 INFO L133 SettingsManager]: * Explicit value domain=true [2018-10-25 01:40:37,330 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-25 01:40:37,330 INFO L133 SettingsManager]: * Octagon Domain=false [2018-10-25 01:40:37,330 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-25 01:40:37,330 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-25 01:40:37,330 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-25 01:40:37,330 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-25 01:40:37,331 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-25 01:40:37,331 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-25 01:40:37,332 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-25 01:40:37,332 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-25 01:40:37,332 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-25 01:40:37,332 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-25 01:40:37,332 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-25 01:40:37,333 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-25 01:40:37,333 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-25 01:40:37,333 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-25 01:40:37,333 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-25 01:40:37,333 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-25 01:40:37,334 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-25 01:40:37,334 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-25 01:40:37,334 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-25 01:40:37,334 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-25 01:40:37,335 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-25 01:40:37,335 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-25 01:40:37,335 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-25 01:40:37,335 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-25 01:40:37,335 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-25 01:40:37,336 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-25 01:40:37,336 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-25 01:40:37,404 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-25 01:40:37,421 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-25 01:40:37,426 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-25 01:40:37,428 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-25 01:40:37,428 INFO L276 PluginConnector]: CDTParser initialized [2018-10-25 01:40:37,429 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem13_label00_true-unreach-call.c [2018-10-25 01:40:37,498 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/680cb2337/7482668c9eda4bce8b5531363dad4fa0/FLAG91375de84 [2018-10-25 01:40:38,319 INFO L298 CDTParser]: Found 1 translation units. [2018-10-25 01:40:38,320 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem13_label00_true-unreach-call.c [2018-10-25 01:40:38,359 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/680cb2337/7482668c9eda4bce8b5531363dad4fa0/FLAG91375de84 [2018-10-25 01:40:38,377 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/680cb2337/7482668c9eda4bce8b5531363dad4fa0 [2018-10-25 01:40:38,390 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-25 01:40:38,392 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-25 01:40:38,394 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-25 01:40:38,398 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-25 01:40:38,402 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-25 01:40:38,403 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 01:40:38" (1/1) ... [2018-10-25 01:40:38,407 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:40:38, skipping insertion in model container [2018-10-25 01:40:38,407 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 01:40:38" (1/1) ... [2018-10-25 01:40:38,417 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-25 01:40:38,613 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-25 01:40:40,145 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-25 01:40:40,149 INFO L189 MainTranslator]: Completed pre-run [2018-10-25 01:40:40,884 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-25 01:40:40,922 INFO L193 MainTranslator]: Completed translation [2018-10-25 01:40:40,922 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:40:40 WrapperNode [2018-10-25 01:40:40,923 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-25 01:40:40,924 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-25 01:40:40,924 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-25 01:40:40,924 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-25 01:40:40,935 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:40:40" (1/1) ... [2018-10-25 01:40:41,011 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:40:40" (1/1) ... [2018-10-25 01:40:41,560 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-25 01:40:41,561 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-25 01:40:41,561 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-25 01:40:41,561 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-25 01:40:41,576 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:40:40" (1/1) ... [2018-10-25 01:40:41,576 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:40:40" (1/1) ... [2018-10-25 01:40:41,635 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:40:40" (1/1) ... [2018-10-25 01:40:41,636 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:40:40" (1/1) ... [2018-10-25 01:40:41,763 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:40:40" (1/1) ... [2018-10-25 01:40:41,797 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:40:40" (1/1) ... [2018-10-25 01:40:41,849 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:40:40" (1/1) ... [2018-10-25 01:40:41,896 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-25 01:40:41,897 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-25 01:40:41,897 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-25 01:40:41,899 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-25 01:40:41,900 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:40:40" (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:40:41,977 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-25 01:40:41,977 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-25 01:40:41,978 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output4 [2018-10-25 01:40:41,979 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output4 [2018-10-25 01:40:41,979 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output3 [2018-10-25 01:40:41,979 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output3 [2018-10-25 01:40:41,979 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2018-10-25 01:40:41,979 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2018-10-25 01:40:41,980 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-10-25 01:40:41,980 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-10-25 01:40:41,980 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-25 01:40:41,980 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-25 01:40:41,980 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-25 01:40:41,981 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-25 01:40:53,273 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-25 01:40:53,274 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 01:40:53 BoogieIcfgContainer [2018-10-25 01:40:53,274 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-25 01:40:53,276 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-25 01:40:53,276 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-25 01:40:53,280 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-25 01:40:53,280 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.10 01:40:38" (1/3) ... [2018-10-25 01:40:53,281 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b4cafd5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 01:40:53, skipping insertion in model container [2018-10-25 01:40:53,281 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:40:40" (2/3) ... [2018-10-25 01:40:53,281 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b4cafd5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 01:40:53, skipping insertion in model container [2018-10-25 01:40:53,282 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 01:40:53" (3/3) ... [2018-10-25 01:40:53,284 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem13_label00_true-unreach-call.c [2018-10-25 01:40:53,293 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-25 01:40:53,307 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-25 01:40:53,325 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-25 01:40:53,389 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-25 01:40:53,389 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-25 01:40:53,389 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-25 01:40:53,389 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-25 01:40:53,389 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-25 01:40:53,389 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-25 01:40:53,391 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-25 01:40:53,392 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-25 01:40:53,451 INFO L276 IsEmpty]: Start isEmpty. Operand 1120 states. [2018-10-25 01:40:53,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-10-25 01:40:53,458 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:40:53,459 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] [2018-10-25 01:40:53,461 INFO L424 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:40:53,467 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:40:53,467 INFO L82 PathProgramCache]: Analyzing trace with hash -920036068, now seen corresponding path program 1 times [2018-10-25 01:40:53,470 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:40:53,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:40:53,519 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:40:53,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:40:53,519 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:40:53,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:40:53,909 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:40:53,912 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:40:53,913 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-25 01:40:53,913 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:40:53,922 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-25 01:40:53,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-25 01:40:53,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-25 01:40:53,944 INFO L87 Difference]: Start difference. First operand 1120 states. Second operand 4 states. [2018-10-25 01:41:09,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:41:09,044 INFO L93 Difference]: Finished difference Result 3968 states and 7392 transitions. [2018-10-25 01:41:09,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-25 01:41:09,046 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 44 [2018-10-25 01:41:09,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:41:09,087 INFO L225 Difference]: With dead ends: 3968 [2018-10-25 01:41:09,088 INFO L226 Difference]: Without dead ends: 2842 [2018-10-25 01:41:09,101 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:41:09,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2842 states. [2018-10-25 01:41:09,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2842 to 1981. [2018-10-25 01:41:09,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1981 states. [2018-10-25 01:41:09,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1981 states to 1981 states and 3456 transitions. [2018-10-25 01:41:09,262 INFO L78 Accepts]: Start accepts. Automaton has 1981 states and 3456 transitions. Word has length 44 [2018-10-25 01:41:09,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:41:09,262 INFO L481 AbstractCegarLoop]: Abstraction has 1981 states and 3456 transitions. [2018-10-25 01:41:09,263 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-25 01:41:09,263 INFO L276 IsEmpty]: Start isEmpty. Operand 1981 states and 3456 transitions. [2018-10-25 01:41:09,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-10-25 01:41:09,269 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:41:09,270 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:09,270 INFO L424 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:41:09,270 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:41:09,271 INFO L82 PathProgramCache]: Analyzing trace with hash 673844312, now seen corresponding path program 1 times [2018-10-25 01:41:09,271 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:41:09,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:41:09,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:41:09,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:41:09,272 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:41:09,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:41:09,683 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:41:09,683 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:41:09,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-25 01:41:09,684 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:41:09,686 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-25 01:41:09,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-25 01:41:09,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-25 01:41:09,686 INFO L87 Difference]: Start difference. First operand 1981 states and 3456 transitions. Second operand 5 states. [2018-10-25 01:41:29,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:41:29,455 INFO L93 Difference]: Finished difference Result 5673 states and 10081 transitions. [2018-10-25 01:41:29,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 01:41:29,457 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 114 [2018-10-25 01:41:29,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:41:29,485 INFO L225 Difference]: With dead ends: 5673 [2018-10-25 01:41:29,486 INFO L226 Difference]: Without dead ends: 3698 [2018-10-25 01:41:29,493 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-10-25 01:41:29,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3698 states. [2018-10-25 01:41:29,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3698 to 3687. [2018-10-25 01:41:29,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3687 states. [2018-10-25 01:41:29,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3687 states to 3687 states and 5870 transitions. [2018-10-25 01:41:29,606 INFO L78 Accepts]: Start accepts. Automaton has 3687 states and 5870 transitions. Word has length 114 [2018-10-25 01:41:29,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:41:29,606 INFO L481 AbstractCegarLoop]: Abstraction has 3687 states and 5870 transitions. [2018-10-25 01:41:29,607 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-25 01:41:29,607 INFO L276 IsEmpty]: Start isEmpty. Operand 3687 states and 5870 transitions. [2018-10-25 01:41:29,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-10-25 01:41:29,610 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:41:29,611 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:29,611 INFO L424 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:41:29,611 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:41:29,611 INFO L82 PathProgramCache]: Analyzing trace with hash -1072616972, now seen corresponding path program 1 times [2018-10-25 01:41:29,612 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:41:29,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:41:29,613 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:41:29,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:41:29,613 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:41:29,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:41:29,868 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:41:29,868 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:41:29,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-25 01:41:29,869 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:41:29,869 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-25 01:41:29,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-25 01:41:29,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-25 01:41:29,870 INFO L87 Difference]: Start difference. First operand 3687 states and 5870 transitions. Second operand 5 states. [2018-10-25 01:41:44,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:41:44,313 INFO L93 Difference]: Finished difference Result 10963 states and 17865 transitions. [2018-10-25 01:41:44,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-25 01:41:44,313 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 116 [2018-10-25 01:41:44,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:41:44,350 INFO L225 Difference]: With dead ends: 10963 [2018-10-25 01:41:44,350 INFO L226 Difference]: Without dead ends: 7282 [2018-10-25 01:41:44,364 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:41:44,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7282 states. [2018-10-25 01:41:44,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7282 to 7175. [2018-10-25 01:41:44,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7175 states. [2018-10-25 01:41:44,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7175 states to 7175 states and 10520 transitions. [2018-10-25 01:41:44,567 INFO L78 Accepts]: Start accepts. Automaton has 7175 states and 10520 transitions. Word has length 116 [2018-10-25 01:41:44,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:41:44,568 INFO L481 AbstractCegarLoop]: Abstraction has 7175 states and 10520 transitions. [2018-10-25 01:41:44,568 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-25 01:41:44,568 INFO L276 IsEmpty]: Start isEmpty. Operand 7175 states and 10520 transitions. [2018-10-25 01:41:44,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-10-25 01:41:44,571 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:41:44,571 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:44,572 INFO L424 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:41:44,572 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:41:44,572 INFO L82 PathProgramCache]: Analyzing trace with hash -2080422020, now seen corresponding path program 1 times [2018-10-25 01:41:44,572 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:41:44,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:41:44,573 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:41:44,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:41:44,574 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:41:44,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:41:45,036 WARN L179 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 10 [2018-10-25 01:41:45,134 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:41:45,135 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:41:45,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-25 01:41:45,135 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:41:45,136 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 01:41:45,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 01:41:45,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-10-25 01:41:45,137 INFO L87 Difference]: Start difference. First operand 7175 states and 10520 transitions. Second operand 6 states. [2018-10-25 01:42:11,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:42:11,035 INFO L93 Difference]: Finished difference Result 18116 states and 26150 transitions. [2018-10-25 01:42:11,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-25 01:42:11,036 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 160 [2018-10-25 01:42:11,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:42:11,093 INFO L225 Difference]: With dead ends: 18116 [2018-10-25 01:42:11,096 INFO L226 Difference]: Without dead ends: 10947 [2018-10-25 01:42:11,126 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-10-25 01:42:11,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10947 states. [2018-10-25 01:42:11,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10947 to 10597. [2018-10-25 01:42:11,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10597 states. [2018-10-25 01:42:11,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10597 states to 10597 states and 14744 transitions. [2018-10-25 01:42:11,395 INFO L78 Accepts]: Start accepts. Automaton has 10597 states and 14744 transitions. Word has length 160 [2018-10-25 01:42:11,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:42:11,396 INFO L481 AbstractCegarLoop]: Abstraction has 10597 states and 14744 transitions. [2018-10-25 01:42:11,396 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 01:42:11,396 INFO L276 IsEmpty]: Start isEmpty. Operand 10597 states and 14744 transitions. [2018-10-25 01:42:11,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-10-25 01:42:11,399 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:42:11,399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 01:42:11,400 INFO L424 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:42:11,400 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:42:11,400 INFO L82 PathProgramCache]: Analyzing trace with hash 2003986425, now seen corresponding path program 1 times [2018-10-25 01:42:11,400 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:42:11,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:42:11,401 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:42:11,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:42:11,401 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:42:11,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:42:11,919 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 4 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:42:11,920 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 01:42:11,920 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 01:42:11,921 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 175 with the following transitions: [2018-10-25 01:42:11,923 INFO L202 CegarAbsIntRunner]: [0], [1], [2628], [2635], [2643], [2651], [2659], [2667], [2675], [2683], [2691], [2699], [2707], [2715], [2723], [2731], [2739], [2747], [2755], [2763], [2771], [2779], [2787], [2795], [2803], [2811], [2819], [2827], [2835], [2843], [2851], [2859], [2867], [2875], [2879], [2881], [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], [3258], [3262], [3266], [3270], [3274], [3278], [3282], [3286], [3290], [3294], [3305], [3309], [3313], [3317], [3321], [3325], [3329], [3333], [3344], [3355], [3366], [3370], [3374], [3378], [3382], [3386], [3390], [3394], [3398], [3402], [3406], [3409], [4238], [4242], [4246], [4252], [4256], [4258], [4269], [4270], [4271], [4273], [4274] [2018-10-25 01:42:11,975 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 01:42:11,975 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 01:42:12,742 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: java.lang.ArithmeticException: BigInteger: modulus not positive at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.extractInterpolants(BaseRefinementStrategy.java:391) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.handleInfeasibleCase(BaseRefinementStrategy.java:296) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:206) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:435) 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) Caused by: 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.analysis.abstractinterpretationv2.algorithm.FixpointEngine.calculateAbstractPost(FixpointEngine.java:249) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.algorithm.FixpointEngine.calculateFixpoint(FixpointEngine.java:134) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.algorithm.FixpointEngine.run(FixpointEngine.java:105) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.tool.AbstractInterpreter.runWithoutTimeoutAndResults(AbstractInterpreter.java:149) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarAbsIntRunner.generateFixpoints(CegarAbsIntRunner.java:217) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseTaipanRefinementStrategy.constructInterpolantGenerator(BaseTaipanRefinementStrategy.java:385) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseTaipanRefinementStrategy.getInterpolantGenerator(BaseTaipanRefinementStrategy.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.extractInterpolants(BaseRefinementStrategy.java:380) ... 20 more [2018-10-25 01:42:12,747 INFO L168 Benchmark]: Toolchain (without parser) took 94356.30 ms. Allocated memory was 1.5 GB in the beginning and 3.0 GB in the end (delta: 1.5 GB). Free memory was 1.4 GB in the beginning and 2.9 GB in the end (delta: -1.4 GB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2018-10-25 01:42:12,748 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:42:12,749 INFO L168 Benchmark]: CACSL2BoogieTranslator took 2529.53 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: 243.1 MB). Peak memory consumption was 243.1 MB. Max. memory is 7.1 GB. [2018-10-25 01:42:12,750 INFO L168 Benchmark]: Boogie Procedure Inliner took 636.62 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 843.1 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 83.7 MB. Max. memory is 7.1 GB. [2018-10-25 01:42:12,751 INFO L168 Benchmark]: Boogie Preprocessor took 336.24 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: 37.4 MB). Peak memory consumption was 37.4 MB. Max. memory is 7.1 GB. [2018-10-25 01:42:12,752 INFO L168 Benchmark]: RCFGBuilder took 11376.90 ms. Allocated memory was 2.4 GB in the beginning and 2.6 GB in the end (delta: 184.0 MB). Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 20.8 MB). Peak memory consumption was 677.0 MB. Max. memory is 7.1 GB. [2018-10-25 01:42:12,753 INFO L168 Benchmark]: TraceAbstraction took 79470.47 ms. Allocated memory was 2.6 GB in the beginning and 3.0 GB in the end (delta: 465.0 MB). Free memory was 2.2 GB in the beginning and 2.9 GB in the end (delta: -628.2 MB). Peak memory consumption was 933.4 MB. Max. memory is 7.1 GB. [2018-10-25 01:42:12,759 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 2529.53 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: 243.1 MB). Peak memory consumption was 243.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 636.62 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 843.1 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 83.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 336.24 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: 37.4 MB). Peak memory consumption was 37.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 11376.90 ms. Allocated memory was 2.4 GB in the beginning and 2.6 GB in the end (delta: 184.0 MB). Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 20.8 MB). Peak memory consumption was 677.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 79470.47 ms. Allocated memory was 2.6 GB in the beginning and 3.0 GB in the end (delta: 465.0 MB). Free memory was 2.2 GB in the beginning and 2.9 GB in the end (delta: -628.2 MB). Peak memory consumption was 933.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: java.lang.ArithmeticException: BigInteger: modulus not positive de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: java.lang.ArithmeticException: BigInteger: modulus not positive: de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.extractInterpolants(BaseRefinementStrategy.java:391) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...