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/Problem13_label02_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-25 01:40:46,584 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-25 01:40:46,586 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-25 01:40:46,602 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-25 01:40:46,603 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-25 01:40:46,605 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-25 01:40:46,606 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-25 01:40:46,608 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-25 01:40:46,610 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-25 01:40:46,611 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-25 01:40:46,612 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-25 01:40:46,616 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-25 01:40:46,617 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-25 01:40:46,621 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-25 01:40:46,625 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-25 01:40:46,626 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-25 01:40:46,627 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-25 01:40:46,629 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-25 01:40:46,634 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-25 01:40:46,638 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-25 01:40:46,639 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-25 01:40:46,642 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-25 01:40:46,646 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-25 01:40:46,647 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-25 01:40:46,647 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-25 01:40:46,652 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-25 01:40:46,653 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-25 01:40:46,654 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-25 01:40:46,655 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-25 01:40:46,656 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-25 01:40:46,656 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-25 01:40:46,657 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-25 01:40:46,657 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-25 01:40:46,657 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-25 01:40:46,658 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-25 01:40:46,659 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-25 01:40:46,659 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-EXP.epf [2018-10-25 01:40:46,680 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-25 01:40:46,680 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-25 01:40:46,681 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-25 01:40:46,681 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-25 01:40:46,681 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-25 01:40:46,682 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-25 01:40:46,685 INFO L133 SettingsManager]: * Explicit value domain=true [2018-10-25 01:40:46,686 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-25 01:40:46,686 INFO L133 SettingsManager]: * Octagon Domain=false [2018-10-25 01:40:46,686 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-25 01:40:46,686 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-25 01:40:46,686 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-25 01:40:46,687 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-25 01:40:46,687 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-25 01:40:46,688 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-25 01:40:46,688 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-25 01:40:46,688 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-25 01:40:46,689 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-25 01:40:46,689 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-25 01:40:46,689 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-25 01:40:46,689 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-25 01:40:46,689 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-25 01:40:46,689 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-25 01:40:46,691 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-25 01:40:46,692 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-25 01:40:46,692 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-25 01:40:46,692 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-25 01:40:46,692 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-25 01:40:46,692 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-25 01:40:46,693 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-25 01:40:46,693 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-25 01:40:46,693 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-25 01:40:46,693 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-25 01:40:46,693 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-25 01:40:46,694 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-25 01:40:46,694 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-25 01:40:46,759 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-25 01:40:46,772 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-25 01:40:46,776 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-25 01:40:46,778 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-25 01:40:46,778 INFO L276 PluginConnector]: CDTParser initialized [2018-10-25 01:40:46,779 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem13_label02_true-unreach-call.c [2018-10-25 01:40:46,854 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/f46ab56f1/4069f2e7156a4a859cae8a37e8457e91/FLAG5af9009fd [2018-10-25 01:40:47,691 INFO L298 CDTParser]: Found 1 translation units. [2018-10-25 01:40:47,692 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem13_label02_true-unreach-call.c [2018-10-25 01:40:47,732 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/f46ab56f1/4069f2e7156a4a859cae8a37e8457e91/FLAG5af9009fd [2018-10-25 01:40:47,753 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/f46ab56f1/4069f2e7156a4a859cae8a37e8457e91 [2018-10-25 01:40:47,767 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-25 01:40:47,769 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-25 01:40:47,770 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-25 01:40:47,771 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-25 01:40:47,775 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-25 01:40:47,776 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 01:40:47" (1/1) ... [2018-10-25 01:40:47,781 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35c9fd02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:40:47, skipping insertion in model container [2018-10-25 01:40:47,781 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 01:40:47" (1/1) ... [2018-10-25 01:40:47,793 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-25 01:40:47,993 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-25 01:40:49,501 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-25 01:40:49,507 INFO L189 MainTranslator]: Completed pre-run [2018-10-25 01:40:50,269 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-25 01:40:50,307 INFO L193 MainTranslator]: Completed translation [2018-10-25 01:40:50,307 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:40:50 WrapperNode [2018-10-25 01:40:50,307 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-25 01:40:50,308 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-25 01:40:50,309 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-25 01:40:50,309 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-25 01:40:50,319 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:40:50" (1/1) ... [2018-10-25 01:40:50,404 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:40:50" (1/1) ... [2018-10-25 01:40:50,918 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-25 01:40:50,918 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-25 01:40:50,919 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-25 01:40:50,919 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-25 01:40:50,930 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:40:50" (1/1) ... [2018-10-25 01:40:50,930 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:40:50" (1/1) ... [2018-10-25 01:40:50,969 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:40:50" (1/1) ... [2018-10-25 01:40:50,970 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:40:50" (1/1) ... [2018-10-25 01:40:51,150 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:40:50" (1/1) ... [2018-10-25 01:40:51,187 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:40:50" (1/1) ... [2018-10-25 01:40:51,267 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:40:50" (1/1) ... [2018-10-25 01:40:51,360 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-25 01:40:51,361 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-25 01:40:51,361 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-25 01:40:51,361 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-25 01:40:51,362 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:40:50" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-25 01:40:51,434 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-25 01:40:51,435 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-25 01:40:51,435 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output4 [2018-10-25 01:40:51,435 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output4 [2018-10-25 01:40:51,436 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output3 [2018-10-25 01:40:51,436 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output3 [2018-10-25 01:40:51,436 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2018-10-25 01:40:51,436 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2018-10-25 01:40:51,436 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-10-25 01:40:51,437 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-10-25 01:40:51,437 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-25 01:40:51,437 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-25 01:40:51,437 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-25 01:40:51,437 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-25 01:41:04,098 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-25 01:41:04,099 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 01:41:04 BoogieIcfgContainer [2018-10-25 01:41:04,099 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-25 01:41:04,100 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-25 01:41:04,101 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-25 01:41:04,106 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-25 01:41:04,106 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.10 01:40:47" (1/3) ... [2018-10-25 01:41:04,107 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d0330a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 01:41:04, skipping insertion in model container [2018-10-25 01:41:04,107 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:40:50" (2/3) ... [2018-10-25 01:41:04,108 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d0330a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 01:41:04, skipping insertion in model container [2018-10-25 01:41:04,108 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 01:41:04" (3/3) ... [2018-10-25 01:41:04,111 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem13_label02_true-unreach-call.c [2018-10-25 01:41:04,121 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-25 01:41:04,137 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-25 01:41:04,153 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-25 01:41:04,200 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-25 01:41:04,200 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-25 01:41:04,200 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-25 01:41:04,201 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-25 01:41:04,201 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-25 01:41:04,201 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-25 01:41:04,201 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-25 01:41:04,201 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-25 01:41:04,245 INFO L276 IsEmpty]: Start isEmpty. Operand 1120 states. [2018-10-25 01:41:04,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-10-25 01:41:04,259 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:41:04,260 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 01:41:04,262 INFO L424 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:41:04,269 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:41:04,269 INFO L82 PathProgramCache]: Analyzing trace with hash 608823044, now seen corresponding path program 1 times [2018-10-25 01:41:04,272 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:41:04,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:41:04,330 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:41:04,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:41:04,331 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:41:04,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:41:04,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:41:04,786 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:41:04,787 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-25 01:41:04,787 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:41:04,794 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-25 01:41:04,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-25 01:41:04,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-25 01:41:04,814 INFO L87 Difference]: Start difference. First operand 1120 states. Second operand 4 states. [2018-10-25 01:41:21,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:41:21,463 INFO L93 Difference]: Finished difference Result 4105 states and 7669 transitions. [2018-10-25 01:41:21,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-25 01:41:21,474 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 46 [2018-10-25 01:41:21,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:41:21,532 INFO L225 Difference]: With dead ends: 4105 [2018-10-25 01:41:21,532 INFO L226 Difference]: Without dead ends: 2979 [2018-10-25 01:41:21,551 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-25 01:41:21,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2979 states. [2018-10-25 01:41:21,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2979 to 2849. [2018-10-25 01:41:21,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2849 states. [2018-10-25 01:41:21,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2849 states to 2849 states and 5075 transitions. [2018-10-25 01:41:21,782 INFO L78 Accepts]: Start accepts. Automaton has 2849 states and 5075 transitions. Word has length 46 [2018-10-25 01:41:21,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:41:21,784 INFO L481 AbstractCegarLoop]: Abstraction has 2849 states and 5075 transitions. [2018-10-25 01:41:21,784 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-25 01:41:21,784 INFO L276 IsEmpty]: Start isEmpty. Operand 2849 states and 5075 transitions. [2018-10-25 01:41:21,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-10-25 01:41:21,798 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:41:21,799 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 01:41:21,799 INFO L424 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:41:21,800 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:41:21,800 INFO L82 PathProgramCache]: Analyzing trace with hash -248268951, now seen corresponding path program 1 times [2018-10-25 01:41:21,800 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:41:21,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:41:21,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:41:21,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:41:21,802 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:41:21,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:41:22,322 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:41:22,322 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:41:22,322 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-25 01:41:22,322 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:41:22,325 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 01:41:22,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 01:41:22,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 01:41:22,327 INFO L87 Difference]: Start difference. First operand 2849 states and 5075 transitions. Second operand 6 states. [2018-10-25 01:41:41,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:41:41,736 INFO L93 Difference]: Finished difference Result 10644 states and 19598 transitions. [2018-10-25 01:41:41,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-25 01:41:41,739 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 117 [2018-10-25 01:41:41,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:41:41,793 INFO L225 Difference]: With dead ends: 10644 [2018-10-25 01:41:41,793 INFO L226 Difference]: Without dead ends: 7801 [2018-10-25 01:41:41,811 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-25 01:41:41,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7801 states. [2018-10-25 01:41:42,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7801 to 7735. [2018-10-25 01:41:42,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7735 states. [2018-10-25 01:41:42,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7735 states to 7735 states and 12389 transitions. [2018-10-25 01:41:42,049 INFO L78 Accepts]: Start accepts. Automaton has 7735 states and 12389 transitions. Word has length 117 [2018-10-25 01:41:42,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:41:42,054 INFO L481 AbstractCegarLoop]: Abstraction has 7735 states and 12389 transitions. [2018-10-25 01:41:42,054 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 01:41:42,054 INFO L276 IsEmpty]: Start isEmpty. Operand 7735 states and 12389 transitions. [2018-10-25 01:41:42,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-10-25 01:41:42,065 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:41:42,066 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 01:41:42,066 INFO L424 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:41:42,066 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:41:42,067 INFO L82 PathProgramCache]: Analyzing trace with hash -1062052776, now seen corresponding path program 1 times [2018-10-25 01:41:42,068 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:41:42,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:41:42,070 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:41:42,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:41:42,070 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:41:42,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:41:42,548 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:41:42,548 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:41:42,548 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-25 01:41:42,549 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:41:42,549 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 01:41:42,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 01:41:42,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 01:41:42,550 INFO L87 Difference]: Start difference. First operand 7735 states and 12389 transitions. Second operand 6 states. [2018-10-25 01:42:00,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:42:00,904 INFO L93 Difference]: Finished difference Result 20532 states and 34038 transitions. [2018-10-25 01:42:00,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 01:42:00,905 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 120 [2018-10-25 01:42:00,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:42:00,974 INFO L225 Difference]: With dead ends: 20532 [2018-10-25 01:42:00,974 INFO L226 Difference]: Without dead ends: 12803 [2018-10-25 01:42:01,010 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-25 01:42:01,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12803 states. [2018-10-25 01:42:01,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12803 to 12725. [2018-10-25 01:42:01,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12725 states. [2018-10-25 01:42:01,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12725 states to 12725 states and 19315 transitions. [2018-10-25 01:42:01,312 INFO L78 Accepts]: Start accepts. Automaton has 12725 states and 19315 transitions. Word has length 120 [2018-10-25 01:42:01,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:42:01,312 INFO L481 AbstractCegarLoop]: Abstraction has 12725 states and 19315 transitions. [2018-10-25 01:42:01,312 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 01:42:01,313 INFO L276 IsEmpty]: Start isEmpty. Operand 12725 states and 19315 transitions. [2018-10-25 01:42:01,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-10-25 01:42:01,316 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:42:01,316 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 01:42:01,316 INFO L424 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:42:01,316 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:42:01,317 INFO L82 PathProgramCache]: Analyzing trace with hash 2127704900, now seen corresponding path program 1 times [2018-10-25 01:42:01,317 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:42:01,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:42:01,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:42:01,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:42:01,318 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:42:01,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:42:01,645 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:42:01,646 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:42:01,646 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-25 01:42:01,646 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:42:01,647 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-25 01:42:01,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-25 01:42:01,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-25 01:42:01,649 INFO L87 Difference]: Start difference. First operand 12725 states and 19315 transitions. Second operand 5 states. [2018-10-25 01:42:15,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:42:15,934 INFO L93 Difference]: Finished difference Result 38445 states and 61990 transitions. [2018-10-25 01:42:15,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-25 01:42:15,939 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 130 [2018-10-25 01:42:15,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:42:16,063 INFO L225 Difference]: With dead ends: 38445 [2018-10-25 01:42:16,064 INFO L226 Difference]: Without dead ends: 25726 [2018-10-25 01:42:16,111 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-10-25 01:42:16,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25726 states. [2018-10-25 01:42:16,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25726 to 25424. [2018-10-25 01:42:16,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25424 states. [2018-10-25 01:42:16,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25424 states to 25424 states and 37360 transitions. [2018-10-25 01:42:16,703 INFO L78 Accepts]: Start accepts. Automaton has 25424 states and 37360 transitions. Word has length 130 [2018-10-25 01:42:16,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:42:16,703 INFO L481 AbstractCegarLoop]: Abstraction has 25424 states and 37360 transitions. [2018-10-25 01:42:16,703 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-25 01:42:16,704 INFO L276 IsEmpty]: Start isEmpty. Operand 25424 states and 37360 transitions. [2018-10-25 01:42:16,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-10-25 01:42:16,707 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:42:16,708 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 01:42:16,708 INFO L424 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:42:16,708 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:42:16,709 INFO L82 PathProgramCache]: Analyzing trace with hash -334570632, now seen corresponding path program 1 times [2018-10-25 01:42:16,709 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:42:16,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:42:16,710 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:42:16,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:42:16,710 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:42:16,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:42:16,983 WARN L179 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-25 01:42:17,589 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 22 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:42:17,590 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 01:42:17,590 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 01:42:17,591 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 148 with the following transitions: [2018-10-25 01:42:17,594 INFO L202 CegarAbsIntRunner]: [0], [1], [2628], [2635], [2643], [2651], [2659], [2667], [2675], [2683], [2691], [2699], [2707], [2715], [2723], [2731], [2739], [2747], [2755], [2763], [2771], [2779], [2787], [2795], [2803], [2811], [2819], [2827], [2835], [2843], [2851], [2859], [2867], [2875], [2883], [2891], [2895], [2897], [2900], [2908], [2916], [2924], [2932], [2940], [2948], [2956], [2964], [2972], [2980], [2988], [2996], [3004], [3012], [3020], [3028], [3036], [3044], [3052], [3060], [3068], [3076], [3084], [3092], [3100], [3108], [3116], [3121], [3125], [3129], [3133], [3137], [3148], [3152], [3156], [3160], [3164], [3168], [3179], [3183], [3187], [3191], [3195], [3199], [3203], [3207], [3218], [3222], [3226], [3230], [3234], [3238], [3242], [3246], [3250], [3254], [3258], [3262], [3265], [4238], [4242], [4246], [4252], [4256], [4258], [4269], [4270], [4271], [4273], [4274] [2018-10-25 01:42:17,670 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 01:42:17,671 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 01:42:18,722 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-25 01:42:18,723 INFO L272 AbstractInterpreter]: Visited 108 different actions 311 times. Merged at 5 different actions 9 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 26 variables. [2018-10-25 01:42:18,757 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:42:18,757 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-25 01:42:19,319 INFO L232 lantSequenceWeakener]: Weakened 38 states. On average, predicates are now at 74.69% of their original sizes. [2018-10-25 01:42:19,319 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-25 01:42:20,847 INFO L413 sIntCurrentIteration]: We have 146 unified AI predicates [2018-10-25 01:42:20,847 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-25 01:42:20,848 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-25 01:42:20,849 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [7] total 19 [2018-10-25 01:42:20,849 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:42:20,850 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-25 01:42:20,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-25 01:42:20,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2018-10-25 01:42:20,851 INFO L87 Difference]: Start difference. First operand 25424 states and 37360 transitions. Second operand 14 states. [2018-10-25 01:42:32,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-25 01:42:32,061 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.ArithmeticException: BigInteger: modulus not positive at java.math.BigInteger.mod(BigInteger.java:2458) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.explicit.ExplicitValueValue.modulo(ExplicitValueValue.java:154) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.explicit.ExplicitValueValue.modulo(ExplicitValueValue.java:1) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:125) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:100) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:92) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:93) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:92) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java: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.BasicAbstractInterpolantAutomaton.chooseFalseSuccessor2(BasicAbstractInterpolantAutomaton.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:72) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1066) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:968) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:188) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:673) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:602) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:473) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-10-25 01:42:32,072 INFO L168 Benchmark]: Toolchain (without parser) took 104304.30 ms. Allocated memory was 1.5 GB in the beginning and 3.1 GB in the end (delta: 1.5 GB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -662.5 MB). Peak memory consumption was 885.7 MB. Max. memory is 7.1 GB. [2018-10-25 01:42:32,074 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-25 01:42:32,074 INFO L168 Benchmark]: CACSL2BoogieTranslator took 2537.59 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 253.7 MB). Peak memory consumption was 253.7 MB. Max. memory is 7.1 GB. [2018-10-25 01:42:32,076 INFO L168 Benchmark]: Boogie Procedure Inliner took 609.75 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 814.7 MB). Free memory was 1.2 GB in the beginning and 2.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 73.1 MB. Max. memory is 7.1 GB. [2018-10-25 01:42:32,077 INFO L168 Benchmark]: Boogie Preprocessor took 442.22 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: 49.4 MB). Peak memory consumption was 49.4 MB. Max. memory is 7.1 GB. [2018-10-25 01:42:32,078 INFO L168 Benchmark]: RCFGBuilder took 12738.47 ms. Allocated memory was 2.3 GB in the beginning and 2.5 GB in the end (delta: 182.5 MB). Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 9.9 MB). Peak memory consumption was 652.4 MB. Max. memory is 7.1 GB. [2018-10-25 01:42:32,079 INFO L168 Benchmark]: TraceAbstraction took 87970.99 ms. Allocated memory was 2.5 GB in the beginning and 3.1 GB in the end (delta: 551.0 MB). Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 113.1 MB). Peak memory consumption was 664.1 MB. Max. memory is 7.1 GB. [2018-10-25 01:42:32,087 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.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 2537.59 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 253.7 MB). Peak memory consumption was 253.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 609.75 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 814.7 MB). Free memory was 1.2 GB in the beginning and 2.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 73.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 442.22 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: 49.4 MB). Peak memory consumption was 49.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 12738.47 ms. Allocated memory was 2.3 GB in the beginning and 2.5 GB in the end (delta: 182.5 MB). Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 9.9 MB). Peak memory consumption was 652.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 87970.99 ms. Allocated memory was 2.5 GB in the beginning and 3.1 GB in the end (delta: 551.0 MB). Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 113.1 MB). Peak memory consumption was 664.1 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...