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/Problem18_label53_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-25 02:07:51,178 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-25 02:07:51,180 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-25 02:07:51,192 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-25 02:07:51,192 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-25 02:07:51,193 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-25 02:07:51,194 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-25 02:07:51,196 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-25 02:07:51,198 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-25 02:07:51,199 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-25 02:07:51,200 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-25 02:07:51,200 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-25 02:07:51,201 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-25 02:07:51,202 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-25 02:07:51,203 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-25 02:07:51,204 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-25 02:07:51,205 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-25 02:07:51,206 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-25 02:07:51,208 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-25 02:07:51,210 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-25 02:07:51,211 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-25 02:07:51,212 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-25 02:07:51,215 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-25 02:07:51,215 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-25 02:07:51,215 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-25 02:07:51,216 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-25 02:07:51,217 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-25 02:07:51,218 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-25 02:07:51,219 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-25 02:07:51,220 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-25 02:07:51,220 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-25 02:07:51,221 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-25 02:07:51,221 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-25 02:07:51,221 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-25 02:07:51,222 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-25 02:07:51,223 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-25 02:07:51,223 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 02:07:51,248 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-25 02:07:51,249 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-25 02:07:51,249 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-25 02:07:51,250 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-25 02:07:51,250 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-25 02:07:51,250 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-25 02:07:51,251 INFO L133 SettingsManager]: * Explicit value domain=true [2018-10-25 02:07:51,251 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-25 02:07:51,251 INFO L133 SettingsManager]: * Octagon Domain=false [2018-10-25 02:07:51,251 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-25 02:07:51,251 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-25 02:07:51,252 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-25 02:07:51,252 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-25 02:07:51,252 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-25 02:07:51,253 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-25 02:07:51,253 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-25 02:07:51,253 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-25 02:07:51,253 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-25 02:07:51,253 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-25 02:07:51,254 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-25 02:07:51,254 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-25 02:07:51,254 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-25 02:07:51,255 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-25 02:07:51,255 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-25 02:07:51,255 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-25 02:07:51,255 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-25 02:07:51,256 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-25 02:07:51,256 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-25 02:07:51,256 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-25 02:07:51,256 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-25 02:07:51,256 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-25 02:07:51,256 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-25 02:07:51,257 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-25 02:07:51,257 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-25 02:07:51,257 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-25 02:07:51,257 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-25 02:07:51,320 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-25 02:07:51,335 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-25 02:07:51,340 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-25 02:07:51,342 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-25 02:07:51,342 INFO L276 PluginConnector]: CDTParser initialized [2018-10-25 02:07:51,343 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem18_label53_true-unreach-call.c [2018-10-25 02:07:51,403 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/e4432abd0/46251cce553a4626a44af30d1c65bf0a/FLAGd2e005353 [2018-10-25 02:07:52,160 INFO L298 CDTParser]: Found 1 translation units. [2018-10-25 02:07:52,161 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem18_label53_true-unreach-call.c [2018-10-25 02:07:52,188 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/e4432abd0/46251cce553a4626a44af30d1c65bf0a/FLAGd2e005353 [2018-10-25 02:07:52,209 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/e4432abd0/46251cce553a4626a44af30d1c65bf0a [2018-10-25 02:07:52,220 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-25 02:07:52,222 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-25 02:07:52,223 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-25 02:07:52,223 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-25 02:07:52,228 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-25 02:07:52,230 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 02:07:52" (1/1) ... [2018-10-25 02:07:52,233 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8de4687 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 02:07:52, skipping insertion in model container [2018-10-25 02:07:52,233 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 02:07:52" (1/1) ... [2018-10-25 02:07:52,244 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-25 02:07:52,375 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-25 02:07:53,512 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-25 02:07:53,517 INFO L189 MainTranslator]: Completed pre-run [2018-10-25 02:07:53,967 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-25 02:07:53,996 INFO L193 MainTranslator]: Completed translation [2018-10-25 02:07:53,997 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 02:07:53 WrapperNode [2018-10-25 02:07:53,997 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-25 02:07:53,998 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-25 02:07:53,998 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-25 02:07:53,999 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-25 02:07:54,009 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 02:07:53" (1/1) ... [2018-10-25 02:07:54,060 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 02:07:53" (1/1) ... [2018-10-25 02:07:54,365 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-25 02:07:54,365 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-25 02:07:54,366 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-25 02:07:54,366 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-25 02:07:54,376 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 02:07:53" (1/1) ... [2018-10-25 02:07:54,376 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 02:07:53" (1/1) ... [2018-10-25 02:07:54,389 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 02:07:53" (1/1) ... [2018-10-25 02:07:54,390 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 02:07:53" (1/1) ... [2018-10-25 02:07:54,476 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 02:07:53" (1/1) ... [2018-10-25 02:07:54,512 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 02:07:53" (1/1) ... [2018-10-25 02:07:54,533 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 02:07:53" (1/1) ... [2018-10-25 02:07:54,557 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-25 02:07:54,558 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-25 02:07:54,558 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-25 02:07:54,558 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-25 02:07:54,559 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 02:07:53" (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 02:07:54,632 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-25 02:07:54,632 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-25 02:07:54,632 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output3 [2018-10-25 02:07:54,632 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output3 [2018-10-25 02:07:54,633 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2018-10-25 02:07:54,633 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2018-10-25 02:07:54,633 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-10-25 02:07:54,633 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-10-25 02:07:54,634 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-25 02:07:54,634 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-25 02:07:54,634 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-25 02:07:54,634 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-25 02:08:03,260 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-25 02:08:03,261 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 02:08:03 BoogieIcfgContainer [2018-10-25 02:08:03,261 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-25 02:08:03,263 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-25 02:08:03,263 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-25 02:08:03,266 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-25 02:08:03,266 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.10 02:07:52" (1/3) ... [2018-10-25 02:08:03,267 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cb0b389 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 02:08:03, skipping insertion in model container [2018-10-25 02:08:03,267 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 02:07:53" (2/3) ... [2018-10-25 02:08:03,268 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cb0b389 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 02:08:03, skipping insertion in model container [2018-10-25 02:08:03,268 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 02:08:03" (3/3) ... [2018-10-25 02:08:03,270 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem18_label53_true-unreach-call.c [2018-10-25 02:08:03,281 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-25 02:08:03,294 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-25 02:08:03,312 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-25 02:08:03,360 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-25 02:08:03,360 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-25 02:08:03,360 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-25 02:08:03,360 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-25 02:08:03,361 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-25 02:08:03,361 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-25 02:08:03,361 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-25 02:08:03,361 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-25 02:08:03,403 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states. [2018-10-25 02:08:03,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-10-25 02:08:03,412 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 02:08:03,413 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] [2018-10-25 02:08:03,415 INFO L424 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 02:08:03,422 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 02:08:03,422 INFO L82 PathProgramCache]: Analyzing trace with hash 861122892, now seen corresponding path program 1 times [2018-10-25 02:08:03,425 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 02:08:03,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:08:03,475 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 02:08:03,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:08:03,476 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 02:08:03,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 02:08:03,898 WARN L179 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-25 02:08:04,013 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 02:08:04,016 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 02:08:04,016 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-25 02:08:04,017 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 02:08:04,023 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-25 02:08:04,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-25 02:08:04,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-25 02:08:04,042 INFO L87 Difference]: Start difference. First operand 775 states. Second operand 3 states. [2018-10-25 02:08:10,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 02:08:10,750 INFO L93 Difference]: Finished difference Result 2251 states and 4322 transitions. [2018-10-25 02:08:10,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-25 02:08:10,752 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2018-10-25 02:08:10,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 02:08:10,784 INFO L225 Difference]: With dead ends: 2251 [2018-10-25 02:08:10,784 INFO L226 Difference]: Without dead ends: 1474 [2018-10-25 02:08:10,801 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 02:08:10,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1474 states. [2018-10-25 02:08:10,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1474 to 1474. [2018-10-25 02:08:10,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1474 states. [2018-10-25 02:08:10,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1474 states to 1474 states and 2721 transitions. [2018-10-25 02:08:10,958 INFO L78 Accepts]: Start accepts. Automaton has 1474 states and 2721 transitions. Word has length 40 [2018-10-25 02:08:10,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 02:08:10,959 INFO L481 AbstractCegarLoop]: Abstraction has 1474 states and 2721 transitions. [2018-10-25 02:08:10,959 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-25 02:08:10,959 INFO L276 IsEmpty]: Start isEmpty. Operand 1474 states and 2721 transitions. [2018-10-25 02:08:10,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-10-25 02:08:10,974 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 02:08:10,975 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:08:10,976 INFO L424 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 02:08:10,976 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 02:08:10,976 INFO L82 PathProgramCache]: Analyzing trace with hash -1815461261, now seen corresponding path program 1 times [2018-10-25 02:08:10,976 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 02:08:10,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:08:10,979 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 02:08:10,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:08:10,979 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 02:08:11,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 02:08:11,288 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 02:08:11,288 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 02:08:11,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-25 02:08:11,289 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 02:08:11,291 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 02:08:11,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 02:08:11,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 02:08:11,292 INFO L87 Difference]: Start difference. First operand 1474 states and 2721 transitions. Second operand 6 states. [2018-10-25 02:08:24,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 02:08:24,069 INFO L93 Difference]: Finished difference Result 4419 states and 8244 transitions. [2018-10-25 02:08:24,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 02:08:24,070 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 129 [2018-10-25 02:08:24,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 02:08:24,096 INFO L225 Difference]: With dead ends: 4419 [2018-10-25 02:08:24,097 INFO L226 Difference]: Without dead ends: 2951 [2018-10-25 02:08:24,103 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 02:08:24,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2951 states. [2018-10-25 02:08:24,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2951 to 2928. [2018-10-25 02:08:24,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2928 states. [2018-10-25 02:08:24,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2928 states to 2928 states and 5087 transitions. [2018-10-25 02:08:24,207 INFO L78 Accepts]: Start accepts. Automaton has 2928 states and 5087 transitions. Word has length 129 [2018-10-25 02:08:24,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 02:08:24,209 INFO L481 AbstractCegarLoop]: Abstraction has 2928 states and 5087 transitions. [2018-10-25 02:08:24,209 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 02:08:24,209 INFO L276 IsEmpty]: Start isEmpty. Operand 2928 states and 5087 transitions. [2018-10-25 02:08:24,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-10-25 02:08:24,225 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 02:08:24,226 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:08:24,226 INFO L424 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 02:08:24,226 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 02:08:24,226 INFO L82 PathProgramCache]: Analyzing trace with hash 1289606006, now seen corresponding path program 1 times [2018-10-25 02:08:24,227 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 02:08:24,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:08:24,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 02:08:24,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:08:24,229 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 02:08:24,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 02:08:24,635 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 02:08:24,635 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 02:08:24,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-25 02:08:24,636 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 02:08:24,636 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 02:08:24,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 02:08:24,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 02:08:24,637 INFO L87 Difference]: Start difference. First operand 2928 states and 5087 transitions. Second operand 6 states. [2018-10-25 02:08:33,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 02:08:33,975 INFO L93 Difference]: Finished difference Result 10194 states and 17948 transitions. [2018-10-25 02:08:33,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 02:08:33,976 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 176 [2018-10-25 02:08:33,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 02:08:34,027 INFO L225 Difference]: With dead ends: 10194 [2018-10-25 02:08:34,027 INFO L226 Difference]: Without dead ends: 7272 [2018-10-25 02:08:34,048 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 02:08:34,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7272 states. [2018-10-25 02:08:34,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7272 to 7208. [2018-10-25 02:08:34,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7208 states. [2018-10-25 02:08:34,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7208 states to 7208 states and 11881 transitions. [2018-10-25 02:08:34,268 INFO L78 Accepts]: Start accepts. Automaton has 7208 states and 11881 transitions. Word has length 176 [2018-10-25 02:08:34,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 02:08:34,270 INFO L481 AbstractCegarLoop]: Abstraction has 7208 states and 11881 transitions. [2018-10-25 02:08:34,271 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 02:08:34,271 INFO L276 IsEmpty]: Start isEmpty. Operand 7208 states and 11881 transitions. [2018-10-25 02:08:34,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-10-25 02:08:34,275 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 02:08:34,275 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:08:34,278 INFO L424 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 02:08:34,279 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 02:08:34,279 INFO L82 PathProgramCache]: Analyzing trace with hash -680969838, now seen corresponding path program 1 times [2018-10-25 02:08:34,279 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 02:08:34,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:08:34,280 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 02:08:34,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:08:34,281 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 02:08:34,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 02:08:34,549 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 02:08:34,549 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 02:08:34,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-25 02:08:34,550 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 02:08:34,550 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 02:08:34,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 02:08:34,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 02:08:34,551 INFO L87 Difference]: Start difference. First operand 7208 states and 11881 transitions. Second operand 6 states. [2018-10-25 02:08:40,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 02:08:40,344 INFO L93 Difference]: Finished difference Result 17365 states and 29107 transitions. [2018-10-25 02:08:40,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 02:08:40,345 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 178 [2018-10-25 02:08:40,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 02:08:40,401 INFO L225 Difference]: With dead ends: 17365 [2018-10-25 02:08:40,401 INFO L226 Difference]: Without dead ends: 10163 [2018-10-25 02:08:40,432 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 02:08:40,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10163 states. [2018-10-25 02:08:40,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10163 to 10108. [2018-10-25 02:08:40,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10108 states. [2018-10-25 02:08:40,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10108 states to 10108 states and 14258 transitions. [2018-10-25 02:08:40,700 INFO L78 Accepts]: Start accepts. Automaton has 10108 states and 14258 transitions. Word has length 178 [2018-10-25 02:08:40,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 02:08:40,701 INFO L481 AbstractCegarLoop]: Abstraction has 10108 states and 14258 transitions. [2018-10-25 02:08:40,701 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 02:08:40,701 INFO L276 IsEmpty]: Start isEmpty. Operand 10108 states and 14258 transitions. [2018-10-25 02:08:40,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2018-10-25 02:08:40,708 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 02:08:40,709 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-25 02:08:40,709 INFO L424 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 02:08:40,709 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 02:08:40,710 INFO L82 PathProgramCache]: Analyzing trace with hash 1490762096, now seen corresponding path program 1 times [2018-10-25 02:08:40,710 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 02:08:40,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:08:40,712 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 02:08:40,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:08:40,712 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 02:08:40,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 02:08:41,006 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2018-10-25 02:08:41,007 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 02:08:41,007 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-25 02:08:41,007 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 02:08:41,008 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-25 02:08:41,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-25 02:08:41,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-25 02:08:41,009 INFO L87 Difference]: Start difference. First operand 10108 states and 14258 transitions. Second operand 4 states. [2018-10-25 02:08:49,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 02:08:49,431 INFO L93 Difference]: Finished difference Result 28819 states and 41884 transitions. [2018-10-25 02:08:49,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-25 02:08:49,432 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 236 [2018-10-25 02:08:49,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 02:08:49,530 INFO L225 Difference]: With dead ends: 28819 [2018-10-25 02:08:49,530 INFO L226 Difference]: Without dead ends: 18717 [2018-10-25 02:08:49,583 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-25 02:08:49,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18717 states. [2018-10-25 02:08:49,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18717 to 18717. [2018-10-25 02:08:49,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18717 states. [2018-10-25 02:08:49,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18717 states to 18717 states and 26000 transitions. [2018-10-25 02:08:49,991 INFO L78 Accepts]: Start accepts. Automaton has 18717 states and 26000 transitions. Word has length 236 [2018-10-25 02:08:49,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 02:08:49,992 INFO L481 AbstractCegarLoop]: Abstraction has 18717 states and 26000 transitions. [2018-10-25 02:08:49,992 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-25 02:08:49,992 INFO L276 IsEmpty]: Start isEmpty. Operand 18717 states and 26000 transitions. [2018-10-25 02:08:50,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 391 [2018-10-25 02:08:50,031 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 02:08:50,032 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:08:50,032 INFO L424 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 02:08:50,032 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 02:08:50,033 INFO L82 PathProgramCache]: Analyzing trace with hash -205377436, now seen corresponding path program 1 times [2018-10-25 02:08:50,033 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 02:08:50,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:08:50,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 02:08:50,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:08:50,034 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 02:08:50,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 02:08:50,364 WARN L179 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-25 02:08:50,487 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 66 proven. 67 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-10-25 02:08:50,487 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 02:08:50,487 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 02:08:50,489 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 391 with the following transitions: [2018-10-25 02:08:50,492 INFO L202 CegarAbsIntRunner]: [0], [1], [1624], [1631], [1639], [1647], [1655], [1663], [1671], [1679], [1687], [1695], [1703], [1711], [1719], [1727], [1735], [1743], [1751], [1759], [1767], [1775], [1783], [1791], [1799], [1807], [1815], [1823], [1831], [1839], [1843], [1845], [1848], [1856], [1864], [1872], [1880], [1888], [1896], [1904], [1912], [1920], [1928], [1936], [1944], [1952], [1960], [1968], [1976], [1984], [1992], [2000], [2008], [2016], [2024], [2032], [2040], [2048], [2056], [2064], [2072], [2080], [2088], [2096], [2104], [2112], [2117], [2121], [2124], [2125], [2129], [2133], [2137], [2141], [2145], [2149], [2153], [2157], [2161], [2165], [2169], [2173], [2177], [2181], [2185], [2189], [2193], [2197], [2201], [2205], [2209], [2213], [2217], [2221], [2225], [2229], [2233], [2237], [2241], [2245], [2249], [2253], [2257], [2261], [2265], [2269], [2273], [2277], [2281], [2285], [2289], [2293], [2297], [2301], [2305], [2309], [2313], [2317], [2321], [2325], [2329], [2333], [2337], [2341], [2345], [2349], [2353], [2357], [2361], [2365], [2369], [2373], [2377], [2381], [2385], [2389], [2393], [2397], [2401], [2405], [2409], [2413], [2417], [2421], [2425], [2429], [2433], [2437], [2441], [2445], [2449], [2453], [2457], [2461], [2465], [2469], [2473], [2477], [2481], [2485], [2489], [2493], [2497], [2501], [2505], [2509], [2513], [2517], [2521], [2525], [2529], [2533], [2537], [2541], [2545], [2549], [2553], [2557], [2561], [2565], [2569], [2573], [2577], [2581], [2585], [2589], [2593], [2597], [2601], [2605], [2609], [2613], [2617], [2621], [2625], [2629], [2633], [2637], [2641], [2645], [2649], [2653], [2657], [2661], [2665], [2669], [2673], [2677], [2681], [2685], [2689], [2693], [2697], [2701], [2705], [2709], [2713], [2717], [2721], [2725], [2729], [2733], [2737], [2741], [2745], [2749], [2753], [2757], [2761], [2765], [2769], [2773], [2777], [2781], [2785], [2789], [2793], [2797], [2801], [2805], [2809], [2813], [2817], [2821], [2825], [2829], [2833], [2837], [2841], [2845], [2849], [2853], [2857], [2861], [2865], [2869], [2873], [2877], [2881], [2885], [2889], [2893], [2897], [2901], [2905], [2909], [2913], [2917], [2921], [2925], [2929], [2933], [2937], [2941], [2945], [2948], [2996], [3000], [3004], [3010], [3014], [3016], [3025], [3026], [3027], [3029], [3030] [2018-10-25 02:08:50,590 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 02:08:50,590 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 02:08:51,655 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-25 02:08:51,657 INFO L272 AbstractInterpreter]: Visited 283 different actions 283 times. Never merged. Never widened. Never found a fixpoint. Largest state had 24 variables. [2018-10-25 02:08:51,702 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 02:08:51,703 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-25 02:08:52,594 INFO L232 lantSequenceWeakener]: Weakened 381 states. On average, predicates are now at 77.56% of their original sizes. [2018-10-25 02:08:52,595 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-25 02:08:52,876 INFO L413 sIntCurrentIteration]: We have 389 unified AI predicates [2018-10-25 02:08:52,876 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-25 02:08:52,877 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-25 02:08:52,878 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [5] total 9 [2018-10-25 02:08:52,878 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 02:08:52,879 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 02:08:52,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 02:08:52,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 02:08:52,880 INFO L87 Difference]: Start difference. First operand 18717 states and 26000 transitions. Second operand 6 states. [2018-10-25 02:09:25,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-25 02:09:25,844 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:92) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:93) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.handleAssumeStatement(NonrelationalStatementProcessor.java:363) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.processStatement(NonrelationalStatementProcessor.java:160) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.process(NonrelationalStatementProcessor.java:142) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.process(NonrelationalStatementProcessor.java:128) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.handleInternalTransition(NonrelationalPostOperator.java:362) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.handleInternalTransition(NonrelationalPostOperator.java:353) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.apply(NonrelationalPostOperator.java:125) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.apply(NonrelationalPostOperator.java:1) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.compound.CompoundDomainPostOperator.applyInternally(CompoundDomainPostOperator.java:306) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.compound.CompoundDomainPostOperator.apply(CompoundDomainPostOperator.java:131) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.compound.CompoundDomainPostOperator.apply(CompoundDomainPostOperator.java:1) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.applyPost(TermConjunctEvaluator.java:305) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.lambda$4(TermConjunctEvaluator.java:178) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.computeFixpoint(TermConjunctEvaluator.java:198) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.lambda$1(TermConjunctEvaluator.java:150) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.computePost(TermConjunctEvaluator.java:93) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormanCachedPostOperation.applyPost(PoormanCachedPostOperation.java:308) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormansAbstractPostOperator.applyPost(PoormansAbstractPostOperator.java:217) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormansAbstractPostOperator.apply(PoormansAbstractPostOperator.java:119) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormansAbstractPostOperator.apply(PoormansAbstractPostOperator.java:1) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.DisjunctiveAbstractState.lambda$17(DisjunctiveAbstractState.java:369) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.DisjunctiveAbstractState.mapCollection(DisjunctiveAbstractState.java:537) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.DisjunctiveAbstractState.apply(DisjunctiveAbstractState.java:369) at de.uni_freiburg.informatik.ultimate.plugins.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 02:09:25,849 INFO L168 Benchmark]: Toolchain (without parser) took 93628.65 ms. Allocated memory was 1.5 GB in the beginning and 4.2 GB in the end (delta: 2.7 GB). Free memory was 1.4 GB in the beginning and 1.6 GB in the end (delta: -157.7 MB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. [2018-10-25 02:09:25,851 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 02:09:25,851 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1774.58 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: 148.0 MB). Peak memory consumption was 148.0 MB. Max. memory is 7.1 GB. [2018-10-25 02:09:25,852 INFO L168 Benchmark]: Boogie Procedure Inliner took 366.82 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 788.5 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -964.4 MB). Peak memory consumption was 45.1 MB. Max. memory is 7.1 GB. [2018-10-25 02:09:25,853 INFO L168 Benchmark]: Boogie Preprocessor took 192.14 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 27.4 MB). Peak memory consumption was 27.4 MB. Max. memory is 7.1 GB. [2018-10-25 02:09:25,854 INFO L168 Benchmark]: RCFGBuilder took 8703.65 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.7 GB in the end (delta: 504.5 MB). Peak memory consumption was 504.5 MB. Max. memory is 7.1 GB. [2018-10-25 02:09:25,855 INFO L168 Benchmark]: TraceAbstraction took 82586.08 ms. Allocated memory was 2.3 GB in the beginning and 4.2 GB in the end (delta: 1.9 GB). Free memory was 1.7 GB in the beginning and 1.6 GB in the end (delta: 126.8 MB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. [2018-10-25 02:09:25,863 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 1774.58 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: 148.0 MB). Peak memory consumption was 148.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 366.82 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 788.5 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -964.4 MB). Peak memory consumption was 45.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 192.14 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 27.4 MB). Peak memory consumption was 27.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 8703.65 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.7 GB in the end (delta: 504.5 MB). Peak memory consumption was 504.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 82586.08 ms. Allocated memory was 2.3 GB in the beginning and 4.2 GB in the end (delta: 1.9 GB). Free memory was 1.7 GB in the beginning and 1.6 GB in the end (delta: 126.8 MB). Peak memory consumption was 2.0 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...