/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/Problem01_label25.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 23:30:41,510 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 23:30:41,512 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 23:30:41,531 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 23:30:41,531 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 23:30:41,533 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 23:30:41,535 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 23:30:41,548 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 23:30:41,550 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 23:30:41,552 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 23:30:41,554 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 23:30:41,556 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 23:30:41,556 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 23:30:41,560 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 23:30:41,563 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 23:30:41,564 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 23:30:41,566 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 23:30:41,568 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 23:30:41,569 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 23:30:41,575 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 23:30:41,579 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 23:30:41,580 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 23:30:41,582 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 23:30:41,582 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 23:30:41,585 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 23:30:41,586 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 23:30:41,586 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 23:30:41,587 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 23:30:41,588 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 23:30:41,590 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 23:30:41,590 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 23:30:41,591 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 23:30:41,591 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 23:30:41,592 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 23:30:41,594 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 23:30:41,594 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 23:30:41,595 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 23:30:41,595 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 23:30:41,595 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 23:30:41,599 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 23:30:41,600 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 23:30:41,601 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:30:41,619 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 23:30:41,620 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 23:30:41,621 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-23 23:30:41,621 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-23 23:30:41,621 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-23 23:30:41,622 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-23 23:30:41,622 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-23 23:30:41,622 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-23 23:30:41,622 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-23 23:30:41,622 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-23 23:30:41,623 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-23 23:30:41,624 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-23 23:30:41,624 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-23 23:30:41,624 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-23 23:30:41,625 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-23 23:30:41,625 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 23:30:41,626 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 23:30:41,626 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 23:30:41,626 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 23:30:41,626 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 23:30:41,626 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 23:30:41,627 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 23:30:41,627 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 23:30:41,627 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 23:30:41,627 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 23:30:41,627 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 23:30:41,628 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 23:30:41,628 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 23:30:41,629 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 23:30:41,629 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 23:30:41,629 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 23:30:41,629 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 23:30:41,630 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 23:30:41,630 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-23 23:30:41,630 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 23:30:41,631 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 23:30:41,631 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 23:30:41,631 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-11-23 23:30:41,902 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 23:30:41,921 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 23:30:41,924 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 23:30:41,926 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 23:30:41,926 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 23:30:41,927 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem01_label25.c [2019-11-23 23:30:42,002 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5dbf48c3b/74f29f6f690e47c4b40425cbca831ddb/FLAG80592827c [2019-11-23 23:30:42,586 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 23:30:42,587 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem01_label25.c [2019-11-23 23:30:42,599 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5dbf48c3b/74f29f6f690e47c4b40425cbca831ddb/FLAG80592827c [2019-11-23 23:30:42,816 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5dbf48c3b/74f29f6f690e47c4b40425cbca831ddb [2019-11-23 23:30:42,824 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 23:30:42,825 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 23:30:42,826 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 23:30:42,826 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 23:30:42,830 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 23:30:42,831 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:30:42" (1/1) ... [2019-11-23 23:30:42,834 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2698cf6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:42, skipping insertion in model container [2019-11-23 23:30:42,834 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:30:42" (1/1) ... [2019-11-23 23:30:42,842 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 23:30:42,889 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 23:30:43,442 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 23:30:43,453 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 23:30:43,623 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 23:30:43,638 INFO L208 MainTranslator]: Completed translation [2019-11-23 23:30:43,639 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:43 WrapperNode [2019-11-23 23:30:43,639 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 23:30:43,640 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 23:30:43,640 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 23:30:43,640 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 23:30:43,648 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:30:43" (1/1) ... [2019-11-23 23:30:43,667 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:30:43" (1/1) ... [2019-11-23 23:30:43,726 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 23:30:43,727 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 23:30:43,727 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 23:30:43,727 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 23:30:43,736 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:43" (1/1) ... [2019-11-23 23:30:43,736 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:43" (1/1) ... [2019-11-23 23:30:43,741 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:43" (1/1) ... [2019-11-23 23:30:43,741 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:43" (1/1) ... [2019-11-23 23:30:43,762 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:43" (1/1) ... [2019-11-23 23:30:43,773 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:43" (1/1) ... [2019-11-23 23:30:43,780 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:43" (1/1) ... [2019-11-23 23:30:43,789 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 23:30:43,789 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 23:30:43,789 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 23:30:43,790 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 23:30:43,790 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:43" (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:30:43,870 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 23:30:43,870 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 23:30:45,795 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 23:30:45,796 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-23 23:30:45,797 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:30:45 BoogieIcfgContainer [2019-11-23 23:30:45,798 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 23:30:45,799 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 23:30:45,799 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 23:30:45,802 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 23:30:45,802 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:30:42" (1/3) ... [2019-11-23 23:30:45,803 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ba6e327 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:30:45, skipping insertion in model container [2019-11-23 23:30:45,803 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:43" (2/3) ... [2019-11-23 23:30:45,804 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ba6e327 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:30:45, skipping insertion in model container [2019-11-23 23:30:45,804 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:30:45" (3/3) ... [2019-11-23 23:30:45,806 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem01_label25.c [2019-11-23 23:30:45,815 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 23:30:45,824 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-23 23:30:45,837 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-23 23:30:45,865 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 23:30:45,865 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 23:30:45,866 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 23:30:45,866 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 23:30:45,866 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 23:30:45,866 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 23:30:45,867 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 23:30:45,867 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 23:30:45,884 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states. [2019-11-23 23:30:45,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-11-23 23:30:45,893 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:30:45,894 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] [2019-11-23 23:30:45,895 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:30:45,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:30:45,901 INFO L82 PathProgramCache]: Analyzing trace with hash -839556570, now seen corresponding path program 1 times [2019-11-23 23:30:45,908 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:30:45,909 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801859507] [2019-11-23 23:30:45,909 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:30:46,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:30:46,357 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:30:46,358 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801859507] [2019-11-23 23:30:46,360 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:30:46,360 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:30:46,362 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971085151] [2019-11-23 23:30:46,369 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:30:46,376 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:30:46,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:30:46,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:30:46,393 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 4 states. [2019-11-23 23:30:47,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:30:47,172 INFO L93 Difference]: Finished difference Result 297 states and 569 transitions. [2019-11-23 23:30:47,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:30:47,174 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 71 [2019-11-23 23:30:47,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:30:47,198 INFO L225 Difference]: With dead ends: 297 [2019-11-23 23:30:47,198 INFO L226 Difference]: Without dead ends: 216 [2019-11-23 23:30:47,204 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:30:47,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2019-11-23 23:30:47,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 216. [2019-11-23 23:30:47,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2019-11-23 23:30:47,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 378 transitions. [2019-11-23 23:30:47,301 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 378 transitions. Word has length 71 [2019-11-23 23:30:47,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:30:47,302 INFO L462 AbstractCegarLoop]: Abstraction has 216 states and 378 transitions. [2019-11-23 23:30:47,303 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:30:47,303 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 378 transitions. [2019-11-23 23:30:47,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-11-23 23:30:47,306 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:30:47,307 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-23 23:30:47,307 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:30:47,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:30:47,308 INFO L82 PathProgramCache]: Analyzing trace with hash -523029376, now seen corresponding path program 1 times [2019-11-23 23:30:47,308 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:30:47,308 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9203713] [2019-11-23 23:30:47,308 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:30:47,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:30:47,359 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 23:30:47,359 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9203713] [2019-11-23 23:30:47,360 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:30:47,360 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:30:47,360 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430841081] [2019-11-23 23:30:47,362 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:30:47,363 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:30:47,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:30:47,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:30:47,363 INFO L87 Difference]: Start difference. First operand 216 states and 378 transitions. Second operand 4 states. [2019-11-23 23:30:47,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:30:47,809 INFO L93 Difference]: Finished difference Result 644 states and 1131 transitions. [2019-11-23 23:30:47,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:30:47,810 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2019-11-23 23:30:47,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:30:47,814 INFO L225 Difference]: With dead ends: 644 [2019-11-23 23:30:47,814 INFO L226 Difference]: Without dead ends: 429 [2019-11-23 23:30:47,817 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:30:47,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2019-11-23 23:30:47,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 429. [2019-11-23 23:30:47,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 429 states. [2019-11-23 23:30:47,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 706 transitions. [2019-11-23 23:30:47,856 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 706 transitions. Word has length 76 [2019-11-23 23:30:47,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:30:47,857 INFO L462 AbstractCegarLoop]: Abstraction has 429 states and 706 transitions. [2019-11-23 23:30:47,857 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:30:47,857 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 706 transitions. [2019-11-23 23:30:47,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-11-23 23:30:47,861 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:30:47,861 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 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] [2019-11-23 23:30:47,861 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:30:47,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:30:47,862 INFO L82 PathProgramCache]: Analyzing trace with hash -1468753973, now seen corresponding path program 1 times [2019-11-23 23:30:47,862 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:30:47,862 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657729848] [2019-11-23 23:30:47,863 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:30:47,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:30:47,907 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-23 23:30:47,907 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657729848] [2019-11-23 23:30:47,908 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:30:47,908 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 23:30:47,908 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259603036] [2019-11-23 23:30:47,909 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:30:47,909 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:30:47,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:30:47,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:30:47,910 INFO L87 Difference]: Start difference. First operand 429 states and 706 transitions. Second operand 3 states. [2019-11-23 23:30:48,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:30:48,322 INFO L93 Difference]: Finished difference Result 1070 states and 1787 transitions. [2019-11-23 23:30:48,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:30:48,322 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-11-23 23:30:48,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:30:48,326 INFO L225 Difference]: With dead ends: 1070 [2019-11-23 23:30:48,326 INFO L226 Difference]: Without dead ends: 642 [2019-11-23 23:30:48,329 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:30:48,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2019-11-23 23:30:48,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 429. [2019-11-23 23:30:48,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 429 states. [2019-11-23 23:30:48,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 706 transitions. [2019-11-23 23:30:48,349 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 706 transitions. Word has length 83 [2019-11-23 23:30:48,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:30:48,350 INFO L462 AbstractCegarLoop]: Abstraction has 429 states and 706 transitions. [2019-11-23 23:30:48,350 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:30:48,350 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 706 transitions. [2019-11-23 23:30:48,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-11-23 23:30:48,353 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:30:48,354 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-23 23:30:48,354 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:30:48,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:30:48,355 INFO L82 PathProgramCache]: Analyzing trace with hash 818274791, now seen corresponding path program 1 times [2019-11-23 23:30:48,355 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:30:48,355 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870508305] [2019-11-23 23:30:48,355 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:30:48,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:30:48,487 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 23:30:48,487 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870508305] [2019-11-23 23:30:48,487 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:30:48,488 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:30:48,488 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278629427] [2019-11-23 23:30:48,488 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:30:48,489 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:30:48,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:30:48,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:30:48,489 INFO L87 Difference]: Start difference. First operand 429 states and 706 transitions. Second operand 4 states. [2019-11-23 23:30:49,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:30:49,048 INFO L93 Difference]: Finished difference Result 942 states and 1520 transitions. [2019-11-23 23:30:49,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 23:30:49,049 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 86 [2019-11-23 23:30:49,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:30:49,053 INFO L225 Difference]: With dead ends: 942 [2019-11-23 23:30:49,054 INFO L226 Difference]: Without dead ends: 514 [2019-11-23 23:30:49,055 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-23 23:30:49,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2019-11-23 23:30:49,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 500. [2019-11-23 23:30:49,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 500 states. [2019-11-23 23:30:49,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 783 transitions. [2019-11-23 23:30:49,078 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 783 transitions. Word has length 86 [2019-11-23 23:30:49,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:30:49,078 INFO L462 AbstractCegarLoop]: Abstraction has 500 states and 783 transitions. [2019-11-23 23:30:49,079 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:30:49,079 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 783 transitions. [2019-11-23 23:30:49,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-11-23 23:30:49,082 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:30:49,082 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 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] [2019-11-23 23:30:49,082 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:30:49,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:30:49,083 INFO L82 PathProgramCache]: Analyzing trace with hash 1374587951, now seen corresponding path program 1 times [2019-11-23 23:30:49,083 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:30:49,084 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238189257] [2019-11-23 23:30:49,084 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:30:49,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:30:49,174 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 23:30:49,174 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238189257] [2019-11-23 23:30:49,174 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:30:49,175 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:30:49,175 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114731896] [2019-11-23 23:30:49,175 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:30:49,176 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:30:49,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:30:49,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:30:49,176 INFO L87 Difference]: Start difference. First operand 500 states and 783 transitions. Second operand 4 states. [2019-11-23 23:30:49,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:30:49,747 INFO L93 Difference]: Finished difference Result 1212 states and 1947 transitions. [2019-11-23 23:30:49,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:30:49,748 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 90 [2019-11-23 23:30:49,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:30:49,755 INFO L225 Difference]: With dead ends: 1212 [2019-11-23 23:30:49,755 INFO L226 Difference]: Without dead ends: 784 [2019-11-23 23:30:49,756 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:30:49,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 784 states. [2019-11-23 23:30:49,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 784 to 784. [2019-11-23 23:30:49,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 784 states. [2019-11-23 23:30:49,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 1158 transitions. [2019-11-23 23:30:49,784 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 1158 transitions. Word has length 90 [2019-11-23 23:30:49,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:30:49,784 INFO L462 AbstractCegarLoop]: Abstraction has 784 states and 1158 transitions. [2019-11-23 23:30:49,784 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:30:49,784 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 1158 transitions. [2019-11-23 23:30:49,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-11-23 23:30:49,786 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:30:49,787 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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] [2019-11-23 23:30:49,787 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:30:49,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:30:49,787 INFO L82 PathProgramCache]: Analyzing trace with hash -1287134350, now seen corresponding path program 1 times [2019-11-23 23:30:49,788 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:30:49,788 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246437438] [2019-11-23 23:30:49,788 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:30:49,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:30:49,865 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 23:30:49,865 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246437438] [2019-11-23 23:30:49,866 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:30:49,867 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:30:49,867 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107423773] [2019-11-23 23:30:49,867 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:30:49,867 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:30:49,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:30:49,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:30:49,869 INFO L87 Difference]: Start difference. First operand 784 states and 1158 transitions. Second operand 3 states. [2019-11-23 23:30:50,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:30:50,257 INFO L93 Difference]: Finished difference Result 1709 states and 2541 transitions. [2019-11-23 23:30:50,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:30:50,258 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 93 [2019-11-23 23:30:50,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:30:50,262 INFO L225 Difference]: With dead ends: 1709 [2019-11-23 23:30:50,263 INFO L226 Difference]: Without dead ends: 926 [2019-11-23 23:30:50,264 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:30:50,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 926 states. [2019-11-23 23:30:50,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 926 to 784. [2019-11-23 23:30:50,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 784 states. [2019-11-23 23:30:50,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 1015 transitions. [2019-11-23 23:30:50,285 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 1015 transitions. Word has length 93 [2019-11-23 23:30:50,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:30:50,286 INFO L462 AbstractCegarLoop]: Abstraction has 784 states and 1015 transitions. [2019-11-23 23:30:50,286 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:30:50,286 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 1015 transitions. [2019-11-23 23:30:50,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-11-23 23:30:50,288 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:30:50,289 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 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] [2019-11-23 23:30:50,289 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:30:50,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:30:50,289 INFO L82 PathProgramCache]: Analyzing trace with hash 1197910724, now seen corresponding path program 1 times [2019-11-23 23:30:50,290 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:30:50,290 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326784294] [2019-11-23 23:30:50,290 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:30:50,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:30:50,399 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-23 23:30:50,400 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326784294] [2019-11-23 23:30:50,400 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:30:50,401 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 23:30:50,401 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906427823] [2019-11-23 23:30:50,401 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:30:50,402 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:30:50,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:30:50,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:30:50,403 INFO L87 Difference]: Start difference. First operand 784 states and 1015 transitions. Second operand 4 states. [2019-11-23 23:30:50,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:30:50,901 INFO L93 Difference]: Finished difference Result 2064 states and 2705 transitions. [2019-11-23 23:30:50,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:30:50,902 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2019-11-23 23:30:50,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:30:50,908 INFO L225 Difference]: With dead ends: 2064 [2019-11-23 23:30:50,908 INFO L226 Difference]: Without dead ends: 1281 [2019-11-23 23:30:50,910 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:30:50,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1281 states. [2019-11-23 23:30:50,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1281 to 713. [2019-11-23 23:30:50,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 713 states. [2019-11-23 23:30:50,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 713 states to 713 states and 920 transitions. [2019-11-23 23:30:50,932 INFO L78 Accepts]: Start accepts. Automaton has 713 states and 920 transitions. Word has length 101 [2019-11-23 23:30:50,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:30:50,932 INFO L462 AbstractCegarLoop]: Abstraction has 713 states and 920 transitions. [2019-11-23 23:30:50,932 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:30:50,932 INFO L276 IsEmpty]: Start isEmpty. Operand 713 states and 920 transitions. [2019-11-23 23:30:50,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-11-23 23:30:50,935 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:30:50,935 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:50,935 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:30:50,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:30:50,935 INFO L82 PathProgramCache]: Analyzing trace with hash -1118925776, now seen corresponding path program 1 times [2019-11-23 23:30:50,936 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:30:50,936 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598773977] [2019-11-23 23:30:50,936 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:30:50,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:30:51,021 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 23:30:51,022 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598773977] [2019-11-23 23:30:51,022 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:30:51,022 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:30:51,022 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079186669] [2019-11-23 23:30:51,023 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:30:51,023 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:30:51,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:30:51,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:30:51,024 INFO L87 Difference]: Start difference. First operand 713 states and 920 transitions. Second operand 3 states. [2019-11-23 23:30:51,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:30:51,322 INFO L93 Difference]: Finished difference Result 784 states and 995 transitions. [2019-11-23 23:30:51,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:30:51,322 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 108 [2019-11-23 23:30:51,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:30:51,323 INFO L225 Difference]: With dead ends: 784 [2019-11-23 23:30:51,323 INFO L226 Difference]: Without dead ends: 0 [2019-11-23 23:30:51,324 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:30:51,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-23 23:30:51,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-23 23:30:51,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-23 23:30:51,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-23 23:30:51,325 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 108 [2019-11-23 23:30:51,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:30:51,326 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-23 23:30:51,326 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:30:51,326 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-23 23:30:51,326 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-23 23:30:51,331 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-23 23:30:51,502 INFO L444 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2019-11-23 23:30:51,502 INFO L444 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2019-11-23 23:30:51,502 INFO L444 ceAbstractionStarter]: For program point L532-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 23:30:51,502 INFO L444 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2019-11-23 23:30:51,502 INFO L444 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2019-11-23 23:30:51,502 INFO L444 ceAbstractionStarter]: For program point L533(line 533) no Hoare annotation was computed. [2019-11-23 23:30:51,503 INFO L444 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2019-11-23 23:30:51,503 INFO L444 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2019-11-23 23:30:51,503 INFO L444 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2019-11-23 23:30:51,503 INFO L444 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2019-11-23 23:30:51,503 INFO L444 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2019-11-23 23:30:51,503 INFO L444 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2019-11-23 23:30:51,503 INFO L444 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2019-11-23 23:30:51,503 INFO L444 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2019-11-23 23:30:51,503 INFO L444 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2019-11-23 23:30:51,503 INFO L444 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2019-11-23 23:30:51,504 INFO L444 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2019-11-23 23:30:51,504 INFO L444 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2019-11-23 23:30:51,504 INFO L444 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2019-11-23 23:30:51,504 INFO L440 ceAbstractionStarter]: At program point L574(lines 30 575) the Hoare annotation is: (let ((.cse1 (= 1 ~a7~0)) (.cse0 (= ~a21~0 1))) (or (and (not (= ~a16~0 6)) .cse0) (and .cse1 (= 13 ~a8~0)) (and (not .cse1) .cse0))) [2019-11-23 23:30:51,504 INFO L444 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2019-11-23 23:30:51,504 INFO L444 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2019-11-23 23:30:51,504 INFO L444 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2019-11-23 23:30:51,504 INFO L444 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2019-11-23 23:30:51,505 INFO L444 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2019-11-23 23:30:51,505 INFO L444 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2019-11-23 23:30:51,505 INFO L444 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2019-11-23 23:30:51,505 INFO L444 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2019-11-23 23:30:51,505 INFO L447 ceAbstractionStarter]: At program point L577(lines 577 594) the Hoare annotation is: true [2019-11-23 23:30:51,505 INFO L444 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2019-11-23 23:30:51,505 INFO L444 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2019-11-23 23:30:51,506 INFO L444 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2019-11-23 23:30:51,506 INFO L444 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2019-11-23 23:30:51,506 INFO L444 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2019-11-23 23:30:51,506 INFO L444 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2019-11-23 23:30:51,506 INFO L444 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2019-11-23 23:30:51,506 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-23 23:30:51,506 INFO L444 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2019-11-23 23:30:51,506 INFO L444 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2019-11-23 23:30:51,507 INFO L444 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2019-11-23 23:30:51,507 INFO L444 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2019-11-23 23:30:51,507 INFO L444 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2019-11-23 23:30:51,507 INFO L444 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2019-11-23 23:30:51,507 INFO L440 ceAbstractionStarter]: At program point L583-2(lines 583 593) the Hoare annotation is: (let ((.cse1 (= 1 ~a7~0)) (.cse0 (= ~a21~0 1))) (or (and (not (= ~a16~0 6)) .cse0) (and .cse1 (= 13 ~a8~0)) (and (not .cse1) .cse0))) [2019-11-23 23:30:51,507 INFO L444 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2019-11-23 23:30:51,507 INFO L444 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2019-11-23 23:30:51,507 INFO L444 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2019-11-23 23:30:51,508 INFO L444 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2019-11-23 23:30:51,508 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-23 23:30:51,508 INFO L444 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2019-11-23 23:30:51,508 INFO L444 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2019-11-23 23:30:51,508 INFO L444 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2019-11-23 23:30:51,508 INFO L444 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2019-11-23 23:30:51,508 INFO L444 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2019-11-23 23:30:51,508 INFO L444 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2019-11-23 23:30:51,508 INFO L444 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2019-11-23 23:30:51,508 INFO L444 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2019-11-23 23:30:51,509 INFO L444 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2019-11-23 23:30:51,509 INFO L444 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2019-11-23 23:30:51,509 INFO L444 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2019-11-23 23:30:51,509 INFO L444 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2019-11-23 23:30:51,509 INFO L444 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2019-11-23 23:30:51,509 INFO L444 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2019-11-23 23:30:51,509 INFO L444 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2019-11-23 23:30:51,510 INFO L444 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2019-11-23 23:30:51,510 INFO L444 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2019-11-23 23:30:51,510 INFO L444 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2019-11-23 23:30:51,510 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 533) no Hoare annotation was computed. [2019-11-23 23:30:51,510 INFO L444 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2019-11-23 23:30:51,510 INFO L444 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2019-11-23 23:30:51,510 INFO L444 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2019-11-23 23:30:51,511 INFO L444 ceAbstractionStarter]: For program point L529-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 23:30:51,511 INFO L444 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2019-11-23 23:30:51,511 INFO L444 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2019-11-23 23:30:51,511 INFO L444 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2019-11-23 23:30:51,511 INFO L444 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2019-11-23 23:30:51,527 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 11:30:51 BoogieIcfgContainer [2019-11-23 23:30:51,527 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-23 23:30:51,530 INFO L168 Benchmark]: Toolchain (without parser) took 8703.77 ms. Allocated memory was 145.8 MB in the beginning and 327.7 MB in the end (delta: 181.9 MB). Free memory was 102.4 MB in the beginning and 244.4 MB in the end (delta: -142.0 MB). Peak memory consumption was 39.9 MB. Max. memory is 7.1 GB. [2019-11-23 23:30:51,531 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 145.8 MB. Free memory was 122.0 MB in the beginning and 121.8 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:30:51,532 INFO L168 Benchmark]: CACSL2BoogieTranslator took 813.26 ms. Allocated memory was 145.8 MB in the beginning and 205.5 MB in the end (delta: 59.8 MB). Free memory was 102.2 MB in the beginning and 171.2 MB in the end (delta: -69.0 MB). Peak memory consumption was 31.9 MB. Max. memory is 7.1 GB. [2019-11-23 23:30:51,533 INFO L168 Benchmark]: Boogie Procedure Inliner took 86.99 ms. Allocated memory is still 205.5 MB. Free memory was 171.2 MB in the beginning and 165.6 MB in the end (delta: 5.6 MB). Peak memory consumption was 5.6 MB. Max. memory is 7.1 GB. [2019-11-23 23:30:51,534 INFO L168 Benchmark]: Boogie Preprocessor took 62.03 ms. Allocated memory is still 205.5 MB. Free memory was 165.6 MB in the beginning and 160.7 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:30:51,535 INFO L168 Benchmark]: RCFGBuilder took 2008.57 ms. Allocated memory was 205.5 MB in the beginning and 250.6 MB in the end (delta: 45.1 MB). Free memory was 160.7 MB in the beginning and 205.9 MB in the end (delta: -45.2 MB). Peak memory consumption was 114.5 MB. Max. memory is 7.1 GB. [2019-11-23 23:30:51,536 INFO L168 Benchmark]: TraceAbstraction took 5728.63 ms. Allocated memory was 250.6 MB in the beginning and 327.7 MB in the end (delta: 77.1 MB). Free memory was 205.9 MB in the beginning and 244.4 MB in the end (delta: -38.6 MB). Peak memory consumption was 38.5 MB. Max. memory is 7.1 GB. [2019-11-23 23:30:51,540 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.21 ms. Allocated memory is still 145.8 MB. Free memory was 122.0 MB in the beginning and 121.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 813.26 ms. Allocated memory was 145.8 MB in the beginning and 205.5 MB in the end (delta: 59.8 MB). Free memory was 102.2 MB in the beginning and 171.2 MB in the end (delta: -69.0 MB). Peak memory consumption was 31.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 86.99 ms. Allocated memory is still 205.5 MB. Free memory was 171.2 MB in the beginning and 165.6 MB in the end (delta: 5.6 MB). Peak memory consumption was 5.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 62.03 ms. Allocated memory is still 205.5 MB. Free memory was 165.6 MB in the beginning and 160.7 MB in the end (delta: 4.9 MB). Peak memory consumption was 4.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2008.57 ms. Allocated memory was 205.5 MB in the beginning and 250.6 MB in the end (delta: 45.1 MB). Free memory was 160.7 MB in the beginning and 205.9 MB in the end (delta: -45.2 MB). Peak memory consumption was 114.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 5728.63 ms. Allocated memory was 250.6 MB in the beginning and 327.7 MB in the end (delta: 77.1 MB). Free memory was 205.9 MB in the beginning and 244.4 MB in the end (delta: -38.6 MB). Peak memory consumption was 38.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 533]: 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: 30]: Loop Invariant Derived loop invariant: ((!(a16 == 6) && a21 == 1) || (1 == a7 && 13 == a8)) || (!(1 == a7) && a21 == 1) - InvariantResult [Line: 577]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: ((!(a16 == 6) && a21 == 1) || (1 == a7 && 13 == a8)) || (!(1 == a7) && a21 == 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 76 locations, 1 error locations. Result: SAFE, OverallTime: 5.6s, OverallIterations: 8, TraceHistogramMax: 4, AutomataDifference: 4.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, HoareTripleCheckerStatistics: 478 SDtfs, 921 SDslu, 59 SDs, 0 SdLazy, 2354 SolverSat, 596 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 26 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=784occurred 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, 937 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 32 NumberOfFragments, 49 HoareAnnotationTreeSize, 3 FomulaSimplifications, 3975 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 3 FomulaSimplificationsInter, 282 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 708 NumberOfCodeBlocks, 708 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 700 ConstructedInterpolants, 0 QuantifiedInterpolants, 136541 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 166/166 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...