/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-32bit-Taipan_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem02_label14.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 23:32:15,890 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 23:32:15,892 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 23:32:15,908 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 23:32:15,908 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 23:32:15,910 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 23:32:15,912 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 23:32:15,921 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 23:32:15,925 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 23:32:15,928 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 23:32:15,930 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 23:32:15,932 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 23:32:15,932 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 23:32:15,934 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 23:32:15,936 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 23:32:15,937 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 23:32:15,939 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 23:32:15,939 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 23:32:15,941 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 23:32:15,945 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 23:32:15,949 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 23:32:15,953 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 23:32:15,954 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 23:32:15,955 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 23:32:15,957 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 23:32:15,958 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 23:32:15,958 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 23:32:15,959 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 23:32:15,960 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 23:32:15,961 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 23:32:15,962 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 23:32:15,963 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 23:32:15,964 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 23:32:15,965 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 23:32:15,966 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 23:32:15,966 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 23:32:15,967 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 23:32:15,967 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 23:32:15,967 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 23:32:15,968 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 23:32:15,969 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 23:32:15,970 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:32:16,000 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 23:32:16,004 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 23:32:16,005 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-23 23:32:16,005 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-23 23:32:16,005 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-23 23:32:16,005 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-23 23:32:16,006 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-23 23:32:16,006 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-23 23:32:16,006 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-23 23:32:16,006 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-23 23:32:16,006 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-23 23:32:16,007 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-23 23:32:16,009 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-23 23:32:16,009 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-23 23:32:16,009 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-23 23:32:16,010 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 23:32:16,010 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 23:32:16,010 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 23:32:16,011 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 23:32:16,011 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 23:32:16,011 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 23:32:16,011 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 23:32:16,011 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 23:32:16,012 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 23:32:16,016 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 23:32:16,016 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 23:32:16,016 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 23:32:16,017 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 23:32:16,017 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 23:32:16,017 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 23:32:16,017 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 23:32:16,017 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 23:32:16,018 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 23:32:16,018 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-23 23:32:16,018 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 23:32:16,018 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 23:32:16,018 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 23:32:16,019 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-11-23 23:32:16,294 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 23:32:16,307 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 23:32:16,311 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 23:32:16,312 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 23:32:16,312 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 23:32:16,313 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem02_label14.c [2019-11-23 23:32:16,388 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/43b06a30c/6b263d24acdd46cba00b9d682c37a282/FLAGddcd3b069 [2019-11-23 23:32:16,953 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 23:32:16,958 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem02_label14.c [2019-11-23 23:32:16,975 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/43b06a30c/6b263d24acdd46cba00b9d682c37a282/FLAGddcd3b069 [2019-11-23 23:32:17,253 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/43b06a30c/6b263d24acdd46cba00b9d682c37a282 [2019-11-23 23:32:17,264 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 23:32:17,265 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 23:32:17,266 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 23:32:17,267 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 23:32:17,273 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 23:32:17,274 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:32:17" (1/1) ... [2019-11-23 23:32:17,281 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c099cde and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:17, skipping insertion in model container [2019-11-23 23:32:17,282 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:32:17" (1/1) ... [2019-11-23 23:32:17,290 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 23:32:17,335 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 23:32:17,857 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 23:32:17,866 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 23:32:17,977 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 23:32:17,995 INFO L208 MainTranslator]: Completed translation [2019-11-23 23:32:17,996 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:17 WrapperNode [2019-11-23 23:32:17,996 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 23:32:17,997 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 23:32:17,997 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 23:32:17,997 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 23:32:18,004 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:32:17" (1/1) ... [2019-11-23 23:32:18,020 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:32:17" (1/1) ... [2019-11-23 23:32:18,087 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 23:32:18,087 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 23:32:18,088 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 23:32:18,088 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 23:32:18,096 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:17" (1/1) ... [2019-11-23 23:32:18,096 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:17" (1/1) ... [2019-11-23 23:32:18,101 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:17" (1/1) ... [2019-11-23 23:32:18,101 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:17" (1/1) ... [2019-11-23 23:32:18,121 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:17" (1/1) ... [2019-11-23 23:32:18,132 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:17" (1/1) ... [2019-11-23 23:32:18,139 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:17" (1/1) ... [2019-11-23 23:32:18,148 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 23:32:18,148 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 23:32:18,149 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 23:32:18,149 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 23:32:18,150 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:17" (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:32:18,234 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 23:32:18,237 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 23:32:20,274 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 23:32:20,274 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-23 23:32:20,276 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:32:20 BoogieIcfgContainer [2019-11-23 23:32:20,276 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 23:32:20,277 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 23:32:20,277 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 23:32:20,281 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 23:32:20,281 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:32:17" (1/3) ... [2019-11-23 23:32:20,282 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7631b3cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:32:20, skipping insertion in model container [2019-11-23 23:32:20,282 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:17" (2/3) ... [2019-11-23 23:32:20,282 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7631b3cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:32:20, skipping insertion in model container [2019-11-23 23:32:20,283 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:32:20" (3/3) ... [2019-11-23 23:32:20,284 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem02_label14.c [2019-11-23 23:32:20,295 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 23:32:20,303 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-23 23:32:20,315 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-23 23:32:20,345 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 23:32:20,346 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 23:32:20,346 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 23:32:20,346 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 23:32:20,347 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 23:32:20,347 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 23:32:20,347 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 23:32:20,347 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 23:32:20,374 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states. [2019-11-23 23:32:20,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-11-23 23:32:20,386 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:32:20,387 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:32:20,388 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:32:20,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:32:20,395 INFO L82 PathProgramCache]: Analyzing trace with hash 925957647, now seen corresponding path program 1 times [2019-11-23 23:32:20,406 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:32:20,407 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101448130] [2019-11-23 23:32:20,408 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:32:20,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:32:20,891 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:32:20,892 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101448130] [2019-11-23 23:32:20,894 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:32:20,895 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:32:20,897 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094472428] [2019-11-23 23:32:20,905 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:32:20,906 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:32:20,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:32:20,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:32:20,927 INFO L87 Difference]: Start difference. First operand 85 states. Second operand 4 states. [2019-11-23 23:32:21,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:32:21,812 INFO L93 Difference]: Finished difference Result 333 states and 641 transitions. [2019-11-23 23:32:21,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:32:21,814 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2019-11-23 23:32:21,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:32:21,829 INFO L225 Difference]: With dead ends: 333 [2019-11-23 23:32:21,829 INFO L226 Difference]: Without dead ends: 243 [2019-11-23 23:32:21,833 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:32:21,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2019-11-23 23:32:21,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 243. [2019-11-23 23:32:21,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2019-11-23 23:32:21,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 453 transitions. [2019-11-23 23:32:21,895 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 453 transitions. Word has length 80 [2019-11-23 23:32:21,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:32:21,896 INFO L462 AbstractCegarLoop]: Abstraction has 243 states and 453 transitions. [2019-11-23 23:32:21,896 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:32:21,896 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 453 transitions. [2019-11-23 23:32:21,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-23 23:32:21,901 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:32:21,902 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:32:21,902 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:32:21,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:32:21,903 INFO L82 PathProgramCache]: Analyzing trace with hash 221758126, now seen corresponding path program 1 times [2019-11-23 23:32:21,903 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:32:21,903 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709337080] [2019-11-23 23:32:21,903 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:32:21,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:32:21,984 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 23:32:21,985 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709337080] [2019-11-23 23:32:21,985 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:32:21,985 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:32:21,986 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592548700] [2019-11-23 23:32:21,988 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:32:21,988 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:32:21,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:32:21,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:32:21,990 INFO L87 Difference]: Start difference. First operand 243 states and 453 transitions. Second operand 4 states. [2019-11-23 23:32:22,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:32:22,660 INFO L93 Difference]: Finished difference Result 807 states and 1498 transitions. [2019-11-23 23:32:22,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:32:22,661 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-11-23 23:32:22,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:32:22,668 INFO L225 Difference]: With dead ends: 807 [2019-11-23 23:32:22,668 INFO L226 Difference]: Without dead ends: 565 [2019-11-23 23:32:22,670 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:32:22,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2019-11-23 23:32:22,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 403. [2019-11-23 23:32:22,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 403 states. [2019-11-23 23:32:22,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 719 transitions. [2019-11-23 23:32:22,704 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 719 transitions. Word has length 98 [2019-11-23 23:32:22,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:32:22,708 INFO L462 AbstractCegarLoop]: Abstraction has 403 states and 719 transitions. [2019-11-23 23:32:22,708 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:32:22,708 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 719 transitions. [2019-11-23 23:32:22,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-11-23 23:32:22,723 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:32:22,724 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:32:22,724 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:32:22,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:32:22,725 INFO L82 PathProgramCache]: Analyzing trace with hash -875187101, now seen corresponding path program 1 times [2019-11-23 23:32:22,725 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:32:22,728 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684799002] [2019-11-23 23:32:22,728 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:32:22,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:32:22,865 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 23:32:22,866 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684799002] [2019-11-23 23:32:22,867 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:32:22,867 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 23:32:22,868 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059239514] [2019-11-23 23:32:22,869 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:32:22,870 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:32:22,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:32:22,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:32:22,871 INFO L87 Difference]: Start difference. First operand 403 states and 719 transitions. Second operand 4 states. [2019-11-23 23:32:23,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:32:23,620 INFO L93 Difference]: Finished difference Result 1445 states and 2561 transitions. [2019-11-23 23:32:23,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:32:23,620 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-11-23 23:32:23,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:32:23,629 INFO L225 Difference]: With dead ends: 1445 [2019-11-23 23:32:23,630 INFO L226 Difference]: Without dead ends: 1043 [2019-11-23 23:32:23,634 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:32:23,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1043 states. [2019-11-23 23:32:23,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1043 to 883. [2019-11-23 23:32:23,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 883 states. [2019-11-23 23:32:23,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 883 states to 883 states and 1447 transitions. [2019-11-23 23:32:23,718 INFO L78 Accepts]: Start accepts. Automaton has 883 states and 1447 transitions. Word has length 102 [2019-11-23 23:32:23,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:32:23,719 INFO L462 AbstractCegarLoop]: Abstraction has 883 states and 1447 transitions. [2019-11-23 23:32:23,720 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:32:23,720 INFO L276 IsEmpty]: Start isEmpty. Operand 883 states and 1447 transitions. [2019-11-23 23:32:23,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-11-23 23:32:23,725 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:32:23,726 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:23,727 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:32:23,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:32:23,728 INFO L82 PathProgramCache]: Analyzing trace with hash 11623352, now seen corresponding path program 1 times [2019-11-23 23:32:23,728 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:32:23,729 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300381602] [2019-11-23 23:32:23,729 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:32:23,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:32:23,883 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:32:23,884 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300381602] [2019-11-23 23:32:23,884 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:32:23,885 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 23:32:23,885 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874464985] [2019-11-23 23:32:23,886 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:32:23,886 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:32:23,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:32:23,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:32:23,887 INFO L87 Difference]: Start difference. First operand 883 states and 1447 transitions. Second operand 3 states. [2019-11-23 23:32:24,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:32:24,347 INFO L93 Difference]: Finished difference Result 2165 states and 3504 transitions. [2019-11-23 23:32:24,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:32:24,347 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 102 [2019-11-23 23:32:24,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:32:24,355 INFO L225 Difference]: With dead ends: 2165 [2019-11-23 23:32:24,355 INFO L226 Difference]: Without dead ends: 1283 [2019-11-23 23:32:24,357 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:32:24,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1283 states. [2019-11-23 23:32:24,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1283 to 1203. [2019-11-23 23:32:24,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1203 states. [2019-11-23 23:32:24,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1203 states to 1203 states and 1719 transitions. [2019-11-23 23:32:24,414 INFO L78 Accepts]: Start accepts. Automaton has 1203 states and 1719 transitions. Word has length 102 [2019-11-23 23:32:24,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:32:24,415 INFO L462 AbstractCegarLoop]: Abstraction has 1203 states and 1719 transitions. [2019-11-23 23:32:24,415 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:32:24,415 INFO L276 IsEmpty]: Start isEmpty. Operand 1203 states and 1719 transitions. [2019-11-23 23:32:24,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-11-23 23:32:24,420 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:32:24,420 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:32:24,420 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:32:24,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:32:24,421 INFO L82 PathProgramCache]: Analyzing trace with hash -2118167535, now seen corresponding path program 1 times [2019-11-23 23:32:24,421 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:32:24,423 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039711262] [2019-11-23 23:32:24,423 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:32:24,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:32:24,593 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-23 23:32:24,595 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039711262] [2019-11-23 23:32:24,595 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:32:24,595 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 23:32:24,596 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096783622] [2019-11-23 23:32:24,597 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:32:24,598 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:32:24,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:32:24,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:32:24,599 INFO L87 Difference]: Start difference. First operand 1203 states and 1719 transitions. Second operand 4 states. [2019-11-23 23:32:25,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:32:25,280 INFO L93 Difference]: Finished difference Result 2725 states and 3887 transitions. [2019-11-23 23:32:25,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:32:25,280 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 107 [2019-11-23 23:32:25,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:32:25,288 INFO L225 Difference]: With dead ends: 2725 [2019-11-23 23:32:25,288 INFO L226 Difference]: Without dead ends: 1283 [2019-11-23 23:32:25,290 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:32:25,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1283 states. [2019-11-23 23:32:25,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1283 to 1283. [2019-11-23 23:32:25,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1283 states. [2019-11-23 23:32:25,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1283 states to 1283 states and 1541 transitions. [2019-11-23 23:32:25,320 INFO L78 Accepts]: Start accepts. Automaton has 1283 states and 1541 transitions. Word has length 107 [2019-11-23 23:32:25,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:32:25,321 INFO L462 AbstractCegarLoop]: Abstraction has 1283 states and 1541 transitions. [2019-11-23 23:32:25,321 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:32:25,321 INFO L276 IsEmpty]: Start isEmpty. Operand 1283 states and 1541 transitions. [2019-11-23 23:32:25,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-11-23 23:32:25,325 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:32:25,325 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:32:25,325 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:32:25,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:32:25,326 INFO L82 PathProgramCache]: Analyzing trace with hash 2102869639, now seen corresponding path program 1 times [2019-11-23 23:32:25,326 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:32:25,326 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653622414] [2019-11-23 23:32:25,326 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:32:25,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:32:25,699 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 23:32:25,700 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653622414] [2019-11-23 23:32:25,700 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:32:25,700 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-23 23:32:25,700 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527972704] [2019-11-23 23:32:25,701 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-23 23:32:25,701 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:32:25,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-23 23:32:25,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-11-23 23:32:25,702 INFO L87 Difference]: Start difference. First operand 1283 states and 1541 transitions. Second operand 8 states. [2019-11-23 23:32:26,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:32:26,649 INFO L93 Difference]: Finished difference Result 2828 states and 3388 transitions. [2019-11-23 23:32:26,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-23 23:32:26,649 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 148 [2019-11-23 23:32:26,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:32:26,656 INFO L225 Difference]: With dead ends: 2828 [2019-11-23 23:32:26,657 INFO L226 Difference]: Without dead ends: 1386 [2019-11-23 23:32:26,659 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2019-11-23 23:32:26,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1386 states. [2019-11-23 23:32:26,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1386 to 1203. [2019-11-23 23:32:26,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1203 states. [2019-11-23 23:32:26,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1203 states to 1203 states and 1441 transitions. [2019-11-23 23:32:26,689 INFO L78 Accepts]: Start accepts. Automaton has 1203 states and 1441 transitions. Word has length 148 [2019-11-23 23:32:26,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:32:26,689 INFO L462 AbstractCegarLoop]: Abstraction has 1203 states and 1441 transitions. [2019-11-23 23:32:26,689 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-23 23:32:26,689 INFO L276 IsEmpty]: Start isEmpty. Operand 1203 states and 1441 transitions. [2019-11-23 23:32:26,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-11-23 23:32:26,693 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:32:26,693 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:32:26,694 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:32:26,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:32:26,694 INFO L82 PathProgramCache]: Analyzing trace with hash -1933242070, now seen corresponding path program 1 times [2019-11-23 23:32:26,694 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:32:26,695 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886813296] [2019-11-23 23:32:26,695 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:32:26,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:32:26,809 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 23:32:26,810 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886813296] [2019-11-23 23:32:26,810 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:32:26,810 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 23:32:26,811 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638481194] [2019-11-23 23:32:26,811 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:32:26,811 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:32:26,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:32:26,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:32:26,812 INFO L87 Difference]: Start difference. First operand 1203 states and 1441 transitions. Second operand 4 states. [2019-11-23 23:32:27,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:32:27,379 INFO L93 Difference]: Finished difference Result 2245 states and 2690 transitions. [2019-11-23 23:32:27,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:32:27,379 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 157 [2019-11-23 23:32:27,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:32:27,385 INFO L225 Difference]: With dead ends: 2245 [2019-11-23 23:32:27,385 INFO L226 Difference]: Without dead ends: 883 [2019-11-23 23:32:27,387 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:32:27,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 883 states. [2019-11-23 23:32:27,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 883 to 883. [2019-11-23 23:32:27,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 883 states. [2019-11-23 23:32:27,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 883 states to 883 states and 1004 transitions. [2019-11-23 23:32:27,404 INFO L78 Accepts]: Start accepts. Automaton has 883 states and 1004 transitions. Word has length 157 [2019-11-23 23:32:27,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:32:27,404 INFO L462 AbstractCegarLoop]: Abstraction has 883 states and 1004 transitions. [2019-11-23 23:32:27,405 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:32:27,405 INFO L276 IsEmpty]: Start isEmpty. Operand 883 states and 1004 transitions. [2019-11-23 23:32:27,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-11-23 23:32:27,407 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:32:27,408 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:32:27,408 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:32:27,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:32:27,409 INFO L82 PathProgramCache]: Analyzing trace with hash -1296453692, now seen corresponding path program 1 times [2019-11-23 23:32:27,409 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:32:27,409 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900121217] [2019-11-23 23:32:27,409 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:32:27,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:32:27,514 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-11-23 23:32:27,515 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900121217] [2019-11-23 23:32:27,515 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:32:27,515 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:32:27,516 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93939386] [2019-11-23 23:32:27,516 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:32:27,516 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:32:27,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:32:27,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:32:27,517 INFO L87 Difference]: Start difference. First operand 883 states and 1004 transitions. Second operand 3 states. [2019-11-23 23:32:27,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:32:27,797 INFO L93 Difference]: Finished difference Result 1925 states and 2194 transitions. [2019-11-23 23:32:27,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:32:27,798 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 178 [2019-11-23 23:32:27,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:32:27,803 INFO L225 Difference]: With dead ends: 1925 [2019-11-23 23:32:27,804 INFO L226 Difference]: Without dead ends: 1043 [2019-11-23 23:32:27,805 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:32:27,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1043 states. [2019-11-23 23:32:27,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1043 to 1043. [2019-11-23 23:32:27,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1043 states. [2019-11-23 23:32:27,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1043 states to 1043 states and 1177 transitions. [2019-11-23 23:32:27,824 INFO L78 Accepts]: Start accepts. Automaton has 1043 states and 1177 transitions. Word has length 178 [2019-11-23 23:32:27,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:32:27,824 INFO L462 AbstractCegarLoop]: Abstraction has 1043 states and 1177 transitions. [2019-11-23 23:32:27,825 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:32:27,825 INFO L276 IsEmpty]: Start isEmpty. Operand 1043 states and 1177 transitions. [2019-11-23 23:32:27,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2019-11-23 23:32:27,828 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:32:27,829 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-23 23:32:27,829 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:32:27,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:32:27,829 INFO L82 PathProgramCache]: Analyzing trace with hash 1782733256, now seen corresponding path program 1 times [2019-11-23 23:32:27,830 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:32:27,830 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352516631] [2019-11-23 23:32:27,830 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:32:27,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:32:27,925 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 201 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2019-11-23 23:32:27,926 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352516631] [2019-11-23 23:32:27,926 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:32:27,926 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 23:32:27,931 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746086670] [2019-11-23 23:32:27,931 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:32:27,932 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:32:27,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:32:27,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:32:27,933 INFO L87 Difference]: Start difference. First operand 1043 states and 1177 transitions. Second operand 4 states. [2019-11-23 23:32:28,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:32:28,457 INFO L93 Difference]: Finished difference Result 2325 states and 2612 transitions. [2019-11-23 23:32:28,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:32:28,457 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 236 [2019-11-23 23:32:28,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:32:28,462 INFO L225 Difference]: With dead ends: 2325 [2019-11-23 23:32:28,462 INFO L226 Difference]: Without dead ends: 1123 [2019-11-23 23:32:28,464 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:32:28,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1123 states. [2019-11-23 23:32:28,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1123 to 883. [2019-11-23 23:32:28,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 883 states. [2019-11-23 23:32:28,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 883 states to 883 states and 949 transitions. [2019-11-23 23:32:28,483 INFO L78 Accepts]: Start accepts. Automaton has 883 states and 949 transitions. Word has length 236 [2019-11-23 23:32:28,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:32:28,484 INFO L462 AbstractCegarLoop]: Abstraction has 883 states and 949 transitions. [2019-11-23 23:32:28,484 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:32:28,484 INFO L276 IsEmpty]: Start isEmpty. Operand 883 states and 949 transitions. [2019-11-23 23:32:28,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2019-11-23 23:32:28,488 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:32:28,488 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-23 23:32:28,489 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:32:28,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:32:28,489 INFO L82 PathProgramCache]: Analyzing trace with hash 933528899, now seen corresponding path program 1 times [2019-11-23 23:32:28,489 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:32:28,490 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534002208] [2019-11-23 23:32:28,490 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:32:28,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:32:29,020 INFO L134 CoverageAnalysis]: Checked inductivity of 416 backedges. 303 proven. 61 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2019-11-23 23:32:29,021 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534002208] [2019-11-23 23:32:29,021 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [472518066] [2019-11-23 23:32:29,022 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 23:32:29,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:32:29,155 INFO L255 TraceCheckSpWp]: Trace formula consists of 459 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-23 23:32:29,182 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 23:32:29,319 INFO L134 CoverageAnalysis]: Checked inductivity of 416 backedges. 309 proven. 0 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2019-11-23 23:32:29,321 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-23 23:32:29,379 INFO L134 CoverageAnalysis]: Checked inductivity of 416 backedges. 309 proven. 0 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2019-11-23 23:32:29,379 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-11-23 23:32:29,380 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [8] total 11 [2019-11-23 23:32:29,380 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770099797] [2019-11-23 23:32:29,381 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:32:29,381 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:32:29,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:32:29,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2019-11-23 23:32:29,382 INFO L87 Difference]: Start difference. First operand 883 states and 949 transitions. Second operand 4 states. [2019-11-23 23:32:29,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:32:29,700 INFO L93 Difference]: Finished difference Result 1523 states and 1640 transitions. [2019-11-23 23:32:29,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:32:29,701 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 262 [2019-11-23 23:32:29,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:32:29,701 INFO L225 Difference]: With dead ends: 1523 [2019-11-23 23:32:29,702 INFO L226 Difference]: Without dead ends: 0 [2019-11-23 23:32:29,704 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 531 GetRequests, 521 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2019-11-23 23:32:29,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-23 23:32:29,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-23 23:32:29,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-23 23:32:29,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-23 23:32:29,705 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 262 [2019-11-23 23:32:29,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:32:29,705 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-23 23:32:29,705 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:32:29,705 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-23 23:32:29,705 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-23 23:32:29,911 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 23:32:29,918 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-23 23:32:30,431 WARN L192 SmtUtils]: Spent 419.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 50 [2019-11-23 23:32:30,886 WARN L192 SmtUtils]: Spent 452.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 47 [2019-11-23 23:32:30,889 INFO L444 ceAbstractionStarter]: For program point L234(lines 234 413) no Hoare annotation was computed. [2019-11-23 23:32:30,890 INFO L444 ceAbstractionStarter]: For program point L169(lines 169 413) no Hoare annotation was computed. [2019-11-23 23:32:30,890 INFO L444 ceAbstractionStarter]: For program point L368(lines 368 413) no Hoare annotation was computed. [2019-11-23 23:32:30,890 INFO L444 ceAbstractionStarter]: For program point L38(lines 38 413) no Hoare annotation was computed. [2019-11-23 23:32:30,890 INFO L444 ceAbstractionStarter]: For program point L237(lines 237 413) no Hoare annotation was computed. [2019-11-23 23:32:30,890 INFO L444 ceAbstractionStarter]: For program point L106(lines 106 413) no Hoare annotation was computed. [2019-11-23 23:32:30,890 INFO L444 ceAbstractionStarter]: For program point L42(lines 42 413) no Hoare annotation was computed. [2019-11-23 23:32:30,890 INFO L444 ceAbstractionStarter]: For program point L175(lines 175 413) no Hoare annotation was computed. [2019-11-23 23:32:30,891 INFO L444 ceAbstractionStarter]: For program point L375(lines 375 413) no Hoare annotation was computed. [2019-11-23 23:32:30,891 INFO L444 ceAbstractionStarter]: For program point L309(lines 309 413) no Hoare annotation was computed. [2019-11-23 23:32:30,891 INFO L444 ceAbstractionStarter]: For program point L179(lines 179 413) no Hoare annotation was computed. [2019-11-23 23:32:30,891 INFO L444 ceAbstractionStarter]: For program point L113(lines 113 413) no Hoare annotation was computed. [2019-11-23 23:32:30,891 INFO L444 ceAbstractionStarter]: For program point L47(lines 47 413) no Hoare annotation was computed. [2019-11-23 23:32:30,891 INFO L444 ceAbstractionStarter]: For program point L378(lines 378 413) no Hoare annotation was computed. [2019-11-23 23:32:30,891 INFO L444 ceAbstractionStarter]: For program point L380(lines 380 413) no Hoare annotation was computed. [2019-11-23 23:32:30,891 INFO L444 ceAbstractionStarter]: For program point L314(lines 314 413) no Hoare annotation was computed. [2019-11-23 23:32:30,892 INFO L444 ceAbstractionStarter]: For program point L248(lines 248 413) no Hoare annotation was computed. [2019-11-23 23:32:30,892 INFO L444 ceAbstractionStarter]: For program point L50(lines 50 413) no Hoare annotation was computed. [2019-11-23 23:32:30,892 INFO L444 ceAbstractionStarter]: For program point L185(lines 185 413) no Hoare annotation was computed. [2019-11-23 23:32:30,892 INFO L444 ceAbstractionStarter]: For program point L119(lines 119 413) no Hoare annotation was computed. [2019-11-23 23:32:30,892 INFO L444 ceAbstractionStarter]: For program point L54(lines 54 413) no Hoare annotation was computed. [2019-11-23 23:32:30,892 INFO L444 ceAbstractionStarter]: For program point L253(lines 253 413) no Hoare annotation was computed. [2019-11-23 23:32:30,892 INFO L444 ceAbstractionStarter]: For program point L187(lines 187 413) no Hoare annotation was computed. [2019-11-23 23:32:30,893 INFO L444 ceAbstractionStarter]: For program point L519-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 23:32:30,893 INFO L444 ceAbstractionStarter]: For program point L189(lines 189 413) no Hoare annotation was computed. [2019-11-23 23:32:30,893 INFO L444 ceAbstractionStarter]: For program point L123(lines 123 413) no Hoare annotation was computed. [2019-11-23 23:32:30,893 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-23 23:32:30,893 INFO L444 ceAbstractionStarter]: For program point L389(lines 389 413) no Hoare annotation was computed. [2019-11-23 23:32:30,893 INFO L444 ceAbstractionStarter]: For program point L191(lines 191 413) no Hoare annotation was computed. [2019-11-23 23:32:30,893 INFO L444 ceAbstractionStarter]: For program point L59(lines 59 413) no Hoare annotation was computed. [2019-11-23 23:32:30,893 INFO L444 ceAbstractionStarter]: For program point L522-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 23:32:30,894 INFO L444 ceAbstractionStarter]: For program point L523(line 523) no Hoare annotation was computed. [2019-11-23 23:32:30,894 INFO L444 ceAbstractionStarter]: For program point L259(lines 259 413) no Hoare annotation was computed. [2019-11-23 23:32:30,894 INFO L444 ceAbstractionStarter]: For program point L194(lines 194 413) no Hoare annotation was computed. [2019-11-23 23:32:30,894 INFO L444 ceAbstractionStarter]: For program point L261(lines 261 413) no Hoare annotation was computed. [2019-11-23 23:32:30,894 INFO L444 ceAbstractionStarter]: For program point L394(lines 394 413) no Hoare annotation was computed. [2019-11-23 23:32:30,894 INFO L444 ceAbstractionStarter]: For program point L328(lines 328 413) no Hoare annotation was computed. [2019-11-23 23:32:30,894 INFO L444 ceAbstractionStarter]: For program point L130(lines 130 413) no Hoare annotation was computed. [2019-11-23 23:32:30,894 INFO L444 ceAbstractionStarter]: For program point L65(lines 65 413) no Hoare annotation was computed. [2019-11-23 23:32:30,895 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 523) no Hoare annotation was computed. [2019-11-23 23:32:30,895 INFO L444 ceAbstractionStarter]: For program point L198(lines 198 413) no Hoare annotation was computed. [2019-11-23 23:32:30,895 INFO L444 ceAbstractionStarter]: For program point L331(lines 331 413) no Hoare annotation was computed. [2019-11-23 23:32:30,895 INFO L444 ceAbstractionStarter]: For program point L398(lines 398 413) no Hoare annotation was computed. [2019-11-23 23:32:30,895 INFO L444 ceAbstractionStarter]: For program point L134(lines 134 413) no Hoare annotation was computed. [2019-11-23 23:32:30,896 INFO L440 ceAbstractionStarter]: At program point L597(lines 29 598) the Hoare annotation is: (let ((.cse0 (= ~a28~0 9)) (.cse3 (= ~a25~0 1)) (.cse9 (= ~a17~0 8)) (.cse11 (= ~a28~0 11))) (let ((.cse1 (<= ~a17~0 7)) (.cse6 (= ~a28~0 10)) (.cse10 (not .cse11)) (.cse8 (or (and (not (= 5 ULTIMATE.start_calculate_output_~input)) .cse9 (= ~a28~0 7) (= ~a21~0 1)) (= ~a11~0 1))) (.cse2 (<= ~a19~0 0)) (.cse7 (not .cse3)) (.cse5 (not .cse0)) (.cse4 (= ~a19~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse1 .cse4 .cse3 .cse5) (and .cse6 .cse7 .cse8) (and .cse6 .cse7 .cse4) (and (not .cse4) .cse7 .cse9 .cse5 .cse10) (and .cse9 .cse3 .cse5 .cse10) (and .cse0 .cse4 .cse9) (and .cse7 .cse9 .cse5 .cse10 .cse8) (and .cse2 .cse7 .cse9 .cse5) (and .cse11 .cse4 .cse3)))) [2019-11-23 23:32:30,896 INFO L444 ceAbstractionStarter]: For program point L69(lines 69 413) no Hoare annotation was computed. [2019-11-23 23:32:30,896 INFO L444 ceAbstractionStarter]: For program point L202(lines 202 413) no Hoare annotation was computed. [2019-11-23 23:32:30,896 INFO L447 ceAbstractionStarter]: At program point L600(lines 600 617) the Hoare annotation is: true [2019-11-23 23:32:30,896 INFO L444 ceAbstractionStarter]: For program point L402(lines 402 413) no Hoare annotation was computed. [2019-11-23 23:32:30,897 INFO L444 ceAbstractionStarter]: For program point L337(lines 337 413) no Hoare annotation was computed. [2019-11-23 23:32:30,897 INFO L444 ceAbstractionStarter]: For program point L139(lines 139 413) no Hoare annotation was computed. [2019-11-23 23:32:30,897 INFO L444 ceAbstractionStarter]: For program point L404(lines 404 413) no Hoare annotation was computed. [2019-11-23 23:32:30,897 INFO L444 ceAbstractionStarter]: For program point L74(lines 74 413) no Hoare annotation was computed. [2019-11-23 23:32:30,897 INFO L444 ceAbstractionStarter]: For program point L407(lines 407 413) no Hoare annotation was computed. [2019-11-23 23:32:30,897 INFO L444 ceAbstractionStarter]: For program point L143(lines 143 413) no Hoare annotation was computed. [2019-11-23 23:32:30,899 INFO L440 ceAbstractionStarter]: At program point L606-2(lines 606 616) the Hoare annotation is: (let ((.cse0 (= ~a28~0 9)) (.cse3 (= ~a25~0 1)) (.cse9 (= ~a17~0 8)) (.cse11 (= ~a28~0 7)) (.cse12 (= ~a21~0 1)) (.cse13 (= ~a28~0 11))) (let ((.cse1 (<= ~a17~0 7)) (.cse6 (= ~a28~0 10)) (.cse10 (not .cse13)) (.cse8 (or (and (not (= 5 ULTIMATE.start_calculate_output_~input)) .cse9 .cse11 .cse12) (= ~a11~0 1))) (.cse2 (<= ~a19~0 0)) (.cse7 (not .cse3)) (.cse5 (not .cse0)) (.cse4 (= ~a19~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse1 .cse4 .cse3 .cse5) (and .cse6 .cse7 .cse8) (and .cse6 .cse7 .cse4) (and (not .cse4) .cse7 .cse9 .cse5 .cse10) (and .cse9 .cse3 .cse5 .cse10) (and .cse9 .cse11 .cse12 (<= ~a25~0 0)) (and .cse0 .cse4 .cse9) (and .cse7 .cse9 .cse5 .cse10 .cse8) (and .cse2 .cse7 .cse9 .cse5) (and .cse13 .cse4 .cse3)))) [2019-11-23 23:32:30,899 INFO L444 ceAbstractionStarter]: For program point L276(lines 276 413) no Hoare annotation was computed. [2019-11-23 23:32:30,899 INFO L444 ceAbstractionStarter]: For program point L409(lines 409 413) no Hoare annotation was computed. [2019-11-23 23:32:30,899 INFO L444 ceAbstractionStarter]: For program point L212(lines 212 413) no Hoare annotation was computed. [2019-11-23 23:32:30,899 INFO L444 ceAbstractionStarter]: For program point L280(lines 280 413) no Hoare annotation was computed. [2019-11-23 23:32:30,899 INFO L444 ceAbstractionStarter]: For program point L148(lines 148 413) no Hoare annotation was computed. [2019-11-23 23:32:30,900 INFO L444 ceAbstractionStarter]: For program point L82(lines 82 413) no Hoare annotation was computed. [2019-11-23 23:32:30,900 INFO L444 ceAbstractionStarter]: For program point L611(line 611) no Hoare annotation was computed. [2019-11-23 23:32:30,900 INFO L444 ceAbstractionStarter]: For program point L215(lines 215 413) no Hoare annotation was computed. [2019-11-23 23:32:30,900 INFO L444 ceAbstractionStarter]: For program point L349(lines 349 413) no Hoare annotation was computed. [2019-11-23 23:32:30,900 INFO L444 ceAbstractionStarter]: For program point L283(lines 283 413) no Hoare annotation was computed. [2019-11-23 23:32:30,900 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-23 23:32:30,900 INFO L444 ceAbstractionStarter]: For program point L218(lines 218 413) no Hoare annotation was computed. [2019-11-23 23:32:30,900 INFO L444 ceAbstractionStarter]: For program point L286(lines 286 413) no Hoare annotation was computed. [2019-11-23 23:32:30,900 INFO L444 ceAbstractionStarter]: For program point L154(lines 154 413) no Hoare annotation was computed. [2019-11-23 23:32:30,901 INFO L444 ceAbstractionStarter]: For program point L354(lines 354 413) no Hoare annotation was computed. [2019-11-23 23:32:30,901 INFO L444 ceAbstractionStarter]: For program point L223(lines 223 413) no Hoare annotation was computed. [2019-11-23 23:32:30,901 INFO L444 ceAbstractionStarter]: For program point L91(lines 91 413) no Hoare annotation was computed. [2019-11-23 23:32:30,901 INFO L444 ceAbstractionStarter]: For program point L291(lines 291 413) no Hoare annotation was computed. [2019-11-23 23:32:30,901 INFO L444 ceAbstractionStarter]: For program point L225(lines 225 413) no Hoare annotation was computed. [2019-11-23 23:32:30,901 INFO L444 ceAbstractionStarter]: For program point L159(lines 159 413) no Hoare annotation was computed. [2019-11-23 23:32:30,901 INFO L444 ceAbstractionStarter]: For program point L293(lines 293 413) no Hoare annotation was computed. [2019-11-23 23:32:30,901 INFO L444 ceAbstractionStarter]: For program point L95(lines 95 413) no Hoare annotation was computed. [2019-11-23 23:32:30,901 INFO L444 ceAbstractionStarter]: For program point L30(lines 30 413) no Hoare annotation was computed. [2019-11-23 23:32:30,901 INFO L444 ceAbstractionStarter]: For program point L361(lines 361 413) no Hoare annotation was computed. [2019-11-23 23:32:30,902 INFO L444 ceAbstractionStarter]: For program point L297(lines 297 413) no Hoare annotation was computed. [2019-11-23 23:32:30,902 INFO L444 ceAbstractionStarter]: For program point L165(lines 165 413) no Hoare annotation was computed. [2019-11-23 23:32:30,902 INFO L444 ceAbstractionStarter]: For program point L99(lines 99 413) no Hoare annotation was computed. [2019-11-23 23:32:30,902 INFO L444 ceAbstractionStarter]: For program point L232(lines 232 413) no Hoare annotation was computed. [2019-11-23 23:32:30,902 INFO L444 ceAbstractionStarter]: For program point L35(lines 35 413) no Hoare annotation was computed. [2019-11-23 23:32:30,954 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 11:32:30 BoogieIcfgContainer [2019-11-23 23:32:30,954 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-23 23:32:30,957 INFO L168 Benchmark]: Toolchain (without parser) took 13691.13 ms. Allocated memory was 138.4 MB in the beginning and 444.6 MB in the end (delta: 306.2 MB). Free memory was 101.7 MB in the beginning and 355.6 MB in the end (delta: -253.9 MB). Peak memory consumption was 326.9 MB. Max. memory is 7.1 GB. [2019-11-23 23:32:30,960 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 138.4 MB. Free memory is still 121.2 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-11-23 23:32:30,961 INFO L168 Benchmark]: CACSL2BoogieTranslator took 729.99 ms. Allocated memory was 138.4 MB in the beginning and 202.9 MB in the end (delta: 64.5 MB). Free memory was 101.3 MB in the beginning and 163.6 MB in the end (delta: -62.3 MB). Peak memory consumption was 28.1 MB. Max. memory is 7.1 GB. [2019-11-23 23:32:30,964 INFO L168 Benchmark]: Boogie Procedure Inliner took 90.44 ms. Allocated memory is still 202.9 MB. Free memory was 163.6 MB in the beginning and 157.6 MB in the end (delta: 6.0 MB). Peak memory consumption was 6.0 MB. Max. memory is 7.1 GB. [2019-11-23 23:32:30,965 INFO L168 Benchmark]: Boogie Preprocessor took 60.63 ms. Allocated memory is still 202.9 MB. Free memory was 157.6 MB in the beginning and 152.6 MB in the end (delta: 5.0 MB). Peak memory consumption was 5.0 MB. Max. memory is 7.1 GB. [2019-11-23 23:32:30,966 INFO L168 Benchmark]: RCFGBuilder took 2127.85 ms. Allocated memory was 202.9 MB in the beginning and 249.0 MB in the end (delta: 46.1 MB). Free memory was 152.6 MB in the beginning and 186.3 MB in the end (delta: -33.7 MB). Peak memory consumption was 109.3 MB. Max. memory is 7.1 GB. [2019-11-23 23:32:30,969 INFO L168 Benchmark]: TraceAbstraction took 10677.30 ms. Allocated memory was 249.0 MB in the beginning and 444.6 MB in the end (delta: 195.6 MB). Free memory was 186.3 MB in the beginning and 355.6 MB in the end (delta: -169.3 MB). Peak memory consumption was 300.9 MB. Max. memory is 7.1 GB. [2019-11-23 23:32:30,975 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.24 ms. Allocated memory is still 138.4 MB. Free memory is still 121.2 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 729.99 ms. Allocated memory was 138.4 MB in the beginning and 202.9 MB in the end (delta: 64.5 MB). Free memory was 101.3 MB in the beginning and 163.6 MB in the end (delta: -62.3 MB). Peak memory consumption was 28.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 90.44 ms. Allocated memory is still 202.9 MB. Free memory was 163.6 MB in the beginning and 157.6 MB in the end (delta: 6.0 MB). Peak memory consumption was 6.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 60.63 ms. Allocated memory is still 202.9 MB. Free memory was 157.6 MB in the beginning and 152.6 MB in the end (delta: 5.0 MB). Peak memory consumption was 5.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2127.85 ms. Allocated memory was 202.9 MB in the beginning and 249.0 MB in the end (delta: 46.1 MB). Free memory was 152.6 MB in the beginning and 186.3 MB in the end (delta: -33.7 MB). Peak memory consumption was 109.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 10677.30 ms. Allocated memory was 249.0 MB in the beginning and 444.6 MB in the end (delta: 195.6 MB). Free memory was 186.3 MB in the beginning and 355.6 MB in the end (delta: -169.3 MB). Peak memory consumption was 300.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 523]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 600]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 606]: Loop Invariant Derived loop invariant: ((((((((((((a28 == 9 && a17 <= 7) && a19 <= 0) && a25 == 1) || (((a17 <= 7 && a19 == 1) && a25 == 1) && !(a28 == 9))) || ((a28 == 10 && !(a25 == 1)) && ((((!(5 == input) && a17 == 8) && a28 == 7) && a21 == 1) || a11 == 1))) || ((a28 == 10 && !(a25 == 1)) && a19 == 1)) || ((((!(a19 == 1) && !(a25 == 1)) && a17 == 8) && !(a28 == 9)) && !(a28 == 11))) || (((a17 == 8 && a25 == 1) && !(a28 == 9)) && !(a28 == 11))) || (((a17 == 8 && a28 == 7) && a21 == 1) && a25 <= 0)) || ((a28 == 9 && a19 == 1) && a17 == 8)) || ((((!(a25 == 1) && a17 == 8) && !(a28 == 9)) && !(a28 == 11)) && ((((!(5 == input) && a17 == 8) && a28 == 7) && a21 == 1) || a11 == 1))) || (((a19 <= 0 && !(a25 == 1)) && a17 == 8) && !(a28 == 9))) || ((a28 == 11 && a19 == 1) && a25 == 1) - InvariantResult [Line: 29]: Loop Invariant Derived loop invariant: (((((((((((a28 == 9 && a17 <= 7) && a19 <= 0) && a25 == 1) || (((a17 <= 7 && a19 == 1) && a25 == 1) && !(a28 == 9))) || ((a28 == 10 && !(a25 == 1)) && ((((!(5 == input) && a17 == 8) && a28 == 7) && a21 == 1) || a11 == 1))) || ((a28 == 10 && !(a25 == 1)) && a19 == 1)) || ((((!(a19 == 1) && !(a25 == 1)) && a17 == 8) && !(a28 == 9)) && !(a28 == 11))) || (((a17 == 8 && a25 == 1) && !(a28 == 9)) && !(a28 == 11))) || ((a28 == 9 && a19 == 1) && a17 == 8)) || ((((!(a25 == 1) && a17 == 8) && !(a28 == 9)) && !(a28 == 11)) && ((((!(5 == input) && a17 == 8) && a28 == 7) && a21 == 1) || a11 == 1))) || (((a19 <= 0 && !(a25 == 1)) && a17 == 8) && !(a28 == 9))) || ((a28 == 11 && a19 == 1) && a25 == 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 85 locations, 1 error locations. Result: SAFE, OverallTime: 10.5s, OverallIterations: 10, TraceHistogramMax: 5, AutomataDifference: 6.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.9s, HoareTripleCheckerStatistics: 568 SDtfs, 1251 SDslu, 139 SDs, 0 SdLazy, 4146 SolverSat, 731 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 569 GetRequests, 535 SyntacticMatches, 4 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1283occurred 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.3s AutomataMinimizationTime, 10 MinimizatonAttempts, 825 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 42 NumberOfFragments, 352 HoareAnnotationTreeSize, 3 FomulaSimplifications, 1140 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 3 FomulaSimplificationsInter, 777 FormulaSimplificationTreeSizeReductionInter, 0.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 1732 NumberOfCodeBlocks, 1732 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 1982 ConstructedInterpolants, 0 QuantifiedInterpolants, 1179409 SizeOfPredicates, 0 NumberOfNonLiveVariables, 459 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 12 InterpolantComputations, 11 PerfectInterpolantSequences, 1842/1903 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...