/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/locks/test_locks_14-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-24 04:13:26,993 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-24 04:13:26,996 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-24 04:13:27,015 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-24 04:13:27,016 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-24 04:13:27,018 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-24 04:13:27,020 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-24 04:13:27,030 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-24 04:13:27,034 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-24 04:13:27,037 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-24 04:13:27,039 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-24 04:13:27,041 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-24 04:13:27,041 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-24 04:13:27,043 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-24 04:13:27,046 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-24 04:13:27,047 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-24 04:13:27,049 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-24 04:13:27,050 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-24 04:13:27,051 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-24 04:13:27,057 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-24 04:13:27,063 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-24 04:13:27,068 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-24 04:13:27,070 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-24 04:13:27,070 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-24 04:13:27,073 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-24 04:13:27,073 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-24 04:13:27,073 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-24 04:13:27,075 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-24 04:13:27,077 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-24 04:13:27,078 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-24 04:13:27,078 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-24 04:13:27,080 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-24 04:13:27,081 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-24 04:13:27,082 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-24 04:13:27,084 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-24 04:13:27,084 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-24 04:13:27,085 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-24 04:13:27,085 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-24 04:13:27,085 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-24 04:13:27,086 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-24 04:13:27,088 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-24 04:13:27,089 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-24 04:13:27,124 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-24 04:13:27,124 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-24 04:13:27,126 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-24 04:13:27,126 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-24 04:13:27,126 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-24 04:13:27,126 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-24 04:13:27,127 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-24 04:13:27,127 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-24 04:13:27,127 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-24 04:13:27,127 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-24 04:13:27,128 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-24 04:13:27,129 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-24 04:13:27,129 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-24 04:13:27,129 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-24 04:13:27,130 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-24 04:13:27,131 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-24 04:13:27,131 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-24 04:13:27,132 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-24 04:13:27,132 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-24 04:13:27,132 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-24 04:13:27,132 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-24 04:13:27,132 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-24 04:13:27,132 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-24 04:13:27,133 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-24 04:13:27,133 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-24 04:13:27,133 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-24 04:13:27,133 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-24 04:13:27,133 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-24 04:13:27,135 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-24 04:13:27,135 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-24 04:13:27,135 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-24 04:13:27,135 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-24 04:13:27,136 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-24 04:13:27,136 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-24 04:13:27,136 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-24 04:13:27,137 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-24 04:13:27,137 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-24 04:13:27,137 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-11-24 04:13:27,407 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-24 04:13:27,424 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-24 04:13:27,429 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-24 04:13:27,430 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-24 04:13:27,430 INFO L275 PluginConnector]: CDTParser initialized [2019-11-24 04:13:27,431 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_14-1.c [2019-11-24 04:13:27,502 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/53503c95f/d5baec9942cd4e49a70d511b71f6c581/FLAG4f9419c9a [2019-11-24 04:13:27,974 INFO L306 CDTParser]: Found 1 translation units. [2019-11-24 04:13:27,975 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_14-1.c [2019-11-24 04:13:27,986 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/53503c95f/d5baec9942cd4e49a70d511b71f6c581/FLAG4f9419c9a [2019-11-24 04:13:28,351 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/53503c95f/d5baec9942cd4e49a70d511b71f6c581 [2019-11-24 04:13:28,360 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-24 04:13:28,362 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-24 04:13:28,363 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-24 04:13:28,363 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-24 04:13:28,367 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-24 04:13:28,368 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 04:13:28" (1/1) ... [2019-11-24 04:13:28,372 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@167bfb4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:13:28, skipping insertion in model container [2019-11-24 04:13:28,375 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 04:13:28" (1/1) ... [2019-11-24 04:13:28,385 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-24 04:13:28,426 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-24 04:13:28,662 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 04:13:28,665 INFO L203 MainTranslator]: Completed pre-run [2019-11-24 04:13:28,695 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 04:13:28,787 INFO L208 MainTranslator]: Completed translation [2019-11-24 04:13:28,788 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:13:28 WrapperNode [2019-11-24 04:13:28,788 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-24 04:13:28,789 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-24 04:13:28,789 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-24 04:13:28,789 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-24 04:13:28,798 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:13:28" (1/1) ... [2019-11-24 04:13:28,805 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:13:28" (1/1) ... [2019-11-24 04:13:28,834 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-24 04:13:28,834 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-24 04:13:28,835 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-24 04:13:28,835 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-24 04:13:28,845 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:13:28" (1/1) ... [2019-11-24 04:13:28,845 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:13:28" (1/1) ... [2019-11-24 04:13:28,847 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:13:28" (1/1) ... [2019-11-24 04:13:28,847 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:13:28" (1/1) ... [2019-11-24 04:13:28,851 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:13:28" (1/1) ... [2019-11-24 04:13:28,863 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:13:28" (1/1) ... [2019-11-24 04:13:28,868 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:13:28" (1/1) ... [2019-11-24 04:13:28,874 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-24 04:13:28,875 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-24 04:13:28,875 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-24 04:13:28,875 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-24 04:13:28,876 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:13:28" (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-24 04:13:28,934 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-24 04:13:28,935 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-24 04:13:29,571 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-24 04:13:29,572 INFO L284 CfgBuilder]: Removed 5 assume(true) statements. [2019-11-24 04:13:29,574 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 04:13:29 BoogieIcfgContainer [2019-11-24 04:13:29,574 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-24 04:13:29,576 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-24 04:13:29,576 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-24 04:13:29,580 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-24 04:13:29,580 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 04:13:28" (1/3) ... [2019-11-24 04:13:29,582 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b76796c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 04:13:29, skipping insertion in model container [2019-11-24 04:13:29,582 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:13:28" (2/3) ... [2019-11-24 04:13:29,583 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b76796c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 04:13:29, skipping insertion in model container [2019-11-24 04:13:29,583 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 04:13:29" (3/3) ... [2019-11-24 04:13:29,585 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_14-1.c [2019-11-24 04:13:29,595 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-24 04:13:29,603 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-24 04:13:29,615 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-24 04:13:29,647 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-24 04:13:29,647 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-24 04:13:29,647 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-24 04:13:29,647 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-24 04:13:29,648 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-24 04:13:29,648 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-24 04:13:29,648 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-24 04:13:29,648 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-24 04:13:29,669 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states. [2019-11-24 04:13:29,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-11-24 04:13:29,675 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:13:29,676 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-11-24 04:13:29,677 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:13:29,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:13:29,684 INFO L82 PathProgramCache]: Analyzing trace with hash 934198341, now seen corresponding path program 1 times [2019-11-24 04:13:29,695 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:13:29,696 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496129041] [2019-11-24 04:13:29,696 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:13:29,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:13:29,915 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-24 04:13:29,916 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496129041] [2019-11-24 04:13:29,917 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:13:29,917 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 04:13:29,919 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722778527] [2019-11-24 04:13:29,924 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 04:13:29,925 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:13:29,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 04:13:29,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-24 04:13:29,940 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 4 states. [2019-11-24 04:13:30,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:13:30,017 INFO L93 Difference]: Finished difference Result 74 states and 129 transitions. [2019-11-24 04:13:30,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 04:13:30,019 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2019-11-24 04:13:30,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:13:30,030 INFO L225 Difference]: With dead ends: 74 [2019-11-24 04:13:30,030 INFO L226 Difference]: Without dead ends: 63 [2019-11-24 04:13:30,033 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-24 04:13:30,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-11-24 04:13:30,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 33. [2019-11-24 04:13:30,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-11-24 04:13:30,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 59 transitions. [2019-11-24 04:13:30,076 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 59 transitions. Word has length 6 [2019-11-24 04:13:30,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:13:30,077 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 59 transitions. [2019-11-24 04:13:30,077 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 04:13:30,077 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 59 transitions. [2019-11-24 04:13:30,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-11-24 04:13:30,078 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:13:30,078 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:13:30,079 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:13:30,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:13:30,079 INFO L82 PathProgramCache]: Analyzing trace with hash -1104410450, now seen corresponding path program 1 times [2019-11-24 04:13:30,080 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:13:30,080 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842447331] [2019-11-24 04:13:30,081 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:13:30,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:13:30,199 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-24 04:13:30,199 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842447331] [2019-11-24 04:13:30,200 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:13:30,200 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 04:13:30,200 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621822882] [2019-11-24 04:13:30,202 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 04:13:30,203 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:13:30,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 04:13:30,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-24 04:13:30,204 INFO L87 Difference]: Start difference. First operand 33 states and 59 transitions. Second operand 4 states. [2019-11-24 04:13:30,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:13:30,232 INFO L93 Difference]: Finished difference Result 63 states and 111 transitions. [2019-11-24 04:13:30,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 04:13:30,232 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-11-24 04:13:30,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:13:30,234 INFO L225 Difference]: With dead ends: 63 [2019-11-24 04:13:30,234 INFO L226 Difference]: Without dead ends: 61 [2019-11-24 04:13:30,235 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-24 04:13:30,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-11-24 04:13:30,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 33. [2019-11-24 04:13:30,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-11-24 04:13:30,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 58 transitions. [2019-11-24 04:13:30,243 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 58 transitions. Word has length 7 [2019-11-24 04:13:30,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:13:30,243 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 58 transitions. [2019-11-24 04:13:30,244 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 04:13:30,244 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 58 transitions. [2019-11-24 04:13:30,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-24 04:13:30,244 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:13:30,245 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:13:30,245 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:13:30,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:13:30,245 INFO L82 PathProgramCache]: Analyzing trace with hash 123226810, now seen corresponding path program 1 times [2019-11-24 04:13:30,246 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:13:30,246 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152298574] [2019-11-24 04:13:30,246 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:13:30,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:13:30,330 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-24 04:13:30,331 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152298574] [2019-11-24 04:13:30,331 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:13:30,332 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 04:13:30,332 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525828223] [2019-11-24 04:13:30,332 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 04:13:30,333 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:13:30,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 04:13:30,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-24 04:13:30,334 INFO L87 Difference]: Start difference. First operand 33 states and 58 transitions. Second operand 4 states. [2019-11-24 04:13:30,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:13:30,379 INFO L93 Difference]: Finished difference Result 61 states and 106 transitions. [2019-11-24 04:13:30,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 04:13:30,380 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2019-11-24 04:13:30,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:13:30,383 INFO L225 Difference]: With dead ends: 61 [2019-11-24 04:13:30,383 INFO L226 Difference]: Without dead ends: 59 [2019-11-24 04:13:30,385 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-24 04:13:30,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-11-24 04:13:30,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 33. [2019-11-24 04:13:30,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-11-24 04:13:30,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 57 transitions. [2019-11-24 04:13:30,392 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 57 transitions. Word has length 8 [2019-11-24 04:13:30,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:13:30,393 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 57 transitions. [2019-11-24 04:13:30,393 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 04:13:30,393 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 57 transitions. [2019-11-24 04:13:30,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-24 04:13:30,394 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:13:30,394 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:13:30,395 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:13:30,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:13:30,395 INFO L82 PathProgramCache]: Analyzing trace with hash -474723453, now seen corresponding path program 1 times [2019-11-24 04:13:30,395 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:13:30,396 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099294480] [2019-11-24 04:13:30,396 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:13:30,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:13:30,464 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-24 04:13:30,465 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099294480] [2019-11-24 04:13:30,465 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:13:30,465 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 04:13:30,466 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45468164] [2019-11-24 04:13:30,466 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 04:13:30,466 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:13:30,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 04:13:30,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-24 04:13:30,467 INFO L87 Difference]: Start difference. First operand 33 states and 57 transitions. Second operand 4 states. [2019-11-24 04:13:30,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:13:30,489 INFO L93 Difference]: Finished difference Result 59 states and 101 transitions. [2019-11-24 04:13:30,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 04:13:30,490 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2019-11-24 04:13:30,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:13:30,491 INFO L225 Difference]: With dead ends: 59 [2019-11-24 04:13:30,491 INFO L226 Difference]: Without dead ends: 57 [2019-11-24 04:13:30,491 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-24 04:13:30,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-11-24 04:13:30,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 33. [2019-11-24 04:13:30,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-11-24 04:13:30,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 56 transitions. [2019-11-24 04:13:30,497 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 56 transitions. Word has length 9 [2019-11-24 04:13:30,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:13:30,497 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 56 transitions. [2019-11-24 04:13:30,497 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 04:13:30,497 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 56 transitions. [2019-11-24 04:13:30,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-24 04:13:30,499 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:13:30,499 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:13:30,500 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:13:30,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:13:30,500 INFO L82 PathProgramCache]: Analyzing trace with hash -1831312081, now seen corresponding path program 1 times [2019-11-24 04:13:30,501 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:13:30,502 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798924171] [2019-11-24 04:13:30,502 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:13:30,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:13:30,568 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-24 04:13:30,569 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798924171] [2019-11-24 04:13:30,569 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:13:30,569 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 04:13:30,569 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949618232] [2019-11-24 04:13:30,570 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 04:13:30,570 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:13:30,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 04:13:30,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-24 04:13:30,571 INFO L87 Difference]: Start difference. First operand 33 states and 56 transitions. Second operand 4 states. [2019-11-24 04:13:30,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:13:30,595 INFO L93 Difference]: Finished difference Result 57 states and 96 transitions. [2019-11-24 04:13:30,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 04:13:30,596 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-11-24 04:13:30,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:13:30,597 INFO L225 Difference]: With dead ends: 57 [2019-11-24 04:13:30,597 INFO L226 Difference]: Without dead ends: 55 [2019-11-24 04:13:30,598 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-24 04:13:30,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-11-24 04:13:30,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 33. [2019-11-24 04:13:30,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-11-24 04:13:30,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 55 transitions. [2019-11-24 04:13:30,603 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 55 transitions. Word has length 10 [2019-11-24 04:13:30,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:13:30,603 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 55 transitions. [2019-11-24 04:13:30,603 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 04:13:30,603 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 55 transitions. [2019-11-24 04:13:30,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-24 04:13:30,604 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:13:30,605 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:13:30,605 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:13:30,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:13:30,606 INFO L82 PathProgramCache]: Analyzing trace with hash -935886248, now seen corresponding path program 1 times [2019-11-24 04:13:30,606 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:13:30,606 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061352196] [2019-11-24 04:13:30,607 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:13:30,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:13:30,646 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-24 04:13:30,646 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061352196] [2019-11-24 04:13:30,646 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:13:30,646 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 04:13:30,647 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77701122] [2019-11-24 04:13:30,647 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 04:13:30,647 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:13:30,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 04:13:30,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-24 04:13:30,648 INFO L87 Difference]: Start difference. First operand 33 states and 55 transitions. Second operand 4 states. [2019-11-24 04:13:30,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:13:30,669 INFO L93 Difference]: Finished difference Result 55 states and 91 transitions. [2019-11-24 04:13:30,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 04:13:30,669 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-11-24 04:13:30,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:13:30,670 INFO L225 Difference]: With dead ends: 55 [2019-11-24 04:13:30,670 INFO L226 Difference]: Without dead ends: 53 [2019-11-24 04:13:30,671 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-24 04:13:30,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-11-24 04:13:30,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 33. [2019-11-24 04:13:30,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-11-24 04:13:30,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 54 transitions. [2019-11-24 04:13:30,675 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 54 transitions. Word has length 11 [2019-11-24 04:13:30,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:13:30,675 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 54 transitions. [2019-11-24 04:13:30,676 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 04:13:30,676 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 54 transitions. [2019-11-24 04:13:30,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-24 04:13:30,676 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:13:30,677 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:13:30,677 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:13:30,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:13:30,677 INFO L82 PathProgramCache]: Analyzing trace with hash 1052511140, now seen corresponding path program 1 times [2019-11-24 04:13:30,677 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:13:30,678 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820740996] [2019-11-24 04:13:30,678 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:13:30,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:13:30,714 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-24 04:13:30,715 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820740996] [2019-11-24 04:13:30,715 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:13:30,715 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 04:13:30,716 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746681882] [2019-11-24 04:13:30,717 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 04:13:30,717 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:13:30,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 04:13:30,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-24 04:13:30,718 INFO L87 Difference]: Start difference. First operand 33 states and 54 transitions. Second operand 4 states. [2019-11-24 04:13:30,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:13:30,750 INFO L93 Difference]: Finished difference Result 53 states and 86 transitions. [2019-11-24 04:13:30,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 04:13:30,750 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-11-24 04:13:30,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:13:30,751 INFO L225 Difference]: With dead ends: 53 [2019-11-24 04:13:30,751 INFO L226 Difference]: Without dead ends: 51 [2019-11-24 04:13:30,752 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-24 04:13:30,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-11-24 04:13:30,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 33. [2019-11-24 04:13:30,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-11-24 04:13:30,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 53 transitions. [2019-11-24 04:13:30,759 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 53 transitions. Word has length 12 [2019-11-24 04:13:30,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:13:30,760 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 53 transitions. [2019-11-24 04:13:30,760 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 04:13:30,760 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 53 transitions. [2019-11-24 04:13:30,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-24 04:13:30,760 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:13:30,761 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:13:30,761 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:13:30,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:13:30,761 INFO L82 PathProgramCache]: Analyzing trace with hash -1731678931, now seen corresponding path program 1 times [2019-11-24 04:13:30,762 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:13:30,762 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262787625] [2019-11-24 04:13:30,762 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:13:30,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:13:30,795 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-24 04:13:30,795 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262787625] [2019-11-24 04:13:30,796 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:13:30,796 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 04:13:30,796 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036913148] [2019-11-24 04:13:30,796 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 04:13:30,797 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:13:30,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 04:13:30,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-24 04:13:30,797 INFO L87 Difference]: Start difference. First operand 33 states and 53 transitions. Second operand 4 states. [2019-11-24 04:13:30,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:13:30,815 INFO L93 Difference]: Finished difference Result 51 states and 81 transitions. [2019-11-24 04:13:30,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 04:13:30,816 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-11-24 04:13:30,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:13:30,816 INFO L225 Difference]: With dead ends: 51 [2019-11-24 04:13:30,817 INFO L226 Difference]: Without dead ends: 49 [2019-11-24 04:13:30,817 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-24 04:13:30,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-11-24 04:13:30,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 33. [2019-11-24 04:13:30,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-11-24 04:13:30,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 52 transitions. [2019-11-24 04:13:30,821 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 52 transitions. Word has length 13 [2019-11-24 04:13:30,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:13:30,821 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 52 transitions. [2019-11-24 04:13:30,821 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 04:13:30,822 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 52 transitions. [2019-11-24 04:13:30,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-24 04:13:30,822 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:13:30,822 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:13:30,823 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:13:30,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:13:30,823 INFO L82 PathProgramCache]: Analyzing trace with hash -2142224871, now seen corresponding path program 1 times [2019-11-24 04:13:30,823 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:13:30,824 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168841139] [2019-11-24 04:13:30,824 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:13:30,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:13:30,853 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-24 04:13:30,854 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168841139] [2019-11-24 04:13:30,854 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:13:30,854 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 04:13:30,854 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698133969] [2019-11-24 04:13:30,855 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 04:13:30,855 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:13:30,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 04:13:30,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-24 04:13:30,856 INFO L87 Difference]: Start difference. First operand 33 states and 52 transitions. Second operand 4 states. [2019-11-24 04:13:30,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:13:30,875 INFO L93 Difference]: Finished difference Result 49 states and 76 transitions. [2019-11-24 04:13:30,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 04:13:30,875 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-11-24 04:13:30,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:13:30,876 INFO L225 Difference]: With dead ends: 49 [2019-11-24 04:13:30,876 INFO L226 Difference]: Without dead ends: 47 [2019-11-24 04:13:30,876 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-24 04:13:30,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-11-24 04:13:30,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 33. [2019-11-24 04:13:30,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-11-24 04:13:30,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 51 transitions. [2019-11-24 04:13:30,880 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 51 transitions. Word has length 14 [2019-11-24 04:13:30,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:13:30,880 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 51 transitions. [2019-11-24 04:13:30,880 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 04:13:30,880 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 51 transitions. [2019-11-24 04:13:30,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-24 04:13:30,881 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:13:30,881 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:13:30,881 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:13:30,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:13:30,882 INFO L82 PathProgramCache]: Analyzing trace with hash -1984246782, now seen corresponding path program 1 times [2019-11-24 04:13:30,882 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:13:30,882 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247808495] [2019-11-24 04:13:30,882 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:13:30,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:13:30,915 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-24 04:13:30,916 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247808495] [2019-11-24 04:13:30,916 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:13:30,916 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 04:13:30,916 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005661685] [2019-11-24 04:13:30,917 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 04:13:30,917 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:13:30,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 04:13:30,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-24 04:13:30,918 INFO L87 Difference]: Start difference. First operand 33 states and 51 transitions. Second operand 4 states. [2019-11-24 04:13:30,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:13:30,937 INFO L93 Difference]: Finished difference Result 47 states and 71 transitions. [2019-11-24 04:13:30,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 04:13:30,938 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-11-24 04:13:30,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:13:30,939 INFO L225 Difference]: With dead ends: 47 [2019-11-24 04:13:30,939 INFO L226 Difference]: Without dead ends: 45 [2019-11-24 04:13:30,940 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-24 04:13:30,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-11-24 04:13:30,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 33. [2019-11-24 04:13:30,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-11-24 04:13:30,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 50 transitions. [2019-11-24 04:13:30,943 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 50 transitions. Word has length 15 [2019-11-24 04:13:30,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:13:30,943 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 50 transitions. [2019-11-24 04:13:30,943 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 04:13:30,943 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 50 transitions. [2019-11-24 04:13:30,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-24 04:13:30,944 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:13:30,944 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:13:30,944 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:13:30,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:13:30,945 INFO L82 PathProgramCache]: Analyzing trace with hash -1381892978, now seen corresponding path program 1 times [2019-11-24 04:13:30,945 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:13:30,945 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497197055] [2019-11-24 04:13:30,945 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:13:30,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:13:30,975 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-24 04:13:30,976 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497197055] [2019-11-24 04:13:30,976 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:13:30,976 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 04:13:30,976 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954230784] [2019-11-24 04:13:30,977 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 04:13:30,977 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:13:30,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 04:13:30,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-24 04:13:30,978 INFO L87 Difference]: Start difference. First operand 33 states and 50 transitions. Second operand 4 states. [2019-11-24 04:13:30,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:13:30,994 INFO L93 Difference]: Finished difference Result 45 states and 66 transitions. [2019-11-24 04:13:30,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 04:13:30,995 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-11-24 04:13:30,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:13:30,995 INFO L225 Difference]: With dead ends: 45 [2019-11-24 04:13:30,996 INFO L226 Difference]: Without dead ends: 43 [2019-11-24 04:13:30,996 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-24 04:13:30,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-11-24 04:13:30,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 33. [2019-11-24 04:13:30,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-11-24 04:13:30,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 49 transitions. [2019-11-24 04:13:30,999 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 49 transitions. Word has length 16 [2019-11-24 04:13:30,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:13:30,999 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 49 transitions. [2019-11-24 04:13:30,999 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 04:13:30,999 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 49 transitions. [2019-11-24 04:13:31,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-24 04:13:31,000 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:13:31,000 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:13:31,001 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:13:31,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:13:31,001 INFO L82 PathProgramCache]: Analyzing trace with hash 111206103, now seen corresponding path program 1 times [2019-11-24 04:13:31,001 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:13:31,002 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877497616] [2019-11-24 04:13:31,002 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:13:31,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:13:31,032 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-24 04:13:31,032 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877497616] [2019-11-24 04:13:31,033 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:13:31,033 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 04:13:31,033 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010493904] [2019-11-24 04:13:31,033 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 04:13:31,034 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:13:31,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 04:13:31,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-24 04:13:31,034 INFO L87 Difference]: Start difference. First operand 33 states and 49 transitions. Second operand 4 states. [2019-11-24 04:13:31,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:13:31,051 INFO L93 Difference]: Finished difference Result 43 states and 61 transitions. [2019-11-24 04:13:31,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 04:13:31,052 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-11-24 04:13:31,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:13:31,052 INFO L225 Difference]: With dead ends: 43 [2019-11-24 04:13:31,053 INFO L226 Difference]: Without dead ends: 41 [2019-11-24 04:13:31,053 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-24 04:13:31,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-11-24 04:13:31,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 33. [2019-11-24 04:13:31,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-11-24 04:13:31,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 48 transitions. [2019-11-24 04:13:31,056 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 48 transitions. Word has length 17 [2019-11-24 04:13:31,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:13:31,056 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 48 transitions. [2019-11-24 04:13:31,056 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 04:13:31,056 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 48 transitions. [2019-11-24 04:13:31,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-24 04:13:31,057 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:13:31,057 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:13:31,057 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:13:31,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:13:31,058 INFO L82 PathProgramCache]: Analyzing trace with hash -847362301, now seen corresponding path program 1 times [2019-11-24 04:13:31,058 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:13:31,058 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437367235] [2019-11-24 04:13:31,059 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:13:31,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:13:31,101 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-24 04:13:31,101 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437367235] [2019-11-24 04:13:31,101 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:13:31,102 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 04:13:31,103 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053590785] [2019-11-24 04:13:31,104 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 04:13:31,104 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:13:31,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 04:13:31,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-24 04:13:31,105 INFO L87 Difference]: Start difference. First operand 33 states and 48 transitions. Second operand 4 states. [2019-11-24 04:13:31,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:13:31,126 INFO L93 Difference]: Finished difference Result 41 states and 56 transitions. [2019-11-24 04:13:31,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 04:13:31,126 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-11-24 04:13:31,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:13:31,127 INFO L225 Difference]: With dead ends: 41 [2019-11-24 04:13:31,127 INFO L226 Difference]: Without dead ends: 39 [2019-11-24 04:13:31,129 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-24 04:13:31,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-11-24 04:13:31,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 33. [2019-11-24 04:13:31,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-11-24 04:13:31,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 47 transitions. [2019-11-24 04:13:31,137 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 47 transitions. Word has length 18 [2019-11-24 04:13:31,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:13:31,137 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 47 transitions. [2019-11-24 04:13:31,137 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 04:13:31,138 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 47 transitions. [2019-11-24 04:13:31,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-24 04:13:31,140 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:13:31,140 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:13:31,140 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:13:31,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:13:31,141 INFO L82 PathProgramCache]: Analyzing trace with hash -498211412, now seen corresponding path program 1 times [2019-11-24 04:13:31,143 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:13:31,144 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890492557] [2019-11-24 04:13:31,144 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:13:31,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:13:31,179 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-24 04:13:31,180 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890492557] [2019-11-24 04:13:31,180 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:13:31,180 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 04:13:31,181 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363286794] [2019-11-24 04:13:31,182 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 04:13:31,182 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:13:31,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 04:13:31,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-24 04:13:31,183 INFO L87 Difference]: Start difference. First operand 33 states and 47 transitions. Second operand 4 states. [2019-11-24 04:13:31,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:13:31,201 INFO L93 Difference]: Finished difference Result 35 states and 49 transitions. [2019-11-24 04:13:31,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 04:13:31,202 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-11-24 04:13:31,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:13:31,202 INFO L225 Difference]: With dead ends: 35 [2019-11-24 04:13:31,203 INFO L226 Difference]: Without dead ends: 0 [2019-11-24 04:13:31,203 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-24 04:13:31,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-24 04:13:31,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-24 04:13:31,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-24 04:13:31,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-24 04:13:31,205 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 19 [2019-11-24 04:13:31,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:13:31,205 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-24 04:13:31,206 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 04:13:31,206 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-24 04:13:31,206 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-24 04:13:31,211 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-24 04:13:31,226 INFO L444 ceAbstractionStarter]: For program point L184-1(lines 51 214) no Hoare annotation was computed. [2019-11-24 04:13:31,227 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-24 04:13:31,227 INFO L447 ceAbstractionStarter]: At program point L218(lines 4 219) the Hoare annotation is: true [2019-11-24 04:13:31,227 INFO L444 ceAbstractionStarter]: For program point L185(line 185) no Hoare annotation was computed. [2019-11-24 04:13:31,227 INFO L444 ceAbstractionStarter]: For program point L53(lines 53 55) no Hoare annotation was computed. [2019-11-24 04:13:31,228 INFO L444 ceAbstractionStarter]: For program point L169-1(lines 51 214) no Hoare annotation was computed. [2019-11-24 04:13:31,228 INFO L444 ceAbstractionStarter]: For program point L170(line 170) no Hoare annotation was computed. [2019-11-24 04:13:31,228 INFO L444 ceAbstractionStarter]: For program point L154-1(lines 51 214) no Hoare annotation was computed. [2019-11-24 04:13:31,228 INFO L444 ceAbstractionStarter]: For program point L204-1(lines 51 214) no Hoare annotation was computed. [2019-11-24 04:13:31,228 INFO L444 ceAbstractionStarter]: For program point L138-1(lines 51 214) no Hoare annotation was computed. [2019-11-24 04:13:31,228 INFO L444 ceAbstractionStarter]: For program point L155(line 155) no Hoare annotation was computed. [2019-11-24 04:13:31,228 INFO L444 ceAbstractionStarter]: For program point L205(line 205) no Hoare annotation was computed. [2019-11-24 04:13:31,229 INFO L444 ceAbstractionStarter]: For program point L189-1(lines 51 214) no Hoare annotation was computed. [2019-11-24 04:13:31,229 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-24 04:13:31,229 INFO L444 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2019-11-24 04:13:31,229 INFO L444 ceAbstractionStarter]: For program point L174-1(lines 51 214) no Hoare annotation was computed. [2019-11-24 04:13:31,229 INFO L444 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2019-11-24 04:13:31,229 INFO L444 ceAbstractionStarter]: For program point L159-1(lines 51 214) no Hoare annotation was computed. [2019-11-24 04:13:31,229 INFO L447 ceAbstractionStarter]: At program point L209-1(lines 51 214) the Hoare annotation is: true [2019-11-24 04:13:31,230 INFO L444 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2019-11-24 04:13:31,230 INFO L444 ceAbstractionStarter]: For program point L210(line 210) no Hoare annotation was computed. [2019-11-24 04:13:31,230 INFO L440 ceAbstractionStarter]: At program point L210-1(lines 5 219) the Hoare annotation is: false [2019-11-24 04:13:31,230 INFO L444 ceAbstractionStarter]: For program point L144-1(lines 51 214) no Hoare annotation was computed. [2019-11-24 04:13:31,230 INFO L444 ceAbstractionStarter]: For program point L194-1(lines 51 214) no Hoare annotation was computed. [2019-11-24 04:13:31,230 INFO L444 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2019-11-24 04:13:31,231 INFO L444 ceAbstractionStarter]: For program point L195(line 195) no Hoare annotation was computed. [2019-11-24 04:13:31,231 INFO L444 ceAbstractionStarter]: For program point L179-1(lines 51 214) no Hoare annotation was computed. [2019-11-24 04:13:31,231 INFO L444 ceAbstractionStarter]: For program point L180(line 180) no Hoare annotation was computed. [2019-11-24 04:13:31,231 INFO L444 ceAbstractionStarter]: For program point L164-1(lines 51 214) no Hoare annotation was computed. [2019-11-24 04:13:31,231 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 217) no Hoare annotation was computed. [2019-11-24 04:13:31,231 INFO L444 ceAbstractionStarter]: For program point L165(line 165) no Hoare annotation was computed. [2019-11-24 04:13:31,232 INFO L447 ceAbstractionStarter]: At program point L215(lines 5 219) the Hoare annotation is: true [2019-11-24 04:13:31,232 INFO L444 ceAbstractionStarter]: For program point L149-1(lines 51 214) no Hoare annotation was computed. [2019-11-24 04:13:31,232 INFO L444 ceAbstractionStarter]: For program point L199-1(lines 51 214) no Hoare annotation was computed. [2019-11-24 04:13:31,232 INFO L444 ceAbstractionStarter]: For program point L150(line 150) no Hoare annotation was computed. [2019-11-24 04:13:31,232 INFO L444 ceAbstractionStarter]: For program point L200(line 200) no Hoare annotation was computed. [2019-11-24 04:13:31,239 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.11 04:13:31 BoogieIcfgContainer [2019-11-24 04:13:31,240 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-24 04:13:31,242 INFO L168 Benchmark]: Toolchain (without parser) took 2880.06 ms. Allocated memory was 139.5 MB in the beginning and 235.9 MB in the end (delta: 96.5 MB). Free memory was 102.4 MB in the beginning and 94.0 MB in the end (delta: 8.4 MB). Peak memory consumption was 104.9 MB. Max. memory is 7.1 GB. [2019-11-24 04:13:31,243 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 139.5 MB. Free memory is still 121.0 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-11-24 04:13:31,244 INFO L168 Benchmark]: CACSL2BoogieTranslator took 425.31 ms. Allocated memory was 139.5 MB in the beginning and 204.5 MB in the end (delta: 65.0 MB). Free memory was 102.0 MB in the beginning and 183.3 MB in the end (delta: -81.2 MB). Peak memory consumption was 24.6 MB. Max. memory is 7.1 GB. [2019-11-24 04:13:31,244 INFO L168 Benchmark]: Boogie Procedure Inliner took 45.52 ms. Allocated memory is still 204.5 MB. Free memory was 183.3 MB in the beginning and 181.0 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 7.1 GB. [2019-11-24 04:13:31,245 INFO L168 Benchmark]: Boogie Preprocessor took 39.96 ms. Allocated memory is still 204.5 MB. Free memory was 181.0 MB in the beginning and 179.1 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-11-24 04:13:31,246 INFO L168 Benchmark]: RCFGBuilder took 699.29 ms. Allocated memory is still 204.5 MB. Free memory was 179.1 MB in the beginning and 132.2 MB in the end (delta: 46.9 MB). Peak memory consumption was 46.9 MB. Max. memory is 7.1 GB. [2019-11-24 04:13:31,247 INFO L168 Benchmark]: TraceAbstraction took 1663.61 ms. Allocated memory was 204.5 MB in the beginning and 235.9 MB in the end (delta: 31.5 MB). Free memory was 132.2 MB in the beginning and 94.0 MB in the end (delta: 38.2 MB). Peak memory consumption was 69.7 MB. Max. memory is 7.1 GB. [2019-11-24 04:13:31,251 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.26 ms. Allocated memory is still 139.5 MB. Free memory is still 121.0 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 425.31 ms. Allocated memory was 139.5 MB in the beginning and 204.5 MB in the end (delta: 65.0 MB). Free memory was 102.0 MB in the beginning and 183.3 MB in the end (delta: -81.2 MB). Peak memory consumption was 24.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 45.52 ms. Allocated memory is still 204.5 MB. Free memory was 183.3 MB in the beginning and 181.0 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.96 ms. Allocated memory is still 204.5 MB. Free memory was 181.0 MB in the beginning and 179.1 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 699.29 ms. Allocated memory is still 204.5 MB. Free memory was 179.1 MB in the beginning and 132.2 MB in the end (delta: 46.9 MB). Peak memory consumption was 46.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 1663.61 ms. Allocated memory was 204.5 MB in the beginning and 235.9 MB in the end (delta: 31.5 MB). Free memory was 132.2 MB in the beginning and 94.0 MB in the end (delta: 38.2 MB). Peak memory consumption was 69.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 217]: 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: 4]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 51]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 36 locations, 1 error locations. Result: SAFE, OverallTime: 1.5s, OverallIterations: 14, TraceHistogramMax: 1, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 712 SDtfs, 604 SDslu, 1061 SDs, 0 SdLazy, 126 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 56 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=36occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 14 MinimizatonAttempts, 234 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 9 NumberOfFragments, 4 HoareAnnotationTreeSize, 4 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 4 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 175 NumberOfCodeBlocks, 175 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 161 ConstructedInterpolants, 0 QuantifiedInterpolants, 11011 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 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...