/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-32bit-Taipan_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem02_label54.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 23:33:28,481 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 23:33:28,484 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 23:33:28,500 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 23:33:28,501 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 23:33:28,502 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 23:33:28,503 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 23:33:28,506 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 23:33:28,522 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 23:33:28,523 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 23:33:28,524 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 23:33:28,525 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 23:33:28,527 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 23:33:28,528 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 23:33:28,531 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 23:33:28,533 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 23:33:28,534 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 23:33:28,538 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 23:33:28,542 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 23:33:28,545 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 23:33:28,549 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 23:33:28,552 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 23:33:28,553 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 23:33:28,554 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 23:33:28,556 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 23:33:28,557 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 23:33:28,557 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 23:33:28,558 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 23:33:28,558 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 23:33:28,561 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 23:33:28,561 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 23:33:28,562 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 23:33:28,563 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 23:33:28,563 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 23:33:28,564 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 23:33:28,564 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 23:33:28,565 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 23:33:28,565 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 23:33:28,566 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 23:33:28,566 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 23:33:28,567 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 23:33:28,568 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-32bit-Taipan_Default.epf [2019-11-23 23:33:28,583 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 23:33:28,583 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 23:33:28,584 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-23 23:33:28,584 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-23 23:33:28,584 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-23 23:33:28,585 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-23 23:33:28,585 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-23 23:33:28,585 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-23 23:33:28,585 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-23 23:33:28,585 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-23 23:33:28,585 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-23 23:33:28,586 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-23 23:33:28,586 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-23 23:33:28,586 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-23 23:33:28,586 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-23 23:33:28,587 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 23:33:28,587 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 23:33:28,587 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 23:33:28,588 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 23:33:28,588 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 23:33:28,588 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 23:33:28,588 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 23:33:28,589 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 23:33:28,589 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 23:33:28,589 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 23:33:28,589 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 23:33:28,589 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 23:33:28,590 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 23:33:28,590 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 23:33:28,590 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 23:33:28,590 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 23:33:28,590 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 23:33:28,590 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 23:33:28,591 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-23 23:33:28,591 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 23:33:28,591 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 23:33:28,591 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 23:33:28,591 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-11-23 23:33:28,880 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 23:33:28,899 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 23:33:28,903 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 23:33:28,905 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 23:33:28,905 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 23:33:28,906 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem02_label54.c [2019-11-23 23:33:28,984 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d62542b4/7f7afdb189774f39b5aeacc9f6cac4ad/FLAG22deb295d [2019-11-23 23:33:29,550 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 23:33:29,551 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem02_label54.c [2019-11-23 23:33:29,565 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d62542b4/7f7afdb189774f39b5aeacc9f6cac4ad/FLAG22deb295d [2019-11-23 23:33:29,820 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d62542b4/7f7afdb189774f39b5aeacc9f6cac4ad [2019-11-23 23:33:29,833 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 23:33:29,834 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 23:33:29,835 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 23:33:29,836 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 23:33:29,839 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 23:33:29,841 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:33:29" (1/1) ... [2019-11-23 23:33:29,844 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2bf34412 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:33:29, skipping insertion in model container [2019-11-23 23:33:29,844 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:33:29" (1/1) ... [2019-11-23 23:33:29,852 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 23:33:29,906 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 23:33:30,442 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 23:33:30,454 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 23:33:30,583 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 23:33:30,603 INFO L208 MainTranslator]: Completed translation [2019-11-23 23:33:30,604 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:33:30 WrapperNode [2019-11-23 23:33:30,604 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 23:33:30,605 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 23:33:30,605 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 23:33:30,605 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 23:33:30,615 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:33:30" (1/1) ... [2019-11-23 23:33:30,646 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:33:30" (1/1) ... [2019-11-23 23:33:30,737 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 23:33:30,737 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 23:33:30,738 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 23:33:30,738 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 23:33:30,748 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:33:30" (1/1) ... [2019-11-23 23:33:30,749 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:33:30" (1/1) ... [2019-11-23 23:33:30,757 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:33:30" (1/1) ... [2019-11-23 23:33:30,758 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:33:30" (1/1) ... [2019-11-23 23:33:30,793 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:33:30" (1/1) ... [2019-11-23 23:33:30,816 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:33:30" (1/1) ... [2019-11-23 23:33:30,822 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:33:30" (1/1) ... [2019-11-23 23:33:30,832 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 23:33:30,832 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 23:33:30,833 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 23:33:30,833 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 23:33:30,834 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:33:30" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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 [2019-11-23 23:33:30,895 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 23:33:30,895 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 23:33:32,861 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 23:33:32,862 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-23 23:33:32,863 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:33:32 BoogieIcfgContainer [2019-11-23 23:33:32,863 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 23:33:32,864 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 23:33:32,864 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 23:33:32,868 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 23:33:32,869 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:33:29" (1/3) ... [2019-11-23 23:33:32,870 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29250d3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:33:32, skipping insertion in model container [2019-11-23 23:33:32,870 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:33:30" (2/3) ... [2019-11-23 23:33:32,871 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29250d3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:33:32, skipping insertion in model container [2019-11-23 23:33:32,871 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:33:32" (3/3) ... [2019-11-23 23:33:32,872 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem02_label54.c [2019-11-23 23:33:32,882 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 23:33:32,890 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-23 23:33:32,903 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-23 23:33:32,946 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 23:33:32,946 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 23:33:32,946 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 23:33:32,947 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 23:33:32,947 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 23:33:32,947 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 23:33:32,947 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 23:33:32,947 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 23:33:32,971 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states. [2019-11-23 23:33:32,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-11-23 23:33:32,982 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:33:32,984 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:33:32,984 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:33:32,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:33:32,993 INFO L82 PathProgramCache]: Analyzing trace with hash 925947785, now seen corresponding path program 1 times [2019-11-23 23:33:33,008 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:33:33,008 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953728543] [2019-11-23 23:33:33,008 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:33:33,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:33:33,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 23:33:33,452 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953728543] [2019-11-23 23:33:33,454 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:33:33,454 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 23:33:33,455 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874138702] [2019-11-23 23:33:33,463 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:33:33,463 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:33:33,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:33:33,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:33:33,480 INFO L87 Difference]: Start difference. First operand 85 states. Second operand 3 states. [2019-11-23 23:33:34,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:33:34,003 INFO L93 Difference]: Finished difference Result 251 states and 482 transitions. [2019-11-23 23:33:34,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:33:34,005 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 80 [2019-11-23 23:33:34,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:33:34,020 INFO L225 Difference]: With dead ends: 251 [2019-11-23 23:33:34,020 INFO L226 Difference]: Without dead ends: 163 [2019-11-23 23:33:34,027 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:33:34,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-11-23 23:33:34,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2019-11-23 23:33:34,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-11-23 23:33:34,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 288 transitions. [2019-11-23 23:33:34,091 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 288 transitions. Word has length 80 [2019-11-23 23:33:34,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:33:34,092 INFO L462 AbstractCegarLoop]: Abstraction has 163 states and 288 transitions. [2019-11-23 23:33:34,092 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:33:34,093 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 288 transitions. [2019-11-23 23:33:34,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-23 23:33:34,097 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:33:34,097 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-23 23:33:34,097 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:33:34,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:33:34,098 INFO L82 PathProgramCache]: Analyzing trace with hash 221748264, now seen corresponding path program 1 times [2019-11-23 23:33:34,098 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:33:34,099 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134893328] [2019-11-23 23:33:34,099 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:33:34,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:33:34,221 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 23:33:34,222 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134893328] [2019-11-23 23:33:34,222 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:33:34,222 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:33:34,223 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032706880] [2019-11-23 23:33:34,226 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:33:34,226 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:33:34,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:33:34,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:33:34,227 INFO L87 Difference]: Start difference. First operand 163 states and 288 transitions. Second operand 4 states. [2019-11-23 23:33:34,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:33:34,906 INFO L93 Difference]: Finished difference Result 647 states and 1148 transitions. [2019-11-23 23:33:34,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:33:34,907 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-11-23 23:33:34,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:33:34,912 INFO L225 Difference]: With dead ends: 647 [2019-11-23 23:33:34,912 INFO L226 Difference]: Without dead ends: 485 [2019-11-23 23:33:34,914 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:33:34,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2019-11-23 23:33:34,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 323. [2019-11-23 23:33:34,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2019-11-23 23:33:34,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 549 transitions. [2019-11-23 23:33:34,952 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 549 transitions. Word has length 98 [2019-11-23 23:33:34,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:33:34,952 INFO L462 AbstractCegarLoop]: Abstraction has 323 states and 549 transitions. [2019-11-23 23:33:34,953 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:33:34,953 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 549 transitions. [2019-11-23 23:33:34,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-23 23:33:34,956 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:33:34,957 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-23 23:33:34,957 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:33:34,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:33:34,957 INFO L82 PathProgramCache]: Analyzing trace with hash -1583675060, now seen corresponding path program 1 times [2019-11-23 23:33:34,958 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:33:34,958 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413516463] [2019-11-23 23:33:34,958 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:33:34,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:33:35,018 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 23:33:35,019 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413516463] [2019-11-23 23:33:35,019 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:33:35,019 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:33:35,019 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823886099] [2019-11-23 23:33:35,020 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:33:35,020 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:33:35,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:33:35,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:33:35,021 INFO L87 Difference]: Start difference. First operand 323 states and 549 transitions. Second operand 4 states. [2019-11-23 23:33:35,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:33:35,752 INFO L93 Difference]: Finished difference Result 1285 states and 2191 transitions. [2019-11-23 23:33:35,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:33:35,753 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 99 [2019-11-23 23:33:35,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:33:35,759 INFO L225 Difference]: With dead ends: 1285 [2019-11-23 23:33:35,759 INFO L226 Difference]: Without dead ends: 963 [2019-11-23 23:33:35,762 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:33:35,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 963 states. [2019-11-23 23:33:35,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 963 to 643. [2019-11-23 23:33:35,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 643 states. [2019-11-23 23:33:35,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 1034 transitions. [2019-11-23 23:33:35,814 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 1034 transitions. Word has length 99 [2019-11-23 23:33:35,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:33:35,817 INFO L462 AbstractCegarLoop]: Abstraction has 643 states and 1034 transitions. [2019-11-23 23:33:35,817 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:33:35,817 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 1034 transitions. [2019-11-23 23:33:35,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-11-23 23:33:35,823 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:33:35,823 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 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] [2019-11-23 23:33:35,823 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:33:35,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:33:35,824 INFO L82 PathProgramCache]: Analyzing trace with hash -875196963, now seen corresponding path program 1 times [2019-11-23 23:33:35,824 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:33:35,824 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115420669] [2019-11-23 23:33:35,824 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:33:35,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:33:35,950 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 23:33:35,951 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115420669] [2019-11-23 23:33:35,951 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:33:35,951 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 23:33:35,952 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766409746] [2019-11-23 23:33:35,952 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:33:35,952 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:33:35,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:33:35,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:33:35,953 INFO L87 Difference]: Start difference. First operand 643 states and 1034 transitions. Second operand 4 states. [2019-11-23 23:33:36,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:33:36,706 INFO L93 Difference]: Finished difference Result 2085 states and 3283 transitions. [2019-11-23 23:33:36,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:33:36,707 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-11-23 23:33:36,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:33:36,718 INFO L225 Difference]: With dead ends: 2085 [2019-11-23 23:33:36,718 INFO L226 Difference]: Without dead ends: 1443 [2019-11-23 23:33:36,720 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:33:36,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1443 states. [2019-11-23 23:33:36,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1443 to 1283. [2019-11-23 23:33:36,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1283 states. [2019-11-23 23:33:36,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1283 states to 1283 states and 1830 transitions. [2019-11-23 23:33:36,765 INFO L78 Accepts]: Start accepts. Automaton has 1283 states and 1830 transitions. Word has length 102 [2019-11-23 23:33:36,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:33:36,766 INFO L462 AbstractCegarLoop]: Abstraction has 1283 states and 1830 transitions. [2019-11-23 23:33:36,766 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:33:36,766 INFO L276 IsEmpty]: Start isEmpty. Operand 1283 states and 1830 transitions. [2019-11-23 23:33:36,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-11-23 23:33:36,769 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:33:36,770 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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] [2019-11-23 23:33:36,770 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:33:36,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:33:36,771 INFO L82 PathProgramCache]: Analyzing trace with hash -2118177397, now seen corresponding path program 1 times [2019-11-23 23:33:36,771 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:33:36,772 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621017240] [2019-11-23 23:33:36,772 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:33:36,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:33:36,891 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-23 23:33:36,892 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621017240] [2019-11-23 23:33:36,892 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:33:36,892 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 23:33:36,893 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309707801] [2019-11-23 23:33:36,893 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:33:36,893 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:33:36,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:33:36,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:33:36,894 INFO L87 Difference]: Start difference. First operand 1283 states and 1830 transitions. Second operand 4 states. [2019-11-23 23:33:37,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:33:37,679 INFO L93 Difference]: Finished difference Result 3045 states and 4365 transitions. [2019-11-23 23:33:37,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:33:37,680 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 107 [2019-11-23 23:33:37,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:33:37,691 INFO L225 Difference]: With dead ends: 3045 [2019-11-23 23:33:37,693 INFO L226 Difference]: Without dead ends: 1443 [2019-11-23 23:33:37,697 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:33:37,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1443 states. [2019-11-23 23:33:37,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1443 to 1443. [2019-11-23 23:33:37,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1443 states. [2019-11-23 23:33:37,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1443 states to 1443 states and 1752 transitions. [2019-11-23 23:33:37,744 INFO L78 Accepts]: Start accepts. Automaton has 1443 states and 1752 transitions. Word has length 107 [2019-11-23 23:33:37,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:33:37,745 INFO L462 AbstractCegarLoop]: Abstraction has 1443 states and 1752 transitions. [2019-11-23 23:33:37,745 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:33:37,745 INFO L276 IsEmpty]: Start isEmpty. Operand 1443 states and 1752 transitions. [2019-11-23 23:33:37,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-11-23 23:33:37,751 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:33:37,752 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:33:37,752 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:33:37,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:33:37,753 INFO L82 PathProgramCache]: Analyzing trace with hash 1503301046, now seen corresponding path program 1 times [2019-11-23 23:33:37,753 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:33:37,753 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791306327] [2019-11-23 23:33:37,754 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:33:37,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:33:37,858 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-11-23 23:33:37,859 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791306327] [2019-11-23 23:33:37,860 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:33:37,860 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 23:33:37,860 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652963525] [2019-11-23 23:33:37,861 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:33:37,861 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:33:37,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:33:37,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:33:37,863 INFO L87 Difference]: Start difference. First operand 1443 states and 1752 transitions. Second operand 3 states. [2019-11-23 23:33:38,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:33:38,261 INFO L93 Difference]: Finished difference Result 3285 states and 3985 transitions. [2019-11-23 23:33:38,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:33:38,262 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 119 [2019-11-23 23:33:38,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:33:38,272 INFO L225 Difference]: With dead ends: 3285 [2019-11-23 23:33:38,273 INFO L226 Difference]: Without dead ends: 1843 [2019-11-23 23:33:38,275 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:33:38,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1843 states. [2019-11-23 23:33:38,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1843 to 1283. [2019-11-23 23:33:38,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1283 states. [2019-11-23 23:33:38,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1283 states to 1283 states and 1529 transitions. [2019-11-23 23:33:38,315 INFO L78 Accepts]: Start accepts. Automaton has 1283 states and 1529 transitions. Word has length 119 [2019-11-23 23:33:38,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:33:38,315 INFO L462 AbstractCegarLoop]: Abstraction has 1283 states and 1529 transitions. [2019-11-23 23:33:38,315 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:33:38,315 INFO L276 IsEmpty]: Start isEmpty. Operand 1283 states and 1529 transitions. [2019-11-23 23:33:38,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-11-23 23:33:38,319 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:33:38,319 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-23 23:33:38,320 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:33:38,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:33:38,325 INFO L82 PathProgramCache]: Analyzing trace with hash 2102859777, now seen corresponding path program 1 times [2019-11-23 23:33:38,325 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:33:38,326 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925154854] [2019-11-23 23:33:38,332 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:33:38,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:33:38,735 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 23:33:38,735 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925154854] [2019-11-23 23:33:38,735 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:33:38,736 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-23 23:33:38,736 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449409728] [2019-11-23 23:33:38,736 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-23 23:33:38,736 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:33:38,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-23 23:33:38,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-11-23 23:33:38,737 INFO L87 Difference]: Start difference. First operand 1283 states and 1529 transitions. Second operand 8 states. [2019-11-23 23:33:39,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:33:39,760 INFO L93 Difference]: Finished difference Result 2825 states and 3351 transitions. [2019-11-23 23:33:39,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-23 23:33:39,760 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 148 [2019-11-23 23:33:39,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:33:39,768 INFO L225 Difference]: With dead ends: 2825 [2019-11-23 23:33:39,768 INFO L226 Difference]: Without dead ends: 1383 [2019-11-23 23:33:39,770 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2019-11-23 23:33:39,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1383 states. [2019-11-23 23:33:39,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1383 to 1203. [2019-11-23 23:33:39,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1203 states. [2019-11-23 23:33:39,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1203 states to 1203 states and 1421 transitions. [2019-11-23 23:33:39,800 INFO L78 Accepts]: Start accepts. Automaton has 1203 states and 1421 transitions. Word has length 148 [2019-11-23 23:33:39,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:33:39,801 INFO L462 AbstractCegarLoop]: Abstraction has 1203 states and 1421 transitions. [2019-11-23 23:33:39,801 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-23 23:33:39,802 INFO L276 IsEmpty]: Start isEmpty. Operand 1203 states and 1421 transitions. [2019-11-23 23:33:39,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-11-23 23:33:39,805 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:33:39,806 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-23 23:33:39,806 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:33:39,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:33:39,806 INFO L82 PathProgramCache]: Analyzing trace with hash 128915111, now seen corresponding path program 1 times [2019-11-23 23:33:39,806 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:33:39,807 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305093690] [2019-11-23 23:33:39,807 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:33:39,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:33:39,920 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-11-23 23:33:39,920 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305093690] [2019-11-23 23:33:39,921 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:33:39,921 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:33:39,921 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310947692] [2019-11-23 23:33:39,921 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:33:39,922 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:33:39,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:33:39,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:33:39,922 INFO L87 Difference]: Start difference. First operand 1203 states and 1421 transitions. Second operand 3 states. [2019-11-23 23:33:40,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:33:40,324 INFO L93 Difference]: Finished difference Result 2243 states and 2651 transitions. [2019-11-23 23:33:40,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:33:40,325 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 149 [2019-11-23 23:33:40,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:33:40,325 INFO L225 Difference]: With dead ends: 2243 [2019-11-23 23:33:40,326 INFO L226 Difference]: Without dead ends: 0 [2019-11-23 23:33:40,329 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:33:40,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-23 23:33:40,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-23 23:33:40,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-23 23:33:40,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-23 23:33:40,331 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 149 [2019-11-23 23:33:40,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:33:40,331 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-23 23:33:40,331 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:33:40,331 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-23 23:33:40,331 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-23 23:33:40,338 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-23 23:33:40,732 WARN L192 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 33 [2019-11-23 23:33:40,983 WARN L192 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 33 [2019-11-23 23:33:40,987 INFO L444 ceAbstractionStarter]: For program point L234(lines 234 413) no Hoare annotation was computed. [2019-11-23 23:33:40,987 INFO L444 ceAbstractionStarter]: For program point L169(lines 169 413) no Hoare annotation was computed. [2019-11-23 23:33:40,987 INFO L444 ceAbstractionStarter]: For program point L368(lines 368 413) no Hoare annotation was computed. [2019-11-23 23:33:40,988 INFO L444 ceAbstractionStarter]: For program point L38(lines 38 413) no Hoare annotation was computed. [2019-11-23 23:33:40,988 INFO L444 ceAbstractionStarter]: For program point L237(lines 237 413) no Hoare annotation was computed. [2019-11-23 23:33:40,988 INFO L444 ceAbstractionStarter]: For program point L106(lines 106 413) no Hoare annotation was computed. [2019-11-23 23:33:40,988 INFO L444 ceAbstractionStarter]: For program point L42(lines 42 413) no Hoare annotation was computed. [2019-11-23 23:33:40,989 INFO L444 ceAbstractionStarter]: For program point L175(lines 175 413) no Hoare annotation was computed. [2019-11-23 23:33:40,989 INFO L444 ceAbstractionStarter]: For program point L375(lines 375 413) no Hoare annotation was computed. [2019-11-23 23:33:40,989 INFO L444 ceAbstractionStarter]: For program point L309(lines 309 413) no Hoare annotation was computed. [2019-11-23 23:33:40,989 INFO L444 ceAbstractionStarter]: For program point L179(lines 179 413) no Hoare annotation was computed. [2019-11-23 23:33:40,989 INFO L444 ceAbstractionStarter]: For program point L113(lines 113 413) no Hoare annotation was computed. [2019-11-23 23:33:40,990 INFO L444 ceAbstractionStarter]: For program point L47(lines 47 413) no Hoare annotation was computed. [2019-11-23 23:33:40,990 INFO L444 ceAbstractionStarter]: For program point L378(lines 378 413) no Hoare annotation was computed. [2019-11-23 23:33:40,990 INFO L444 ceAbstractionStarter]: For program point L380(lines 380 413) no Hoare annotation was computed. [2019-11-23 23:33:40,990 INFO L444 ceAbstractionStarter]: For program point L314(lines 314 413) no Hoare annotation was computed. [2019-11-23 23:33:40,990 INFO L444 ceAbstractionStarter]: For program point L248(lines 248 413) no Hoare annotation was computed. [2019-11-23 23:33:40,990 INFO L444 ceAbstractionStarter]: For program point L50(lines 50 413) no Hoare annotation was computed. [2019-11-23 23:33:40,991 INFO L444 ceAbstractionStarter]: For program point L185(lines 185 413) no Hoare annotation was computed. [2019-11-23 23:33:40,991 INFO L444 ceAbstractionStarter]: For program point L119(lines 119 413) no Hoare annotation was computed. [2019-11-23 23:33:40,991 INFO L444 ceAbstractionStarter]: For program point L54(lines 54 413) no Hoare annotation was computed. [2019-11-23 23:33:40,991 INFO L444 ceAbstractionStarter]: For program point L253(lines 253 413) no Hoare annotation was computed. [2019-11-23 23:33:40,991 INFO L444 ceAbstractionStarter]: For program point L187(lines 187 413) no Hoare annotation was computed. [2019-11-23 23:33:40,991 INFO L444 ceAbstractionStarter]: For program point L189(lines 189 413) no Hoare annotation was computed. [2019-11-23 23:33:40,991 INFO L444 ceAbstractionStarter]: For program point L123(lines 123 413) no Hoare annotation was computed. [2019-11-23 23:33:40,991 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-23 23:33:40,992 INFO L444 ceAbstractionStarter]: For program point L389(lines 389 413) no Hoare annotation was computed. [2019-11-23 23:33:40,992 INFO L444 ceAbstractionStarter]: For program point L191(lines 191 413) no Hoare annotation was computed. [2019-11-23 23:33:40,992 INFO L444 ceAbstractionStarter]: For program point L59(lines 59 413) no Hoare annotation was computed. [2019-11-23 23:33:40,992 INFO L444 ceAbstractionStarter]: For program point L259(lines 259 413) no Hoare annotation was computed. [2019-11-23 23:33:40,992 INFO L444 ceAbstractionStarter]: For program point L194(lines 194 413) no Hoare annotation was computed. [2019-11-23 23:33:40,992 INFO L444 ceAbstractionStarter]: For program point L261(lines 261 413) no Hoare annotation was computed. [2019-11-23 23:33:40,992 INFO L444 ceAbstractionStarter]: For program point L394(lines 394 413) no Hoare annotation was computed. [2019-11-23 23:33:40,992 INFO L444 ceAbstractionStarter]: For program point L328(lines 328 413) no Hoare annotation was computed. [2019-11-23 23:33:40,993 INFO L444 ceAbstractionStarter]: For program point L130(lines 130 413) no Hoare annotation was computed. [2019-11-23 23:33:40,993 INFO L444 ceAbstractionStarter]: For program point L65(lines 65 413) no Hoare annotation was computed. [2019-11-23 23:33:40,993 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 475) no Hoare annotation was computed. [2019-11-23 23:33:40,993 INFO L444 ceAbstractionStarter]: For program point L198(lines 198 413) no Hoare annotation was computed. [2019-11-23 23:33:40,993 INFO L444 ceAbstractionStarter]: For program point L331(lines 331 413) no Hoare annotation was computed. [2019-11-23 23:33:40,993 INFO L444 ceAbstractionStarter]: For program point L398(lines 398 413) no Hoare annotation was computed. [2019-11-23 23:33:40,993 INFO L444 ceAbstractionStarter]: For program point L134(lines 134 413) no Hoare annotation was computed. [2019-11-23 23:33:40,994 INFO L440 ceAbstractionStarter]: At program point L597(lines 29 598) the Hoare annotation is: (let ((.cse8 (= ~a11~0 1)) (.cse7 (= ~a25~0 1))) (let ((.cse3 (= ~a17~0 8)) (.cse2 (= ~a28~0 9)) (.cse0 (= ~a28~0 10)) (.cse5 (not .cse7)) (.cse4 (not (= ~a28~0 11))) (.cse1 (= ~a19~0 1)) (.cse6 (not .cse8))) (or (and .cse0 .cse1) (and .cse2 .cse3 .cse1) (and .cse3 (not .cse2) .cse4) (and .cse5 .cse3 .cse6) (and .cse2 .cse5 .cse6) (and .cse2 .cse7) (and .cse0 .cse5 .cse8) (and .cse1 .cse7 .cse4) (and .cse1 .cse6 .cse7)))) [2019-11-23 23:33:40,994 INFO L444 ceAbstractionStarter]: For program point L69(lines 69 413) no Hoare annotation was computed. [2019-11-23 23:33:40,994 INFO L444 ceAbstractionStarter]: For program point L202(lines 202 413) no Hoare annotation was computed. [2019-11-23 23:33:40,994 INFO L447 ceAbstractionStarter]: At program point L600(lines 600 617) the Hoare annotation is: true [2019-11-23 23:33:40,995 INFO L444 ceAbstractionStarter]: For program point L402(lines 402 413) no Hoare annotation was computed. [2019-11-23 23:33:40,995 INFO L444 ceAbstractionStarter]: For program point L337(lines 337 413) no Hoare annotation was computed. [2019-11-23 23:33:40,995 INFO L444 ceAbstractionStarter]: For program point L139(lines 139 413) no Hoare annotation was computed. [2019-11-23 23:33:40,995 INFO L444 ceAbstractionStarter]: For program point L404(lines 404 413) no Hoare annotation was computed. [2019-11-23 23:33:40,995 INFO L444 ceAbstractionStarter]: For program point L74(lines 74 413) no Hoare annotation was computed. [2019-11-23 23:33:40,995 INFO L444 ceAbstractionStarter]: For program point L471-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 23:33:40,995 INFO L444 ceAbstractionStarter]: For program point L407(lines 407 413) no Hoare annotation was computed. [2019-11-23 23:33:40,995 INFO L444 ceAbstractionStarter]: For program point L143(lines 143 413) no Hoare annotation was computed. [2019-11-23 23:33:40,996 INFO L440 ceAbstractionStarter]: At program point L606-2(lines 606 616) the Hoare annotation is: (let ((.cse8 (= ~a11~0 1)) (.cse7 (= ~a25~0 1))) (let ((.cse3 (= ~a17~0 8)) (.cse2 (= ~a28~0 9)) (.cse0 (= ~a28~0 10)) (.cse5 (not .cse7)) (.cse4 (not (= ~a28~0 11))) (.cse1 (= ~a19~0 1)) (.cse6 (not .cse8))) (or (and .cse0 .cse1) (and .cse2 .cse3 .cse1) (and .cse3 (not .cse2) .cse4) (and .cse5 .cse3 .cse6) (and .cse2 .cse5 .cse6) (and .cse2 .cse7) (and .cse0 .cse5 .cse8) (and .cse1 .cse7 .cse4) (and .cse1 .cse6 .cse7)))) [2019-11-23 23:33:40,996 INFO L444 ceAbstractionStarter]: For program point L474-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 23:33:40,996 INFO L444 ceAbstractionStarter]: For program point L276(lines 276 413) no Hoare annotation was computed. [2019-11-23 23:33:40,996 INFO L444 ceAbstractionStarter]: For program point L475(line 475) no Hoare annotation was computed. [2019-11-23 23:33:40,996 INFO L444 ceAbstractionStarter]: For program point L409(lines 409 413) no Hoare annotation was computed. [2019-11-23 23:33:40,996 INFO L444 ceAbstractionStarter]: For program point L212(lines 212 413) no Hoare annotation was computed. [2019-11-23 23:33:40,996 INFO L444 ceAbstractionStarter]: For program point L280(lines 280 413) no Hoare annotation was computed. [2019-11-23 23:33:40,997 INFO L444 ceAbstractionStarter]: For program point L148(lines 148 413) no Hoare annotation was computed. [2019-11-23 23:33:40,997 INFO L444 ceAbstractionStarter]: For program point L82(lines 82 413) no Hoare annotation was computed. [2019-11-23 23:33:40,997 INFO L444 ceAbstractionStarter]: For program point L611(line 611) no Hoare annotation was computed. [2019-11-23 23:33:40,997 INFO L444 ceAbstractionStarter]: For program point L215(lines 215 413) no Hoare annotation was computed. [2019-11-23 23:33:40,997 INFO L444 ceAbstractionStarter]: For program point L349(lines 349 413) no Hoare annotation was computed. [2019-11-23 23:33:40,997 INFO L444 ceAbstractionStarter]: For program point L283(lines 283 413) no Hoare annotation was computed. [2019-11-23 23:33:40,997 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-23 23:33:40,997 INFO L444 ceAbstractionStarter]: For program point L218(lines 218 413) no Hoare annotation was computed. [2019-11-23 23:33:40,997 INFO L444 ceAbstractionStarter]: For program point L286(lines 286 413) no Hoare annotation was computed. [2019-11-23 23:33:40,998 INFO L444 ceAbstractionStarter]: For program point L154(lines 154 413) no Hoare annotation was computed. [2019-11-23 23:33:40,998 INFO L444 ceAbstractionStarter]: For program point L354(lines 354 413) no Hoare annotation was computed. [2019-11-23 23:33:40,998 INFO L444 ceAbstractionStarter]: For program point L223(lines 223 413) no Hoare annotation was computed. [2019-11-23 23:33:40,998 INFO L444 ceAbstractionStarter]: For program point L91(lines 91 413) no Hoare annotation was computed. [2019-11-23 23:33:40,998 INFO L444 ceAbstractionStarter]: For program point L291(lines 291 413) no Hoare annotation was computed. [2019-11-23 23:33:40,998 INFO L444 ceAbstractionStarter]: For program point L225(lines 225 413) no Hoare annotation was computed. [2019-11-23 23:33:40,998 INFO L444 ceAbstractionStarter]: For program point L159(lines 159 413) no Hoare annotation was computed. [2019-11-23 23:33:40,998 INFO L444 ceAbstractionStarter]: For program point L293(lines 293 413) no Hoare annotation was computed. [2019-11-23 23:33:40,999 INFO L444 ceAbstractionStarter]: For program point L95(lines 95 413) no Hoare annotation was computed. [2019-11-23 23:33:40,999 INFO L444 ceAbstractionStarter]: For program point L30(lines 30 413) no Hoare annotation was computed. [2019-11-23 23:33:40,999 INFO L444 ceAbstractionStarter]: For program point L361(lines 361 413) no Hoare annotation was computed. [2019-11-23 23:33:40,999 INFO L444 ceAbstractionStarter]: For program point L297(lines 297 413) no Hoare annotation was computed. [2019-11-23 23:33:40,999 INFO L444 ceAbstractionStarter]: For program point L165(lines 165 413) no Hoare annotation was computed. [2019-11-23 23:33:40,999 INFO L444 ceAbstractionStarter]: For program point L99(lines 99 413) no Hoare annotation was computed. [2019-11-23 23:33:40,999 INFO L444 ceAbstractionStarter]: For program point L232(lines 232 413) no Hoare annotation was computed. [2019-11-23 23:33:40,999 INFO L444 ceAbstractionStarter]: For program point L35(lines 35 413) no Hoare annotation was computed. [2019-11-23 23:33:41,021 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 11:33:41 BoogieIcfgContainer [2019-11-23 23:33:41,021 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-23 23:33:41,023 INFO L168 Benchmark]: Toolchain (without parser) took 11188.68 ms. Allocated memory was 145.2 MB in the beginning and 378.0 MB in the end (delta: 232.8 MB). Free memory was 100.9 MB in the beginning and 154.7 MB in the end (delta: -53.8 MB). Peak memory consumption was 178.9 MB. Max. memory is 7.1 GB. [2019-11-23 23:33:41,024 INFO L168 Benchmark]: CDTParser took 0.30 ms. Allocated memory is still 145.2 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-11-23 23:33:41,025 INFO L168 Benchmark]: CACSL2BoogieTranslator took 768.90 ms. Allocated memory was 145.2 MB in the beginning and 205.0 MB in the end (delta: 59.8 MB). Free memory was 100.6 MB in the beginning and 171.6 MB in the end (delta: -70.9 MB). Peak memory consumption was 31.1 MB. Max. memory is 7.1 GB. [2019-11-23 23:33:41,026 INFO L168 Benchmark]: Boogie Procedure Inliner took 132.51 ms. Allocated memory is still 205.0 MB. Free memory was 171.6 MB in the beginning and 166.1 MB in the end (delta: 5.5 MB). Peak memory consumption was 5.5 MB. Max. memory is 7.1 GB. [2019-11-23 23:33:41,027 INFO L168 Benchmark]: Boogie Preprocessor took 94.63 ms. Allocated memory is still 205.0 MB. Free memory was 166.1 MB in the beginning and 161.2 MB in the end (delta: 4.9 MB). Peak memory consumption was 4.9 MB. Max. memory is 7.1 GB. [2019-11-23 23:33:41,028 INFO L168 Benchmark]: RCFGBuilder took 2030.98 ms. Allocated memory was 205.0 MB in the beginning and 251.7 MB in the end (delta: 46.7 MB). Free memory was 161.2 MB in the beginning and 197.5 MB in the end (delta: -36.4 MB). Peak memory consumption was 115.1 MB. Max. memory is 7.1 GB. [2019-11-23 23:33:41,029 INFO L168 Benchmark]: TraceAbstraction took 8156.62 ms. Allocated memory was 251.7 MB in the beginning and 378.0 MB in the end (delta: 126.4 MB). Free memory was 197.5 MB in the beginning and 154.7 MB in the end (delta: 42.8 MB). Peak memory consumption was 169.2 MB. Max. memory is 7.1 GB. [2019-11-23 23:33:41,034 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.30 ms. Allocated memory is still 145.2 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 768.90 ms. Allocated memory was 145.2 MB in the beginning and 205.0 MB in the end (delta: 59.8 MB). Free memory was 100.6 MB in the beginning and 171.6 MB in the end (delta: -70.9 MB). Peak memory consumption was 31.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 132.51 ms. Allocated memory is still 205.0 MB. Free memory was 171.6 MB in the beginning and 166.1 MB in the end (delta: 5.5 MB). Peak memory consumption was 5.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 94.63 ms. Allocated memory is still 205.0 MB. Free memory was 166.1 MB in the beginning and 161.2 MB in the end (delta: 4.9 MB). Peak memory consumption was 4.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2030.98 ms. Allocated memory was 205.0 MB in the beginning and 251.7 MB in the end (delta: 46.7 MB). Free memory was 161.2 MB in the beginning and 197.5 MB in the end (delta: -36.4 MB). Peak memory consumption was 115.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 8156.62 ms. Allocated memory was 251.7 MB in the beginning and 378.0 MB in the end (delta: 126.4 MB). Free memory was 197.5 MB in the beginning and 154.7 MB in the end (delta: 42.8 MB). Peak memory consumption was 169.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 475]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 600]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 606]: Loop Invariant Derived loop invariant: ((((((((a28 == 10 && a19 == 1) || ((a28 == 9 && a17 == 8) && a19 == 1)) || ((a17 == 8 && !(a28 == 9)) && !(a28 == 11))) || ((!(a25 == 1) && a17 == 8) && !(a11 == 1))) || ((a28 == 9 && !(a25 == 1)) && !(a11 == 1))) || (a28 == 9 && a25 == 1)) || ((a28 == 10 && !(a25 == 1)) && a11 == 1)) || ((a19 == 1 && a25 == 1) && !(a28 == 11))) || ((a19 == 1 && !(a11 == 1)) && a25 == 1) - InvariantResult [Line: 29]: Loop Invariant Derived loop invariant: ((((((((a28 == 10 && a19 == 1) || ((a28 == 9 && a17 == 8) && a19 == 1)) || ((a17 == 8 && !(a28 == 9)) && !(a28 == 11))) || ((!(a25 == 1) && a17 == 8) && !(a11 == 1))) || ((a28 == 9 && !(a25 == 1)) && !(a11 == 1))) || (a28 == 9 && a25 == 1)) || ((a28 == 10 && !(a25 == 1)) && a11 == 1)) || ((a19 == 1 && a25 == 1) && !(a28 == 11))) || ((a19 == 1 && !(a11 == 1)) && a25 == 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 85 locations, 1 error locations. Result: SAFE, OverallTime: 8.0s, OverallIterations: 8, TraceHistogramMax: 4, AutomataDifference: 5.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.6s, HoareTripleCheckerStatistics: 382 SDtfs, 988 SDslu, 114 SDs, 0 SdLazy, 3382 SolverSat, 705 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 31 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1443occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 8 MinimizatonAttempts, 1382 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 43 NumberOfFragments, 189 HoareAnnotationTreeSize, 3 FomulaSimplifications, 2418 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 3 FomulaSimplificationsInter, 764 FormulaSimplificationTreeSizeReductionInter, 0.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 902 NumberOfCodeBlocks, 902 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 894 ConstructedInterpolants, 0 QuantifiedInterpolants, 366691 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 323/323 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...