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/Problem17_label57_false-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-24 23:49:42,260 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-24 23:49:42,264 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-24 23:49:42,279 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-24 23:49:42,280 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-24 23:49:42,281 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-24 23:49:42,283 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-24 23:49:42,285 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-24 23:49:42,288 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-24 23:49:42,292 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-24 23:49:42,293 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-24 23:49:42,294 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-24 23:49:42,295 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-24 23:49:42,296 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-24 23:49:42,297 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-24 23:49:42,298 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-24 23:49:42,299 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-24 23:49:42,300 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-24 23:49:42,302 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-24 23:49:42,304 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-24 23:49:42,305 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-24 23:49:42,306 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-24 23:49:42,310 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-24 23:49:42,310 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-24 23:49:42,310 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-24 23:49:42,311 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-24 23:49:42,312 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-24 23:49:42,313 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-24 23:49:42,314 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-24 23:49:42,315 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-24 23:49:42,315 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-24 23:49:42,316 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-24 23:49:42,316 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-24 23:49:42,316 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-24 23:49:42,317 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-24 23:49:42,318 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-24 23:49:42,318 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-24 23:49:42,334 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-24 23:49:42,335 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-24 23:49:42,335 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-24 23:49:42,336 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-24 23:49:42,336 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-24 23:49:42,336 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-24 23:49:42,336 INFO L133 SettingsManager]: * Explicit value domain=true [2018-10-24 23:49:42,336 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-24 23:49:42,337 INFO L133 SettingsManager]: * Octagon Domain=false [2018-10-24 23:49:42,337 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-24 23:49:42,337 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-24 23:49:42,337 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-24 23:49:42,337 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-24 23:49:42,338 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-24 23:49:42,338 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-24 23:49:42,339 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-24 23:49:42,339 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-24 23:49:42,339 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-24 23:49:42,339 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-24 23:49:42,339 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-24 23:49:42,339 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-24 23:49:42,340 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-24 23:49:42,340 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-24 23:49:42,340 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-24 23:49:42,340 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-24 23:49:42,340 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-24 23:49:42,341 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-24 23:49:42,341 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-24 23:49:42,341 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-24 23:49:42,341 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-24 23:49:42,341 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-24 23:49:42,342 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-24 23:49:42,342 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-24 23:49:42,342 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-24 23:49:42,342 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-24 23:49:42,342 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-24 23:49:42,386 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-24 23:49:42,401 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-24 23:49:42,406 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-24 23:49:42,407 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-24 23:49:42,408 INFO L276 PluginConnector]: CDTParser initialized [2018-10-24 23:49:42,409 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem17_label57_false-unreach-call.c [2018-10-24 23:49:42,473 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/0d53108c5/ee34d98b10f34095bccaaacca8f55300/FLAG4a6fc0c0b [2018-10-24 23:49:43,187 INFO L298 CDTParser]: Found 1 translation units. [2018-10-24 23:49:43,190 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem17_label57_false-unreach-call.c [2018-10-24 23:49:43,217 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/0d53108c5/ee34d98b10f34095bccaaacca8f55300/FLAG4a6fc0c0b [2018-10-24 23:49:43,235 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/0d53108c5/ee34d98b10f34095bccaaacca8f55300 [2018-10-24 23:49:43,248 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-24 23:49:43,250 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-24 23:49:43,251 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-24 23:49:43,251 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-24 23:49:43,257 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-24 23:49:43,258 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:49:43" (1/1) ... [2018-10-24 23:49:43,261 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@748c7e94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:49:43, skipping insertion in model container [2018-10-24 23:49:43,262 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:49:43" (1/1) ... [2018-10-24 23:49:43,273 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-24 23:49:43,407 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-24 23:49:44,508 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 23:49:44,517 INFO L189 MainTranslator]: Completed pre-run [2018-10-24 23:49:44,920 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 23:49:44,945 INFO L193 MainTranslator]: Completed translation [2018-10-24 23:49:44,945 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:49:44 WrapperNode [2018-10-24 23:49:44,945 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-24 23:49:44,946 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-24 23:49:44,947 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-24 23:49:44,947 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-24 23:49:44,957 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:49:44" (1/1) ... [2018-10-24 23:49:45,025 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:49:44" (1/1) ... [2018-10-24 23:49:45,429 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-24 23:49:45,429 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-24 23:49:45,430 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-24 23:49:45,430 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-24 23:49:45,442 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:49:44" (1/1) ... [2018-10-24 23:49:45,442 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:49:44" (1/1) ... [2018-10-24 23:49:45,476 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:49:44" (1/1) ... [2018-10-24 23:49:45,476 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:49:44" (1/1) ... [2018-10-24 23:49:45,551 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:49:44" (1/1) ... [2018-10-24 23:49:45,573 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:49:44" (1/1) ... [2018-10-24 23:49:45,604 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:49:44" (1/1) ... [2018-10-24 23:49:45,632 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-24 23:49:45,632 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-24 23:49:45,633 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-24 23:49:45,633 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-24 23:49:45,634 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:49:44" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-24 23:49:45,702 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-24 23:49:45,703 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-24 23:49:45,703 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2018-10-24 23:49:45,703 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2018-10-24 23:49:45,703 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-10-24 23:49:45,703 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-10-24 23:49:45,704 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-24 23:49:45,704 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-24 23:49:45,704 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-24 23:49:45,704 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-24 23:49:57,531 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-24 23:49:57,532 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:49:57 BoogieIcfgContainer [2018-10-24 23:49:57,532 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-24 23:49:57,533 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-24 23:49:57,536 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-24 23:49:57,543 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-24 23:49:57,543 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 11:49:43" (1/3) ... [2018-10-24 23:49:57,544 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@99fe489 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:49:57, skipping insertion in model container [2018-10-24 23:49:57,544 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:49:44" (2/3) ... [2018-10-24 23:49:57,545 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@99fe489 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:49:57, skipping insertion in model container [2018-10-24 23:49:57,545 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:49:57" (3/3) ... [2018-10-24 23:49:57,549 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem17_label57_false-unreach-call.c [2018-10-24 23:49:57,560 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-24 23:49:57,576 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-24 23:49:57,595 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-24 23:49:57,658 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-24 23:49:57,658 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-24 23:49:57,658 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-24 23:49:57,658 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-24 23:49:57,658 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-24 23:49:57,659 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-24 23:49:57,659 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-24 23:49:57,659 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-24 23:49:57,712 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states. [2018-10-24 23:49:57,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-10-24 23:49:57,719 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 23:49:57,721 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] [2018-10-24 23:49:57,725 INFO L424 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 23:49:57,733 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:49:57,733 INFO L82 PathProgramCache]: Analyzing trace with hash -43851924, now seen corresponding path program 1 times [2018-10-24 23:49:57,736 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 23:49:57,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:49:57,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 23:49:57,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:49:57,799 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 23:49:57,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 23:49:58,201 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-24 23:49:58,208 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 23:49:58,208 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 23:49:58,208 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 23:49:58,215 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 23:49:58,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 23:49:58,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 23:49:58,234 INFO L87 Difference]: Start difference. First operand 604 states. Second operand 4 states. [2018-10-24 23:50:08,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 23:50:08,971 INFO L93 Difference]: Finished difference Result 2166 states and 4013 transitions. [2018-10-24 23:50:08,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 23:50:08,973 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2018-10-24 23:50:08,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 23:50:09,007 INFO L225 Difference]: With dead ends: 2166 [2018-10-24 23:50:09,007 INFO L226 Difference]: Without dead ends: 1556 [2018-10-24 23:50:09,017 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-24 23:50:09,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1556 states. [2018-10-24 23:50:09,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1556 to 1068. [2018-10-24 23:50:09,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1068 states. [2018-10-24 23:50:09,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1068 states to 1068 states and 1850 transitions. [2018-10-24 23:50:09,159 INFO L78 Accepts]: Start accepts. Automaton has 1068 states and 1850 transitions. Word has length 24 [2018-10-24 23:50:09,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 23:50:09,160 INFO L481 AbstractCegarLoop]: Abstraction has 1068 states and 1850 transitions. [2018-10-24 23:50:09,160 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 23:50:09,160 INFO L276 IsEmpty]: Start isEmpty. Operand 1068 states and 1850 transitions. [2018-10-24 23:50:09,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-10-24 23:50:09,168 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 23:50:09,168 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-10-24 23:50:09,169 INFO L424 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 23:50:09,169 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:50:09,169 INFO L82 PathProgramCache]: Analyzing trace with hash -397529710, now seen corresponding path program 1 times [2018-10-24 23:50:09,169 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 23:50:09,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:50:09,170 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 23:50:09,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:50:09,171 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 23:50:09,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 23:50:09,604 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 23:50:09,604 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 23:50:09,604 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-24 23:50:09,605 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 23:50:09,608 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-24 23:50:09,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-24 23:50:09,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-24 23:50:09,609 INFO L87 Difference]: Start difference. First operand 1068 states and 1850 transitions. Second operand 6 states. [2018-10-24 23:50:18,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 23:50:18,999 INFO L93 Difference]: Finished difference Result 3059 states and 5419 transitions. [2018-10-24 23:50:19,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-24 23:50:19,008 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 100 [2018-10-24 23:50:19,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 23:50:19,029 INFO L225 Difference]: With dead ends: 3059 [2018-10-24 23:50:19,030 INFO L226 Difference]: Without dead ends: 1997 [2018-10-24 23:50:19,035 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-24 23:50:19,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1997 states. [2018-10-24 23:50:19,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1997 to 1975. [2018-10-24 23:50:19,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1975 states. [2018-10-24 23:50:19,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1975 states to 1975 states and 3181 transitions. [2018-10-24 23:50:19,117 INFO L78 Accepts]: Start accepts. Automaton has 1975 states and 3181 transitions. Word has length 100 [2018-10-24 23:50:19,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 23:50:19,118 INFO L481 AbstractCegarLoop]: Abstraction has 1975 states and 3181 transitions. [2018-10-24 23:50:19,118 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-24 23:50:19,118 INFO L276 IsEmpty]: Start isEmpty. Operand 1975 states and 3181 transitions. [2018-10-24 23:50:19,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-10-24 23:50:19,125 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 23:50:19,126 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-10-24 23:50:19,126 INFO L424 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 23:50:19,126 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:50:19,127 INFO L82 PathProgramCache]: Analyzing trace with hash -1715903094, now seen corresponding path program 1 times [2018-10-24 23:50:19,131 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 23:50:19,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:50:19,132 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 23:50:19,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:50:19,132 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 23:50:19,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 23:50:19,451 WARN L179 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-24 23:50:19,795 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 23:50:19,796 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 23:50:19,796 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-24 23:50:19,796 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 23:50:19,797 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-24 23:50:19,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-24 23:50:19,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-24 23:50:19,797 INFO L87 Difference]: Start difference. First operand 1975 states and 3181 transitions. Second operand 6 states. [2018-10-24 23:50:28,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 23:50:28,058 INFO L93 Difference]: Finished difference Result 4880 states and 7834 transitions. [2018-10-24 23:50:28,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-24 23:50:28,059 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 104 [2018-10-24 23:50:28,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 23:50:28,078 INFO L225 Difference]: With dead ends: 4880 [2018-10-24 23:50:28,078 INFO L226 Difference]: Without dead ends: 2911 [2018-10-24 23:50:28,088 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-24 23:50:28,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2911 states. [2018-10-24 23:50:28,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2911 to 2880. [2018-10-24 23:50:28,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2880 states. [2018-10-24 23:50:28,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2880 states to 2880 states and 3936 transitions. [2018-10-24 23:50:28,176 INFO L78 Accepts]: Start accepts. Automaton has 2880 states and 3936 transitions. Word has length 104 [2018-10-24 23:50:28,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 23:50:28,177 INFO L481 AbstractCegarLoop]: Abstraction has 2880 states and 3936 transitions. [2018-10-24 23:50:28,177 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-24 23:50:28,177 INFO L276 IsEmpty]: Start isEmpty. Operand 2880 states and 3936 transitions. [2018-10-24 23:50:28,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-10-24 23:50:28,180 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 23:50:28,180 INFO L375 BasicCegarLoop]: trace histogram [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-24 23:50:28,180 INFO L424 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 23:50:28,180 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:50:28,181 INFO L82 PathProgramCache]: Analyzing trace with hash 405307367, now seen corresponding path program 1 times [2018-10-24 23:50:28,181 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 23:50:28,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:50:28,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 23:50:28,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:50:28,182 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 23:50:28,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 23:50:28,372 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 23:50:28,373 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 23:50:28,373 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 23:50:28,373 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 23:50:28,374 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 23:50:28,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 23:50:28,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 23:50:28,374 INFO L87 Difference]: Start difference. First operand 2880 states and 3936 transitions. Second operand 4 states. [2018-10-24 23:50:32,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 23:50:32,723 INFO L93 Difference]: Finished difference Result 6193 states and 8504 transitions. [2018-10-24 23:50:32,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 23:50:32,724 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 134 [2018-10-24 23:50:32,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 23:50:32,739 INFO L225 Difference]: With dead ends: 6193 [2018-10-24 23:50:32,740 INFO L226 Difference]: Without dead ends: 3319 [2018-10-24 23:50:32,751 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-24 23:50:32,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3319 states. [2018-10-24 23:50:32,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3319 to 3319. [2018-10-24 23:50:32,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3319 states. [2018-10-24 23:50:32,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3319 states to 3319 states and 4342 transitions. [2018-10-24 23:50:32,832 INFO L78 Accepts]: Start accepts. Automaton has 3319 states and 4342 transitions. Word has length 134 [2018-10-24 23:50:32,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 23:50:32,833 INFO L481 AbstractCegarLoop]: Abstraction has 3319 states and 4342 transitions. [2018-10-24 23:50:32,833 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 23:50:32,833 INFO L276 IsEmpty]: Start isEmpty. Operand 3319 states and 4342 transitions. [2018-10-24 23:50:32,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-10-24 23:50:32,836 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 23:50:32,836 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 23:50:32,837 INFO L424 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 23:50:32,837 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:50:32,837 INFO L82 PathProgramCache]: Analyzing trace with hash 400329504, now seen corresponding path program 1 times [2018-10-24 23:50:32,837 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 23:50:32,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:50:32,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 23:50:32,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:50:32,839 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 23:50:32,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 23:50:33,526 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 39 proven. 2 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2018-10-24 23:50:33,527 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 23:50:33,527 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 23:50:33,528 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 189 with the following transitions: [2018-10-24 23:50:33,530 INFO L202 CegarAbsIntRunner]: [0], [1], [711], [718], [726], [734], [742], [750], [758], [766], [774], [782], [790], [798], [802], [804], [807], [815], [823], [831], [839], [847], [855], [863], [871], [879], [887], [895], [903], [911], [919], [927], [935], [943], [951], [959], [967], [975], [983], [991], [999], [1007], [1015], [1023], [1031], [1039], [1047], [1055], [1063], [1071], [1079], [1087], [1095], [1103], [1111], [1119], [1127], [1135], [1143], [1151], [1159], [1167], [1175], [1183], [1191], [1199], [1204], [1208], [1212], [1216], [1220], [1224], [1227], [1228], [1232], [1236], [1240], [1244], [1255], [1259], [1263], [1267], [1271], [1275], [1279], [1282], [2279], [2283], [2287], [2293], [2297], [2299], [2306], [2307], [2308], [2310], [2311] [2018-10-24 23:50:33,604 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-24 23:50:33,604 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-24 23:50:37,882 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-24 23:50:37,884 INFO L272 AbstractInterpreter]: Visited 97 different actions 193 times. Merged at 7 different actions 11 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 26 variables. [2018-10-24 23:50:37,919 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:50:37,920 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-24 23:50:37,921 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 23:50:37,921 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 23:50:37,939 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 23:50:37,939 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-24 23:50:38,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 23:50:38,045 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 23:50:38,492 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 39 proven. 2 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2018-10-24 23:50:38,493 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 23:50:38,928 WARN L179 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-10-24 23:50:39,047 WARN L179 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-10-24 23:50:43,396 WARN L179 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 39 DAG size of output: 15 [2018-10-24 23:50:43,976 WARN L179 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 24 [2018-10-24 23:50:44,460 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 39 proven. 71 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 23:50:44,496 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 23:50:44,497 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 8] total 16 [2018-10-24 23:50:44,497 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 23:50:44,500 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-24 23:50:44,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-24 23:50:44,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2018-10-24 23:50:44,503 INFO L87 Difference]: Start difference. First operand 3319 states and 4342 transitions. Second operand 10 states. [2018-10-24 23:51:10,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 23:51:10,907 INFO L93 Difference]: Finished difference Result 15898 states and 21631 transitions. [2018-10-24 23:51:10,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-24 23:51:10,908 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 188 [2018-10-24 23:51:10,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 23:51:10,972 INFO L225 Difference]: With dead ends: 15898 [2018-10-24 23:51:10,972 INFO L226 Difference]: Without dead ends: 12585 [2018-10-24 23:51:10,999 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 391 GetRequests, 369 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=150, Invalid=356, Unknown=0, NotChecked=0, Total=506 [2018-10-24 23:51:11,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12585 states. [2018-10-24 23:51:11,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12585 to 12469. [2018-10-24 23:51:11,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12469 states. [2018-10-24 23:51:11,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12469 states to 12469 states and 15552 transitions. [2018-10-24 23:51:11,349 INFO L78 Accepts]: Start accepts. Automaton has 12469 states and 15552 transitions. Word has length 188 [2018-10-24 23:51:11,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 23:51:11,350 INFO L481 AbstractCegarLoop]: Abstraction has 12469 states and 15552 transitions. [2018-10-24 23:51:11,350 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-24 23:51:11,350 INFO L276 IsEmpty]: Start isEmpty. Operand 12469 states and 15552 transitions. [2018-10-24 23:51:11,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2018-10-24 23:51:11,356 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 23:51:11,356 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 23:51:11,357 INFO L424 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 23:51:11,357 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:51:11,357 INFO L82 PathProgramCache]: Analyzing trace with hash -841312883, now seen corresponding path program 1 times [2018-10-24 23:51:11,357 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 23:51:11,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:51:11,360 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 23:51:11,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:51:11,361 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 23:51:11,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 23:51:11,932 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 35 proven. 73 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-24 23:51:11,933 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 23:51:11,933 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 23:51:11,933 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 211 with the following transitions: [2018-10-24 23:51:11,934 INFO L202 CegarAbsIntRunner]: [0], [1], [711], [718], [726], [734], [742], [750], [758], [766], [774], [782], [790], [798], [802], [804], [807], [815], [823], [831], [839], [847], [855], [863], [871], [879], [887], [895], [903], [911], [919], [927], [935], [943], [951], [959], [967], [975], [983], [991], [999], [1007], [1015], [1023], [1031], [1039], [1047], [1055], [1063], [1071], [1079], [1087], [1095], [1103], [1111], [1119], [1127], [1135], [1143], [1151], [1159], [1167], [1175], [1183], [1191], [1199], [1204], [1208], [1212], [1216], [1220], [1224], [1227], [1228], [1232], [1236], [1240], [1244], [1255], [1259], [1263], [1267], [1271], [1275], [1279], [1283], [1287], [1291], [1295], [1299], [1303], [1307], [1318], [1322], [1326], [1330], [1334], [1345], [1349], [1353], [1357], [1361], [1365], [1369], [1373], [1377], [1381], [1384], [2279], [2283], [2287], [2293], [2297], [2299], [2306], [2307], [2308], [2310], [2311] [2018-10-24 23:51:11,939 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-24 23:51:11,940 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-24 23:51:12,357 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-24 23:51:12,357 INFO L272 AbstractInterpreter]: Visited 115 different actions 115 times. Never merged. Never widened. Never found a fixpoint. Largest state had 26 variables. [2018-10-24 23:51:12,405 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:51:12,405 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-24 23:51:13,153 INFO L232 lantSequenceWeakener]: Weakened 201 states. On average, predicates are now at 75.08% of their original sizes. [2018-10-24 23:51:13,154 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-24 23:51:13,391 INFO L413 sIntCurrentIteration]: We have 209 unified AI predicates [2018-10-24 23:51:13,392 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-24 23:51:13,392 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 23:51:13,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 12 [2018-10-24 23:51:13,393 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 23:51:13,393 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-24 23:51:13,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-24 23:51:13,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-24 23:51:13,394 INFO L87 Difference]: Start difference. First operand 12469 states and 15552 transitions. Second operand 6 states. [2018-10-24 23:51:35,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-24 23:51:35,740 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.ArithmeticException: BigInteger: modulus not positive at java.math.BigInteger.mod(BigInteger.java:2458) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.explicit.ExplicitValueValue.modulo(ExplicitValueValue.java:154) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.explicit.ExplicitValueValue.modulo(ExplicitValueValue.java:1) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:125) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:100) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:92) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:93) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:92) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:93) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.ConditionalEvaluator.evaluate(ConditionalEvaluator.java:78) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.ConditionalEvaluator.evaluate(ConditionalEvaluator.java:1) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:93) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java: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-24 23:51:35,747 INFO L168 Benchmark]: Toolchain (without parser) took 112498.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 3.5 GB in the end (delta: -2.1 GB). Peak memory consumption was 548.6 MB. Max. memory is 7.1 GB. [2018-10-24 23:51:35,748 INFO L168 Benchmark]: CDTParser took 0.22 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-24 23:51:35,749 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1694.85 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 140.0 MB). Peak memory consumption was 140.0 MB. Max. memory is 7.1 GB. [2018-10-24 23:51:35,750 INFO L168 Benchmark]: Boogie Procedure Inliner took 482.81 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 776.5 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -929.8 MB). Peak memory consumption was 56.1 MB. Max. memory is 7.1 GB. [2018-10-24 23:51:35,751 INFO L168 Benchmark]: Boogie Preprocessor took 202.65 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 27.6 MB). Peak memory consumption was 27.6 MB. Max. memory is 7.1 GB. [2018-10-24 23:51:35,751 INFO L168 Benchmark]: RCFGBuilder took 11900.00 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.7 GB in the end (delta: 471.2 MB). Peak memory consumption was 471.2 MB. Max. memory is 7.1 GB. [2018-10-24 23:51:35,752 INFO L168 Benchmark]: TraceAbstraction took 98212.65 ms. Allocated memory was 2.3 GB in the beginning and 4.1 GB in the end (delta: 1.8 GB). Free memory was 1.7 GB in the beginning and 3.5 GB in the end (delta: -1.8 GB). Peak memory consumption was 63.2 MB. Max. memory is 7.1 GB. [2018-10-24 23:51:35,758 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.22 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 1694.85 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 140.0 MB). Peak memory consumption was 140.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 482.81 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 776.5 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -929.8 MB). Peak memory consumption was 56.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 202.65 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 27.6 MB). Peak memory consumption was 27.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 11900.00 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.7 GB in the end (delta: 471.2 MB). Peak memory consumption was 471.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 98212.65 ms. Allocated memory was 2.3 GB in the beginning and 4.1 GB in the end (delta: 1.8 GB). Free memory was 1.7 GB in the beginning and 3.5 GB in the end (delta: -1.8 GB). Peak memory consumption was 63.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: ArithmeticException: BigInteger: modulus not positive de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: ArithmeticException: BigInteger: modulus not positive: java.math.BigInteger.mod(BigInteger.java:2458) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...