java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-EXP.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem16_label16_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-25 01:52:19,261 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-25 01:52:19,264 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-25 01:52:19,277 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-25 01:52:19,278 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-25 01:52:19,279 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-25 01:52:19,280 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-25 01:52:19,282 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-25 01:52:19,283 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-25 01:52:19,284 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-25 01:52:19,285 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-25 01:52:19,285 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-25 01:52:19,286 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-25 01:52:19,287 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-25 01:52:19,293 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-25 01:52:19,294 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-25 01:52:19,295 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-25 01:52:19,297 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-25 01:52:19,299 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-25 01:52:19,300 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-25 01:52:19,301 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-25 01:52:19,302 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-25 01:52:19,305 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-25 01:52:19,305 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-25 01:52:19,306 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-25 01:52:19,306 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-25 01:52:19,308 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-25 01:52:19,308 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-25 01:52:19,309 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-25 01:52:19,312 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-25 01:52:19,313 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-25 01:52:19,313 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-25 01:52:19,314 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-25 01:52:19,314 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-25 01:52:19,318 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-25 01:52:19,319 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-25 01:52:19,319 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:52:19,336 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-25 01:52:19,336 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-25 01:52:19,337 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-25 01:52:19,337 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-25 01:52:19,337 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-25 01:52:19,338 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-25 01:52:19,338 INFO L133 SettingsManager]: * Explicit value domain=true [2018-10-25 01:52:19,338 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-25 01:52:19,338 INFO L133 SettingsManager]: * Octagon Domain=false [2018-10-25 01:52:19,339 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-25 01:52:19,339 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-25 01:52:19,339 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-25 01:52:19,339 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-25 01:52:19,340 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-25 01:52:19,340 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-25 01:52:19,341 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-25 01:52:19,341 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-25 01:52:19,341 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-25 01:52:19,341 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-25 01:52:19,341 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-25 01:52:19,342 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-25 01:52:19,342 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-25 01:52:19,342 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-25 01:52:19,342 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-25 01:52:19,343 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-25 01:52:19,343 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-25 01:52:19,343 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-25 01:52:19,343 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-25 01:52:19,344 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-25 01:52:19,344 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-25 01:52:19,344 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-25 01:52:19,344 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-25 01:52:19,344 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-25 01:52:19,344 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-25 01:52:19,345 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-25 01:52:19,345 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-25 01:52:19,414 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-25 01:52:19,430 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-25 01:52:19,434 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-25 01:52:19,436 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-25 01:52:19,437 INFO L276 PluginConnector]: CDTParser initialized [2018-10-25 01:52:19,437 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem16_label16_true-unreach-call.c [2018-10-25 01:52:19,507 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/f9ed55fab/b51c41467a5e4867a81e4bd686ce83e4/FLAG5c4893d2b [2018-10-25 01:52:20,242 INFO L298 CDTParser]: Found 1 translation units. [2018-10-25 01:52:20,243 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem16_label16_true-unreach-call.c [2018-10-25 01:52:20,264 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/f9ed55fab/b51c41467a5e4867a81e4bd686ce83e4/FLAG5c4893d2b [2018-10-25 01:52:20,283 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/f9ed55fab/b51c41467a5e4867a81e4bd686ce83e4 [2018-10-25 01:52:20,296 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-25 01:52:20,298 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-25 01:52:20,299 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-25 01:52:20,299 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-25 01:52:20,305 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-25 01:52:20,306 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 01:52:20" (1/1) ... [2018-10-25 01:52:20,310 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f32220e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:52:20, skipping insertion in model container [2018-10-25 01:52:20,310 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 01:52:20" (1/1) ... [2018-10-25 01:52:20,321 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-25 01:52:20,411 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-25 01:52:21,159 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-25 01:52:21,164 INFO L189 MainTranslator]: Completed pre-run [2018-10-25 01:52:21,441 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-25 01:52:21,461 INFO L193 MainTranslator]: Completed translation [2018-10-25 01:52:21,462 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:52:21 WrapperNode [2018-10-25 01:52:21,462 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-25 01:52:21,463 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-25 01:52:21,464 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-25 01:52:21,464 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-25 01:52:21,474 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:52:21" (1/1) ... [2018-10-25 01:52:21,509 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:52:21" (1/1) ... [2018-10-25 01:52:21,776 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-25 01:52:21,777 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-25 01:52:21,777 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-25 01:52:21,777 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-25 01:52:21,789 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:52:21" (1/1) ... [2018-10-25 01:52:21,790 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:52:21" (1/1) ... [2018-10-25 01:52:21,802 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:52:21" (1/1) ... [2018-10-25 01:52:21,802 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:52:21" (1/1) ... [2018-10-25 01:52:21,873 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:52:21" (1/1) ... [2018-10-25 01:52:21,915 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:52:21" (1/1) ... [2018-10-25 01:52:21,958 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:52:21" (1/1) ... [2018-10-25 01:52:21,981 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-25 01:52:21,982 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-25 01:52:21,982 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-25 01:52:21,983 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-25 01:52:21,984 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:52:21" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-25 01:52:22,051 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-25 01:52:22,051 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-25 01:52:22,051 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2018-10-25 01:52:22,052 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2018-10-25 01:52:22,052 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-10-25 01:52:22,052 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-10-25 01:52:22,052 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-25 01:52:22,052 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-25 01:52:22,053 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-25 01:52:22,054 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-25 01:52:30,293 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-25 01:52:30,293 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 01:52:30 BoogieIcfgContainer [2018-10-25 01:52:30,294 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-25 01:52:30,295 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-25 01:52:30,295 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-25 01:52:30,299 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-25 01:52:30,299 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.10 01:52:20" (1/3) ... [2018-10-25 01:52:30,300 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8a3e47b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 01:52:30, skipping insertion in model container [2018-10-25 01:52:30,300 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:52:21" (2/3) ... [2018-10-25 01:52:30,301 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8a3e47b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 01:52:30, skipping insertion in model container [2018-10-25 01:52:30,301 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 01:52:30" (3/3) ... [2018-10-25 01:52:30,303 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem16_label16_true-unreach-call.c [2018-10-25 01:52:30,314 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-25 01:52:30,325 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-25 01:52:30,344 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-25 01:52:30,384 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-25 01:52:30,384 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-25 01:52:30,385 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-25 01:52:30,385 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-25 01:52:30,385 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-25 01:52:30,385 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-25 01:52:30,385 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-25 01:52:30,386 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-25 01:52:30,421 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states. [2018-10-25 01:52:30,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-10-25 01:52:30,431 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:52:30,432 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] [2018-10-25 01:52:30,434 INFO L424 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:52:30,440 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:52:30,441 INFO L82 PathProgramCache]: Analyzing trace with hash 657368747, now seen corresponding path program 1 times [2018-10-25 01:52:30,444 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:52:30,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:52:30,500 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:52:30,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:52:30,500 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:52:30,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:52:30,974 WARN L179 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-25 01:52:31,129 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:52:31,135 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:52:31,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-25 01:52:31,138 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:52:31,148 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-25 01:52:31,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-25 01:52:31,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-25 01:52:31,169 INFO L87 Difference]: Start difference. First operand 410 states. Second operand 3 states. [2018-10-25 01:52:36,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:52:36,033 INFO L93 Difference]: Finished difference Result 1156 states and 2144 transitions. [2018-10-25 01:52:36,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-25 01:52:36,037 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2018-10-25 01:52:36,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:52:36,065 INFO L225 Difference]: With dead ends: 1156 [2018-10-25 01:52:36,066 INFO L226 Difference]: Without dead ends: 744 [2018-10-25 01:52:36,079 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-25 01:52:36,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 744 states. [2018-10-25 01:52:36,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 744 to 744. [2018-10-25 01:52:36,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 744 states. [2018-10-25 01:52:36,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 744 states to 744 states and 1317 transitions. [2018-10-25 01:52:36,234 INFO L78 Accepts]: Start accepts. Automaton has 744 states and 1317 transitions. Word has length 49 [2018-10-25 01:52:36,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:52:36,234 INFO L481 AbstractCegarLoop]: Abstraction has 744 states and 1317 transitions. [2018-10-25 01:52:36,235 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-25 01:52:36,236 INFO L276 IsEmpty]: Start isEmpty. Operand 744 states and 1317 transitions. [2018-10-25 01:52:36,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-10-25 01:52:36,249 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:52:36,250 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:36,250 INFO L424 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:52:36,251 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:52:36,251 INFO L82 PathProgramCache]: Analyzing trace with hash 591590536, now seen corresponding path program 1 times [2018-10-25 01:52:36,251 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:52:36,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:52:36,254 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:52:36,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:52:36,254 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:52:36,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:52:36,864 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:52:36,865 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:52:36,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-25 01:52:36,865 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:52:36,867 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 01:52:36,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 01:52:36,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-25 01:52:36,868 INFO L87 Difference]: Start difference. First operand 744 states and 1317 transitions. Second operand 6 states. [2018-10-25 01:52:41,040 WARN L179 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-10-25 01:52:51,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:52:51,349 INFO L93 Difference]: Finished difference Result 2960 states and 5492 transitions. [2018-10-25 01:52:51,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-25 01:52:51,353 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 125 [2018-10-25 01:52:51,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:52:51,380 INFO L225 Difference]: With dead ends: 2960 [2018-10-25 01:52:51,380 INFO L226 Difference]: Without dead ends: 2222 [2018-10-25 01:52:51,395 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-10-25 01:52:51,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2222 states. [2018-10-25 01:52:51,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2222 to 2169. [2018-10-25 01:52:51,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2169 states. [2018-10-25 01:52:51,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2169 states to 2169 states and 3669 transitions. [2018-10-25 01:52:51,506 INFO L78 Accepts]: Start accepts. Automaton has 2169 states and 3669 transitions. Word has length 125 [2018-10-25 01:52:51,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:52:51,506 INFO L481 AbstractCegarLoop]: Abstraction has 2169 states and 3669 transitions. [2018-10-25 01:52:51,506 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 01:52:51,507 INFO L276 IsEmpty]: Start isEmpty. Operand 2169 states and 3669 transitions. [2018-10-25 01:52:51,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-10-25 01:52:51,511 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:52:51,511 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:51,512 INFO L424 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:52:51,512 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:52:51,512 INFO L82 PathProgramCache]: Analyzing trace with hash 975106256, now seen corresponding path program 1 times [2018-10-25 01:52:51,512 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:52:51,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:52:51,513 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:52:51,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:52:51,514 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:52:51,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:52:51,757 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:52:51,758 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:52:51,758 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-25 01:52:51,758 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:52:51,759 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 01:52:51,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 01:52:51,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 01:52:51,759 INFO L87 Difference]: Start difference. First operand 2169 states and 3669 transitions. Second operand 6 states. [2018-10-25 01:52:57,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:52:57,596 INFO L93 Difference]: Finished difference Result 8029 states and 14212 transitions. [2018-10-25 01:52:57,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 01:52:57,604 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 129 [2018-10-25 01:52:57,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:52:57,650 INFO L225 Difference]: With dead ends: 8029 [2018-10-25 01:52:57,650 INFO L226 Difference]: Without dead ends: 5866 [2018-10-25 01:52:57,684 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:52:57,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5866 states. [2018-10-25 01:52:57,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5866 to 5815. [2018-10-25 01:52:57,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5815 states. [2018-10-25 01:52:57,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5815 states to 5815 states and 8929 transitions. [2018-10-25 01:52:57,869 INFO L78 Accepts]: Start accepts. Automaton has 5815 states and 8929 transitions. Word has length 129 [2018-10-25 01:52:57,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:52:57,869 INFO L481 AbstractCegarLoop]: Abstraction has 5815 states and 8929 transitions. [2018-10-25 01:52:57,869 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 01:52:57,870 INFO L276 IsEmpty]: Start isEmpty. Operand 5815 states and 8929 transitions. [2018-10-25 01:52:57,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-10-25 01:52:57,873 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:52:57,873 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:57,873 INFO L424 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:52:57,874 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:52:57,874 INFO L82 PathProgramCache]: Analyzing trace with hash -834708748, now seen corresponding path program 1 times [2018-10-25 01:52:57,874 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:52:57,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:52:57,875 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:52:57,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:52:57,875 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:52:57,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:52:58,086 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:52:58,087 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:52:58,087 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-25 01:52:58,087 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:52:58,088 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 01:52:58,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 01:52:58,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 01:52:58,088 INFO L87 Difference]: Start difference. First operand 5815 states and 8929 transitions. Second operand 6 states. [2018-10-25 01:53:04,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:53:04,659 INFO L93 Difference]: Finished difference Result 14127 states and 22920 transitions. [2018-10-25 01:53:04,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 01:53:04,660 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 131 [2018-10-25 01:53:04,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:53:04,709 INFO L225 Difference]: With dead ends: 14127 [2018-10-25 01:53:04,709 INFO L226 Difference]: Without dead ends: 8318 [2018-10-25 01:53:04,751 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:53:04,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8318 states. [2018-10-25 01:53:04,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8318 to 8243. [2018-10-25 01:53:04,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8243 states. [2018-10-25 01:53:04,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8243 states to 8243 states and 12158 transitions. [2018-10-25 01:53:04,980 INFO L78 Accepts]: Start accepts. Automaton has 8243 states and 12158 transitions. Word has length 131 [2018-10-25 01:53:04,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:53:04,981 INFO L481 AbstractCegarLoop]: Abstraction has 8243 states and 12158 transitions. [2018-10-25 01:53:04,981 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 01:53:04,981 INFO L276 IsEmpty]: Start isEmpty. Operand 8243 states and 12158 transitions. [2018-10-25 01:53:04,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-10-25 01:53:04,984 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:53:04,984 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 01:53:04,985 INFO L424 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:53:04,985 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:53:04,985 INFO L82 PathProgramCache]: Analyzing trace with hash 845250593, now seen corresponding path program 1 times [2018-10-25 01:53:04,985 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:53:04,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:53:04,987 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:53:04,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:53:04,987 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:53:05,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:53:05,233 WARN L179 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-25 01:53:05,308 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:53:05,308 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:53:05,309 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-25 01:53:05,309 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:53:05,311 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 01:53:05,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 01:53:05,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 01:53:05,312 INFO L87 Difference]: Start difference. First operand 8243 states and 12158 transitions. Second operand 6 states. [2018-10-25 01:53:08,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:53:08,450 INFO L93 Difference]: Finished difference Result 19923 states and 31423 transitions. [2018-10-25 01:53:08,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 01:53:08,454 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 134 [2018-10-25 01:53:08,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:53:08,530 INFO L225 Difference]: With dead ends: 19923 [2018-10-25 01:53:08,531 INFO L226 Difference]: Without dead ends: 11686 [2018-10-25 01:53:08,567 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-25 01:53:08,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11686 states. [2018-10-25 01:53:08,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11686 to 11640. [2018-10-25 01:53:08,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11640 states. [2018-10-25 01:53:08,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11640 states to 11640 states and 16576 transitions. [2018-10-25 01:53:08,902 INFO L78 Accepts]: Start accepts. Automaton has 11640 states and 16576 transitions. Word has length 134 [2018-10-25 01:53:08,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:53:08,902 INFO L481 AbstractCegarLoop]: Abstraction has 11640 states and 16576 transitions. [2018-10-25 01:53:08,902 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 01:53:08,903 INFO L276 IsEmpty]: Start isEmpty. Operand 11640 states and 16576 transitions. [2018-10-25 01:53:08,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-10-25 01:53:08,905 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:53:08,906 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 01:53:08,906 INFO L424 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:53:08,906 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:53:08,906 INFO L82 PathProgramCache]: Analyzing trace with hash 1926747012, now seen corresponding path program 1 times [2018-10-25 01:53:08,907 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:53:08,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:53:08,908 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:53:08,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:53:08,908 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:53:08,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:53:09,176 WARN L179 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-25 01:53:09,585 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:53:09,586 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:53:09,586 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-25 01:53:09,586 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:53:09,587 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 01:53:09,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 01:53:09,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 01:53:09,588 INFO L87 Difference]: Start difference. First operand 11640 states and 16576 transitions. Second operand 6 states. [2018-10-25 01:53:13,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:53:13,750 INFO L93 Difference]: Finished difference Result 25059 states and 36462 transitions. [2018-10-25 01:53:13,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 01:53:13,751 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 139 [2018-10-25 01:53:13,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:53:13,808 INFO L225 Difference]: With dead ends: 25059 [2018-10-25 01:53:13,809 INFO L226 Difference]: Without dead ends: 13425 [2018-10-25 01:53:13,843 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-25 01:53:13,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13425 states. [2018-10-25 01:53:14,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13425 to 13399. [2018-10-25 01:53:14,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13399 states. [2018-10-25 01:53:14,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13399 states to 13399 states and 17766 transitions. [2018-10-25 01:53:14,140 INFO L78 Accepts]: Start accepts. Automaton has 13399 states and 17766 transitions. Word has length 139 [2018-10-25 01:53:14,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:53:14,140 INFO L481 AbstractCegarLoop]: Abstraction has 13399 states and 17766 transitions. [2018-10-25 01:53:14,140 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 01:53:14,141 INFO L276 IsEmpty]: Start isEmpty. Operand 13399 states and 17766 transitions. [2018-10-25 01:53:14,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-10-25 01:53:14,145 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:53:14,146 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 01:53:14,146 INFO L424 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:53:14,146 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:53:14,146 INFO L82 PathProgramCache]: Analyzing trace with hash 520725928, now seen corresponding path program 1 times [2018-10-25 01:53:14,147 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:53:14,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:53:14,153 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:53:14,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:53:14,153 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:53:14,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:53:14,421 WARN L179 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-25 01:53:14,672 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-25 01:53:14,672 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 01:53:14,672 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 01:53:14,673 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 142 with the following transitions: [2018-10-25 01:53:14,676 INFO L202 CegarAbsIntRunner]: [0], [1], [180], [187], [195], [203], [211], [219], [227], [235], [243], [251], [259], [267], [275], [283], [291], [299], [307], [315], [323], [331], [339], [347], [355], [363], [371], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [471], [473], [476], [484], [492], [500], [508], [516], [524], [532], [540], [548], [556], [564], [572], [580], [588], [596], [604], [612], [620], [628], [636], [644], [652], [660], [668], [673], [677], [681], [685], [689], [693], [697], [701], [705], [709], [713], [717], [721], [725], [729], [733], [737], [741], [745], [749], [753], [757], [760], [1552], [1556], [1560], [1566], [1570], [1572], [1579], [1580], [1581], [1583], [1584] [2018-10-25 01:53:14,749 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 01:53:14,750 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 01:53:15,760 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-25 01:53:15,762 INFO L272 AbstractInterpreter]: Visited 99 different actions 284 times. Merged at 5 different actions 9 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-10-25 01:53:15,807 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:53:15,807 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-25 01:53:16,530 INFO L232 lantSequenceWeakener]: Weakened 39 states. On average, predicates are now at 81.65% of their original sizes. [2018-10-25 01:53:16,530 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-25 01:53:18,615 INFO L413 sIntCurrentIteration]: We have 140 unified AI predicates [2018-10-25 01:53:18,616 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-25 01:53:18,617 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-25 01:53:18,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [4] total 16 [2018-10-25 01:53:18,617 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:53:18,618 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-25 01:53:18,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-25 01:53:18,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2018-10-25 01:53:18,619 INFO L87 Difference]: Start difference. First operand 13399 states and 17766 transitions. Second operand 14 states. [2018-10-25 01:54:00,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-25 01:54:00,446 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.ArithmeticException: BigInteger: modulus not positive at java.math.BigInteger.mod(BigInteger.java:2458) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.explicit.ExplicitValueValue.modulo(ExplicitValueValue.java:154) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.explicit.ExplicitValueValue.modulo(ExplicitValueValue.java:1) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:125) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:100) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:92) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:92) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:93) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.ConditionalEvaluator.evaluate(ConditionalEvaluator.java:78) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.ConditionalEvaluator.evaluate(ConditionalEvaluator.java:1) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:93) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:92) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:92) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.ConditionalEvaluator.evaluate(ConditionalEvaluator.java:78) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.ConditionalEvaluator.evaluate(ConditionalEvaluator.java:1) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:93) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.handleAssumeStatement(NonrelationalStatementProcessor.java:363) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.processStatement(NonrelationalStatementProcessor.java:160) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.process(NonrelationalStatementProcessor.java:142) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.process(NonrelationalStatementProcessor.java:128) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.handleInternalTransition(NonrelationalPostOperator.java:362) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.handleInternalTransition(NonrelationalPostOperator.java:353) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.apply(NonrelationalPostOperator.java:125) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.apply(NonrelationalPostOperator.java:1) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.compound.CompoundDomainPostOperator.applyInternally(CompoundDomainPostOperator.java:306) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.compound.CompoundDomainPostOperator.apply(CompoundDomainPostOperator.java:131) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.compound.CompoundDomainPostOperator.apply(CompoundDomainPostOperator.java:1) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.applyPost(TermConjunctEvaluator.java:305) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.lambda$4(TermConjunctEvaluator.java:178) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.computeFixpoint(TermConjunctEvaluator.java:198) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.lambda$1(TermConjunctEvaluator.java:150) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.computePost(TermConjunctEvaluator.java:93) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormanCachedPostOperation.applyPost(PoormanCachedPostOperation.java:308) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormansAbstractPostOperator.applyPost(PoormansAbstractPostOperator.java:217) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormansAbstractPostOperator.apply(PoormansAbstractPostOperator.java:119) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormansAbstractPostOperator.apply(PoormansAbstractPostOperator.java:1) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.DisjunctiveAbstractState.lambda$17(DisjunctiveAbstractState.java:369) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.DisjunctiveAbstractState.mapCollection(DisjunctiveAbstractState.java:537) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.DisjunctiveAbstractState.apply(DisjunctiveAbstractState.java:369) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.AbsIntHoareTripleChecker.checkInternalTransitionWithValidState(AbsIntHoareTripleChecker.java:352) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.AbsIntHoareTripleChecker.checkInternalAbsInt(AbsIntHoareTripleChecker.java:249) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.AbsIntHoareTripleChecker.checkInternal(AbsIntHoareTripleChecker.java:181) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.CachingHoareTripleChecker.checkInternal(CachingHoareTripleChecker.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton$InternalSuccessorComputationHelper.computeSuccWithSolver(AbstractInterpolantAutomaton.java:359) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.addOtherSuccessors(DeterministicInterpolantAutomaton.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1066) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:968) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:188) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:673) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:602) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:473) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-10-25 01:54:00,451 INFO L168 Benchmark]: Toolchain (without parser) took 100154.41 ms. Allocated memory was 1.5 GB in the beginning and 4.1 GB in the end (delta: 2.6 GB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -751.1 MB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. [2018-10-25 01:54:00,453 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-25 01:54:00,453 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1164.22 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 84.6 MB). Peak memory consumption was 84.6 MB. Max. memory is 7.1 GB. [2018-10-25 01:54:00,454 INFO L168 Benchmark]: Boogie Procedure Inliner took 313.12 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 745.5 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -857.0 MB). Peak memory consumption was 28.7 MB. Max. memory is 7.1 GB. [2018-10-25 01:54:00,455 INFO L168 Benchmark]: Boogie Preprocessor took 204.98 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: 14.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 7.1 GB. [2018-10-25 01:54:00,456 INFO L168 Benchmark]: RCFGBuilder took 8311.70 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 275.4 MB). Peak memory consumption was 275.4 MB. Max. memory is 7.1 GB. [2018-10-25 01:54:00,457 INFO L168 Benchmark]: TraceAbstraction took 90155.62 ms. Allocated memory was 2.3 GB in the beginning and 4.1 GB in the end (delta: 1.8 GB). Free memory was 1.9 GB in the beginning and 2.2 GB in the end (delta: -268.3 MB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2018-10-25 01:54:00,462 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.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1164.22 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 84.6 MB). Peak memory consumption was 84.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 313.12 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 745.5 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -857.0 MB). Peak memory consumption was 28.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 204.98 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: 14.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 8311.70 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 275.4 MB). Peak memory consumption was 275.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 90155.62 ms. Allocated memory was 2.3 GB in the beginning and 4.1 GB in the end (delta: 1.8 GB). Free memory was 1.9 GB in the beginning and 2.2 GB in the end (delta: -268.3 MB). Peak memory consumption was 1.6 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...