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/Problem11_label53_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-25 01:34:12,031 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-25 01:34:12,033 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-25 01:34:12,046 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-25 01:34:12,046 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-25 01:34:12,047 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-25 01:34:12,049 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-25 01:34:12,051 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-25 01:34:12,052 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-25 01:34:12,053 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-25 01:34:12,054 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-25 01:34:12,054 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-25 01:34:12,055 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-25 01:34:12,056 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-25 01:34:12,057 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-25 01:34:12,061 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-25 01:34:12,062 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-25 01:34:12,066 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-25 01:34:12,070 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-25 01:34:12,074 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-25 01:34:12,075 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-25 01:34:12,080 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-25 01:34:12,085 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-25 01:34:12,088 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-25 01:34:12,088 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-25 01:34:12,089 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-25 01:34:12,090 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-25 01:34:12,091 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-25 01:34:12,091 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-25 01:34:12,092 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-25 01:34:12,092 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-25 01:34:12,093 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-25 01:34:12,093 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-25 01:34:12,094 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-25 01:34:12,094 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-25 01:34:12,099 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-25 01:34:12,099 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:34:12,127 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-25 01:34:12,127 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-25 01:34:12,128 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-25 01:34:12,128 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-25 01:34:12,128 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-25 01:34:12,129 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-25 01:34:12,129 INFO L133 SettingsManager]: * Explicit value domain=true [2018-10-25 01:34:12,129 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-25 01:34:12,130 INFO L133 SettingsManager]: * Octagon Domain=false [2018-10-25 01:34:12,130 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-25 01:34:12,130 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-25 01:34:12,130 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-25 01:34:12,130 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-25 01:34:12,130 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-25 01:34:12,131 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-25 01:34:12,131 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-25 01:34:12,132 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-25 01:34:12,132 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-25 01:34:12,132 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-25 01:34:12,132 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-25 01:34:12,132 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-25 01:34:12,133 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-25 01:34:12,133 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-25 01:34:12,133 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-25 01:34:12,133 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-25 01:34:12,133 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-25 01:34:12,134 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-25 01:34:12,134 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-25 01:34:12,134 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-25 01:34:12,134 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-25 01:34:12,134 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-25 01:34:12,134 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-25 01:34:12,135 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-25 01:34:12,135 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-25 01:34:12,135 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-25 01:34:12,135 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-25 01:34:12,192 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-25 01:34:12,210 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-25 01:34:12,215 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-25 01:34:12,216 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-25 01:34:12,217 INFO L276 PluginConnector]: CDTParser initialized [2018-10-25 01:34:12,219 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem11_label53_true-unreach-call.c [2018-10-25 01:34:12,288 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/6e02eb31e/7ef0934db8c74c1690b0765abb0c9e52/FLAGa42a79173 [2018-10-25 01:34:12,905 INFO L298 CDTParser]: Found 1 translation units. [2018-10-25 01:34:12,906 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem11_label53_true-unreach-call.c [2018-10-25 01:34:12,922 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/6e02eb31e/7ef0934db8c74c1690b0765abb0c9e52/FLAGa42a79173 [2018-10-25 01:34:12,944 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/6e02eb31e/7ef0934db8c74c1690b0765abb0c9e52 [2018-10-25 01:34:12,957 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-25 01:34:12,959 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-25 01:34:12,960 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-25 01:34:12,960 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-25 01:34:12,964 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-25 01:34:12,965 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 01:34:12" (1/1) ... [2018-10-25 01:34:12,969 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@219fb805 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:34:12, skipping insertion in model container [2018-10-25 01:34:12,969 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 01:34:12" (1/1) ... [2018-10-25 01:34:12,980 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-25 01:34:13,072 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-25 01:34:13,825 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-25 01:34:13,831 INFO L189 MainTranslator]: Completed pre-run [2018-10-25 01:34:14,040 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-25 01:34:14,059 INFO L193 MainTranslator]: Completed translation [2018-10-25 01:34:14,059 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:34:14 WrapperNode [2018-10-25 01:34:14,060 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-25 01:34:14,061 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-25 01:34:14,062 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-25 01:34:14,062 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-25 01:34:14,070 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:34:14" (1/1) ... [2018-10-25 01:34:14,098 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:34:14" (1/1) ... [2018-10-25 01:34:14,351 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-25 01:34:14,352 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-25 01:34:14,352 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-25 01:34:14,352 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-25 01:34:14,364 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:34:14" (1/1) ... [2018-10-25 01:34:14,364 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:34:14" (1/1) ... [2018-10-25 01:34:14,379 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:34:14" (1/1) ... [2018-10-25 01:34:14,380 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:34:14" (1/1) ... [2018-10-25 01:34:14,436 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:34:14" (1/1) ... [2018-10-25 01:34:14,465 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:34:14" (1/1) ... [2018-10-25 01:34:14,477 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:34:14" (1/1) ... [2018-10-25 01:34:14,490 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-25 01:34:14,490 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-25 01:34:14,491 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-25 01:34:14,491 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-25 01:34:14,492 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:34:14" (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:34:14,564 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-25 01:34:14,565 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-25 01:34:14,565 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-10-25 01:34:14,565 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-10-25 01:34:14,565 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-25 01:34:14,566 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-25 01:34:14,566 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-25 01:34:14,566 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-25 01:34:19,390 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-25 01:34:19,392 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 01:34:19 BoogieIcfgContainer [2018-10-25 01:34:19,393 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-25 01:34:19,394 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-25 01:34:19,394 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-25 01:34:19,397 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-25 01:34:19,398 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.10 01:34:12" (1/3) ... [2018-10-25 01:34:19,399 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f7ad3b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 01:34:19, skipping insertion in model container [2018-10-25 01:34:19,399 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:34:14" (2/3) ... [2018-10-25 01:34:19,399 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f7ad3b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 01:34:19, skipping insertion in model container [2018-10-25 01:34:19,399 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 01:34:19" (3/3) ... [2018-10-25 01:34:19,401 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem11_label53_true-unreach-call.c [2018-10-25 01:34:19,412 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-25 01:34:19,421 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-25 01:34:19,439 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-25 01:34:19,479 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-25 01:34:19,479 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-25 01:34:19,479 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-25 01:34:19,480 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-25 01:34:19,480 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-25 01:34:19,480 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-25 01:34:19,480 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-25 01:34:19,480 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-25 01:34:19,510 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states. [2018-10-25 01:34:19,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-10-25 01:34:19,520 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:34:19,521 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] [2018-10-25 01:34:19,524 INFO L424 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:34:19,530 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:34:19,531 INFO L82 PathProgramCache]: Analyzing trace with hash 1916491172, now seen corresponding path program 1 times [2018-10-25 01:34:19,533 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:34:19,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:34:19,593 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:34:19,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:34:19,593 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:34:19,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:34:20,121 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:34:20,124 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:34:20,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-25 01:34:20,124 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:34:20,130 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-25 01:34:20,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-25 01:34:20,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-25 01:34:20,150 INFO L87 Difference]: Start difference. First operand 293 states. Second operand 4 states. [2018-10-25 01:34:23,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:34:23,795 INFO L93 Difference]: Finished difference Result 1001 states and 1780 transitions. [2018-10-25 01:34:23,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-25 01:34:23,797 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2018-10-25 01:34:23,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:34:23,822 INFO L225 Difference]: With dead ends: 1001 [2018-10-25 01:34:23,823 INFO L226 Difference]: Without dead ends: 702 [2018-10-25 01:34:23,832 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:34:23,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 702 states. [2018-10-25 01:34:23,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 702 to 699. [2018-10-25 01:34:23,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 699 states. [2018-10-25 01:34:23,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 699 states and 1082 transitions. [2018-10-25 01:34:23,942 INFO L78 Accepts]: Start accepts. Automaton has 699 states and 1082 transitions. Word has length 54 [2018-10-25 01:34:23,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:34:23,943 INFO L481 AbstractCegarLoop]: Abstraction has 699 states and 1082 transitions. [2018-10-25 01:34:23,943 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-25 01:34:23,944 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 1082 transitions. [2018-10-25 01:34:23,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-10-25 01:34:23,952 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:34:23,952 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:23,952 INFO L424 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:34:23,953 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:34:23,953 INFO L82 PathProgramCache]: Analyzing trace with hash 1310907987, now seen corresponding path program 1 times [2018-10-25 01:34:23,953 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:34:23,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:34:23,955 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:34:23,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:34:23,955 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:34:24,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:34:24,326 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:34:24,327 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:34:24,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-25 01:34:24,327 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:34:24,330 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 01:34:24,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 01:34:24,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 01:34:24,331 INFO L87 Difference]: Start difference. First operand 699 states and 1082 transitions. Second operand 6 states. [2018-10-25 01:34:29,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:34:29,092 INFO L93 Difference]: Finished difference Result 2534 states and 4100 transitions. [2018-10-25 01:34:29,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 01:34:29,093 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 127 [2018-10-25 01:34:29,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:34:29,108 INFO L225 Difference]: With dead ends: 2534 [2018-10-25 01:34:29,108 INFO L226 Difference]: Without dead ends: 1841 [2018-10-25 01:34:29,116 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-25 01:34:29,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1841 states. [2018-10-25 01:34:29,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1841 to 1815. [2018-10-25 01:34:29,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1815 states. [2018-10-25 01:34:29,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1815 states to 1815 states and 2683 transitions. [2018-10-25 01:34:29,203 INFO L78 Accepts]: Start accepts. Automaton has 1815 states and 2683 transitions. Word has length 127 [2018-10-25 01:34:29,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:34:29,204 INFO L481 AbstractCegarLoop]: Abstraction has 1815 states and 2683 transitions. [2018-10-25 01:34:29,204 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 01:34:29,204 INFO L276 IsEmpty]: Start isEmpty. Operand 1815 states and 2683 transitions. [2018-10-25 01:34:29,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2018-10-25 01:34:29,220 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:34:29,220 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 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] [2018-10-25 01:34:29,220 INFO L424 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:34:29,221 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:34:29,221 INFO L82 PathProgramCache]: Analyzing trace with hash -1917313452, now seen corresponding path program 1 times [2018-10-25 01:34:29,221 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:34:29,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:34:29,222 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:34:29,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:34:29,223 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:34:29,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:34:29,590 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-10-25 01:34:29,591 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:34:29,591 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-25 01:34:29,591 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:34:29,592 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-25 01:34:29,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-25 01:34:29,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-25 01:34:29,593 INFO L87 Difference]: Start difference. First operand 1815 states and 2683 transitions. Second operand 4 states. [2018-10-25 01:34:33,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:34:33,187 INFO L93 Difference]: Finished difference Result 4749 states and 7412 transitions. [2018-10-25 01:34:33,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-25 01:34:33,191 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 230 [2018-10-25 01:34:33,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:34:33,220 INFO L225 Difference]: With dead ends: 4749 [2018-10-25 01:34:33,221 INFO L226 Difference]: Without dead ends: 2940 [2018-10-25 01:34:33,235 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-25 01:34:33,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2940 states. [2018-10-25 01:34:33,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2940 to 2927. [2018-10-25 01:34:33,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2927 states. [2018-10-25 01:34:33,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2927 states to 2927 states and 4052 transitions. [2018-10-25 01:34:33,333 INFO L78 Accepts]: Start accepts. Automaton has 2927 states and 4052 transitions. Word has length 230 [2018-10-25 01:34:33,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:34:33,334 INFO L481 AbstractCegarLoop]: Abstraction has 2927 states and 4052 transitions. [2018-10-25 01:34:33,335 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-25 01:34:33,335 INFO L276 IsEmpty]: Start isEmpty. Operand 2927 states and 4052 transitions. [2018-10-25 01:34:33,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2018-10-25 01:34:33,344 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:34:33,344 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 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:34:33,344 INFO L424 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:34:33,345 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:34:33,345 INFO L82 PathProgramCache]: Analyzing trace with hash -20907064, now seen corresponding path program 1 times [2018-10-25 01:34:33,345 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:34:33,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:34:33,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:34:33,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:34:33,347 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:34:33,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:34:34,041 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 166 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:34:34,042 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 01:34:34,042 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 01:34:34,043 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 237 with the following transitions: [2018-10-25 01:34:34,046 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [333], [335], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [510], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [626], [630], [634], [638], [642], [646], [650], [653], [1084], [1088], [1092], [1098], [1102], [1104], [1109], [1110], [1111], [1113], [1114] [2018-10-25 01:34:34,126 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 01:34:34,126 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 01:34:35,115 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-25 01:34:35,117 INFO L272 AbstractInterpreter]: Visited 113 different actions 113 times. Never merged. Never widened. Never found a fixpoint. Largest state had 28 variables. [2018-10-25 01:34:35,160 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:34:35,160 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-25 01:34:36,113 INFO L232 lantSequenceWeakener]: Weakened 227 states. On average, predicates are now at 73.59% of their original sizes. [2018-10-25 01:34:36,114 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-25 01:34:36,386 INFO L413 sIntCurrentIteration]: We have 235 unified AI predicates [2018-10-25 01:34:36,386 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-25 01:34:36,387 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-25 01:34:36,387 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2018-10-25 01:34:36,388 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:34:36,388 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 01:34:36,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 01:34:36,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 01:34:36,389 INFO L87 Difference]: Start difference. First operand 2927 states and 4052 transitions. Second operand 6 states. [2018-10-25 01:36:26,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:36:26,621 INFO L93 Difference]: Finished difference Result 6040 states and 8357 transitions. [2018-10-25 01:36:26,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-25 01:36:26,621 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 236 [2018-10-25 01:36:26,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:36:26,639 INFO L225 Difference]: With dead ends: 6040 [2018-10-25 01:36:26,639 INFO L226 Difference]: Without dead ends: 3119 [2018-10-25 01:36:26,649 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 236 GetRequests, 231 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-10-25 01:36:26,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3119 states. [2018-10-25 01:36:26,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3119 to 3117. [2018-10-25 01:36:26,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3117 states. [2018-10-25 01:36:26,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3117 states to 3117 states and 4252 transitions. [2018-10-25 01:36:26,732 INFO L78 Accepts]: Start accepts. Automaton has 3117 states and 4252 transitions. Word has length 236 [2018-10-25 01:36:26,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:36:26,733 INFO L481 AbstractCegarLoop]: Abstraction has 3117 states and 4252 transitions. [2018-10-25 01:36:26,733 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 01:36:26,733 INFO L276 IsEmpty]: Start isEmpty. Operand 3117 states and 4252 transitions. [2018-10-25 01:36:26,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2018-10-25 01:36:26,741 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:36:26,741 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-25 01:36:26,742 INFO L424 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:36:26,742 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:36:26,742 INFO L82 PathProgramCache]: Analyzing trace with hash 1343138969, now seen corresponding path program 1 times [2018-10-25 01:36:26,743 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:36:26,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:36:26,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:36:26,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:36:26,744 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:36:26,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:36:27,330 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 200 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:36:27,331 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 01:36:27,331 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 01:36:27,331 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 290 with the following transitions: [2018-10-25 01:36:27,334 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [333], [335], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [626], [630], [634], [638], [642], [646], [650], [653], [654], [658], [662], [666], [677], [688], [692], [696], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [750], [1084], [1088], [1092], [1098], [1102], [1104], [1109], [1110], [1111], [1113], [1114] [2018-10-25 01:36:27,348 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 01:36:27,349 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 01:36:28,003 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-25 01:36:28,003 INFO L272 AbstractInterpreter]: Visited 135 different actions 393 times. Merged at 5 different actions 10 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 28 variables. [2018-10-25 01:36:28,024 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:36:28,024 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-25 01:36:29,004 INFO L232 lantSequenceWeakener]: Weakened 286 states. On average, predicates are now at 73.58% of their original sizes. [2018-10-25 01:36:29,005 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-25 01:36:29,257 INFO L413 sIntCurrentIteration]: We have 288 unified AI predicates [2018-10-25 01:36:29,257 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-25 01:36:29,258 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-25 01:36:29,258 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [6] total 14 [2018-10-25 01:36:29,258 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:36:29,259 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-25 01:36:29,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-25 01:36:29,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-10-25 01:36:29,260 INFO L87 Difference]: Start difference. First operand 3117 states and 4252 transitions. Second operand 10 states. [2018-10-25 01:37:09,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-25 01:37:09,695 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.ArithmeticException: BigInteger: modulus not positive at java.math.BigInteger.mod(BigInteger.java:2458) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.explicit.ExplicitValueValue.modulo(ExplicitValueValue.java:154) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.explicit.ExplicitValueValue.modulo(ExplicitValueValue.java:1) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:125) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:100) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:92) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:92) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:92) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.ConditionalEvaluator.evaluate(ConditionalEvaluator.java:78) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.ConditionalEvaluator.evaluate(ConditionalEvaluator.java:1) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:93) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.handleAssumeStatement(NonrelationalStatementProcessor.java:363) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.processStatement(NonrelationalStatementProcessor.java:160) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.process(NonrelationalStatementProcessor.java:142) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.process(NonrelationalStatementProcessor.java:128) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.handleInternalTransition(NonrelationalPostOperator.java:362) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.handleInternalTransition(NonrelationalPostOperator.java:353) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.apply(NonrelationalPostOperator.java:125) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.apply(NonrelationalPostOperator.java:1) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.compound.CompoundDomainPostOperator.applyInternally(CompoundDomainPostOperator.java:306) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.compound.CompoundDomainPostOperator.apply(CompoundDomainPostOperator.java:131) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.compound.CompoundDomainPostOperator.apply(CompoundDomainPostOperator.java:1) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.applyPost(TermConjunctEvaluator.java:305) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.lambda$4(TermConjunctEvaluator.java:178) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.computeFixpoint(TermConjunctEvaluator.java:198) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.lambda$1(TermConjunctEvaluator.java:150) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.computePost(TermConjunctEvaluator.java:93) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormanCachedPostOperation.applyPost(PoormanCachedPostOperation.java:308) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormansAbstractPostOperator.applyPost(PoormansAbstractPostOperator.java:217) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormansAbstractPostOperator.apply(PoormansAbstractPostOperator.java:119) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormansAbstractPostOperator.apply(PoormansAbstractPostOperator.java:1) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.DisjunctiveAbstractState.lambda$17(DisjunctiveAbstractState.java:369) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.DisjunctiveAbstractState.mapCollection(DisjunctiveAbstractState.java:537) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.DisjunctiveAbstractState.apply(DisjunctiveAbstractState.java:369) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.AbsIntHoareTripleChecker.checkInternalTransitionWithValidState(AbsIntHoareTripleChecker.java:352) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.AbsIntHoareTripleChecker.checkInternalAbsInt(AbsIntHoareTripleChecker.java:249) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.AbsIntHoareTripleChecker.checkInternal(AbsIntHoareTripleChecker.java:181) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.CachingHoareTripleChecker.checkInternal(CachingHoareTripleChecker.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton$InternalSuccessorComputationHelper.computeSuccWithSolver(AbstractInterpolantAutomaton.java:359) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.chooseFalseSuccessor2(BasicAbstractInterpolantAutomaton.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:72) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1066) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:968) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:188) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:673) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:602) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:473) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-10-25 01:37:09,700 INFO L168 Benchmark]: Toolchain (without parser) took 176741.75 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 1.5 GB in the end (delta: -45.3 MB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. [2018-10-25 01:37:09,702 INFO L168 Benchmark]: CDTParser took 0.32 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:37:09,702 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1100.74 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 52.9 MB). Peak memory consumption was 52.9 MB. Max. memory is 7.1 GB. [2018-10-25 01:37:09,703 INFO L168 Benchmark]: Boogie Procedure Inliner took 290.29 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 742.4 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -833.0 MB). Peak memory consumption was 24.2 MB. Max. memory is 7.1 GB. [2018-10-25 01:37:09,704 INFO L168 Benchmark]: Boogie Preprocessor took 138.16 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-25 01:37:09,705 INFO L168 Benchmark]: RCFGBuilder took 4902.44 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 199.2 MB). Peak memory consumption was 199.2 MB. Max. memory is 7.1 GB. [2018-10-25 01:37:09,706 INFO L168 Benchmark]: TraceAbstraction took 170305.02 ms. Allocated memory was 2.3 GB in the beginning and 4.1 GB in the end (delta: 1.9 GB). Free memory was 2.0 GB in the beginning and 1.5 GB in the end (delta: 535.5 MB). Peak memory consumption was 2.4 GB. Max. memory is 7.1 GB. [2018-10-25 01:37:09,711 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.32 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 1100.74 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 52.9 MB). Peak memory consumption was 52.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 290.29 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 742.4 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -833.0 MB). Peak memory consumption was 24.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 138.16 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 4902.44 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 199.2 MB). Peak memory consumption was 199.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 170305.02 ms. Allocated memory was 2.3 GB in the beginning and 4.1 GB in the end (delta: 1.9 GB). Free memory was 2.0 GB in the beginning and 1.5 GB in the end (delta: 535.5 MB). Peak memory consumption was 2.4 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...