java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-EXP.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem16_label15_false-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-24 23:43:22,360 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-24 23:43:22,362 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-24 23:43:22,375 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-24 23:43:22,375 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-24 23:43:22,376 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-24 23:43:22,377 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-24 23:43:22,379 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-24 23:43:22,383 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-24 23:43:22,387 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-24 23:43:22,388 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-24 23:43:22,388 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-24 23:43:22,389 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-24 23:43:22,390 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-24 23:43:22,392 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-24 23:43:22,393 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-24 23:43:22,394 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-24 23:43:22,396 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-24 23:43:22,398 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-24 23:43:22,399 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-24 23:43:22,401 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-24 23:43:22,402 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-24 23:43:22,404 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-24 23:43:22,405 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-24 23:43:22,405 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-24 23:43:22,406 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-24 23:43:22,407 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-24 23:43:22,408 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-24 23:43:22,409 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-24 23:43:22,410 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-24 23:43:22,410 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-24 23:43:22,411 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-24 23:43:22,411 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-24 23:43:22,411 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-24 23:43:22,413 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-24 23:43:22,413 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-24 23:43:22,414 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-EXP.epf [2018-10-24 23:43:22,430 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-24 23:43:22,431 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-24 23:43:22,432 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-24 23:43:22,432 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-24 23:43:22,432 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-24 23:43:22,432 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-24 23:43:22,433 INFO L133 SettingsManager]: * Explicit value domain=true [2018-10-24 23:43:22,433 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-24 23:43:22,433 INFO L133 SettingsManager]: * Octagon Domain=false [2018-10-24 23:43:22,433 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-24 23:43:22,434 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-24 23:43:22,434 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-24 23:43:22,434 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-24 23:43:22,434 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-24 23:43:22,435 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-24 23:43:22,435 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-24 23:43:22,436 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-24 23:43:22,436 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-24 23:43:22,436 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-24 23:43:22,436 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-24 23:43:22,437 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-24 23:43:22,437 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-24 23:43:22,437 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-24 23:43:22,437 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-24 23:43:22,437 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-24 23:43:22,438 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-24 23:43:22,438 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-24 23:43:22,438 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-24 23:43:22,438 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-24 23:43:22,438 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-24 23:43:22,439 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-24 23:43:22,439 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-24 23:43:22,439 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-24 23:43:22,439 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-24 23:43:22,439 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-24 23:43:22,440 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-24 23:43:22,490 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-24 23:43:22,503 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-24 23:43:22,507 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-24 23:43:22,509 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-24 23:43:22,509 INFO L276 PluginConnector]: CDTParser initialized [2018-10-24 23:43:22,510 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem16_label15_false-unreach-call.c [2018-10-24 23:43:22,581 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/085140934/b5862875dcf8455e95d2057abc2d9ffd/FLAGc2b02e6a1 [2018-10-24 23:43:23,219 INFO L298 CDTParser]: Found 1 translation units. [2018-10-24 23:43:23,220 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem16_label15_false-unreach-call.c [2018-10-24 23:43:23,254 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/085140934/b5862875dcf8455e95d2057abc2d9ffd/FLAGc2b02e6a1 [2018-10-24 23:43:23,272 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/085140934/b5862875dcf8455e95d2057abc2d9ffd [2018-10-24 23:43:23,285 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-24 23:43:23,287 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-24 23:43:23,289 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-24 23:43:23,289 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-24 23:43:23,293 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-24 23:43:23,295 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:43:23" (1/1) ... [2018-10-24 23:43:23,299 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38ff5b28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:43:23, skipping insertion in model container [2018-10-24 23:43:23,299 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:43:23" (1/1) ... [2018-10-24 23:43:23,312 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-24 23:43:23,401 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-24 23:43:24,148 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 23:43:24,154 INFO L189 MainTranslator]: Completed pre-run [2018-10-24 23:43:24,434 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 23:43:24,457 INFO L193 MainTranslator]: Completed translation [2018-10-24 23:43:24,458 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:43:24 WrapperNode [2018-10-24 23:43:24,458 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-24 23:43:24,459 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-24 23:43:24,459 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-24 23:43:24,460 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-24 23:43:24,471 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:43:24" (1/1) ... [2018-10-24 23:43:24,525 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:43:24" (1/1) ... [2018-10-24 23:43:24,768 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-24 23:43:24,769 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-24 23:43:24,770 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-24 23:43:24,770 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-24 23:43:24,782 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:43:24" (1/1) ... [2018-10-24 23:43:24,783 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:43:24" (1/1) ... [2018-10-24 23:43:24,795 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:43:24" (1/1) ... [2018-10-24 23:43:24,795 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:43:24" (1/1) ... [2018-10-24 23:43:24,870 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:43:24" (1/1) ... [2018-10-24 23:43:24,905 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:43:24" (1/1) ... [2018-10-24 23:43:24,936 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:43:24" (1/1) ... [2018-10-24 23:43:24,965 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-24 23:43:24,965 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-24 23:43:24,966 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-24 23:43:24,966 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-24 23:43:24,967 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:43:24" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-24 23:43:25,043 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-24 23:43:25,043 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-24 23:43:25,043 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2018-10-24 23:43:25,044 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2018-10-24 23:43:25,044 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-10-24 23:43:25,044 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-10-24 23:43:25,045 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-24 23:43:25,045 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-24 23:43:25,045 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-24 23:43:25,045 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-24 23:43:31,516 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-24 23:43:31,517 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:43:31 BoogieIcfgContainer [2018-10-24 23:43:31,517 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-24 23:43:31,518 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-24 23:43:31,518 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-24 23:43:31,522 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-24 23:43:31,523 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 11:43:23" (1/3) ... [2018-10-24 23:43:31,524 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@496b0642 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:43:31, skipping insertion in model container [2018-10-24 23:43:31,524 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:43:24" (2/3) ... [2018-10-24 23:43:31,525 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@496b0642 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:43:31, skipping insertion in model container [2018-10-24 23:43:31,525 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:43:31" (3/3) ... [2018-10-24 23:43:31,527 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem16_label15_false-unreach-call.c [2018-10-24 23:43:31,538 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-24 23:43:31,552 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-24 23:43:31,578 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-24 23:43:31,639 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-24 23:43:31,640 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-24 23:43:31,640 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-24 23:43:31,640 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-24 23:43:31,640 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-24 23:43:31,640 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-24 23:43:31,641 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-24 23:43:31,641 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-24 23:43:31,695 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states. [2018-10-24 23:43:31,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-10-24 23:43:31,704 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 23:43:31,705 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] [2018-10-24 23:43:31,707 INFO L424 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 23:43:31,715 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:43:31,715 INFO L82 PathProgramCache]: Analyzing trace with hash 1965718299, now seen corresponding path program 1 times [2018-10-24 23:43:31,718 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 23:43:31,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:43:31,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 23:43:31,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:43:31,783 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 23:43:31,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 23:43:32,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 23:43:32,190 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 23:43:32,190 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 23:43:32,190 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 23:43:32,197 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 23:43:32,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 23:43:32,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 23:43:32,216 INFO L87 Difference]: Start difference. First operand 410 states. Second operand 4 states. [2018-10-24 23:43:39,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 23:43:39,211 INFO L93 Difference]: Finished difference Result 1513 states and 2838 transitions. [2018-10-24 23:43:39,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 23:43:39,216 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2018-10-24 23:43:39,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 23:43:39,244 INFO L225 Difference]: With dead ends: 1513 [2018-10-24 23:43:39,245 INFO L226 Difference]: Without dead ends: 1097 [2018-10-24 23:43:39,254 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 23:43:39,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1097 states. [2018-10-24 23:43:39,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1097 to 744. [2018-10-24 23:43:39,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 744 states. [2018-10-24 23:43:39,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 744 states to 744 states and 1357 transitions. [2018-10-24 23:43:39,366 INFO L78 Accepts]: Start accepts. Automaton has 744 states and 1357 transitions. Word has length 29 [2018-10-24 23:43:39,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 23:43:39,367 INFO L481 AbstractCegarLoop]: Abstraction has 744 states and 1357 transitions. [2018-10-24 23:43:39,367 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 23:43:39,367 INFO L276 IsEmpty]: Start isEmpty. Operand 744 states and 1357 transitions. [2018-10-24 23:43:39,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-10-24 23:43:39,373 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 23:43:39,373 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 23:43:39,374 INFO L424 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 23:43:39,374 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:43:39,374 INFO L82 PathProgramCache]: Analyzing trace with hash -2135341492, now seen corresponding path program 1 times [2018-10-24 23:43:39,374 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 23:43:39,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:43:39,376 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 23:43:39,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:43:39,376 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 23:43:39,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 23:43:39,627 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 23:43:39,628 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 23:43:39,628 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-24 23:43:39,628 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 23:43:39,630 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-24 23:43:39,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-24 23:43:39,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-24 23:43:39,631 INFO L87 Difference]: Start difference. First operand 744 states and 1357 transitions. Second operand 5 states. [2018-10-24 23:43:46,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 23:43:46,979 INFO L93 Difference]: Finished difference Result 2196 states and 4092 transitions. [2018-10-24 23:43:46,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-24 23:43:46,986 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 99 [2018-10-24 23:43:46,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 23:43:47,003 INFO L225 Difference]: With dead ends: 2196 [2018-10-24 23:43:47,003 INFO L226 Difference]: Without dead ends: 1458 [2018-10-24 23:43:47,008 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-10-24 23:43:47,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1458 states. [2018-10-24 23:43:47,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1458 to 1438. [2018-10-24 23:43:47,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1438 states. [2018-10-24 23:43:47,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1438 states to 1438 states and 2551 transitions. [2018-10-24 23:43:47,099 INFO L78 Accepts]: Start accepts. Automaton has 1438 states and 2551 transitions. Word has length 99 [2018-10-24 23:43:47,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 23:43:47,100 INFO L481 AbstractCegarLoop]: Abstraction has 1438 states and 2551 transitions. [2018-10-24 23:43:47,100 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-24 23:43:47,100 INFO L276 IsEmpty]: Start isEmpty. Operand 1438 states and 2551 transitions. [2018-10-24 23:43:47,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-10-24 23:43:47,104 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 23:43:47,104 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 23:43:47,105 INFO L424 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 23:43:47,105 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:43:47,105 INFO L82 PathProgramCache]: Analyzing trace with hash 558578681, now seen corresponding path program 1 times [2018-10-24 23:43:47,105 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 23:43:47,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:43:47,106 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 23:43:47,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:43:47,107 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 23:43:47,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 23:43:47,290 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 23:43:47,290 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 23:43:47,290 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-24 23:43:47,291 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 23:43:47,291 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-24 23:43:47,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-24 23:43:47,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-24 23:43:47,292 INFO L87 Difference]: Start difference. First operand 1438 states and 2551 transitions. Second operand 6 states. [2018-10-24 23:43:52,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 23:43:52,601 INFO L93 Difference]: Finished difference Result 4239 states and 7543 transitions. [2018-10-24 23:43:52,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-24 23:43:52,615 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 102 [2018-10-24 23:43:52,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 23:43:52,634 INFO L225 Difference]: With dead ends: 4239 [2018-10-24 23:43:52,634 INFO L226 Difference]: Without dead ends: 2807 [2018-10-24 23:43:52,644 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-24 23:43:52,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2807 states. [2018-10-24 23:43:52,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2807 to 2785. [2018-10-24 23:43:52,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2785 states. [2018-10-24 23:43:52,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2785 states to 2785 states and 4352 transitions. [2018-10-24 23:43:52,734 INFO L78 Accepts]: Start accepts. Automaton has 2785 states and 4352 transitions. Word has length 102 [2018-10-24 23:43:52,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 23:43:52,735 INFO L481 AbstractCegarLoop]: Abstraction has 2785 states and 4352 transitions. [2018-10-24 23:43:52,735 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-24 23:43:52,736 INFO L276 IsEmpty]: Start isEmpty. Operand 2785 states and 4352 transitions. [2018-10-24 23:43:52,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-10-24 23:43:52,738 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 23:43:52,738 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 23:43:52,738 INFO L424 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 23:43:52,738 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:43:52,739 INFO L82 PathProgramCache]: Analyzing trace with hash -2114066796, now seen corresponding path program 1 times [2018-10-24 23:43:52,739 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 23:43:52,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:43:52,740 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 23:43:52,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:43:52,740 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 23:43:52,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 23:43:52,977 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 23:43:52,977 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 23:43:52,978 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-24 23:43:52,978 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 23:43:52,978 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-24 23:43:52,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-24 23:43:52,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-24 23:43:52,979 INFO L87 Difference]: Start difference. First operand 2785 states and 4352 transitions. Second operand 6 states. [2018-10-24 23:43:57,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 23:43:57,049 INFO L93 Difference]: Finished difference Result 6952 states and 11048 transitions. [2018-10-24 23:43:57,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-24 23:43:57,052 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 103 [2018-10-24 23:43:57,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 23:43:57,075 INFO L225 Difference]: With dead ends: 6952 [2018-10-24 23:43:57,076 INFO L226 Difference]: Without dead ends: 4173 [2018-10-24 23:43:57,093 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-24 23:43:57,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4173 states. [2018-10-24 23:43:57,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4173 to 4153. [2018-10-24 23:43:57,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4153 states. [2018-10-24 23:43:57,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4153 states to 4153 states and 5896 transitions. [2018-10-24 23:43:57,229 INFO L78 Accepts]: Start accepts. Automaton has 4153 states and 5896 transitions. Word has length 103 [2018-10-24 23:43:57,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 23:43:57,229 INFO L481 AbstractCegarLoop]: Abstraction has 4153 states and 5896 transitions. [2018-10-24 23:43:57,229 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-24 23:43:57,230 INFO L276 IsEmpty]: Start isEmpty. Operand 4153 states and 5896 transitions. [2018-10-24 23:43:57,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-10-24 23:43:57,233 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 23:43:57,233 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 23:43:57,235 INFO L424 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 23:43:57,235 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:43:57,235 INFO L82 PathProgramCache]: Analyzing trace with hash -377282367, now seen corresponding path program 1 times [2018-10-24 23:43:57,235 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 23:43:57,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:43:57,236 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 23:43:57,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:43:57,237 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 23:43:57,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 23:43:57,477 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 23:43:57,478 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 23:43:57,478 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-24 23:43:57,478 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 23:43:57,478 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-24 23:43:57,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-24 23:43:57,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-24 23:43:57,479 INFO L87 Difference]: Start difference. First operand 4153 states and 5896 transitions. Second operand 6 states. [2018-10-24 23:44:02,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 23:44:02,139 INFO L93 Difference]: Finished difference Result 11374 states and 16767 transitions. [2018-10-24 23:44:02,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-24 23:44:02,146 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 106 [2018-10-24 23:44:02,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 23:44:02,186 INFO L225 Difference]: With dead ends: 11374 [2018-10-24 23:44:02,187 INFO L226 Difference]: Without dead ends: 7227 [2018-10-24 23:44:02,217 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-24 23:44:02,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7227 states. [2018-10-24 23:44:02,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7227 to 7152. [2018-10-24 23:44:02,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7152 states. [2018-10-24 23:44:02,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7152 states to 7152 states and 9826 transitions. [2018-10-24 23:44:02,420 INFO L78 Accepts]: Start accepts. Automaton has 7152 states and 9826 transitions. Word has length 106 [2018-10-24 23:44:02,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 23:44:02,420 INFO L481 AbstractCegarLoop]: Abstraction has 7152 states and 9826 transitions. [2018-10-24 23:44:02,420 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-24 23:44:02,420 INFO L276 IsEmpty]: Start isEmpty. Operand 7152 states and 9826 transitions. [2018-10-24 23:44:02,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-10-24 23:44:02,422 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 23:44:02,422 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 23:44:02,424 INFO L424 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 23:44:02,424 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:44:02,424 INFO L82 PathProgramCache]: Analyzing trace with hash -996963759, now seen corresponding path program 1 times [2018-10-24 23:44:02,424 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 23:44:02,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:44:02,425 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 23:44:02,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:44:02,426 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 23:44:02,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 23:44:02,675 WARN L179 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-24 23:44:02,878 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 23:44:02,878 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 23:44:02,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-24 23:44:02,879 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 23:44:02,879 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-24 23:44:02,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-24 23:44:02,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-24 23:44:02,881 INFO L87 Difference]: Start difference. First operand 7152 states and 9826 transitions. Second operand 6 states. [2018-10-24 23:44:06,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 23:44:06,200 INFO L93 Difference]: Finished difference Result 17771 states and 25546 transitions. [2018-10-24 23:44:06,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-24 23:44:06,201 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 114 [2018-10-24 23:44:06,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 23:44:06,263 INFO L225 Difference]: With dead ends: 17771 [2018-10-24 23:44:06,264 INFO L226 Difference]: Without dead ends: 10625 [2018-10-24 23:44:06,290 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-24 23:44:06,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10625 states. [2018-10-24 23:44:06,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10625 to 10585. [2018-10-24 23:44:06,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10585 states. [2018-10-24 23:44:06,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10585 states to 10585 states and 13819 transitions. [2018-10-24 23:44:06,569 INFO L78 Accepts]: Start accepts. Automaton has 10585 states and 13819 transitions. Word has length 114 [2018-10-24 23:44:06,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 23:44:06,570 INFO L481 AbstractCegarLoop]: Abstraction has 10585 states and 13819 transitions. [2018-10-24 23:44:06,571 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-24 23:44:06,571 INFO L276 IsEmpty]: Start isEmpty. Operand 10585 states and 13819 transitions. [2018-10-24 23:44:06,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-10-24 23:44:06,572 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 23:44:06,573 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 23:44:06,573 INFO L424 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 23:44:06,573 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:44:06,573 INFO L82 PathProgramCache]: Analyzing trace with hash 1532470232, now seen corresponding path program 1 times [2018-10-24 23:44:06,574 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 23:44:06,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:44:06,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 23:44:06,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:44:06,579 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 23:44:06,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 23:44:06,833 WARN L179 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-24 23:44:07,051 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-24 23:44:07,052 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 23:44:07,052 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 23:44:07,053 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 122 with the following transitions: [2018-10-24 23:44:07,056 INFO L202 CegarAbsIntRunner]: [0], [1], [180], [187], [195], [203], [211], [219], [227], [235], [243], [251], [259], [267], [275], [283], [291], [299], [307], [311], [313], [316], [324], [332], [340], [348], [356], [364], [372], [380], [388], [396], [404], [412], [420], [428], [436], [444], [452], [460], [468], [476], [484], [492], [500], [508], [516], [524], [532], [540], [548], [556], [564], [572], [580], [588], [596], [604], [612], [620], [628], [636], [644], [652], [660], [668], [673], [677], [681], [685], [689], [693], [697], [701], [705], [709], [713], [717], [721], [725], [729], [733], [737], [741], [745], [749], [753], [757], [760], [1552], [1556], [1560], [1566], [1570], [1572], [1579], [1580], [1581], [1583], [1584] [2018-10-24 23:44:07,126 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-24 23:44:07,128 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-24 23:44:08,268 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-24 23:44:08,270 INFO L272 AbstractInterpreter]: Visited 99 different actions 284 times. Merged at 5 different actions 9 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-10-24 23:44:08,322 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:44:08,322 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-24 23:44:09,142 INFO L232 lantSequenceWeakener]: Weakened 19 states. On average, predicates are now at 81.48% of their original sizes. [2018-10-24 23:44:09,142 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-24 23:44:11,107 INFO L413 sIntCurrentIteration]: We have 120 unified AI predicates [2018-10-24 23:44:11,107 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-24 23:44:11,108 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 23:44:11,108 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [4] total 16 [2018-10-24 23:44:11,109 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 23:44:11,109 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-24 23:44:11,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-24 23:44:11,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2018-10-24 23:44:11,110 INFO L87 Difference]: Start difference. First operand 10585 states and 13819 transitions. Second operand 14 states. [2018-10-24 23:45:06,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-24 23:45:06,909 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.ArithmeticException: BigInteger: modulus not positive at java.math.BigInteger.mod(BigInteger.java:2458) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.explicit.ExplicitValueValue.modulo(ExplicitValueValue.java:154) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.explicit.ExplicitValueValue.modulo(ExplicitValueValue.java:1) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:125) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:100) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:92) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:92) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:93) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.ConditionalEvaluator.evaluate(ConditionalEvaluator.java:78) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.ConditionalEvaluator.evaluate(ConditionalEvaluator.java:1) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:93) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:92) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:92) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.ConditionalEvaluator.evaluate(ConditionalEvaluator.java:78) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.ConditionalEvaluator.evaluate(ConditionalEvaluator.java:1) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:93) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.handleAssumeStatement(NonrelationalStatementProcessor.java:363) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.processStatement(NonrelationalStatementProcessor.java:160) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.process(NonrelationalStatementProcessor.java:142) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.process(NonrelationalStatementProcessor.java:128) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.handleInternalTransition(NonrelationalPostOperator.java:362) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.handleInternalTransition(NonrelationalPostOperator.java:353) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.apply(NonrelationalPostOperator.java:125) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.apply(NonrelationalPostOperator.java:1) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.compound.CompoundDomainPostOperator.applyInternally(CompoundDomainPostOperator.java:306) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.compound.CompoundDomainPostOperator.apply(CompoundDomainPostOperator.java:131) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.compound.CompoundDomainPostOperator.apply(CompoundDomainPostOperator.java:1) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.applyPost(TermConjunctEvaluator.java:305) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.lambda$4(TermConjunctEvaluator.java:178) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.computeFixpoint(TermConjunctEvaluator.java:198) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.lambda$1(TermConjunctEvaluator.java:150) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.computePost(TermConjunctEvaluator.java:93) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormanCachedPostOperation.applyPost(PoormanCachedPostOperation.java:308) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormansAbstractPostOperator.applyPost(PoormansAbstractPostOperator.java:217) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormansAbstractPostOperator.apply(PoormansAbstractPostOperator.java:119) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormansAbstractPostOperator.apply(PoormansAbstractPostOperator.java:1) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.DisjunctiveAbstractState.lambda$17(DisjunctiveAbstractState.java:369) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.DisjunctiveAbstractState.mapCollection(DisjunctiveAbstractState.java:537) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.DisjunctiveAbstractState.apply(DisjunctiveAbstractState.java:369) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.AbsIntHoareTripleChecker.checkInternalTransitionWithValidState(AbsIntHoareTripleChecker.java:352) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.AbsIntHoareTripleChecker.checkInternalAbsInt(AbsIntHoareTripleChecker.java:249) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.AbsIntHoareTripleChecker.checkInternal(AbsIntHoareTripleChecker.java:181) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.CachingHoareTripleChecker.checkInternal(CachingHoareTripleChecker.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton$InternalSuccessorComputationHelper.computeSuccWithSolver(AbstractInterpolantAutomaton.java:359) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.addOtherSuccessors(DeterministicInterpolantAutomaton.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1066) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:968) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:188) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:673) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:602) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:473) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-10-24 23:45:06,914 INFO L168 Benchmark]: Toolchain (without parser) took 103628.44 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.0 GB in the end (delta: -1.6 GB). Peak memory consumption was 1.0 GB. Max. memory is 7.1 GB. [2018-10-24 23:45:06,916 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-24 23:45:06,916 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1169.93 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: 76.6 MB). Peak memory consumption was 76.6 MB. Max. memory is 7.1 GB. [2018-10-24 23:45:06,917 INFO L168 Benchmark]: Boogie Procedure Inliner took 309.86 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 721.4 MB). Free memory was 1.3 GB in the beginning and 2.1 GB in the end (delta: -820.3 MB). Peak memory consumption was 28.7 MB. Max. memory is 7.1 GB. [2018-10-24 23:45:06,918 INFO L168 Benchmark]: Boogie Preprocessor took 195.77 ms. Allocated memory is still 2.2 GB. Free memory was 2.1 GB in the beginning and 2.1 GB in the end (delta: 13.7 MB). Peak memory consumption was 13.7 MB. Max. memory is 7.1 GB. [2018-10-24 23:45:06,919 INFO L168 Benchmark]: RCFGBuilder took 6551.63 ms. Allocated memory is still 2.2 GB. Free memory was 2.1 GB in the beginning and 1.9 GB in the end (delta: 242.4 MB). Peak memory consumption was 242.4 MB. Max. memory is 7.1 GB. [2018-10-24 23:45:06,920 INFO L168 Benchmark]: TraceAbstraction took 95395.36 ms. Allocated memory was 2.2 GB in the beginning and 4.1 GB in the end (delta: 1.9 GB). Free memory was 1.9 GB in the beginning and 3.0 GB in the end (delta: -1.1 GB). Peak memory consumption was 803.5 MB. Max. memory is 7.1 GB. [2018-10-24 23:45:06,925 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.18 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1169.93 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: 76.6 MB). Peak memory consumption was 76.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 309.86 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 721.4 MB). Free memory was 1.3 GB in the beginning and 2.1 GB in the end (delta: -820.3 MB). Peak memory consumption was 28.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 195.77 ms. Allocated memory is still 2.2 GB. Free memory was 2.1 GB in the beginning and 2.1 GB in the end (delta: 13.7 MB). Peak memory consumption was 13.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 6551.63 ms. Allocated memory is still 2.2 GB. Free memory was 2.1 GB in the beginning and 1.9 GB in the end (delta: 242.4 MB). Peak memory consumption was 242.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 95395.36 ms. Allocated memory was 2.2 GB in the beginning and 4.1 GB in the end (delta: 1.9 GB). Free memory was 1.9 GB in the beginning and 3.0 GB in the end (delta: -1.1 GB). Peak memory consumption was 803.5 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...