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/Problem15_label46_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-25 01:50:12,186 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-25 01:50:12,190 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-25 01:50:12,205 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-25 01:50:12,205 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-25 01:50:12,206 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-25 01:50:12,208 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-25 01:50:12,209 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-25 01:50:12,211 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-25 01:50:12,212 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-25 01:50:12,213 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-25 01:50:12,213 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-25 01:50:12,214 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-25 01:50:12,215 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-25 01:50:12,216 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-25 01:50:12,217 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-25 01:50:12,218 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-25 01:50:12,220 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-25 01:50:12,222 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-25 01:50:12,224 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-25 01:50:12,225 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-25 01:50:12,226 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-25 01:50:12,229 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-25 01:50:12,229 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-25 01:50:12,230 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-25 01:50:12,233 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-25 01:50:12,234 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-25 01:50:12,234 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-25 01:50:12,237 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-25 01:50:12,239 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-25 01:50:12,241 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-25 01:50:12,243 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-25 01:50:12,244 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-25 01:50:12,244 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-25 01:50:12,245 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-25 01:50:12,246 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-25 01:50:12,246 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:50:12,275 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-25 01:50:12,276 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-25 01:50:12,277 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-25 01:50:12,277 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-25 01:50:12,277 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-25 01:50:12,278 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-25 01:50:12,278 INFO L133 SettingsManager]: * Explicit value domain=true [2018-10-25 01:50:12,278 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-25 01:50:12,278 INFO L133 SettingsManager]: * Octagon Domain=false [2018-10-25 01:50:12,278 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-25 01:50:12,279 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-25 01:50:12,279 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-25 01:50:12,279 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-25 01:50:12,279 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-25 01:50:12,280 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-25 01:50:12,280 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-25 01:50:12,281 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-25 01:50:12,281 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-25 01:50:12,281 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-25 01:50:12,281 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-25 01:50:12,281 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-25 01:50:12,281 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-25 01:50:12,283 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-25 01:50:12,283 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-25 01:50:12,283 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-25 01:50:12,283 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-25 01:50:12,283 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-25 01:50:12,283 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-25 01:50:12,283 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-25 01:50:12,284 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-25 01:50:12,284 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-25 01:50:12,284 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-25 01:50:12,284 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-25 01:50:12,284 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-25 01:50:12,284 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-25 01:50:12,285 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-25 01:50:12,330 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-25 01:50:12,344 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-25 01:50:12,349 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-25 01:50:12,351 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-25 01:50:12,351 INFO L276 PluginConnector]: CDTParser initialized [2018-10-25 01:50:12,352 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem15_label46_true-unreach-call.c [2018-10-25 01:50:12,413 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/414835c17/f5f57dffe5424b74938860b100192d31/FLAGe7a5b622e [2018-10-25 01:50:13,121 INFO L298 CDTParser]: Found 1 translation units. [2018-10-25 01:50:13,122 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem15_label46_true-unreach-call.c [2018-10-25 01:50:13,143 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/414835c17/f5f57dffe5424b74938860b100192d31/FLAGe7a5b622e [2018-10-25 01:50:13,163 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/414835c17/f5f57dffe5424b74938860b100192d31 [2018-10-25 01:50:13,177 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-25 01:50:13,179 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-25 01:50:13,180 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-25 01:50:13,180 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-25 01:50:13,185 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-25 01:50:13,187 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 01:50:13" (1/1) ... [2018-10-25 01:50:13,190 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7670273 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:50:13, skipping insertion in model container [2018-10-25 01:50:13,191 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 01:50:13" (1/1) ... [2018-10-25 01:50:13,201 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-25 01:50:13,308 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-25 01:50:14,075 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-25 01:50:14,079 INFO L189 MainTranslator]: Completed pre-run [2018-10-25 01:50:14,384 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-25 01:50:14,404 INFO L193 MainTranslator]: Completed translation [2018-10-25 01:50:14,405 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:50:14 WrapperNode [2018-10-25 01:50:14,405 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-25 01:50:14,406 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-25 01:50:14,407 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-25 01:50:14,407 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-25 01:50:14,417 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:50:14" (1/1) ... [2018-10-25 01:50:14,465 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:50:14" (1/1) ... [2018-10-25 01:50:14,829 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-25 01:50:14,829 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-25 01:50:14,830 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-25 01:50:14,830 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-25 01:50:14,841 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:50:14" (1/1) ... [2018-10-25 01:50:14,841 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:50:14" (1/1) ... [2018-10-25 01:50:14,859 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:50:14" (1/1) ... [2018-10-25 01:50:14,859 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:50:14" (1/1) ... [2018-10-25 01:50:14,935 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:50:14" (1/1) ... [2018-10-25 01:50:14,963 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:50:14" (1/1) ... [2018-10-25 01:50:14,995 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:50:14" (1/1) ... [2018-10-25 01:50:15,036 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-25 01:50:15,037 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-25 01:50:15,037 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-25 01:50:15,037 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-25 01:50:15,038 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:50:14" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-25 01:50:15,105 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-25 01:50:15,106 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-25 01:50:15,106 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2018-10-25 01:50:15,107 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2018-10-25 01:50:15,107 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-10-25 01:50:15,107 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-10-25 01:50:15,107 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-25 01:50:15,108 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-25 01:50:15,108 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-25 01:50:15,108 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-25 01:50:23,541 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-25 01:50:23,542 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 01:50:23 BoogieIcfgContainer [2018-10-25 01:50:23,543 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-25 01:50:23,544 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-25 01:50:23,544 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-25 01:50:23,548 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-25 01:50:23,548 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.10 01:50:13" (1/3) ... [2018-10-25 01:50:23,549 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60ba66da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 01:50:23, skipping insertion in model container [2018-10-25 01:50:23,549 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:50:14" (2/3) ... [2018-10-25 01:50:23,549 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60ba66da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 01:50:23, skipping insertion in model container [2018-10-25 01:50:23,550 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 01:50:23" (3/3) ... [2018-10-25 01:50:23,551 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem15_label46_true-unreach-call.c [2018-10-25 01:50:23,562 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-25 01:50:23,570 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-25 01:50:23,588 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-25 01:50:23,630 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-25 01:50:23,630 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-25 01:50:23,631 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-25 01:50:23,631 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-25 01:50:23,631 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-25 01:50:23,631 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-25 01:50:23,631 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-25 01:50:23,632 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-25 01:50:23,665 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states. [2018-10-25 01:50:23,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-10-25 01:50:23,675 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:50:23,676 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 01:50:23,681 INFO L424 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:50:23,689 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:50:23,689 INFO L82 PathProgramCache]: Analyzing trace with hash -171109996, now seen corresponding path program 1 times [2018-10-25 01:50:23,693 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:50:23,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:50:23,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:50:23,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:50:23,752 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:50:23,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:50:24,207 WARN L179 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-25 01:50:24,340 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:50:24,342 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:50:24,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-25 01:50:24,343 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:50:24,350 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-25 01:50:24,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-25 01:50:24,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-25 01:50:24,372 INFO L87 Difference]: Start difference. First operand 438 states. Second operand 3 states. [2018-10-25 01:50:28,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:50:28,884 INFO L93 Difference]: Finished difference Result 1198 states and 2158 transitions. [2018-10-25 01:50:28,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-25 01:50:28,887 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2018-10-25 01:50:28,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:50:28,913 INFO L225 Difference]: With dead ends: 1198 [2018-10-25 01:50:28,914 INFO L226 Difference]: Without dead ends: 758 [2018-10-25 01:50:28,925 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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:50:28,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 758 states. [2018-10-25 01:50:29,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 758 to 754. [2018-10-25 01:50:29,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 754 states. [2018-10-25 01:50:29,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 1328 transitions. [2018-10-25 01:50:29,101 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 1328 transitions. Word has length 50 [2018-10-25 01:50:29,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:50:29,102 INFO L481 AbstractCegarLoop]: Abstraction has 754 states and 1328 transitions. [2018-10-25 01:50:29,103 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-25 01:50:29,103 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 1328 transitions. [2018-10-25 01:50:29,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-10-25 01:50:29,118 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:50:29,119 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:29,119 INFO L424 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:50:29,119 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:50:29,120 INFO L82 PathProgramCache]: Analyzing trace with hash 1340083984, now seen corresponding path program 1 times [2018-10-25 01:50:29,120 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:50:29,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:50:29,122 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:50:29,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:50:29,122 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:50:29,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:50:29,591 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:50:29,592 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:50:29,592 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-25 01:50:29,592 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:50:29,595 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-25 01:50:29,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-25 01:50:29,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-25 01:50:29,595 INFO L87 Difference]: Start difference. First operand 754 states and 1328 transitions. Second operand 5 states. [2018-10-25 01:50:37,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:50:37,984 INFO L93 Difference]: Finished difference Result 2229 states and 3961 transitions. [2018-10-25 01:50:37,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-25 01:50:37,988 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 124 [2018-10-25 01:50:37,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:50:38,005 INFO L225 Difference]: With dead ends: 2229 [2018-10-25 01:50:38,006 INFO L226 Difference]: Without dead ends: 1481 [2018-10-25 01:50:38,011 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-10-25 01:50:38,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1481 states. [2018-10-25 01:50:38,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1481 to 1449. [2018-10-25 01:50:38,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1449 states. [2018-10-25 01:50:38,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1449 states to 1449 states and 2254 transitions. [2018-10-25 01:50:38,078 INFO L78 Accepts]: Start accepts. Automaton has 1449 states and 2254 transitions. Word has length 124 [2018-10-25 01:50:38,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:50:38,079 INFO L481 AbstractCegarLoop]: Abstraction has 1449 states and 2254 transitions. [2018-10-25 01:50:38,079 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-25 01:50:38,079 INFO L276 IsEmpty]: Start isEmpty. Operand 1449 states and 2254 transitions. [2018-10-25 01:50:38,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-10-25 01:50:38,086 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:50:38,086 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:38,086 INFO L424 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:50:38,087 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:50:38,087 INFO L82 PathProgramCache]: Analyzing trace with hash 1528606616, now seen corresponding path program 1 times [2018-10-25 01:50:38,087 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:50:38,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:50:38,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:50:38,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:50:38,095 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:50:38,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:50:38,379 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:50:38,379 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:50:38,379 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-25 01:50:38,379 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:50:38,380 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 01:50:38,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 01:50:38,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 01:50:38,381 INFO L87 Difference]: Start difference. First operand 1449 states and 2254 transitions. Second operand 6 states. [2018-10-25 01:50:46,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:50:46,675 INFO L93 Difference]: Finished difference Result 4188 states and 6605 transitions. [2018-10-25 01:50:46,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 01:50:46,676 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 136 [2018-10-25 01:50:46,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:50:46,698 INFO L225 Difference]: With dead ends: 4188 [2018-10-25 01:50:46,698 INFO L226 Difference]: Without dead ends: 2745 [2018-10-25 01:50:46,708 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:50:46,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2745 states. [2018-10-25 01:50:46,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2745 to 2711. [2018-10-25 01:50:46,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2711 states. [2018-10-25 01:50:46,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2711 states to 2711 states and 3819 transitions. [2018-10-25 01:50:46,803 INFO L78 Accepts]: Start accepts. Automaton has 2711 states and 3819 transitions. Word has length 136 [2018-10-25 01:50:46,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:50:46,803 INFO L481 AbstractCegarLoop]: Abstraction has 2711 states and 3819 transitions. [2018-10-25 01:50:46,803 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 01:50:46,804 INFO L276 IsEmpty]: Start isEmpty. Operand 2711 states and 3819 transitions. [2018-10-25 01:50:46,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-10-25 01:50:46,807 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:50:46,807 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:46,807 INFO L424 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:50:46,807 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:50:46,809 INFO L82 PathProgramCache]: Analyzing trace with hash -929559410, now seen corresponding path program 1 times [2018-10-25 01:50:46,809 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:50:46,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:50:46,810 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:50:46,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:50:46,810 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:50:46,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:50:47,054 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:50:47,054 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:50:47,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-25 01:50:47,055 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:50:47,055 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 01:50:47,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 01:50:47,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 01:50:47,056 INFO L87 Difference]: Start difference. First operand 2711 states and 3819 transitions. Second operand 6 states. [2018-10-25 01:50:53,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:50:53,225 INFO L93 Difference]: Finished difference Result 6682 states and 9546 transitions. [2018-10-25 01:50:53,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 01:50:53,226 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 137 [2018-10-25 01:50:53,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:50:53,250 INFO L225 Difference]: With dead ends: 6682 [2018-10-25 01:50:53,251 INFO L226 Difference]: Without dead ends: 3977 [2018-10-25 01:50:53,264 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:50:53,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3977 states. [2018-10-25 01:50:53,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3977 to 3953. [2018-10-25 01:50:53,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3953 states. [2018-10-25 01:50:53,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3953 states to 3953 states and 5247 transitions. [2018-10-25 01:50:53,390 INFO L78 Accepts]: Start accepts. Automaton has 3953 states and 5247 transitions. Word has length 137 [2018-10-25 01:50:53,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:50:53,391 INFO L481 AbstractCegarLoop]: Abstraction has 3953 states and 5247 transitions. [2018-10-25 01:50:53,391 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 01:50:53,391 INFO L276 IsEmpty]: Start isEmpty. Operand 3953 states and 5247 transitions. [2018-10-25 01:50:53,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-10-25 01:50:53,395 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:50:53,396 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:53,396 INFO L424 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:50:53,396 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:50:53,397 INFO L82 PathProgramCache]: Analyzing trace with hash -470998967, now seen corresponding path program 1 times [2018-10-25 01:50:53,397 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:50:53,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:50:53,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:50:53,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:50:53,398 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:50:53,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:50:53,946 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:50:53,947 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:50:53,947 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-25 01:50:53,947 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:50:53,947 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 01:50:53,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 01:50:53,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-25 01:50:53,948 INFO L87 Difference]: Start difference. First operand 3953 states and 5247 transitions. Second operand 6 states. [2018-10-25 01:51:09,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:51:09,526 INFO L93 Difference]: Finished difference Result 14072 states and 19014 transitions. [2018-10-25 01:51:09,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-25 01:51:09,527 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 177 [2018-10-25 01:51:09,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:51:09,579 INFO L225 Difference]: With dead ends: 14072 [2018-10-25 01:51:09,579 INFO L226 Difference]: Without dead ends: 10125 [2018-10-25 01:51:09,605 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-10-25 01:51:09,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10125 states. [2018-10-25 01:51:09,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10125 to 9916. [2018-10-25 01:51:09,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9916 states. [2018-10-25 01:51:09,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9916 states to 9916 states and 12557 transitions. [2018-10-25 01:51:09,846 INFO L78 Accepts]: Start accepts. Automaton has 9916 states and 12557 transitions. Word has length 177 [2018-10-25 01:51:09,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:51:09,846 INFO L481 AbstractCegarLoop]: Abstraction has 9916 states and 12557 transitions. [2018-10-25 01:51:09,846 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 01:51:09,847 INFO L276 IsEmpty]: Start isEmpty. Operand 9916 states and 12557 transitions. [2018-10-25 01:51:09,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2018-10-25 01:51:09,854 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:51:09,855 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-25 01:51:09,855 INFO L424 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:51:09,855 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:51:09,855 INFO L82 PathProgramCache]: Analyzing trace with hash 933056982, now seen corresponding path program 1 times [2018-10-25 01:51:09,856 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:51:09,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:51:09,856 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:51:09,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:51:09,857 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:51:09,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:51:10,154 WARN L179 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 8 DAG size of output: 5 [2018-10-25 01:51:10,185 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-10-25 01:51:10,186 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:51:10,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-25 01:51:10,186 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:51:10,187 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-25 01:51:10,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-25 01:51:10,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-25 01:51:10,187 INFO L87 Difference]: Start difference. First operand 9916 states and 12557 transitions. Second operand 4 states. [2018-10-25 01:51:18,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:51:18,870 INFO L93 Difference]: Finished difference Result 26048 states and 34184 transitions. [2018-10-25 01:51:18,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-25 01:51:18,870 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 205 [2018-10-25 01:51:18,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:51:18,942 INFO L225 Difference]: With dead ends: 26048 [2018-10-25 01:51:18,942 INFO L226 Difference]: Without dead ends: 16138 [2018-10-25 01:51:18,990 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-25 01:51:19,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16138 states. [2018-10-25 01:51:19,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16138 to 15819. [2018-10-25 01:51:19,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15819 states. [2018-10-25 01:51:19,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15819 states to 15819 states and 19538 transitions. [2018-10-25 01:51:19,353 INFO L78 Accepts]: Start accepts. Automaton has 15819 states and 19538 transitions. Word has length 205 [2018-10-25 01:51:19,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:51:19,353 INFO L481 AbstractCegarLoop]: Abstraction has 15819 states and 19538 transitions. [2018-10-25 01:51:19,353 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-25 01:51:19,354 INFO L276 IsEmpty]: Start isEmpty. Operand 15819 states and 19538 transitions. [2018-10-25 01:51:19,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2018-10-25 01:51:19,366 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:51:19,366 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-25 01:51:19,367 INFO L424 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:51:19,367 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:51:19,367 INFO L82 PathProgramCache]: Analyzing trace with hash -75498616, now seen corresponding path program 1 times [2018-10-25 01:51:19,367 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:51:19,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:51:19,372 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:51:19,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:51:19,372 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:51:19,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:51:19,629 WARN L179 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 3 [2018-10-25 01:51:19,654 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-10-25 01:51:19,655 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:51:19,655 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-25 01:51:19,655 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:51:19,656 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-25 01:51:19,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-25 01:51:19,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-25 01:51:19,657 INFO L87 Difference]: Start difference. First operand 15819 states and 19538 transitions. Second operand 3 states. [2018-10-25 01:51:24,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:51:24,026 INFO L93 Difference]: Finished difference Result 36397 states and 46181 transitions. [2018-10-25 01:51:24,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-25 01:51:24,026 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 218 [2018-10-25 01:51:24,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:51:24,123 INFO L225 Difference]: With dead ends: 36397 [2018-10-25 01:51:24,124 INFO L226 Difference]: Without dead ends: 20584 [2018-10-25 01:51:24,167 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-25 01:51:24,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20584 states. [2018-10-25 01:51:24,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20584 to 20530. [2018-10-25 01:51:24,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20530 states. [2018-10-25 01:51:24,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20530 states to 20530 states and 25907 transitions. [2018-10-25 01:51:24,605 INFO L78 Accepts]: Start accepts. Automaton has 20530 states and 25907 transitions. Word has length 218 [2018-10-25 01:51:24,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:51:24,605 INFO L481 AbstractCegarLoop]: Abstraction has 20530 states and 25907 transitions. [2018-10-25 01:51:24,606 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-25 01:51:24,606 INFO L276 IsEmpty]: Start isEmpty. Operand 20530 states and 25907 transitions. [2018-10-25 01:51:24,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2018-10-25 01:51:24,620 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:51:24,621 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 01:51:24,621 INFO L424 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:51:24,621 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:51:24,621 INFO L82 PathProgramCache]: Analyzing trace with hash 976466900, now seen corresponding path program 1 times [2018-10-25 01:51:24,622 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:51:24,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:51:24,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:51:24,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:51:24,623 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:51:24,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:51:25,286 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 91 proven. 2 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2018-10-25 01:51:25,287 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 01:51:25,287 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 01:51:25,288 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 232 with the following transitions: [2018-10-25 01:51:25,290 INFO L202 CegarAbsIntRunner]: [0], [1], [74], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [373], [375], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [498], [506], [514], [522], [530], [538], [546], [554], [562], [567], [571], [582], [586], [590], [594], [598], [602], [606], [610], [614], [617], [618], [622], [626], [630], [641], [645], [649], [653], [657], [668], [672], [676], [680], [684], [688], [692], [696], [707], [711], [714], [1635], [1639], [1643], [1649], [1653], [1655], [1662], [1663], [1664], [1666], [1667] [2018-10-25 01:51:25,346 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 01:51:25,346 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 01:51:26,129 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-25 01:51:26,131 INFO L272 AbstractInterpreter]: Visited 105 different actions 105 times. Never merged. Never widened. Never found a fixpoint. Largest state had 24 variables. [2018-10-25 01:51:26,175 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:51:26,175 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-25 01:51:27,138 INFO L232 lantSequenceWeakener]: Weakened 222 states. On average, predicates are now at 77.96% of their original sizes. [2018-10-25 01:51:27,138 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-25 01:51:27,390 INFO L413 sIntCurrentIteration]: We have 230 unified AI predicates [2018-10-25 01:51:27,390 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-25 01:51:27,391 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-25 01:51:27,391 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 11 [2018-10-25 01:51:27,391 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:51:27,392 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 01:51:27,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 01:51:27,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 01:51:27,393 INFO L87 Difference]: Start difference. First operand 20530 states and 25907 transitions. Second operand 6 states. [2018-10-25 01:52:16,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-25 01:52:16,708 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.ArithmeticException: BigInteger: modulus not positive at java.math.BigInteger.mod(BigInteger.java:2458) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.explicit.ExplicitValueValue.modulo(ExplicitValueValue.java:154) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.explicit.ExplicitValueValue.modulo(ExplicitValueValue.java:1) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:125) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:100) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:92) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:92) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:92) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.ConditionalEvaluator.evaluate(ConditionalEvaluator.java:78) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.ConditionalEvaluator.evaluate(ConditionalEvaluator.java:1) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:93) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.handleAssumeStatement(NonrelationalStatementProcessor.java:363) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.processStatement(NonrelationalStatementProcessor.java:160) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.process(NonrelationalStatementProcessor.java:142) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.process(NonrelationalStatementProcessor.java:128) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.handleInternalTransition(NonrelationalPostOperator.java:362) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.handleInternalTransition(NonrelationalPostOperator.java:353) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.apply(NonrelationalPostOperator.java:125) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.apply(NonrelationalPostOperator.java:1) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.compound.CompoundDomainPostOperator.applyInternally(CompoundDomainPostOperator.java:306) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.compound.CompoundDomainPostOperator.apply(CompoundDomainPostOperator.java:131) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.compound.CompoundDomainPostOperator.apply(CompoundDomainPostOperator.java:1) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.applyPost(TermConjunctEvaluator.java:305) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.lambda$4(TermConjunctEvaluator.java:178) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.computeFixpoint(TermConjunctEvaluator.java:198) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.lambda$1(TermConjunctEvaluator.java:150) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.computePost(TermConjunctEvaluator.java:93) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormanCachedPostOperation.applyPost(PoormanCachedPostOperation.java:308) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormansAbstractPostOperator.applyPost(PoormansAbstractPostOperator.java:217) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormansAbstractPostOperator.apply(PoormansAbstractPostOperator.java:119) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormansAbstractPostOperator.apply(PoormansAbstractPostOperator.java:1) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.DisjunctiveAbstractState.lambda$17(DisjunctiveAbstractState.java:369) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.DisjunctiveAbstractState.mapCollection(DisjunctiveAbstractState.java:537) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.DisjunctiveAbstractState.apply(DisjunctiveAbstractState.java:369) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.AbsIntHoareTripleChecker.checkInternalTransitionWithValidState(AbsIntHoareTripleChecker.java:352) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.AbsIntHoareTripleChecker.checkInternalAbsInt(AbsIntHoareTripleChecker.java:249) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.AbsIntHoareTripleChecker.checkInternal(AbsIntHoareTripleChecker.java:181) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.CachingHoareTripleChecker.checkInternal(CachingHoareTripleChecker.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton$InternalSuccessorComputationHelper.computeSuccWithSolver(AbstractInterpolantAutomaton.java:359) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.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:52:16,715 INFO L168 Benchmark]: Toolchain (without parser) took 123536.92 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.6 GB in the end (delta: -2.2 GB). Peak memory consumption was 375.8 MB. Max. memory is 7.1 GB. [2018-10-25 01:52:16,716 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-25 01:52:16,717 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1225.89 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: 105.9 MB). Peak memory consumption was 105.9 MB. Max. memory is 7.1 GB. [2018-10-25 01:52:16,718 INFO L168 Benchmark]: Boogie Procedure Inliner took 422.88 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 740.3 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -853.7 MB). Peak memory consumption was 33.4 MB. Max. memory is 7.1 GB. [2018-10-25 01:52:16,719 INFO L168 Benchmark]: Boogie Preprocessor took 206.78 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 29.2 MB). Peak memory consumption was 29.2 MB. Max. memory is 7.1 GB. [2018-10-25 01:52:16,719 INFO L168 Benchmark]: RCFGBuilder took 8506.21 ms. Allocated memory is still 2.3 GB. Free memory was 2.1 GB in the beginning and 1.8 GB in the end (delta: 302.0 MB). Peak memory consumption was 302.0 MB. Max. memory is 7.1 GB. [2018-10-25 01:52:16,720 INFO L168 Benchmark]: TraceAbstraction took 113170.04 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.8 GB in the beginning and 3.6 GB in the end (delta: -1.8 GB). Peak memory consumption was 52.2 MB. Max. memory is 7.1 GB. [2018-10-25 01:52:16,726 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1225.89 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: 105.9 MB). Peak memory consumption was 105.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 422.88 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 740.3 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -853.7 MB). Peak memory consumption was 33.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 206.78 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 29.2 MB). Peak memory consumption was 29.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 8506.21 ms. Allocated memory is still 2.3 GB. Free memory was 2.1 GB in the beginning and 1.8 GB in the end (delta: 302.0 MB). Peak memory consumption was 302.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 113170.04 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.8 GB in the beginning and 3.6 GB in the end (delta: -1.8 GB). Peak memory consumption was 52.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...