/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/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem01_label14.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 20:51:42,839 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 20:51:42,842 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 20:51:42,859 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 20:51:42,860 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 20:51:42,861 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 20:51:42,863 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 20:51:42,872 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 20:51:42,876 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 20:51:42,879 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 20:51:42,881 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 20:51:42,882 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 20:51:42,883 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 20:51:42,884 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 20:51:42,886 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 20:51:42,888 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 20:51:42,889 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 20:51:42,890 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 20:51:42,891 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 20:51:42,897 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 20:51:42,900 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 20:51:42,901 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 20:51:42,901 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 20:51:42,902 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 20:51:42,905 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 20:51:42,905 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 20:51:42,905 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 20:51:42,907 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 20:51:42,908 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 20:51:42,909 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 20:51:42,909 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 20:51:42,910 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 20:51:42,911 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 20:51:42,911 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 20:51:42,913 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 20:51:42,913 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 20:51:42,914 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 20:51:42,914 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 20:51:42,914 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 20:51:42,917 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 20:51:42,918 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 20:51:42,919 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-23 20:51:42,932 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 20:51:42,932 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 20:51:42,933 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-23 20:51:42,933 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-23 20:51:42,934 INFO L138 SettingsManager]: * Use SBE=true [2019-11-23 20:51:42,934 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 20:51:42,934 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 20:51:42,934 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 20:51:42,934 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 20:51:42,935 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 20:51:42,935 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 20:51:42,935 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 20:51:42,935 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 20:51:42,935 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-23 20:51:42,935 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 20:51:42,936 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 20:51:42,936 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-23 20:51:42,936 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 20:51:42,936 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 20:51:42,936 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-23 20:51:42,937 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 20:51:42,937 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 20:51:42,937 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 20:51:42,937 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 20:51:42,937 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 20:51:42,938 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 20:51:42,938 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-23 20:51:42,938 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 20:51:42,938 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 20:51:42,938 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 20:51:43,214 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 20:51:43,228 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 20:51:43,231 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 20:51:43,233 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 20:51:43,233 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 20:51:43,234 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem01_label14.c [2019-11-23 20:51:43,298 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a0ad23c5/ff9d9d2859c14a9bbea4d264c661a5f1/FLAGab46fa571 [2019-11-23 20:51:43,889 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 20:51:43,893 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem01_label14.c [2019-11-23 20:51:43,908 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a0ad23c5/ff9d9d2859c14a9bbea4d264c661a5f1/FLAGab46fa571 [2019-11-23 20:51:44,120 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a0ad23c5/ff9d9d2859c14a9bbea4d264c661a5f1 [2019-11-23 20:51:44,131 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 20:51:44,132 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 20:51:44,136 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 20:51:44,136 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 20:51:44,140 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 20:51:44,141 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:51:44" (1/1) ... [2019-11-23 20:51:44,144 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@577254a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:51:44, skipping insertion in model container [2019-11-23 20:51:44,144 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:51:44" (1/1) ... [2019-11-23 20:51:44,154 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 20:51:44,212 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 20:51:44,627 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 20:51:44,633 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 20:51:44,898 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 20:51:44,918 INFO L208 MainTranslator]: Completed translation [2019-11-23 20:51:44,918 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:51:44 WrapperNode [2019-11-23 20:51:44,919 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 20:51:44,919 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 20:51:44,919 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 20:51:44,920 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 20:51:44,928 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:51:44" (1/1) ... [2019-11-23 20:51:44,953 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:51:44" (1/1) ... [2019-11-23 20:51:45,028 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 20:51:45,028 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 20:51:45,029 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 20:51:45,029 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 20:51:45,041 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:51:44" (1/1) ... [2019-11-23 20:51:45,041 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:51:44" (1/1) ... [2019-11-23 20:51:45,063 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:51:44" (1/1) ... [2019-11-23 20:51:45,063 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:51:44" (1/1) ... [2019-11-23 20:51:45,091 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:51:44" (1/1) ... [2019-11-23 20:51:45,120 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:51:44" (1/1) ... [2019-11-23 20:51:45,129 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:51:44" (1/1) ... [2019-11-23 20:51:45,142 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 20:51:45,145 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 20:51:45,145 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 20:51:45,145 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 20:51:45,147 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:51:44" (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 20:51:45,232 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 20:51:45,233 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 20:51:46,787 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 20:51:46,788 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-23 20:51:46,789 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:51:46 BoogieIcfgContainer [2019-11-23 20:51:46,789 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 20:51:46,791 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 20:51:46,791 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 20:51:46,794 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 20:51:46,794 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 08:51:44" (1/3) ... [2019-11-23 20:51:46,795 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c9a4f1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:51:46, skipping insertion in model container [2019-11-23 20:51:46,796 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:51:44" (2/3) ... [2019-11-23 20:51:46,796 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c9a4f1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:51:46, skipping insertion in model container [2019-11-23 20:51:46,796 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:51:46" (3/3) ... [2019-11-23 20:51:46,798 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem01_label14.c [2019-11-23 20:51:46,809 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 20:51:46,817 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-23 20:51:46,830 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-23 20:51:46,858 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 20:51:46,859 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 20:51:46,859 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 20:51:46,859 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 20:51:46,860 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 20:51:46,860 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 20:51:46,860 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 20:51:46,860 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 20:51:46,883 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states. [2019-11-23 20:51:46,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-11-23 20:51:46,897 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:51:46,898 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:51:46,899 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:51:46,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:51:46,905 INFO L82 PathProgramCache]: Analyzing trace with hash 2004563326, now seen corresponding path program 1 times [2019-11-23 20:51:46,915 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:51:46,916 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507273859] [2019-11-23 20:51:46,916 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:51:47,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:51:48,186 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 20:51:48,187 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507273859] [2019-11-23 20:51:48,187 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:51:48,188 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-23 20:51:48,189 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090100411] [2019-11-23 20:51:48,195 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-23 20:51:48,196 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:51:48,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-23 20:51:48,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-11-23 20:51:48,215 INFO L87 Difference]: Start difference. First operand 198 states. Second operand 10 states. [2019-11-23 20:51:48,372 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 32 [2019-11-23 20:51:49,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:51:49,909 INFO L93 Difference]: Finished difference Result 493 states and 846 transitions. [2019-11-23 20:51:49,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-23 20:51:49,911 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 131 [2019-11-23 20:51:49,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:51:49,923 INFO L225 Difference]: With dead ends: 493 [2019-11-23 20:51:49,923 INFO L226 Difference]: Without dead ends: 193 [2019-11-23 20:51:49,928 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=99, Invalid=141, Unknown=0, NotChecked=0, Total=240 [2019-11-23 20:51:49,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2019-11-23 20:51:49,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2019-11-23 20:51:49,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2019-11-23 20:51:49,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 264 transitions. [2019-11-23 20:51:49,983 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 264 transitions. Word has length 131 [2019-11-23 20:51:49,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:51:49,984 INFO L462 AbstractCegarLoop]: Abstraction has 193 states and 264 transitions. [2019-11-23 20:51:49,984 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-23 20:51:49,984 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 264 transitions. [2019-11-23 20:51:49,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-11-23 20:51:49,987 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:51:49,988 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:51:49,988 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:51:49,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:51:49,989 INFO L82 PathProgramCache]: Analyzing trace with hash 481563718, now seen corresponding path program 1 times [2019-11-23 20:51:49,989 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:51:49,989 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148734978] [2019-11-23 20:51:49,989 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:51:50,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:51:50,131 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-23 20:51:50,131 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148734978] [2019-11-23 20:51:50,132 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:51:50,132 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 20:51:50,132 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368460786] [2019-11-23 20:51:50,135 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:51:50,135 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:51:50,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:51:50,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:51:50,136 INFO L87 Difference]: Start difference. First operand 193 states and 264 transitions. Second operand 3 states. [2019-11-23 20:51:50,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:51:50,664 INFO L93 Difference]: Finished difference Result 457 states and 661 transitions. [2019-11-23 20:51:50,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:51:50,665 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 135 [2019-11-23 20:51:50,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:51:50,670 INFO L225 Difference]: With dead ends: 457 [2019-11-23 20:51:50,670 INFO L226 Difference]: Without dead ends: 324 [2019-11-23 20:51:50,671 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 20:51:50,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2019-11-23 20:51:50,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 324. [2019-11-23 20:51:50,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 324 states. [2019-11-23 20:51:50,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 443 transitions. [2019-11-23 20:51:50,695 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 443 transitions. Word has length 135 [2019-11-23 20:51:50,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:51:50,696 INFO L462 AbstractCegarLoop]: Abstraction has 324 states and 443 transitions. [2019-11-23 20:51:50,696 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:51:50,696 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 443 transitions. [2019-11-23 20:51:50,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-11-23 20:51:50,700 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:51:50,700 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:51:50,701 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:51:50,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:51:50,701 INFO L82 PathProgramCache]: Analyzing trace with hash -892512546, now seen corresponding path program 1 times [2019-11-23 20:51:50,701 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:51:50,702 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731147356] [2019-11-23 20:51:50,702 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:51:50,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:51:50,797 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-23 20:51:50,798 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731147356] [2019-11-23 20:51:50,799 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:51:50,799 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 20:51:50,800 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547844933] [2019-11-23 20:51:50,801 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 20:51:50,802 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:51:50,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 20:51:50,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:51:50,803 INFO L87 Difference]: Start difference. First operand 324 states and 443 transitions. Second operand 4 states. [2019-11-23 20:51:51,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:51:51,405 INFO L93 Difference]: Finished difference Result 850 states and 1198 transitions. [2019-11-23 20:51:51,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:51:51,406 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 140 [2019-11-23 20:51:51,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:51:51,411 INFO L225 Difference]: With dead ends: 850 [2019-11-23 20:51:51,412 INFO L226 Difference]: Without dead ends: 586 [2019-11-23 20:51:51,414 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 20:51:51,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2019-11-23 20:51:51,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 586. [2019-11-23 20:51:51,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 586 states. [2019-11-23 20:51:51,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 586 states and 783 transitions. [2019-11-23 20:51:51,468 INFO L78 Accepts]: Start accepts. Automaton has 586 states and 783 transitions. Word has length 140 [2019-11-23 20:51:51,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:51:51,469 INFO L462 AbstractCegarLoop]: Abstraction has 586 states and 783 transitions. [2019-11-23 20:51:51,469 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 20:51:51,469 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 783 transitions. [2019-11-23 20:51:51,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-11-23 20:51:51,474 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:51:51,475 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:51:51,475 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:51:51,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:51:51,476 INFO L82 PathProgramCache]: Analyzing trace with hash -970300302, now seen corresponding path program 1 times [2019-11-23 20:51:51,476 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:51:51,476 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939559786] [2019-11-23 20:51:51,476 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:51:51,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:51:51,564 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-23 20:51:51,565 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939559786] [2019-11-23 20:51:51,565 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:51:51,566 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 20:51:51,566 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49124034] [2019-11-23 20:51:51,567 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:51:51,567 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:51:51,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:51:51,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:51:51,568 INFO L87 Difference]: Start difference. First operand 586 states and 783 transitions. Second operand 3 states. [2019-11-23 20:51:52,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:51:52,108 INFO L93 Difference]: Finished difference Result 1243 states and 1680 transitions. [2019-11-23 20:51:52,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:51:52,109 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 148 [2019-11-23 20:51:52,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:51:52,114 INFO L225 Difference]: With dead ends: 1243 [2019-11-23 20:51:52,114 INFO L226 Difference]: Without dead ends: 717 [2019-11-23 20:51:52,116 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 20:51:52,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2019-11-23 20:51:52,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 586. [2019-11-23 20:51:52,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 586 states. [2019-11-23 20:51:52,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 586 states and 777 transitions. [2019-11-23 20:51:52,130 INFO L78 Accepts]: Start accepts. Automaton has 586 states and 777 transitions. Word has length 148 [2019-11-23 20:51:52,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:51:52,130 INFO L462 AbstractCegarLoop]: Abstraction has 586 states and 777 transitions. [2019-11-23 20:51:52,130 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:51:52,130 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 777 transitions. [2019-11-23 20:51:52,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-11-23 20:51:52,133 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:51:52,134 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:51:52,134 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:51:52,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:51:52,134 INFO L82 PathProgramCache]: Analyzing trace with hash -247512496, now seen corresponding path program 1 times [2019-11-23 20:51:52,135 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:51:52,135 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540559305] [2019-11-23 20:51:52,135 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:51:52,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:51:52,198 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-23 20:51:52,199 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540559305] [2019-11-23 20:51:52,199 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:51:52,199 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 20:51:52,199 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725275365] [2019-11-23 20:51:52,200 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 20:51:52,200 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:51:52,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 20:51:52,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:51:52,201 INFO L87 Difference]: Start difference. First operand 586 states and 777 transitions. Second operand 4 states. [2019-11-23 20:51:52,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:51:52,996 INFO L93 Difference]: Finished difference Result 2029 states and 2732 transitions. [2019-11-23 20:51:52,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 20:51:52,997 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 157 [2019-11-23 20:51:52,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:51:53,005 INFO L225 Difference]: With dead ends: 2029 [2019-11-23 20:51:53,005 INFO L226 Difference]: Without dead ends: 1503 [2019-11-23 20:51:53,006 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 20:51:53,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1503 states. [2019-11-23 20:51:53,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1503 to 1372. [2019-11-23 20:51:53,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1372 states. [2019-11-23 20:51:53,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1372 states to 1372 states and 1768 transitions. [2019-11-23 20:51:53,038 INFO L78 Accepts]: Start accepts. Automaton has 1372 states and 1768 transitions. Word has length 157 [2019-11-23 20:51:53,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:51:53,038 INFO L462 AbstractCegarLoop]: Abstraction has 1372 states and 1768 transitions. [2019-11-23 20:51:53,039 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 20:51:53,039 INFO L276 IsEmpty]: Start isEmpty. Operand 1372 states and 1768 transitions. [2019-11-23 20:51:53,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-11-23 20:51:53,043 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:51:53,043 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:51:53,043 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:51:53,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:51:53,044 INFO L82 PathProgramCache]: Analyzing trace with hash 1736300161, now seen corresponding path program 1 times [2019-11-23 20:51:53,044 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:51:53,044 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448736443] [2019-11-23 20:51:53,045 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:51:53,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:51:53,121 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-23 20:51:53,122 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448736443] [2019-11-23 20:51:53,122 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:51:53,122 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 20:51:53,123 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63299316] [2019-11-23 20:51:53,123 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 20:51:53,123 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:51:53,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 20:51:53,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-23 20:51:53,124 INFO L87 Difference]: Start difference. First operand 1372 states and 1768 transitions. Second operand 5 states. [2019-11-23 20:51:54,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:51:54,262 INFO L93 Difference]: Finished difference Result 2815 states and 3620 transitions. [2019-11-23 20:51:54,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 20:51:54,263 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 163 [2019-11-23 20:51:54,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:51:54,274 INFO L225 Difference]: With dead ends: 2815 [2019-11-23 20:51:54,276 INFO L226 Difference]: Without dead ends: 1503 [2019-11-23 20:51:54,279 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-23 20:51:54,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1503 states. [2019-11-23 20:51:54,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1503 to 1503. [2019-11-23 20:51:54,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1503 states. [2019-11-23 20:51:54,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1503 states to 1503 states and 1893 transitions. [2019-11-23 20:51:54,336 INFO L78 Accepts]: Start accepts. Automaton has 1503 states and 1893 transitions. Word has length 163 [2019-11-23 20:51:54,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:51:54,337 INFO L462 AbstractCegarLoop]: Abstraction has 1503 states and 1893 transitions. [2019-11-23 20:51:54,337 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 20:51:54,337 INFO L276 IsEmpty]: Start isEmpty. Operand 1503 states and 1893 transitions. [2019-11-23 20:51:54,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-11-23 20:51:54,344 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:51:54,344 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:51:54,345 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:51:54,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:51:54,345 INFO L82 PathProgramCache]: Analyzing trace with hash -1205837626, now seen corresponding path program 1 times [2019-11-23 20:51:54,346 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:51:54,346 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528701999] [2019-11-23 20:51:54,346 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:51:54,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:51:54,418 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-23 20:51:54,419 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528701999] [2019-11-23 20:51:54,419 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:51:54,419 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 20:51:54,420 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580919132] [2019-11-23 20:51:54,420 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:51:54,420 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:51:54,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:51:54,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:51:54,421 INFO L87 Difference]: Start difference. First operand 1503 states and 1893 transitions. Second operand 3 states. [2019-11-23 20:51:54,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:51:54,981 INFO L93 Difference]: Finished difference Result 3601 states and 4557 transitions. [2019-11-23 20:51:54,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:51:54,981 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 166 [2019-11-23 20:51:54,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:51:54,990 INFO L225 Difference]: With dead ends: 3601 [2019-11-23 20:51:54,991 INFO L226 Difference]: Without dead ends: 1896 [2019-11-23 20:51:54,993 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 20:51:54,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1896 states. [2019-11-23 20:51:55,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1896 to 1765. [2019-11-23 20:51:55,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1765 states. [2019-11-23 20:51:55,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1765 states to 1765 states and 2004 transitions. [2019-11-23 20:51:55,041 INFO L78 Accepts]: Start accepts. Automaton has 1765 states and 2004 transitions. Word has length 166 [2019-11-23 20:51:55,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:51:55,042 INFO L462 AbstractCegarLoop]: Abstraction has 1765 states and 2004 transitions. [2019-11-23 20:51:55,042 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:51:55,042 INFO L276 IsEmpty]: Start isEmpty. Operand 1765 states and 2004 transitions. [2019-11-23 20:51:55,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-11-23 20:51:55,047 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:51:55,047 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:51:55,048 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:51:55,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:51:55,048 INFO L82 PathProgramCache]: Analyzing trace with hash 1300334530, now seen corresponding path program 1 times [2019-11-23 20:51:55,049 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:51:55,049 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921349139] [2019-11-23 20:51:55,049 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:51:55,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:51:55,231 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:51:55,231 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921349139] [2019-11-23 20:51:55,231 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:51:55,232 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 20:51:55,232 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115468285] [2019-11-23 20:51:55,233 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 20:51:55,233 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:51:55,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 20:51:55,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-23 20:51:55,234 INFO L87 Difference]: Start difference. First operand 1765 states and 2004 transitions. Second operand 5 states. [2019-11-23 20:51:56,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:51:56,163 INFO L93 Difference]: Finished difference Result 4782 states and 5478 transitions. [2019-11-23 20:51:56,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 20:51:56,164 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 181 [2019-11-23 20:51:56,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:51:56,178 INFO L225 Difference]: With dead ends: 4782 [2019-11-23 20:51:56,179 INFO L226 Difference]: Without dead ends: 3077 [2019-11-23 20:51:56,182 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-23 20:51:56,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3077 states. [2019-11-23 20:51:56,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3077 to 2682. [2019-11-23 20:51:56,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2682 states. [2019-11-23 20:51:56,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2682 states to 2682 states and 2977 transitions. [2019-11-23 20:51:56,240 INFO L78 Accepts]: Start accepts. Automaton has 2682 states and 2977 transitions. Word has length 181 [2019-11-23 20:51:56,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:51:56,240 INFO L462 AbstractCegarLoop]: Abstraction has 2682 states and 2977 transitions. [2019-11-23 20:51:56,240 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 20:51:56,240 INFO L276 IsEmpty]: Start isEmpty. Operand 2682 states and 2977 transitions. [2019-11-23 20:51:56,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-11-23 20:51:56,247 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:51:56,247 INFO L410 BasicCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:51:56,247 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:51:56,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:51:56,248 INFO L82 PathProgramCache]: Analyzing trace with hash 766976078, now seen corresponding path program 1 times [2019-11-23 20:51:56,248 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:51:56,248 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709029042] [2019-11-23 20:51:56,249 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:51:56,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:51:56,401 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-11-23 20:51:56,401 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709029042] [2019-11-23 20:51:56,402 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:51:56,402 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 20:51:56,402 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869914357] [2019-11-23 20:51:56,403 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 20:51:56,403 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:51:56,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 20:51:56,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:51:56,403 INFO L87 Difference]: Start difference. First operand 2682 states and 2977 transitions. Second operand 4 states. [2019-11-23 20:51:57,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:51:57,292 INFO L93 Difference]: Finished difference Result 5699 states and 6349 transitions. [2019-11-23 20:51:57,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 20:51:57,293 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 210 [2019-11-23 20:51:57,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:51:57,313 INFO L225 Difference]: With dead ends: 5699 [2019-11-23 20:51:57,313 INFO L226 Difference]: Without dead ends: 2946 [2019-11-23 20:51:57,318 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 3 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 20:51:57,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2946 states. [2019-11-23 20:51:57,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2946 to 2682. [2019-11-23 20:51:57,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2682 states. [2019-11-23 20:51:57,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2682 states to 2682 states and 2882 transitions. [2019-11-23 20:51:57,394 INFO L78 Accepts]: Start accepts. Automaton has 2682 states and 2882 transitions. Word has length 210 [2019-11-23 20:51:57,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:51:57,395 INFO L462 AbstractCegarLoop]: Abstraction has 2682 states and 2882 transitions. [2019-11-23 20:51:57,395 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 20:51:57,395 INFO L276 IsEmpty]: Start isEmpty. Operand 2682 states and 2882 transitions. [2019-11-23 20:51:57,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2019-11-23 20:51:57,406 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:51:57,406 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:51:57,406 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:51:57,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:51:57,407 INFO L82 PathProgramCache]: Analyzing trace with hash 1931153020, now seen corresponding path program 1 times [2019-11-23 20:51:57,407 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:51:57,407 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723397164] [2019-11-23 20:51:57,407 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:51:57,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:51:57,647 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-11-23 20:51:57,647 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723397164] [2019-11-23 20:51:57,648 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:51:57,648 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 20:51:57,648 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949647014] [2019-11-23 20:51:57,649 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:51:57,649 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:51:57,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:51:57,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:51:57,649 INFO L87 Difference]: Start difference. First operand 2682 states and 2882 transitions. Second operand 3 states. [2019-11-23 20:51:58,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:51:58,085 INFO L93 Difference]: Finished difference Result 5566 states and 5992 transitions. [2019-11-23 20:51:58,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:51:58,086 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 235 [2019-11-23 20:51:58,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:51:58,097 INFO L225 Difference]: With dead ends: 5566 [2019-11-23 20:51:58,097 INFO L226 Difference]: Without dead ends: 2682 [2019-11-23 20:51:58,101 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 20:51:58,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2682 states. [2019-11-23 20:51:58,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2682 to 2420. [2019-11-23 20:51:58,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2420 states. [2019-11-23 20:51:58,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2420 states to 2420 states and 2562 transitions. [2019-11-23 20:51:58,150 INFO L78 Accepts]: Start accepts. Automaton has 2420 states and 2562 transitions. Word has length 235 [2019-11-23 20:51:58,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:51:58,151 INFO L462 AbstractCegarLoop]: Abstraction has 2420 states and 2562 transitions. [2019-11-23 20:51:58,151 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:51:58,151 INFO L276 IsEmpty]: Start isEmpty. Operand 2420 states and 2562 transitions. [2019-11-23 20:51:58,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2019-11-23 20:51:58,157 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:51:58,158 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 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, 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, 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 20:51:58,158 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:51:58,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:51:58,159 INFO L82 PathProgramCache]: Analyzing trace with hash 1131445953, now seen corresponding path program 1 times [2019-11-23 20:51:58,159 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:51:58,159 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178685562] [2019-11-23 20:51:58,159 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:51:58,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:51:58,267 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 161 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-11-23 20:51:58,268 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178685562] [2019-11-23 20:51:58,268 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:51:58,268 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 20:51:58,269 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711940770] [2019-11-23 20:51:58,269 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 20:51:58,269 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:51:58,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 20:51:58,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:51:58,270 INFO L87 Difference]: Start difference. First operand 2420 states and 2562 transitions. Second operand 4 states. [2019-11-23 20:51:59,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:51:59,188 INFO L93 Difference]: Finished difference Result 4780 states and 5062 transitions. [2019-11-23 20:51:59,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 20:51:59,188 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 237 [2019-11-23 20:51:59,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:51:59,196 INFO L225 Difference]: With dead ends: 4780 [2019-11-23 20:51:59,196 INFO L226 Difference]: Without dead ends: 1634 [2019-11-23 20:51:59,200 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 20:51:59,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1634 states. [2019-11-23 20:51:59,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1634 to 1503. [2019-11-23 20:51:59,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1503 states. [2019-11-23 20:51:59,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1503 states to 1503 states and 1570 transitions. [2019-11-23 20:51:59,228 INFO L78 Accepts]: Start accepts. Automaton has 1503 states and 1570 transitions. Word has length 237 [2019-11-23 20:51:59,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:51:59,229 INFO L462 AbstractCegarLoop]: Abstraction has 1503 states and 1570 transitions. [2019-11-23 20:51:59,229 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 20:51:59,229 INFO L276 IsEmpty]: Start isEmpty. Operand 1503 states and 1570 transitions. [2019-11-23 20:51:59,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2019-11-23 20:51:59,234 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:51:59,234 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:51:59,234 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:51:59,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:51:59,235 INFO L82 PathProgramCache]: Analyzing trace with hash 1941854154, now seen corresponding path program 1 times [2019-11-23 20:51:59,235 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:51:59,235 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063411706] [2019-11-23 20:51:59,235 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:51:59,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:51:59,778 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-11-23 20:51:59,778 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063411706] [2019-11-23 20:51:59,778 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:51:59,779 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 20:51:59,779 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272768632] [2019-11-23 20:51:59,781 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 20:51:59,781 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:51:59,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 20:51:59,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-23 20:51:59,782 INFO L87 Difference]: Start difference. First operand 1503 states and 1570 transitions. Second operand 5 states. [2019-11-23 20:52:00,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:52:00,297 INFO L93 Difference]: Finished difference Result 3023 states and 3163 transitions. [2019-11-23 20:52:00,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 20:52:00,297 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 259 [2019-11-23 20:52:00,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:52:00,303 INFO L225 Difference]: With dead ends: 3023 [2019-11-23 20:52:00,303 INFO L226 Difference]: Without dead ends: 1503 [2019-11-23 20:52:00,305 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-23 20:52:00,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1503 states. [2019-11-23 20:52:00,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1503 to 1503. [2019-11-23 20:52:00,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1503 states. [2019-11-23 20:52:00,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1503 states to 1503 states and 1567 transitions. [2019-11-23 20:52:00,330 INFO L78 Accepts]: Start accepts. Automaton has 1503 states and 1567 transitions. Word has length 259 [2019-11-23 20:52:00,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:52:00,330 INFO L462 AbstractCegarLoop]: Abstraction has 1503 states and 1567 transitions. [2019-11-23 20:52:00,330 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 20:52:00,330 INFO L276 IsEmpty]: Start isEmpty. Operand 1503 states and 1567 transitions. [2019-11-23 20:52:00,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2019-11-23 20:52:00,335 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:52:00,336 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:52:00,336 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:52:00,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:52:00,336 INFO L82 PathProgramCache]: Analyzing trace with hash -1207165551, now seen corresponding path program 1 times [2019-11-23 20:52:00,337 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:52:00,337 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659030308] [2019-11-23 20:52:00,337 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:52:00,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:52:01,247 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 215 proven. 4 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2019-11-23 20:52:01,247 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659030308] [2019-11-23 20:52:01,248 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [571183101] [2019-11-23 20:52:01,248 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 20:52:01,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:52:01,379 INFO L255 TraceCheckSpWp]: Trace formula consists of 486 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-23 20:52:01,394 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:52:01,544 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 194 proven. 0 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2019-11-23 20:52:01,544 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-23 20:52:01,544 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [12] total 14 [2019-11-23 20:52:01,545 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638146021] [2019-11-23 20:52:01,545 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:52:01,546 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:52:01,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:52:01,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2019-11-23 20:52:01,547 INFO L87 Difference]: Start difference. First operand 1503 states and 1567 transitions. Second operand 3 states. [2019-11-23 20:52:01,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:52:01,944 INFO L93 Difference]: Finished difference Result 1505 states and 1568 transitions. [2019-11-23 20:52:01,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:52:01,944 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 282 [2019-11-23 20:52:01,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:52:01,950 INFO L225 Difference]: With dead ends: 1505 [2019-11-23 20:52:01,950 INFO L226 Difference]: Without dead ends: 1503 [2019-11-23 20:52:01,951 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 285 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2019-11-23 20:52:01,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1503 states. [2019-11-23 20:52:01,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1503 to 1372. [2019-11-23 20:52:01,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1372 states. [2019-11-23 20:52:01,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1372 states to 1372 states and 1430 transitions. [2019-11-23 20:52:01,982 INFO L78 Accepts]: Start accepts. Automaton has 1372 states and 1430 transitions. Word has length 282 [2019-11-23 20:52:01,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:52:01,983 INFO L462 AbstractCegarLoop]: Abstraction has 1372 states and 1430 transitions. [2019-11-23 20:52:01,983 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:52:01,983 INFO L276 IsEmpty]: Start isEmpty. Operand 1372 states and 1430 transitions. [2019-11-23 20:52:01,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2019-11-23 20:52:01,989 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:52:01,989 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:52:02,194 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:52:02,195 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:52:02,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:52:02,200 INFO L82 PathProgramCache]: Analyzing trace with hash -1143025436, now seen corresponding path program 1 times [2019-11-23 20:52:02,200 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:52:02,201 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408945136] [2019-11-23 20:52:02,201 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:52:02,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:52:02,861 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 163 proven. 0 refuted. 0 times theorem prover too weak. 167 trivial. 0 not checked. [2019-11-23 20:52:02,861 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408945136] [2019-11-23 20:52:02,861 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:52:02,861 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 20:52:02,862 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322871370] [2019-11-23 20:52:02,863 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 20:52:02,864 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:52:02,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 20:52:02,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-23 20:52:02,865 INFO L87 Difference]: Start difference. First operand 1372 states and 1430 transitions. Second operand 5 states. [2019-11-23 20:52:03,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:52:03,409 INFO L93 Difference]: Finished difference Result 2631 states and 2747 transitions. [2019-11-23 20:52:03,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 20:52:03,409 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 295 [2019-11-23 20:52:03,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:52:03,410 INFO L225 Difference]: With dead ends: 2631 [2019-11-23 20:52:03,410 INFO L226 Difference]: Without dead ends: 0 [2019-11-23 20:52:03,413 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-23 20:52:03,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-23 20:52:03,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-23 20:52:03,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-23 20:52:03,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-23 20:52:03,414 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 295 [2019-11-23 20:52:03,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:52:03,414 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-23 20:52:03,414 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 20:52:03,414 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-23 20:52:03,414 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-23 20:52:03,419 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-23 20:52:03,833 WARN L192 SmtUtils]: Spent 350.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 57 [2019-11-23 20:52:04,230 WARN L192 SmtUtils]: Spent 390.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 57 [2019-11-23 20:52:04,235 INFO L444 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2019-11-23 20:52:04,235 INFO L444 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2019-11-23 20:52:04,235 INFO L444 ceAbstractionStarter]: For program point L565-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:04,236 INFO L444 ceAbstractionStarter]: For program point L532-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:04,236 INFO L444 ceAbstractionStarter]: For program point L499-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:04,236 INFO L444 ceAbstractionStarter]: For program point L466-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:04,236 INFO L444 ceAbstractionStarter]: For program point L433-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:04,237 INFO L444 ceAbstractionStarter]: For program point L400-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:04,237 INFO L444 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2019-11-23 20:52:04,237 INFO L444 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2019-11-23 20:52:04,237 INFO L444 ceAbstractionStarter]: For program point L566(line 566) no Hoare annotation was computed. [2019-11-23 20:52:04,237 INFO L444 ceAbstractionStarter]: For program point L533(line 533) no Hoare annotation was computed. [2019-11-23 20:52:04,238 INFO L444 ceAbstractionStarter]: For program point L500(line 500) no Hoare annotation was computed. [2019-11-23 20:52:04,238 INFO L444 ceAbstractionStarter]: For program point L467(line 467) no Hoare annotation was computed. [2019-11-23 20:52:04,238 INFO L444 ceAbstractionStarter]: For program point L434(line 434) no Hoare annotation was computed. [2019-11-23 20:52:04,238 INFO L444 ceAbstractionStarter]: For program point L401(line 401) no Hoare annotation was computed. [2019-11-23 20:52:04,238 INFO L444 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2019-11-23 20:52:04,239 INFO L444 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2019-11-23 20:52:04,239 INFO L444 ceAbstractionStarter]: For program point L568-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:04,239 INFO L444 ceAbstractionStarter]: For program point L535-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:04,239 INFO L444 ceAbstractionStarter]: For program point L502-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:04,239 INFO L444 ceAbstractionStarter]: For program point L469-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:04,239 INFO L444 ceAbstractionStarter]: For program point L436-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:04,239 INFO L444 ceAbstractionStarter]: For program point L403-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:04,240 INFO L444 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2019-11-23 20:52:04,240 INFO L444 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2019-11-23 20:52:04,240 INFO L444 ceAbstractionStarter]: For program point L569(line 569) no Hoare annotation was computed. [2019-11-23 20:52:04,240 INFO L444 ceAbstractionStarter]: For program point L536(line 536) no Hoare annotation was computed. [2019-11-23 20:52:04,240 INFO L444 ceAbstractionStarter]: For program point L503(line 503) no Hoare annotation was computed. [2019-11-23 20:52:04,240 INFO L444 ceAbstractionStarter]: For program point L470(line 470) no Hoare annotation was computed. [2019-11-23 20:52:04,240 INFO L444 ceAbstractionStarter]: For program point L437(line 437) no Hoare annotation was computed. [2019-11-23 20:52:04,241 INFO L444 ceAbstractionStarter]: For program point L404(line 404) no Hoare annotation was computed. [2019-11-23 20:52:04,241 INFO L444 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2019-11-23 20:52:04,241 INFO L444 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2019-11-23 20:52:04,241 INFO L444 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2019-11-23 20:52:04,241 INFO L444 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2019-11-23 20:52:04,241 INFO L444 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2019-11-23 20:52:04,241 INFO L444 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2019-11-23 20:52:04,241 INFO L444 ceAbstractionStarter]: For program point L571-1(lines 571 573) no Hoare annotation was computed. [2019-11-23 20:52:04,242 INFO L444 ceAbstractionStarter]: For program point L538-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:04,242 INFO L444 ceAbstractionStarter]: For program point L505-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:04,242 INFO L444 ceAbstractionStarter]: For program point L472-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:04,242 INFO L444 ceAbstractionStarter]: For program point L439-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:04,242 INFO L444 ceAbstractionStarter]: For program point L406-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:04,242 INFO L444 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2019-11-23 20:52:04,242 INFO L444 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2019-11-23 20:52:04,242 INFO L444 ceAbstractionStarter]: For program point L572(line 572) no Hoare annotation was computed. [2019-11-23 20:52:04,243 INFO L444 ceAbstractionStarter]: For program point L539(line 539) no Hoare annotation was computed. [2019-11-23 20:52:04,243 INFO L444 ceAbstractionStarter]: For program point L506(line 506) no Hoare annotation was computed. [2019-11-23 20:52:04,243 INFO L444 ceAbstractionStarter]: For program point L473(line 473) no Hoare annotation was computed. [2019-11-23 20:52:04,243 INFO L444 ceAbstractionStarter]: For program point L440(line 440) no Hoare annotation was computed. [2019-11-23 20:52:04,243 INFO L444 ceAbstractionStarter]: For program point L407(line 407) no Hoare annotation was computed. [2019-11-23 20:52:04,243 INFO L444 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2019-11-23 20:52:04,244 INFO L440 ceAbstractionStarter]: At program point L574(lines 30 575) the Hoare annotation is: (let ((.cse0 (= ~a17~0 1)) (.cse10 (= ~a20~0 1)) (.cse11 (= ~a16~0 6))) (let ((.cse8 (<= ~a21~0 0)) (.cse14 (<= ~a7~0 0)) (.cse3 (= 1 ~a7~0)) (.cse7 (not .cse11)) (.cse2 (= ~a21~0 1)) (.cse5 (= ~a16~0 5)) (.cse1 (= ~a12~0 8)) (.cse9 (<= ~a17~0 0)) (.cse4 (= 15 ~a8~0)) (.cse6 (not .cse10)) (.cse12 (= ~a16~0 4)) (.cse13 (not .cse0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse5) (and .cse6 .cse7 .cse0 .cse2) (and .cse3 .cse8 .cse1 .cse9 .cse10 .cse11) (and .cse3 .cse12 .cse9 .cse4) (and .cse10 .cse4 .cse13 .cse11) (and .cse9 .cse4 .cse5) (and (or (and .cse3 .cse9 .cse5) (and .cse3 .cse8 .cse12 .cse9)) .cse1) (and .cse3 .cse8 .cse7 .cse0 .cse1) (and .cse12 .cse1 .cse9 .cse2 .cse14 (= 14 ~a8~0)) (and (= 13 ~a8~0) .cse12 .cse1 .cse9 .cse2 .cse14) (and .cse3 .cse7 .cse0 .cse2) (and .cse6 .cse5) (and .cse6 .cse1 .cse4 .cse11) (and .cse12 .cse1 .cse9 .cse10 .cse4 .cse13) (and .cse6 .cse12 .cse13)))) [2019-11-23 20:52:04,244 INFO L444 ceAbstractionStarter]: For program point L541-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:04,244 INFO L444 ceAbstractionStarter]: For program point L508-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:04,244 INFO L444 ceAbstractionStarter]: For program point L475-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:04,244 INFO L444 ceAbstractionStarter]: For program point L442-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:04,245 INFO L444 ceAbstractionStarter]: For program point L409-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:04,245 INFO L444 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2019-11-23 20:52:04,245 INFO L444 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2019-11-23 20:52:04,245 INFO L444 ceAbstractionStarter]: For program point L509(line 509) no Hoare annotation was computed. [2019-11-23 20:52:04,245 INFO L444 ceAbstractionStarter]: For program point L476(line 476) no Hoare annotation was computed. [2019-11-23 20:52:04,245 INFO L444 ceAbstractionStarter]: For program point L443(line 443) no Hoare annotation was computed. [2019-11-23 20:52:04,245 INFO L444 ceAbstractionStarter]: For program point L410(line 410) no Hoare annotation was computed. [2019-11-23 20:52:04,245 INFO L444 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2019-11-23 20:52:04,246 INFO L444 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2019-11-23 20:52:04,246 INFO L444 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2019-11-23 20:52:04,246 INFO L444 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2019-11-23 20:52:04,246 INFO L444 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2019-11-23 20:52:04,246 INFO L444 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2019-11-23 20:52:04,246 INFO L444 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2019-11-23 20:52:04,246 INFO L447 ceAbstractionStarter]: At program point L577(lines 577 594) the Hoare annotation is: true [2019-11-23 20:52:04,246 INFO L444 ceAbstractionStarter]: For program point L544-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:04,246 INFO L444 ceAbstractionStarter]: For program point L511-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:04,247 INFO L444 ceAbstractionStarter]: For program point L478-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:04,247 INFO L444 ceAbstractionStarter]: For program point L445-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:04,247 INFO L444 ceAbstractionStarter]: For program point L412-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:04,247 INFO L444 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2019-11-23 20:52:04,247 INFO L444 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2019-11-23 20:52:04,247 INFO L444 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2019-11-23 20:52:04,247 INFO L444 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2019-11-23 20:52:04,247 INFO L444 ceAbstractionStarter]: For program point L512(line 512) no Hoare annotation was computed. [2019-11-23 20:52:04,248 INFO L444 ceAbstractionStarter]: For program point L479(line 479) no Hoare annotation was computed. [2019-11-23 20:52:04,248 INFO L444 ceAbstractionStarter]: For program point L446(line 446) no Hoare annotation was computed. [2019-11-23 20:52:04,248 INFO L444 ceAbstractionStarter]: For program point L413(line 413) no Hoare annotation was computed. [2019-11-23 20:52:04,248 INFO L444 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2019-11-23 20:52:04,248 INFO L444 ceAbstractionStarter]: For program point L547-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:04,248 INFO L444 ceAbstractionStarter]: For program point L514-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:04,248 INFO L444 ceAbstractionStarter]: For program point L481-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:04,248 INFO L444 ceAbstractionStarter]: For program point L448-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:04,249 INFO L444 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2019-11-23 20:52:04,249 INFO L444 ceAbstractionStarter]: For program point L415-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:04,249 INFO L444 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2019-11-23 20:52:04,249 INFO L444 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2019-11-23 20:52:04,249 INFO L444 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2019-11-23 20:52:04,249 INFO L444 ceAbstractionStarter]: For program point L515(line 515) no Hoare annotation was computed. [2019-11-23 20:52:04,249 INFO L444 ceAbstractionStarter]: For program point L482(line 482) no Hoare annotation was computed. [2019-11-23 20:52:04,249 INFO L444 ceAbstractionStarter]: For program point L449(line 449) no Hoare annotation was computed. [2019-11-23 20:52:04,250 INFO L444 ceAbstractionStarter]: For program point L416(line 416) no Hoare annotation was computed. [2019-11-23 20:52:04,250 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-23 20:52:04,250 INFO L444 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2019-11-23 20:52:04,250 INFO L444 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2019-11-23 20:52:04,250 INFO L444 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2019-11-23 20:52:04,250 INFO L444 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2019-11-23 20:52:04,250 INFO L444 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2019-11-23 20:52:04,250 INFO L444 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2019-11-23 20:52:04,251 INFO L444 ceAbstractionStarter]: For program point L550-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:04,251 INFO L440 ceAbstractionStarter]: At program point L583-2(lines 583 593) the Hoare annotation is: (let ((.cse0 (= ~a17~0 1)) (.cse10 (= ~a20~0 1)) (.cse11 (= ~a16~0 6))) (let ((.cse8 (<= ~a21~0 0)) (.cse14 (<= ~a7~0 0)) (.cse3 (= 1 ~a7~0)) (.cse7 (not .cse11)) (.cse2 (= ~a21~0 1)) (.cse5 (= ~a16~0 5)) (.cse1 (= ~a12~0 8)) (.cse9 (<= ~a17~0 0)) (.cse4 (= 15 ~a8~0)) (.cse6 (not .cse10)) (.cse12 (= ~a16~0 4)) (.cse13 (not .cse0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse5) (and .cse6 .cse7 .cse0 .cse2) (and .cse3 .cse8 .cse1 .cse9 .cse10 .cse11) (and .cse3 .cse12 .cse9 .cse4) (and .cse10 .cse4 .cse13 .cse11) (and .cse9 .cse4 .cse5) (and (or (and .cse3 .cse9 .cse5) (and .cse3 .cse8 .cse12 .cse9)) .cse1) (and .cse3 .cse8 .cse7 .cse0 .cse1) (and .cse12 .cse1 .cse9 .cse2 .cse14 (= 14 ~a8~0)) (and (= 13 ~a8~0) .cse12 .cse1 .cse9 .cse2 .cse14) (and .cse3 .cse7 .cse0 .cse2) (and .cse6 .cse5) (and .cse6 .cse1 .cse4 .cse11) (and .cse12 .cse1 .cse9 .cse10 .cse4 .cse13) (and .cse6 .cse12 .cse13)))) [2019-11-23 20:52:04,251 INFO L444 ceAbstractionStarter]: For program point L517-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:04,251 INFO L444 ceAbstractionStarter]: For program point L484-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:04,251 INFO L444 ceAbstractionStarter]: For program point L451-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:04,251 INFO L444 ceAbstractionStarter]: For program point L418-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:04,252 INFO L444 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2019-11-23 20:52:04,252 INFO L444 ceAbstractionStarter]: For program point L551(line 551) no Hoare annotation was computed. [2019-11-23 20:52:04,252 INFO L444 ceAbstractionStarter]: For program point L518(line 518) no Hoare annotation was computed. [2019-11-23 20:52:04,252 INFO L444 ceAbstractionStarter]: For program point L485(line 485) no Hoare annotation was computed. [2019-11-23 20:52:04,252 INFO L444 ceAbstractionStarter]: For program point L452(line 452) no Hoare annotation was computed. [2019-11-23 20:52:04,252 INFO L444 ceAbstractionStarter]: For program point L419(line 419) no Hoare annotation was computed. [2019-11-23 20:52:04,252 INFO L444 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2019-11-23 20:52:04,252 INFO L444 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2019-11-23 20:52:04,253 INFO L444 ceAbstractionStarter]: For program point L553-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:04,253 INFO L444 ceAbstractionStarter]: For program point L520-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:04,253 INFO L444 ceAbstractionStarter]: For program point L487-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:04,253 INFO L444 ceAbstractionStarter]: For program point L454-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:04,253 INFO L444 ceAbstractionStarter]: For program point L421-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:04,253 INFO L444 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2019-11-23 20:52:04,253 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-23 20:52:04,253 INFO L444 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2019-11-23 20:52:04,253 INFO L444 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2019-11-23 20:52:04,254 INFO L444 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2019-11-23 20:52:04,254 INFO L444 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2019-11-23 20:52:04,254 INFO L444 ceAbstractionStarter]: For program point L521(line 521) no Hoare annotation was computed. [2019-11-23 20:52:04,254 INFO L444 ceAbstractionStarter]: For program point L488(line 488) no Hoare annotation was computed. [2019-11-23 20:52:04,254 INFO L444 ceAbstractionStarter]: For program point L455(line 455) no Hoare annotation was computed. [2019-11-23 20:52:04,254 INFO L444 ceAbstractionStarter]: For program point L422(line 422) no Hoare annotation was computed. [2019-11-23 20:52:04,254 INFO L444 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2019-11-23 20:52:04,254 INFO L444 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2019-11-23 20:52:04,255 INFO L444 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2019-11-23 20:52:04,255 INFO L444 ceAbstractionStarter]: For program point L556-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:04,255 INFO L444 ceAbstractionStarter]: For program point L523-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:04,255 INFO L444 ceAbstractionStarter]: For program point L490-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:04,255 INFO L444 ceAbstractionStarter]: For program point L457-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:04,255 INFO L444 ceAbstractionStarter]: For program point L391(lines 391 393) no Hoare annotation was computed. [2019-11-23 20:52:04,255 INFO L444 ceAbstractionStarter]: For program point L424-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:04,255 INFO L444 ceAbstractionStarter]: For program point L391-2(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:04,255 INFO L444 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2019-11-23 20:52:04,256 INFO L444 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2019-11-23 20:52:04,256 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-23 20:52:04,256 INFO L444 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2019-11-23 20:52:04,256 INFO L444 ceAbstractionStarter]: For program point L524(line 524) no Hoare annotation was computed. [2019-11-23 20:52:04,256 INFO L444 ceAbstractionStarter]: For program point L491(line 491) no Hoare annotation was computed. [2019-11-23 20:52:04,256 INFO L444 ceAbstractionStarter]: For program point L458(line 458) no Hoare annotation was computed. [2019-11-23 20:52:04,256 INFO L444 ceAbstractionStarter]: For program point L425(line 425) no Hoare annotation was computed. [2019-11-23 20:52:04,256 INFO L444 ceAbstractionStarter]: For program point L392(line 392) no Hoare annotation was computed. [2019-11-23 20:52:04,256 INFO L444 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2019-11-23 20:52:04,257 INFO L444 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2019-11-23 20:52:04,257 INFO L444 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2019-11-23 20:52:04,257 INFO L444 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2019-11-23 20:52:04,257 INFO L444 ceAbstractionStarter]: For program point L559-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:04,257 INFO L444 ceAbstractionStarter]: For program point L526-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:04,257 INFO L444 ceAbstractionStarter]: For program point L493-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:04,257 INFO L444 ceAbstractionStarter]: For program point L460-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:04,257 INFO L444 ceAbstractionStarter]: For program point L427-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:04,258 INFO L444 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2019-11-23 20:52:04,258 INFO L444 ceAbstractionStarter]: For program point L394-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:04,258 INFO L444 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2019-11-23 20:52:04,258 INFO L444 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2019-11-23 20:52:04,258 INFO L444 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2019-11-23 20:52:04,258 INFO L444 ceAbstractionStarter]: For program point L527(line 527) no Hoare annotation was computed. [2019-11-23 20:52:04,258 INFO L444 ceAbstractionStarter]: For program point L494(line 494) no Hoare annotation was computed. [2019-11-23 20:52:04,258 INFO L444 ceAbstractionStarter]: For program point L461(line 461) no Hoare annotation was computed. [2019-11-23 20:52:04,258 INFO L444 ceAbstractionStarter]: For program point L428(line 428) no Hoare annotation was computed. [2019-11-23 20:52:04,259 INFO L444 ceAbstractionStarter]: For program point L395(line 395) no Hoare annotation was computed. [2019-11-23 20:52:04,259 INFO L444 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2019-11-23 20:52:04,259 INFO L444 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2019-11-23 20:52:04,259 INFO L444 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2019-11-23 20:52:04,259 INFO L444 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-23 20:52:04,259 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 569) no Hoare annotation was computed. [2019-11-23 20:52:04,259 INFO L444 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2019-11-23 20:52:04,259 INFO L444 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2019-11-23 20:52:04,260 INFO L444 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2019-11-23 20:52:04,260 INFO L444 ceAbstractionStarter]: For program point L562-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:04,260 INFO L444 ceAbstractionStarter]: For program point L529-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:04,260 INFO L444 ceAbstractionStarter]: For program point L496-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:04,260 INFO L444 ceAbstractionStarter]: For program point L463-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:04,260 INFO L444 ceAbstractionStarter]: For program point L430-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:04,260 INFO L444 ceAbstractionStarter]: For program point L397-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:04,260 INFO L444 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2019-11-23 20:52:04,261 INFO L444 ceAbstractionStarter]: For program point L563(line 563) no Hoare annotation was computed. [2019-11-23 20:52:04,261 INFO L444 ceAbstractionStarter]: For program point L530(line 530) no Hoare annotation was computed. [2019-11-23 20:52:04,261 INFO L444 ceAbstractionStarter]: For program point L497(line 497) no Hoare annotation was computed. [2019-11-23 20:52:04,261 INFO L444 ceAbstractionStarter]: For program point L464(line 464) no Hoare annotation was computed. [2019-11-23 20:52:04,261 INFO L444 ceAbstractionStarter]: For program point L431(line 431) no Hoare annotation was computed. [2019-11-23 20:52:04,261 INFO L444 ceAbstractionStarter]: For program point L398(line 398) no Hoare annotation was computed. [2019-11-23 20:52:04,261 INFO L444 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2019-11-23 20:52:04,261 INFO L444 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2019-11-23 20:52:04,261 INFO L444 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2019-11-23 20:52:04,288 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 08:52:04 BoogieIcfgContainer [2019-11-23 20:52:04,288 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-23 20:52:04,290 INFO L168 Benchmark]: Toolchain (without parser) took 20157.96 ms. Allocated memory was 140.5 MB in the beginning and 531.6 MB in the end (delta: 391.1 MB). Free memory was 99.6 MB in the beginning and 241.1 MB in the end (delta: -141.5 MB). Peak memory consumption was 249.7 MB. Max. memory is 7.1 GB. [2019-11-23 20:52:04,291 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 140.5 MB. Free memory was 120.9 MB in the beginning and 120.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-11-23 20:52:04,292 INFO L168 Benchmark]: CACSL2BoogieTranslator took 783.20 ms. Allocated memory was 140.5 MB in the beginning and 205.5 MB in the end (delta: 65.0 MB). Free memory was 99.4 MB in the beginning and 171.3 MB in the end (delta: -71.9 MB). Peak memory consumption was 33.0 MB. Max. memory is 7.1 GB. [2019-11-23 20:52:04,292 INFO L168 Benchmark]: Boogie Procedure Inliner took 108.83 ms. Allocated memory is still 205.5 MB. Free memory was 170.6 MB in the beginning and 165.0 MB in the end (delta: 5.6 MB). Peak memory consumption was 5.6 MB. Max. memory is 7.1 GB. [2019-11-23 20:52:04,293 INFO L168 Benchmark]: Boogie Preprocessor took 113.88 ms. Allocated memory is still 205.5 MB. Free memory was 165.0 MB in the beginning and 160.8 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 7.1 GB. [2019-11-23 20:52:04,294 INFO L168 Benchmark]: RCFGBuilder took 1644.67 ms. Allocated memory was 205.5 MB in the beginning and 237.5 MB in the end (delta: 32.0 MB). Free memory was 160.8 MB in the beginning and 171.6 MB in the end (delta: -10.8 MB). Peak memory consumption was 79.9 MB. Max. memory is 7.1 GB. [2019-11-23 20:52:04,295 INFO L168 Benchmark]: TraceAbstraction took 17497.70 ms. Allocated memory was 237.5 MB in the beginning and 531.6 MB in the end (delta: 294.1 MB). Free memory was 171.6 MB in the beginning and 241.1 MB in the end (delta: -69.5 MB). Peak memory consumption was 224.6 MB. Max. memory is 7.1 GB. [2019-11-23 20:52:04,299 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.22 ms. Allocated memory is still 140.5 MB. Free memory was 120.9 MB in the beginning and 120.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 783.20 ms. Allocated memory was 140.5 MB in the beginning and 205.5 MB in the end (delta: 65.0 MB). Free memory was 99.4 MB in the beginning and 171.3 MB in the end (delta: -71.9 MB). Peak memory consumption was 33.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 108.83 ms. Allocated memory is still 205.5 MB. Free memory was 170.6 MB in the beginning and 165.0 MB in the end (delta: 5.6 MB). Peak memory consumption was 5.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 113.88 ms. Allocated memory is still 205.5 MB. Free memory was 165.0 MB in the beginning and 160.8 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1644.67 ms. Allocated memory was 205.5 MB in the beginning and 237.5 MB in the end (delta: 32.0 MB). Free memory was 160.8 MB in the beginning and 171.6 MB in the end (delta: -10.8 MB). Peak memory consumption was 79.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 17497.70 ms. Allocated memory was 237.5 MB in the beginning and 531.6 MB in the end (delta: 294.1 MB). Free memory was 171.6 MB in the beginning and 241.1 MB in the end (delta: -69.5 MB). Peak memory consumption was 224.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 569]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: ((((((((((((((((a17 == 1 && a12 == 8) && a21 == 1) || ((1 == a7 && 15 == a8) && a16 == 5)) || (((!(a20 == 1) && !(a16 == 6)) && a17 == 1) && a21 == 1)) || (((((1 == a7 && a21 <= 0) && a12 == 8) && a17 <= 0) && a20 == 1) && a16 == 6)) || (((1 == a7 && a16 == 4) && a17 <= 0) && 15 == a8)) || (((a20 == 1 && 15 == a8) && !(a17 == 1)) && a16 == 6)) || ((a17 <= 0 && 15 == a8) && a16 == 5)) || ((((1 == a7 && a17 <= 0) && a16 == 5) || (((1 == a7 && a21 <= 0) && a16 == 4) && a17 <= 0)) && a12 == 8)) || ((((1 == a7 && a21 <= 0) && !(a16 == 6)) && a17 == 1) && a12 == 8)) || (((((a16 == 4 && a12 == 8) && a17 <= 0) && a21 == 1) && a7 <= 0) && 14 == a8)) || (((((13 == a8 && a16 == 4) && a12 == 8) && a17 <= 0) && a21 == 1) && a7 <= 0)) || (((1 == a7 && !(a16 == 6)) && a17 == 1) && a21 == 1)) || (!(a20 == 1) && a16 == 5)) || (((!(a20 == 1) && a12 == 8) && 15 == a8) && a16 == 6)) || (((((a16 == 4 && a12 == 8) && a17 <= 0) && a20 == 1) && 15 == a8) && !(a17 == 1))) || ((!(a20 == 1) && a16 == 4) && !(a17 == 1)) - InvariantResult [Line: 577]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: ((((((((((((((((a17 == 1 && a12 == 8) && a21 == 1) || ((1 == a7 && 15 == a8) && a16 == 5)) || (((!(a20 == 1) && !(a16 == 6)) && a17 == 1) && a21 == 1)) || (((((1 == a7 && a21 <= 0) && a12 == 8) && a17 <= 0) && a20 == 1) && a16 == 6)) || (((1 == a7 && a16 == 4) && a17 <= 0) && 15 == a8)) || (((a20 == 1 && 15 == a8) && !(a17 == 1)) && a16 == 6)) || ((a17 <= 0 && 15 == a8) && a16 == 5)) || ((((1 == a7 && a17 <= 0) && a16 == 5) || (((1 == a7 && a21 <= 0) && a16 == 4) && a17 <= 0)) && a12 == 8)) || ((((1 == a7 && a21 <= 0) && !(a16 == 6)) && a17 == 1) && a12 == 8)) || (((((a16 == 4 && a12 == 8) && a17 <= 0) && a21 == 1) && a7 <= 0) && 14 == a8)) || (((((13 == a8 && a16 == 4) && a12 == 8) && a17 <= 0) && a21 == 1) && a7 <= 0)) || (((1 == a7 && !(a16 == 6)) && a17 == 1) && a21 == 1)) || (!(a20 == 1) && a16 == 5)) || (((!(a20 == 1) && a12 == 8) && 15 == a8) && a16 == 6)) || (((((a16 == 4 && a12 == 8) && a17 <= 0) && a20 == 1) && 15 == a8) && !(a17 == 1))) || ((!(a20 == 1) && a16 == 4) && !(a17 == 1)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 198 locations, 1 error locations. Result: SAFE, OverallTime: 17.4s, OverallIterations: 14, TraceHistogramMax: 6, AutomataDifference: 10.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.8s, HoareTripleCheckerStatistics: 1110 SDtfs, 2796 SDslu, 156 SDs, 0 SdLazy, 7086 SolverSat, 816 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 366 GetRequests, 307 SyntacticMatches, 9 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2682occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 14 MinimizatonAttempts, 1576 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 50 NumberOfFragments, 487 HoareAnnotationTreeSize, 3 FomulaSimplifications, 866 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 3 FomulaSimplificationsInter, 306 FormulaSimplificationTreeSizeReductionInter, 0.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 3021 NumberOfCodeBlocks, 3021 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 3006 ConstructedInterpolants, 0 QuantifiedInterpolants, 3254078 SizeOfPredicates, 1 NumberOfNonLiveVariables, 486 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 15 InterpolantComputations, 14 PerfectInterpolantSequences, 1895/1899 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...