./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem01_label29.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem01_label29.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3449156d5b203ef4b6a1a68bea9e5efb1d4b37b1 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-11-28 15:43:25,941 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 15:43:25,944 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 15:43:25,964 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 15:43:25,965 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 15:43:25,967 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 15:43:25,969 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 15:43:25,980 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 15:43:25,987 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 15:43:25,991 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 15:43:25,993 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 15:43:25,995 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 15:43:25,995 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 15:43:26,000 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 15:43:26,002 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 15:43:26,004 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 15:43:26,007 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 15:43:26,008 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 15:43:26,011 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 15:43:26,015 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 15:43:26,021 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 15:43:26,026 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 15:43:26,028 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 15:43:26,030 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 15:43:26,033 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 15:43:26,033 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 15:43:26,033 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 15:43:26,035 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 15:43:26,036 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 15:43:26,037 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 15:43:26,038 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 15:43:26,039 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 15:43:26,040 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 15:43:26,041 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 15:43:26,043 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 15:43:26,044 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 15:43:26,045 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 15:43:26,045 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 15:43:26,046 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 15:43:26,047 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 15:43:26,048 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 15:43:26,050 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-28 15:43:26,084 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 15:43:26,085 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 15:43:26,086 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 15:43:26,087 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 15:43:26,087 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 15:43:26,087 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 15:43:26,088 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 15:43:26,088 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 15:43:26,088 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 15:43:26,088 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 15:43:26,090 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 15:43:26,090 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 15:43:26,090 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 15:43:26,091 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 15:43:26,091 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 15:43:26,091 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 15:43:26,092 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 15:43:26,092 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 15:43:26,092 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 15:43:26,093 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 15:43:26,093 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 15:43:26,093 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 15:43:26,093 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 15:43:26,094 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 15:43:26,094 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 15:43:26,094 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 15:43:26,094 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 15:43:26,095 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 15:43:26,095 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 15:43:26,095 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3449156d5b203ef4b6a1a68bea9e5efb1d4b37b1 [2019-11-28 15:43:26,428 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 15:43:26,441 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 15:43:26,445 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 15:43:26,447 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 15:43:26,447 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 15:43:26,448 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem01_label29.c [2019-11-28 15:43:26,512 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/abdfeeff9/9c20333a000b45f786e1052a04de9ab3/FLAG7ef27c64f [2019-11-28 15:43:27,070 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 15:43:27,071 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem01_label29.c [2019-11-28 15:43:27,084 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/abdfeeff9/9c20333a000b45f786e1052a04de9ab3/FLAG7ef27c64f [2019-11-28 15:43:27,293 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/abdfeeff9/9c20333a000b45f786e1052a04de9ab3 [2019-11-28 15:43:27,297 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 15:43:27,299 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 15:43:27,300 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 15:43:27,300 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 15:43:27,303 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 15:43:27,304 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:43:27" (1/1) ... [2019-11-28 15:43:27,307 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@155b5aed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:43:27, skipping insertion in model container [2019-11-28 15:43:27,308 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:43:27" (1/1) ... [2019-11-28 15:43:27,316 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 15:43:27,377 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 15:43:27,878 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 15:43:27,884 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 15:43:28,032 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 15:43:28,050 INFO L208 MainTranslator]: Completed translation [2019-11-28 15:43:28,051 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:43:28 WrapperNode [2019-11-28 15:43:28,051 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 15:43:28,052 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 15:43:28,052 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 15:43:28,052 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 15:43:28,062 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:43:28" (1/1) ... [2019-11-28 15:43:28,093 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:43:28" (1/1) ... [2019-11-28 15:43:28,162 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 15:43:28,162 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 15:43:28,162 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 15:43:28,163 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 15:43:28,173 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:43:28" (1/1) ... [2019-11-28 15:43:28,174 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:43:28" (1/1) ... [2019-11-28 15:43:28,177 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:43:28" (1/1) ... [2019-11-28 15:43:28,178 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:43:28" (1/1) ... [2019-11-28 15:43:28,208 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:43:28" (1/1) ... [2019-11-28 15:43:28,225 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:43:28" (1/1) ... [2019-11-28 15:43:28,238 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:43:28" (1/1) ... [2019-11-28 15:43:28,251 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 15:43:28,253 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 15:43:28,253 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 15:43:28,253 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 15:43:28,255 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:43:28" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 15:43:28,340 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 15:43:28,341 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 15:43:29,597 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 15:43:29,597 INFO L287 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-28 15:43:29,599 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:43:29 BoogieIcfgContainer [2019-11-28 15:43:29,599 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 15:43:29,600 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 15:43:29,601 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 15:43:29,603 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 15:43:29,604 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 03:43:27" (1/3) ... [2019-11-28 15:43:29,606 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15b1efa9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:43:29, skipping insertion in model container [2019-11-28 15:43:29,606 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:43:28" (2/3) ... [2019-11-28 15:43:29,607 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15b1efa9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:43:29, skipping insertion in model container [2019-11-28 15:43:29,607 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:43:29" (3/3) ... [2019-11-28 15:43:29,610 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem01_label29.c [2019-11-28 15:43:29,622 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 15:43:29,632 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-28 15:43:29,647 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-28 15:43:29,695 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 15:43:29,695 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 15:43:29,696 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 15:43:29,696 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 15:43:29,697 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 15:43:29,698 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 15:43:29,698 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 15:43:29,698 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 15:43:29,732 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states. [2019-11-28 15:43:29,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-11-28 15:43:29,750 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:43:29,753 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] [2019-11-28 15:43:29,754 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:43:29,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:43:29,762 INFO L82 PathProgramCache]: Analyzing trace with hash 620620582, now seen corresponding path program 1 times [2019-11-28 15:43:29,774 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:43:29,775 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342183728] [2019-11-28 15:43:29,776 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:43:30,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:43:30,282 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-28 15:43:30,283 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342183728] [2019-11-28 15:43:30,284 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:43:30,284 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:43:30,286 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104594987] [2019-11-28 15:43:30,292 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 15:43:30,292 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:43:30,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 15:43:30,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 15:43:30,311 INFO L87 Difference]: Start difference. First operand 198 states. Second operand 4 states. [2019-11-28 15:43:31,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:43:31,663 INFO L93 Difference]: Finished difference Result 662 states and 1178 transitions. [2019-11-28 15:43:31,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 15:43:31,665 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2019-11-28 15:43:31,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:43:31,684 INFO L225 Difference]: With dead ends: 662 [2019-11-28 15:43:31,684 INFO L226 Difference]: Without dead ends: 397 [2019-11-28 15:43:31,689 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-28 15:43:31,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2019-11-28 15:43:31,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 397. [2019-11-28 15:43:31,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2019-11-28 15:43:31,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 553 transitions. [2019-11-28 15:43:31,783 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 553 transitions. Word has length 101 [2019-11-28 15:43:31,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:43:31,784 INFO L462 AbstractCegarLoop]: Abstraction has 397 states and 553 transitions. [2019-11-28 15:43:31,784 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 15:43:31,785 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 553 transitions. [2019-11-28 15:43:31,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-11-28 15:43:31,789 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:43:31,790 INFO L410 BasicCegarLoop]: trace histogram [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-28 15:43:31,790 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:43:31,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:43:31,791 INFO L82 PathProgramCache]: Analyzing trace with hash -1432944013, now seen corresponding path program 1 times [2019-11-28 15:43:31,791 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:43:31,791 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593872133] [2019-11-28 15:43:31,792 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:43:31,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:43:32,000 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:43:32,001 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593872133] [2019-11-28 15:43:32,001 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:43:32,001 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 15:43:32,002 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799721159] [2019-11-28 15:43:32,003 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 15:43:32,004 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:43:32,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 15:43:32,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 15:43:32,005 INFO L87 Difference]: Start difference. First operand 397 states and 553 transitions. Second operand 4 states. [2019-11-28 15:43:32,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:43:32,963 INFO L93 Difference]: Finished difference Result 1447 states and 2019 transitions. [2019-11-28 15:43:32,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 15:43:32,964 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 108 [2019-11-28 15:43:32,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:43:32,972 INFO L225 Difference]: With dead ends: 1447 [2019-11-28 15:43:32,972 INFO L226 Difference]: Without dead ends: 1052 [2019-11-28 15:43:32,974 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 15:43:32,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1052 states. [2019-11-28 15:43:33,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1052 to 659. [2019-11-28 15:43:33,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 659 states. [2019-11-28 15:43:33,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 851 transitions. [2019-11-28 15:43:33,015 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 851 transitions. Word has length 108 [2019-11-28 15:43:33,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:43:33,016 INFO L462 AbstractCegarLoop]: Abstraction has 659 states and 851 transitions. [2019-11-28 15:43:33,016 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 15:43:33,016 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 851 transitions. [2019-11-28 15:43:33,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-11-28 15:43:33,019 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:43:33,020 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-28 15:43:33,020 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:43:33,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:43:33,021 INFO L82 PathProgramCache]: Analyzing trace with hash -1541134986, now seen corresponding path program 1 times [2019-11-28 15:43:33,021 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:43:33,022 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879393218] [2019-11-28 15:43:33,022 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:43:33,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:43:33,108 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:43:33,108 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879393218] [2019-11-28 15:43:33,109 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:43:33,109 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:43:33,109 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759765999] [2019-11-28 15:43:33,110 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 15:43:33,110 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:43:33,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 15:43:33,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 15:43:33,111 INFO L87 Difference]: Start difference. First operand 659 states and 851 transitions. Second operand 4 states. [2019-11-28 15:43:34,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:43:34,033 INFO L93 Difference]: Finished difference Result 1578 states and 1998 transitions. [2019-11-28 15:43:34,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 15:43:34,034 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 122 [2019-11-28 15:43:34,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:43:34,039 INFO L225 Difference]: With dead ends: 1578 [2019-11-28 15:43:34,039 INFO L226 Difference]: Without dead ends: 790 [2019-11-28 15:43:34,041 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 15:43:34,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 790 states. [2019-11-28 15:43:34,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 790 to 790. [2019-11-28 15:43:34,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2019-11-28 15:43:34,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 930 transitions. [2019-11-28 15:43:34,068 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 930 transitions. Word has length 122 [2019-11-28 15:43:34,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:43:34,068 INFO L462 AbstractCegarLoop]: Abstraction has 790 states and 930 transitions. [2019-11-28 15:43:34,069 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 15:43:34,069 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 930 transitions. [2019-11-28 15:43:34,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-11-28 15:43:34,073 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:43:34,073 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:43:34,073 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:43:34,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:43:34,074 INFO L82 PathProgramCache]: Analyzing trace with hash 1660180891, now seen corresponding path program 1 times [2019-11-28 15:43:34,074 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:43:34,075 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422642457] [2019-11-28 15:43:34,075 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:43:34,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:43:34,165 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:43:34,166 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422642457] [2019-11-28 15:43:34,166 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:43:34,166 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 15:43:34,167 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135221658] [2019-11-28 15:43:34,168 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:43:34,168 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:43:34,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:43:34,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:43:34,169 INFO L87 Difference]: Start difference. First operand 790 states and 930 transitions. Second operand 3 states. [2019-11-28 15:43:34,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:43:34,758 INFO L93 Difference]: Finished difference Result 2233 states and 2643 transitions. [2019-11-28 15:43:34,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:43:34,758 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 123 [2019-11-28 15:43:34,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:43:34,767 INFO L225 Difference]: With dead ends: 2233 [2019-11-28 15:43:34,767 INFO L226 Difference]: Without dead ends: 1445 [2019-11-28 15:43:34,769 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-28 15:43:34,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1445 states. [2019-11-28 15:43:34,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1445 to 1183. [2019-11-28 15:43:34,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1183 states. [2019-11-28 15:43:34,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1183 states to 1183 states and 1373 transitions. [2019-11-28 15:43:34,810 INFO L78 Accepts]: Start accepts. Automaton has 1183 states and 1373 transitions. Word has length 123 [2019-11-28 15:43:34,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:43:34,811 INFO L462 AbstractCegarLoop]: Abstraction has 1183 states and 1373 transitions. [2019-11-28 15:43:34,811 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:43:34,812 INFO L276 IsEmpty]: Start isEmpty. Operand 1183 states and 1373 transitions. [2019-11-28 15:43:34,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-11-28 15:43:34,815 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:43:34,816 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 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] [2019-11-28 15:43:34,816 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:43:34,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:43:34,816 INFO L82 PathProgramCache]: Analyzing trace with hash -767786909, now seen corresponding path program 1 times [2019-11-28 15:43:34,817 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:43:34,817 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887517008] [2019-11-28 15:43:34,817 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:43:34,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:43:34,921 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-28 15:43:34,922 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887517008] [2019-11-28 15:43:34,922 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:43:34,922 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 15:43:34,923 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173488268] [2019-11-28 15:43:34,923 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:43:34,923 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:43:34,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:43:34,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:43:34,924 INFO L87 Difference]: Start difference. First operand 1183 states and 1373 transitions. Second operand 3 states. [2019-11-28 15:43:35,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:43:35,467 INFO L93 Difference]: Finished difference Result 3150 states and 3672 transitions. [2019-11-28 15:43:35,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:43:35,470 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 127 [2019-11-28 15:43:35,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:43:35,479 INFO L225 Difference]: With dead ends: 3150 [2019-11-28 15:43:35,480 INFO L226 Difference]: Without dead ends: 1969 [2019-11-28 15:43:35,482 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-28 15:43:35,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1969 states. [2019-11-28 15:43:35,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1969 to 1576. [2019-11-28 15:43:35,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1576 states. [2019-11-28 15:43:35,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 1841 transitions. [2019-11-28 15:43:35,529 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 1841 transitions. Word has length 127 [2019-11-28 15:43:35,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:43:35,530 INFO L462 AbstractCegarLoop]: Abstraction has 1576 states and 1841 transitions. [2019-11-28 15:43:35,531 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:43:35,531 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 1841 transitions. [2019-11-28 15:43:35,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-11-28 15:43:35,534 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:43:35,534 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:43:35,535 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:43:35,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:43:35,535 INFO L82 PathProgramCache]: Analyzing trace with hash 1109954633, now seen corresponding path program 1 times [2019-11-28 15:43:35,536 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:43:35,536 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662436093] [2019-11-28 15:43:35,536 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:43:35,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:43:35,596 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-28 15:43:35,596 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662436093] [2019-11-28 15:43:35,598 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:43:35,598 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 15:43:35,598 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751509282] [2019-11-28 15:43:35,600 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:43:35,600 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:43:35,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:43:35,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:43:35,602 INFO L87 Difference]: Start difference. First operand 1576 states and 1841 transitions. Second operand 3 states. [2019-11-28 15:43:36,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:43:36,080 INFO L93 Difference]: Finished difference Result 3281 states and 3832 transitions. [2019-11-28 15:43:36,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:43:36,081 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 129 [2019-11-28 15:43:36,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:43:36,089 INFO L225 Difference]: With dead ends: 3281 [2019-11-28 15:43:36,089 INFO L226 Difference]: Without dead ends: 1707 [2019-11-28 15:43:36,092 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-28 15:43:36,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1707 states. [2019-11-28 15:43:36,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1707 to 1576. [2019-11-28 15:43:36,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1576 states. [2019-11-28 15:43:36,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 1841 transitions. [2019-11-28 15:43:36,124 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 1841 transitions. Word has length 129 [2019-11-28 15:43:36,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:43:36,124 INFO L462 AbstractCegarLoop]: Abstraction has 1576 states and 1841 transitions. [2019-11-28 15:43:36,124 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:43:36,124 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 1841 transitions. [2019-11-28 15:43:36,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-11-28 15:43:36,128 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:43:36,128 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 15:43:36,129 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:43:36,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:43:36,129 INFO L82 PathProgramCache]: Analyzing trace with hash 1564517898, now seen corresponding path program 1 times [2019-11-28 15:43:36,129 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:43:36,130 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473194431] [2019-11-28 15:43:36,130 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:43:36,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:43:36,189 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:43:36,190 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473194431] [2019-11-28 15:43:36,190 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:43:36,190 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 15:43:36,190 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284558839] [2019-11-28 15:43:36,191 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:43:36,191 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:43:36,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:43:36,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:43:36,192 INFO L87 Difference]: Start difference. First operand 1576 states and 1841 transitions. Second operand 3 states. [2019-11-28 15:43:36,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:43:36,694 INFO L93 Difference]: Finished difference Result 3543 states and 4110 transitions. [2019-11-28 15:43:36,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:43:36,695 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 130 [2019-11-28 15:43:36,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:43:36,703 INFO L225 Difference]: With dead ends: 3543 [2019-11-28 15:43:36,704 INFO L226 Difference]: Without dead ends: 1969 [2019-11-28 15:43:36,707 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-28 15:43:36,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1969 states. [2019-11-28 15:43:36,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1969 to 1838. [2019-11-28 15:43:36,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1838 states. [2019-11-28 15:43:36,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 2124 transitions. [2019-11-28 15:43:36,743 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 2124 transitions. Word has length 130 [2019-11-28 15:43:36,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:43:36,743 INFO L462 AbstractCegarLoop]: Abstraction has 1838 states and 2124 transitions. [2019-11-28 15:43:36,744 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:43:36,744 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 2124 transitions. [2019-11-28 15:43:36,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-11-28 15:43:36,748 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:43:36,748 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 15:43:36,748 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:43:36,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:43:36,749 INFO L82 PathProgramCache]: Analyzing trace with hash 1099746882, now seen corresponding path program 1 times [2019-11-28 15:43:36,749 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:43:36,750 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738410034] [2019-11-28 15:43:36,750 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:43:36,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:43:36,956 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:43:36,956 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738410034] [2019-11-28 15:43:36,956 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:43:36,957 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-28 15:43:36,957 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519050909] [2019-11-28 15:43:36,958 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-28 15:43:36,958 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:43:36,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-28 15:43:36,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-11-28 15:43:36,959 INFO L87 Difference]: Start difference. First operand 1838 states and 2124 transitions. Second operand 8 states. [2019-11-28 15:43:38,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:43:38,110 INFO L93 Difference]: Finished difference Result 3847 states and 4438 transitions. [2019-11-28 15:43:38,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 15:43:38,111 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 134 [2019-11-28 15:43:38,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:43:38,122 INFO L225 Difference]: With dead ends: 3847 [2019-11-28 15:43:38,122 INFO L226 Difference]: Without dead ends: 2142 [2019-11-28 15:43:38,126 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-11-28 15:43:38,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2142 states. [2019-11-28 15:43:38,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2142 to 1838. [2019-11-28 15:43:38,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1838 states. [2019-11-28 15:43:38,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 2112 transitions. [2019-11-28 15:43:38,164 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 2112 transitions. Word has length 134 [2019-11-28 15:43:38,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:43:38,164 INFO L462 AbstractCegarLoop]: Abstraction has 1838 states and 2112 transitions. [2019-11-28 15:43:38,164 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-28 15:43:38,165 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 2112 transitions. [2019-11-28 15:43:38,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-11-28 15:43:38,169 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:43:38,169 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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] [2019-11-28 15:43:38,170 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:43:38,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:43:38,170 INFO L82 PathProgramCache]: Analyzing trace with hash -1909853781, now seen corresponding path program 1 times [2019-11-28 15:43:38,170 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:43:38,171 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463240576] [2019-11-28 15:43:38,171 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:43:38,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:43:38,238 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-11-28 15:43:38,239 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463240576] [2019-11-28 15:43:38,239 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:43:38,239 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 15:43:38,244 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463628852] [2019-11-28 15:43:38,245 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:43:38,245 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:43:38,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:43:38,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:43:38,246 INFO L87 Difference]: Start difference. First operand 1838 states and 2112 transitions. Second operand 3 states. [2019-11-28 15:43:38,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:43:38,725 INFO L93 Difference]: Finished difference Result 3674 states and 4220 transitions. [2019-11-28 15:43:38,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:43:38,726 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 157 [2019-11-28 15:43:38,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:43:38,733 INFO L225 Difference]: With dead ends: 3674 [2019-11-28 15:43:38,733 INFO L226 Difference]: Without dead ends: 1838 [2019-11-28 15:43:38,736 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-28 15:43:38,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1838 states. [2019-11-28 15:43:38,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1838 to 1838. [2019-11-28 15:43:38,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1838 states. [2019-11-28 15:43:38,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 1999 transitions. [2019-11-28 15:43:38,767 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 1999 transitions. Word has length 157 [2019-11-28 15:43:38,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:43:38,767 INFO L462 AbstractCegarLoop]: Abstraction has 1838 states and 1999 transitions. [2019-11-28 15:43:38,767 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:43:38,768 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 1999 transitions. [2019-11-28 15:43:38,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-11-28 15:43:38,772 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:43:38,772 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-28 15:43:38,772 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:43:38,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:43:38,773 INFO L82 PathProgramCache]: Analyzing trace with hash -221184622, now seen corresponding path program 1 times [2019-11-28 15:43:38,773 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:43:38,773 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839811750] [2019-11-28 15:43:38,773 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:43:38,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:43:39,296 WARN L192 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 36 [2019-11-28 15:43:39,789 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 93 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:43:39,789 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839811750] [2019-11-28 15:43:39,789 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:43:39,789 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-11-28 15:43:39,790 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088248674] [2019-11-28 15:43:39,790 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-28 15:43:39,790 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:43:39,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-28 15:43:39,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=89, Unknown=0, NotChecked=0, Total=156 [2019-11-28 15:43:39,791 INFO L87 Difference]: Start difference. First operand 1838 states and 1999 transitions. Second operand 13 states. [2019-11-28 15:43:41,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:43:41,467 INFO L93 Difference]: Finished difference Result 3732 states and 4088 transitions. [2019-11-28 15:43:41,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-28 15:43:41,471 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 167 [2019-11-28 15:43:41,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:43:41,479 INFO L225 Difference]: With dead ends: 3732 [2019-11-28 15:43:41,479 INFO L226 Difference]: Without dead ends: 2027 [2019-11-28 15:43:41,482 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=132, Invalid=174, Unknown=0, NotChecked=0, Total=306 [2019-11-28 15:43:41,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2027 states. [2019-11-28 15:43:41,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2027 to 1765. [2019-11-28 15:43:41,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1765 states. [2019-11-28 15:43:41,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1765 states to 1765 states and 1916 transitions. [2019-11-28 15:43:41,515 INFO L78 Accepts]: Start accepts. Automaton has 1765 states and 1916 transitions. Word has length 167 [2019-11-28 15:43:41,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:43:41,515 INFO L462 AbstractCegarLoop]: Abstraction has 1765 states and 1916 transitions. [2019-11-28 15:43:41,515 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-28 15:43:41,515 INFO L276 IsEmpty]: Start isEmpty. Operand 1765 states and 1916 transitions. [2019-11-28 15:43:41,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-11-28 15:43:41,520 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:43:41,521 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2019-11-28 15:43:41,521 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:43:41,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:43:41,521 INFO L82 PathProgramCache]: Analyzing trace with hash 1527065083, now seen corresponding path program 1 times [2019-11-28 15:43:41,521 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:43:41,522 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187543315] [2019-11-28 15:43:41,522 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:43:41,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:43:41,611 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-11-28 15:43:41,611 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187543315] [2019-11-28 15:43:41,611 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:43:41,611 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 15:43:41,612 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954366701] [2019-11-28 15:43:41,612 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:43:41,612 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:43:41,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:43:41,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:43:41,613 INFO L87 Difference]: Start difference. First operand 1765 states and 1916 transitions. Second operand 3 states. [2019-11-28 15:43:42,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:43:42,019 INFO L93 Difference]: Finished difference Result 3528 states and 3830 transitions. [2019-11-28 15:43:42,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:43:42,020 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 195 [2019-11-28 15:43:42,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:43:42,028 INFO L225 Difference]: With dead ends: 3528 [2019-11-28 15:43:42,029 INFO L226 Difference]: Without dead ends: 1765 [2019-11-28 15:43:42,031 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-28 15:43:42,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1765 states. [2019-11-28 15:43:42,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1765 to 1634. [2019-11-28 15:43:42,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1634 states. [2019-11-28 15:43:42,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1634 states to 1634 states and 1762 transitions. [2019-11-28 15:43:42,063 INFO L78 Accepts]: Start accepts. Automaton has 1634 states and 1762 transitions. Word has length 195 [2019-11-28 15:43:42,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:43:42,063 INFO L462 AbstractCegarLoop]: Abstraction has 1634 states and 1762 transitions. [2019-11-28 15:43:42,063 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:43:42,064 INFO L276 IsEmpty]: Start isEmpty. Operand 1634 states and 1762 transitions. [2019-11-28 15:43:42,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2019-11-28 15:43:42,069 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:43:42,069 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 15:43:42,070 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:43:42,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:43:42,070 INFO L82 PathProgramCache]: Analyzing trace with hash 792554223, now seen corresponding path program 1 times [2019-11-28 15:43:42,071 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:43:42,073 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018237418] [2019-11-28 15:43:42,073 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:43:42,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:43:42,219 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 248 proven. 0 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2019-11-28 15:43:42,219 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018237418] [2019-11-28 15:43:42,219 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:43:42,220 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 15:43:42,220 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005117524] [2019-11-28 15:43:42,220 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 15:43:42,220 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:43:42,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 15:43:42,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-28 15:43:42,221 INFO L87 Difference]: Start difference. First operand 1634 states and 1762 transitions. Second operand 6 states. [2019-11-28 15:43:42,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:43:42,923 INFO L93 Difference]: Finished difference Result 3423 states and 3704 transitions. [2019-11-28 15:43:42,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 15:43:42,924 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 239 [2019-11-28 15:43:42,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:43:42,934 INFO L225 Difference]: With dead ends: 3423 [2019-11-28 15:43:42,934 INFO L226 Difference]: Without dead ends: 1922 [2019-11-28 15:43:42,936 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-28 15:43:42,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1922 states. [2019-11-28 15:43:42,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1922 to 1896. [2019-11-28 15:43:42,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1896 states. [2019-11-28 15:43:42,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1896 states to 1896 states and 2020 transitions. [2019-11-28 15:43:42,973 INFO L78 Accepts]: Start accepts. Automaton has 1896 states and 2020 transitions. Word has length 239 [2019-11-28 15:43:42,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:43:42,975 INFO L462 AbstractCegarLoop]: Abstraction has 1896 states and 2020 transitions. [2019-11-28 15:43:42,975 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 15:43:42,975 INFO L276 IsEmpty]: Start isEmpty. Operand 1896 states and 2020 transitions. [2019-11-28 15:43:42,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2019-11-28 15:43:42,986 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:43:42,986 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 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] [2019-11-28 15:43:42,987 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:43:42,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:43:42,987 INFO L82 PathProgramCache]: Analyzing trace with hash -1426430283, now seen corresponding path program 1 times [2019-11-28 15:43:42,988 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:43:42,988 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63985256] [2019-11-28 15:43:42,988 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:43:43,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:43:43,236 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 259 proven. 0 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2019-11-28 15:43:43,237 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63985256] [2019-11-28 15:43:43,237 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:43:43,238 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 15:43:43,238 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312643187] [2019-11-28 15:43:43,239 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 15:43:43,239 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:43:43,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 15:43:43,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-28 15:43:43,240 INFO L87 Difference]: Start difference. First operand 1896 states and 2020 transitions. Second operand 5 states. [2019-11-28 15:43:44,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:43:44,246 INFO L93 Difference]: Finished difference Result 3790 states and 4036 transitions. [2019-11-28 15:43:44,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 15:43:44,247 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 262 [2019-11-28 15:43:44,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:43:44,254 INFO L225 Difference]: With dead ends: 3790 [2019-11-28 15:43:44,254 INFO L226 Difference]: Without dead ends: 1765 [2019-11-28 15:43:44,259 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-28 15:43:44,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1765 states. [2019-11-28 15:43:44,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1765 to 1765. [2019-11-28 15:43:44,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1765 states. [2019-11-28 15:43:44,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1765 states to 1765 states and 1882 transitions. [2019-11-28 15:43:44,292 INFO L78 Accepts]: Start accepts. Automaton has 1765 states and 1882 transitions. Word has length 262 [2019-11-28 15:43:44,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:43:44,293 INFO L462 AbstractCegarLoop]: Abstraction has 1765 states and 1882 transitions. [2019-11-28 15:43:44,293 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 15:43:44,293 INFO L276 IsEmpty]: Start isEmpty. Operand 1765 states and 1882 transitions. [2019-11-28 15:43:44,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2019-11-28 15:43:44,300 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:43:44,300 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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] [2019-11-28 15:43:44,300 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:43:44,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:43:44,301 INFO L82 PathProgramCache]: Analyzing trace with hash -42906621, now seen corresponding path program 1 times [2019-11-28 15:43:44,303 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:43:44,304 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010246411] [2019-11-28 15:43:44,304 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:43:44,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:43:44,953 INFO L134 CoverageAnalysis]: Checked inductivity of 415 backedges. 301 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2019-11-28 15:43:44,953 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010246411] [2019-11-28 15:43:44,954 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:43:44,954 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 15:43:44,954 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403887724] [2019-11-28 15:43:44,955 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 15:43:44,955 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:43:44,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 15:43:44,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-11-28 15:43:44,956 INFO L87 Difference]: Start difference. First operand 1765 states and 1882 transitions. Second operand 6 states. [2019-11-28 15:43:45,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:43:45,794 INFO L93 Difference]: Finished difference Result 3467 states and 3713 transitions. [2019-11-28 15:43:45,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 15:43:45,795 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 273 [2019-11-28 15:43:45,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:43:45,796 INFO L225 Difference]: With dead ends: 3467 [2019-11-28 15:43:45,796 INFO L226 Difference]: Without dead ends: 0 [2019-11-28 15:43:45,801 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-11-28 15:43:45,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-28 15:43:45,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-28 15:43:45,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-28 15:43:45,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-28 15:43:45,803 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 273 [2019-11-28 15:43:45,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:43:45,804 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 15:43:45,804 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 15:43:45,804 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-28 15:43:45,804 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-28 15:43:45,808 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-28 15:43:45,973 WARN L192 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 67 [2019-11-28 15:43:46,127 WARN L192 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 67 [2019-11-28 15:43:46,427 WARN L192 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 54 [2019-11-28 15:43:46,671 WARN L192 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 54 [2019-11-28 15:43:46,674 INFO L246 CegarLoopResult]: For program point L333(lines 333 390) no Hoare annotation was computed. [2019-11-28 15:43:46,675 INFO L246 CegarLoopResult]: For program point L102(lines 102 390) no Hoare annotation was computed. [2019-11-28 15:43:46,675 INFO L246 CegarLoopResult]: For program point L565-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:46,675 INFO L246 CegarLoopResult]: For program point L532-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:46,675 INFO L246 CegarLoopResult]: For program point L499-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:46,675 INFO L246 CegarLoopResult]: For program point L466-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:46,675 INFO L246 CegarLoopResult]: For program point L433-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:46,675 INFO L246 CegarLoopResult]: For program point L400-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:46,675 INFO L246 CegarLoopResult]: For program point L268(lines 268 390) no Hoare annotation was computed. [2019-11-28 15:43:46,676 INFO L246 CegarLoopResult]: For program point L136(lines 136 390) no Hoare annotation was computed. [2019-11-28 15:43:46,676 INFO L246 CegarLoopResult]: For program point L566(line 566) no Hoare annotation was computed. [2019-11-28 15:43:46,676 INFO L246 CegarLoopResult]: For program point L533(line 533) no Hoare annotation was computed. [2019-11-28 15:43:46,676 INFO L246 CegarLoopResult]: For program point L500(line 500) no Hoare annotation was computed. [2019-11-28 15:43:46,676 INFO L246 CegarLoopResult]: For program point L467(line 467) no Hoare annotation was computed. [2019-11-28 15:43:46,676 INFO L246 CegarLoopResult]: For program point L434(line 434) no Hoare annotation was computed. [2019-11-28 15:43:46,676 INFO L246 CegarLoopResult]: For program point L401(line 401) no Hoare annotation was computed. [2019-11-28 15:43:46,676 INFO L246 CegarLoopResult]: For program point L203(lines 203 390) no Hoare annotation was computed. [2019-11-28 15:43:46,676 INFO L246 CegarLoopResult]: For program point L72(lines 72 390) no Hoare annotation was computed. [2019-11-28 15:43:46,677 INFO L246 CegarLoopResult]: For program point L568-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:46,677 INFO L246 CegarLoopResult]: For program point L535-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:46,677 INFO L246 CegarLoopResult]: For program point L502-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:46,677 INFO L246 CegarLoopResult]: For program point L469-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:46,677 INFO L246 CegarLoopResult]: For program point L436-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:46,677 INFO L246 CegarLoopResult]: For program point L403-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:46,677 INFO L246 CegarLoopResult]: For program point L337(lines 337 390) no Hoare annotation was computed. [2019-11-28 15:43:46,678 INFO L246 CegarLoopResult]: For program point L238(lines 238 390) no Hoare annotation was computed. [2019-11-28 15:43:46,678 INFO L246 CegarLoopResult]: For program point L569(line 569) no Hoare annotation was computed. [2019-11-28 15:43:46,678 INFO L246 CegarLoopResult]: For program point L536(line 536) no Hoare annotation was computed. [2019-11-28 15:43:46,678 INFO L246 CegarLoopResult]: For program point L503(line 503) no Hoare annotation was computed. [2019-11-28 15:43:46,678 INFO L246 CegarLoopResult]: For program point L470(line 470) no Hoare annotation was computed. [2019-11-28 15:43:46,679 INFO L246 CegarLoopResult]: For program point L437(line 437) no Hoare annotation was computed. [2019-11-28 15:43:46,679 INFO L246 CegarLoopResult]: For program point L404(line 404) no Hoare annotation was computed. [2019-11-28 15:43:46,679 INFO L246 CegarLoopResult]: For program point L173(lines 173 390) no Hoare annotation was computed. [2019-11-28 15:43:46,679 INFO L246 CegarLoopResult]: For program point L140(lines 140 390) no Hoare annotation was computed. [2019-11-28 15:43:46,679 INFO L246 CegarLoopResult]: For program point L372(lines 372 390) no Hoare annotation was computed. [2019-11-28 15:43:46,679 INFO L246 CegarLoopResult]: For program point L306(lines 306 390) no Hoare annotation was computed. [2019-11-28 15:43:46,680 INFO L246 CegarLoopResult]: For program point L273(lines 273 390) no Hoare annotation was computed. [2019-11-28 15:43:46,680 INFO L246 CegarLoopResult]: For program point L108(lines 108 390) no Hoare annotation was computed. [2019-11-28 15:43:46,680 INFO L246 CegarLoopResult]: For program point L571-1(lines 571 573) no Hoare annotation was computed. [2019-11-28 15:43:46,680 INFO L246 CegarLoopResult]: For program point L538-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:46,680 INFO L246 CegarLoopResult]: For program point L505-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:46,680 INFO L246 CegarLoopResult]: For program point L472-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:46,681 INFO L246 CegarLoopResult]: For program point L439-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:46,681 INFO L246 CegarLoopResult]: For program point L406-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:46,681 INFO L246 CegarLoopResult]: For program point L208(lines 208 390) no Hoare annotation was computed. [2019-11-28 15:43:46,681 INFO L246 CegarLoopResult]: For program point L43(lines 43 390) no Hoare annotation was computed. [2019-11-28 15:43:46,681 INFO L246 CegarLoopResult]: For program point L572(line 572) no Hoare annotation was computed. [2019-11-28 15:43:46,682 INFO L246 CegarLoopResult]: For program point L539(line 539) no Hoare annotation was computed. [2019-11-28 15:43:46,682 INFO L246 CegarLoopResult]: For program point L506(line 506) no Hoare annotation was computed. [2019-11-28 15:43:46,682 INFO L246 CegarLoopResult]: For program point L473(line 473) no Hoare annotation was computed. [2019-11-28 15:43:46,682 INFO L246 CegarLoopResult]: For program point L440(line 440) no Hoare annotation was computed. [2019-11-28 15:43:46,682 INFO L246 CegarLoopResult]: For program point L407(line 407) no Hoare annotation was computed. [2019-11-28 15:43:46,682 INFO L246 CegarLoopResult]: For program point L144(lines 144 390) no Hoare annotation was computed. [2019-11-28 15:43:46,683 INFO L242 CegarLoopResult]: At program point L574(lines 30 575) the Hoare annotation is: (let ((.cse4 (= 15 ~a8~0)) (.cse10 (= 1 ~a7~0))) (let ((.cse7 (= ~a17~0 1)) (.cse2 (<= ~a17~0 0)) (.cse5 (<= ~a20~0 0)) (.cse0 (not .cse10)) (.cse9 (= ~a16~0 4)) (.cse1 (= ~a12~0 8)) (.cse8 (= ~a16~0 5)) (.cse6 (not .cse4)) (.cse3 (= ~a21~0 1)) (.cse11 (= ~a20~0 1))) (or (and (or (= 2 ULTIMATE.start_calculate_output_~input) (= 4 ULTIMATE.start_calculate_output_~input) (= 3 ULTIMATE.start_calculate_output_~input) (= 6 ULTIMATE.start_calculate_output_~input) (= 1 ULTIMATE.start_calculate_output_~input) (= 5 ULTIMATE.start_calculate_output_~input)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse6 .cse7 .cse3) (and .cse0 .cse7 .cse1 .cse3) (and .cse6 .cse8 (not (= 13 ~a8~0))) (and .cse0 .cse1 .cse3 .cse4 (not .cse9)) (and .cse10 .cse9 .cse1 .cse2 .cse3 .cse5) (and .cse0 .cse1 .cse3 .cse11) (and .cse10 .cse6 .cse1) (and .cse9 .cse6 .cse3) (and .cse1 .cse3 .cse4 .cse8) (and .cse6 .cse3 .cse11)))) [2019-11-28 15:43:46,684 INFO L246 CegarLoopResult]: For program point L541-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:46,684 INFO L246 CegarLoopResult]: For program point L508-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:46,684 INFO L246 CegarLoopResult]: For program point L475-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:46,684 INFO L246 CegarLoopResult]: For program point L442-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:46,684 INFO L246 CegarLoopResult]: For program point L409-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:46,684 INFO L246 CegarLoopResult]: For program point L178(lines 178 390) no Hoare annotation was computed. [2019-11-28 15:43:46,685 INFO L246 CegarLoopResult]: For program point L542(line 542) no Hoare annotation was computed. [2019-11-28 15:43:46,685 INFO L246 CegarLoopResult]: For program point L509(line 509) no Hoare annotation was computed. [2019-11-28 15:43:46,685 INFO L246 CegarLoopResult]: For program point L476(line 476) no Hoare annotation was computed. [2019-11-28 15:43:46,685 INFO L246 CegarLoopResult]: For program point L443(line 443) no Hoare annotation was computed. [2019-11-28 15:43:46,685 INFO L246 CegarLoopResult]: For program point L410(line 410) no Hoare annotation was computed. [2019-11-28 15:43:46,686 INFO L246 CegarLoopResult]: For program point L377(lines 377 390) no Hoare annotation was computed. [2019-11-28 15:43:46,686 INFO L246 CegarLoopResult]: For program point L278(lines 278 390) no Hoare annotation was computed. [2019-11-28 15:43:46,686 INFO L246 CegarLoopResult]: For program point L245(lines 245 390) no Hoare annotation was computed. [2019-11-28 15:43:46,686 INFO L246 CegarLoopResult]: For program point L80(lines 80 390) no Hoare annotation was computed. [2019-11-28 15:43:46,686 INFO L246 CegarLoopResult]: For program point L345(lines 345 390) no Hoare annotation was computed. [2019-11-28 15:43:46,686 INFO L246 CegarLoopResult]: For program point L312(lines 312 390) no Hoare annotation was computed. [2019-11-28 15:43:46,687 INFO L246 CegarLoopResult]: For program point L114(lines 114 390) no Hoare annotation was computed. [2019-11-28 15:43:46,687 INFO L249 CegarLoopResult]: At program point L577(lines 577 594) the Hoare annotation is: true [2019-11-28 15:43:46,687 INFO L246 CegarLoopResult]: For program point L544-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:46,687 INFO L246 CegarLoopResult]: For program point L511-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:46,687 INFO L246 CegarLoopResult]: For program point L478-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:46,688 INFO L246 CegarLoopResult]: For program point L445-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:46,688 INFO L246 CegarLoopResult]: For program point L412-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:46,688 INFO L246 CegarLoopResult]: For program point L214(lines 214 390) no Hoare annotation was computed. [2019-11-28 15:43:46,688 INFO L246 CegarLoopResult]: For program point L148(lines 148 390) no Hoare annotation was computed. [2019-11-28 15:43:46,688 INFO L246 CegarLoopResult]: For program point L49(lines 49 390) no Hoare annotation was computed. [2019-11-28 15:43:46,689 INFO L246 CegarLoopResult]: For program point L545(line 545) no Hoare annotation was computed. [2019-11-28 15:43:46,689 INFO L246 CegarLoopResult]: For program point L512(line 512) no Hoare annotation was computed. [2019-11-28 15:43:46,689 INFO L246 CegarLoopResult]: For program point L479(line 479) no Hoare annotation was computed. [2019-11-28 15:43:46,689 INFO L246 CegarLoopResult]: For program point L446(line 446) no Hoare annotation was computed. [2019-11-28 15:43:46,689 INFO L246 CegarLoopResult]: For program point L413(line 413) no Hoare annotation was computed. [2019-11-28 15:43:46,689 INFO L246 CegarLoopResult]: For program point L84(lines 84 390) no Hoare annotation was computed. [2019-11-28 15:43:46,690 INFO L246 CegarLoopResult]: For program point L547-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:46,690 INFO L246 CegarLoopResult]: For program point L514-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:46,690 INFO L246 CegarLoopResult]: For program point L481-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:46,690 INFO L246 CegarLoopResult]: For program point L448-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:46,690 INFO L246 CegarLoopResult]: For program point L382(lines 382 390) no Hoare annotation was computed. [2019-11-28 15:43:46,690 INFO L246 CegarLoopResult]: For program point L415-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:46,691 INFO L246 CegarLoopResult]: For program point L316(lines 316 390) no Hoare annotation was computed. [2019-11-28 15:43:46,691 INFO L246 CegarLoopResult]: For program point L250(lines 250 390) no Hoare annotation was computed. [2019-11-28 15:43:46,691 INFO L246 CegarLoopResult]: For program point L548(line 548) no Hoare annotation was computed. [2019-11-28 15:43:46,691 INFO L246 CegarLoopResult]: For program point L515(line 515) no Hoare annotation was computed. [2019-11-28 15:43:46,691 INFO L246 CegarLoopResult]: For program point L482(line 482) no Hoare annotation was computed. [2019-11-28 15:43:46,691 INFO L246 CegarLoopResult]: For program point L449(line 449) no Hoare annotation was computed. [2019-11-28 15:43:46,691 INFO L246 CegarLoopResult]: For program point L416(line 416) no Hoare annotation was computed. [2019-11-28 15:43:46,692 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-28 15:43:46,692 INFO L246 CegarLoopResult]: For program point L218(lines 218 390) no Hoare annotation was computed. [2019-11-28 15:43:46,692 INFO L246 CegarLoopResult]: For program point L152(lines 152 390) no Hoare annotation was computed. [2019-11-28 15:43:46,692 INFO L246 CegarLoopResult]: For program point L119(lines 119 390) no Hoare annotation was computed. [2019-11-28 15:43:46,692 INFO L246 CegarLoopResult]: For program point L318(lines 318 390) no Hoare annotation was computed. [2019-11-28 15:43:46,692 INFO L246 CegarLoopResult]: For program point L186(lines 186 390) no Hoare annotation was computed. [2019-11-28 15:43:46,693 INFO L246 CegarLoopResult]: For program point L54(lines 54 390) no Hoare annotation was computed. [2019-11-28 15:43:46,693 INFO L246 CegarLoopResult]: For program point L550-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:46,693 INFO L242 CegarLoopResult]: At program point L583-2(lines 583 593) the Hoare annotation is: (let ((.cse4 (= 15 ~a8~0)) (.cse10 (= 1 ~a7~0))) (let ((.cse7 (= ~a17~0 1)) (.cse2 (<= ~a17~0 0)) (.cse5 (<= ~a20~0 0)) (.cse0 (not .cse10)) (.cse9 (= ~a16~0 4)) (.cse1 (= ~a12~0 8)) (.cse8 (= ~a16~0 5)) (.cse6 (not .cse4)) (.cse3 (= ~a21~0 1)) (.cse11 (= ~a20~0 1))) (or (and (or (= 2 ULTIMATE.start_calculate_output_~input) (= 4 ULTIMATE.start_calculate_output_~input) (= 3 ULTIMATE.start_calculate_output_~input) (= 6 ULTIMATE.start_calculate_output_~input) (= 1 ULTIMATE.start_calculate_output_~input) (= 5 ULTIMATE.start_calculate_output_~input)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse6 .cse7 .cse3) (and .cse0 .cse7 .cse1 .cse3) (and .cse6 .cse8 (not (= 13 ~a8~0))) (and .cse0 .cse1 .cse3 .cse4 (not .cse9)) (and .cse10 .cse9 .cse1 .cse2 .cse3 .cse5) (and .cse0 .cse1 .cse3 .cse11) (and .cse10 .cse6 .cse1) (and .cse9 .cse6 .cse3) (and .cse1 .cse3 .cse4 .cse8) (and .cse6 .cse3 .cse11)))) [2019-11-28 15:43:46,693 INFO L246 CegarLoopResult]: For program point L517-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:46,694 INFO L246 CegarLoopResult]: For program point L484-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:46,694 INFO L246 CegarLoopResult]: For program point L451-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:46,694 INFO L246 CegarLoopResult]: For program point L418-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:46,694 INFO L246 CegarLoopResult]: For program point L286(lines 286 390) no Hoare annotation was computed. [2019-11-28 15:43:46,694 INFO L246 CegarLoopResult]: For program point L551(line 551) no Hoare annotation was computed. [2019-11-28 15:43:46,694 INFO L246 CegarLoopResult]: For program point L518(line 518) no Hoare annotation was computed. [2019-11-28 15:43:46,695 INFO L246 CegarLoopResult]: For program point L485(line 485) no Hoare annotation was computed. [2019-11-28 15:43:46,695 INFO L246 CegarLoopResult]: For program point L452(line 452) no Hoare annotation was computed. [2019-11-28 15:43:46,695 INFO L246 CegarLoopResult]: For program point L419(line 419) no Hoare annotation was computed. [2019-11-28 15:43:46,695 INFO L246 CegarLoopResult]: For program point L353(lines 353 390) no Hoare annotation was computed. [2019-11-28 15:43:46,695 INFO L246 CegarLoopResult]: For program point L189(lines 189 390) no Hoare annotation was computed. [2019-11-28 15:43:46,695 INFO L246 CegarLoopResult]: For program point L553-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:46,696 INFO L246 CegarLoopResult]: For program point L520-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:46,696 INFO L246 CegarLoopResult]: For program point L487-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:46,696 INFO L246 CegarLoopResult]: For program point L454-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:46,696 INFO L246 CegarLoopResult]: For program point L421-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:46,696 INFO L246 CegarLoopResult]: For program point L355(lines 355 390) no Hoare annotation was computed. [2019-11-28 15:43:46,696 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-28 15:43:46,697 INFO L246 CegarLoopResult]: For program point L256(lines 256 390) no Hoare annotation was computed. [2019-11-28 15:43:46,697 INFO L246 CegarLoopResult]: For program point L223(lines 223 390) no Hoare annotation was computed. [2019-11-28 15:43:46,697 INFO L246 CegarLoopResult]: For program point L124(lines 124 390) no Hoare annotation was computed. [2019-11-28 15:43:46,697 INFO L246 CegarLoopResult]: For program point L554(line 554) no Hoare annotation was computed. [2019-11-28 15:43:46,697 INFO L246 CegarLoopResult]: For program point L521(line 521) no Hoare annotation was computed. [2019-11-28 15:43:46,697 INFO L246 CegarLoopResult]: For program point L488(line 488) no Hoare annotation was computed. [2019-11-28 15:43:46,698 INFO L246 CegarLoopResult]: For program point L455(line 455) no Hoare annotation was computed. [2019-11-28 15:43:46,698 INFO L246 CegarLoopResult]: For program point L422(line 422) no Hoare annotation was computed. [2019-11-28 15:43:46,698 INFO L246 CegarLoopResult]: For program point L92(lines 92 390) no Hoare annotation was computed. [2019-11-28 15:43:46,698 INFO L246 CegarLoopResult]: For program point L588(line 588) no Hoare annotation was computed. [2019-11-28 15:43:46,698 INFO L246 CegarLoopResult]: For program point L324(lines 324 390) no Hoare annotation was computed. [2019-11-28 15:43:46,698 INFO L246 CegarLoopResult]: For program point L556-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:46,699 INFO L246 CegarLoopResult]: For program point L523-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:46,699 INFO L246 CegarLoopResult]: For program point L490-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:46,699 INFO L246 CegarLoopResult]: For program point L457-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:46,699 INFO L246 CegarLoopResult]: For program point L391(lines 391 393) no Hoare annotation was computed. [2019-11-28 15:43:46,699 INFO L246 CegarLoopResult]: For program point L424-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:46,699 INFO L246 CegarLoopResult]: For program point L391-2(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:46,699 INFO L246 CegarLoopResult]: For program point L292(lines 292 390) no Hoare annotation was computed. [2019-11-28 15:43:46,700 INFO L246 CegarLoopResult]: For program point L160(lines 160 390) no Hoare annotation was computed. [2019-11-28 15:43:46,700 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-28 15:43:46,700 INFO L246 CegarLoopResult]: For program point L557(line 557) no Hoare annotation was computed. [2019-11-28 15:43:46,700 INFO L246 CegarLoopResult]: For program point L524(line 524) no Hoare annotation was computed. [2019-11-28 15:43:46,700 INFO L246 CegarLoopResult]: For program point L491(line 491) no Hoare annotation was computed. [2019-11-28 15:43:46,700 INFO L246 CegarLoopResult]: For program point L458(line 458) no Hoare annotation was computed. [2019-11-28 15:43:46,701 INFO L246 CegarLoopResult]: For program point L425(line 425) no Hoare annotation was computed. [2019-11-28 15:43:46,701 INFO L246 CegarLoopResult]: For program point L392(line 392) no Hoare annotation was computed. [2019-11-28 15:43:46,701 INFO L246 CegarLoopResult]: For program point L194(lines 194 390) no Hoare annotation was computed. [2019-11-28 15:43:46,701 INFO L246 CegarLoopResult]: For program point L62(lines 62 390) no Hoare annotation was computed. [2019-11-28 15:43:46,701 INFO L246 CegarLoopResult]: For program point L261(lines 261 390) no Hoare annotation was computed. [2019-11-28 15:43:46,701 INFO L246 CegarLoopResult]: For program point L129(lines 129 390) no Hoare annotation was computed. [2019-11-28 15:43:46,702 INFO L246 CegarLoopResult]: For program point L559-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:46,702 INFO L246 CegarLoopResult]: For program point L526-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:46,702 INFO L246 CegarLoopResult]: For program point L493-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:46,702 INFO L246 CegarLoopResult]: For program point L460-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:46,702 INFO L246 CegarLoopResult]: For program point L427-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:46,702 INFO L246 CegarLoopResult]: For program point L361(lines 361 390) no Hoare annotation was computed. [2019-11-28 15:43:46,703 INFO L246 CegarLoopResult]: For program point L394-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:46,703 INFO L246 CegarLoopResult]: For program point L97(lines 97 390) no Hoare annotation was computed. [2019-11-28 15:43:46,703 INFO L246 CegarLoopResult]: For program point L31(lines 31 390) no Hoare annotation was computed. [2019-11-28 15:43:46,703 INFO L246 CegarLoopResult]: For program point L560(line 560) no Hoare annotation was computed. [2019-11-28 15:43:46,703 INFO L246 CegarLoopResult]: For program point L527(line 527) no Hoare annotation was computed. [2019-11-28 15:43:46,703 INFO L246 CegarLoopResult]: For program point L494(line 494) no Hoare annotation was computed. [2019-11-28 15:43:46,704 INFO L246 CegarLoopResult]: For program point L461(line 461) no Hoare annotation was computed. [2019-11-28 15:43:46,704 INFO L246 CegarLoopResult]: For program point L428(line 428) no Hoare annotation was computed. [2019-11-28 15:43:46,704 INFO L246 CegarLoopResult]: For program point L395(line 395) no Hoare annotation was computed. [2019-11-28 15:43:46,704 INFO L246 CegarLoopResult]: For program point L329(lines 329 390) no Hoare annotation was computed. [2019-11-28 15:43:46,704 INFO L246 CegarLoopResult]: For program point L197(lines 197 390) no Hoare annotation was computed. [2019-11-28 15:43:46,704 INFO L246 CegarLoopResult]: For program point L65(lines 65 390) no Hoare annotation was computed. [2019-11-28 15:43:46,705 INFO L246 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-28 15:43:46,705 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 479) no Hoare annotation was computed. [2019-11-28 15:43:46,705 INFO L246 CegarLoopResult]: For program point L363(lines 363 390) no Hoare annotation was computed. [2019-11-28 15:43:46,705 INFO L246 CegarLoopResult]: For program point L231(lines 231 390) no Hoare annotation was computed. [2019-11-28 15:43:46,705 INFO L246 CegarLoopResult]: For program point L165(lines 165 390) no Hoare annotation was computed. [2019-11-28 15:43:46,705 INFO L246 CegarLoopResult]: For program point L562-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:46,706 INFO L246 CegarLoopResult]: For program point L529-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:46,706 INFO L246 CegarLoopResult]: For program point L496-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:46,706 INFO L246 CegarLoopResult]: For program point L463-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:46,706 INFO L246 CegarLoopResult]: For program point L430-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:46,706 INFO L246 CegarLoopResult]: For program point L397-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:46,706 INFO L246 CegarLoopResult]: For program point L265(lines 265 390) no Hoare annotation was computed. [2019-11-28 15:43:46,707 INFO L246 CegarLoopResult]: For program point L563(line 563) no Hoare annotation was computed. [2019-11-28 15:43:46,707 INFO L246 CegarLoopResult]: For program point L530(line 530) no Hoare annotation was computed. [2019-11-28 15:43:46,707 INFO L246 CegarLoopResult]: For program point L497(line 497) no Hoare annotation was computed. [2019-11-28 15:43:46,707 INFO L246 CegarLoopResult]: For program point L464(line 464) no Hoare annotation was computed. [2019-11-28 15:43:46,707 INFO L246 CegarLoopResult]: For program point L431(line 431) no Hoare annotation was computed. [2019-11-28 15:43:46,707 INFO L246 CegarLoopResult]: For program point L398(line 398) no Hoare annotation was computed. [2019-11-28 15:43:46,708 INFO L246 CegarLoopResult]: For program point L365(lines 365 390) no Hoare annotation was computed. [2019-11-28 15:43:46,708 INFO L246 CegarLoopResult]: For program point L299(lines 299 390) no Hoare annotation was computed. [2019-11-28 15:43:46,708 INFO L246 CegarLoopResult]: For program point L35(lines 35 390) no Hoare annotation was computed. [2019-11-28 15:43:46,750 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 03:43:46 BoogieIcfgContainer [2019-11-28 15:43:46,750 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 15:43:46,750 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 15:43:46,750 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 15:43:46,751 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 15:43:46,751 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:43:29" (3/4) ... [2019-11-28 15:43:46,755 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-28 15:43:46,788 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-28 15:43:46,789 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-28 15:43:46,991 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 15:43:46,991 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 15:43:46,993 INFO L168 Benchmark]: Toolchain (without parser) took 19694.77 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 552.1 MB). Free memory was 956.3 MB in the beginning and 1.3 GB in the end (delta: -355.1 MB). Peak memory consumption was 197.0 MB. Max. memory is 11.5 GB. [2019-11-28 15:43:46,993 INFO L168 Benchmark]: CDTParser took 0.35 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 15:43:46,994 INFO L168 Benchmark]: CACSL2BoogieTranslator took 751.87 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.8 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -168.4 MB). Peak memory consumption was 28.1 MB. Max. memory is 11.5 GB. [2019-11-28 15:43:46,994 INFO L168 Benchmark]: Boogie Procedure Inliner took 109.98 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-11-28 15:43:46,995 INFO L168 Benchmark]: Boogie Preprocessor took 88.90 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 13.7 MB). Peak memory consumption was 13.7 MB. Max. memory is 11.5 GB. [2019-11-28 15:43:46,995 INFO L168 Benchmark]: RCFGBuilder took 1346.68 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 101.4 MB). Peak memory consumption was 101.4 MB. Max. memory is 11.5 GB. [2019-11-28 15:43:46,995 INFO L168 Benchmark]: TraceAbstraction took 17149.48 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 406.3 MB). Free memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: -323.2 MB). Peak memory consumption was 83.2 MB. Max. memory is 11.5 GB. [2019-11-28 15:43:46,996 INFO L168 Benchmark]: Witness Printer took 241.00 ms. Allocated memory is still 1.6 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 14.6 MB). Peak memory consumption was 14.6 MB. Max. memory is 11.5 GB. [2019-11-28 15:43:46,998 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.35 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 751.87 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.8 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -168.4 MB). Peak memory consumption was 28.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 109.98 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 88.90 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 13.7 MB). Peak memory consumption was 13.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1346.68 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 101.4 MB). Peak memory consumption was 101.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 17149.48 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 406.3 MB). Free memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: -323.2 MB). Peak memory consumption was 83.2 MB. Max. memory is 11.5 GB. * Witness Printer took 241.00 ms. Allocated memory is still 1.6 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 14.6 MB). Peak memory consumption was 14.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 479]: 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: ((((((((((((((((((((2 == input || 4 == input) || 3 == input) || 6 == input) || 1 == input) || 5 == input) && !(1 == a7)) && a12 == 8) && a17 <= 0) && a21 == 1) && 15 == a8) && a20 <= 0) || ((!(15 == a8) && a17 == 1) && a21 == 1)) || (((!(1 == a7) && a17 == 1) && a12 == 8) && a21 == 1)) || ((!(15 == a8) && a16 == 5) && !(13 == a8))) || ((((!(1 == a7) && a12 == 8) && a21 == 1) && 15 == a8) && !(a16 == 4))) || (((((1 == a7 && a16 == 4) && a12 == 8) && a17 <= 0) && a21 == 1) && a20 <= 0)) || (((!(1 == a7) && a12 == 8) && a21 == 1) && a20 == 1)) || ((1 == a7 && !(15 == a8)) && a12 == 8)) || ((a16 == 4 && !(15 == a8)) && a21 == 1)) || (((a12 == 8 && a21 == 1) && 15 == a8) && a16 == 5)) || ((!(15 == a8) && a21 == 1) && a20 == 1) - InvariantResult [Line: 577]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: ((((((((((((((((((((2 == input || 4 == input) || 3 == input) || 6 == input) || 1 == input) || 5 == input) && !(1 == a7)) && a12 == 8) && a17 <= 0) && a21 == 1) && 15 == a8) && a20 <= 0) || ((!(15 == a8) && a17 == 1) && a21 == 1)) || (((!(1 == a7) && a17 == 1) && a12 == 8) && a21 == 1)) || ((!(15 == a8) && a16 == 5) && !(13 == a8))) || ((((!(1 == a7) && a12 == 8) && a21 == 1) && 15 == a8) && !(a16 == 4))) || (((((1 == a7 && a16 == 4) && a12 == 8) && a17 <= 0) && a21 == 1) && a20 <= 0)) || (((!(1 == a7) && a12 == 8) && a21 == 1) && a20 == 1)) || ((1 == a7 && !(15 == a8)) && a12 == 8)) || ((a16 == 4 && !(15 == a8)) && a21 == 1)) || (((a12 == 8 && a21 == 1) && 15 == a8) && a16 == 5)) || ((!(15 == a8) && a21 == 1) && a20 == 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 198 locations, 1 error locations. Result: SAFE, OverallTime: 16.1s, OverallIterations: 14, TraceHistogramMax: 8, AutomataDifference: 11.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.8s, HoareTripleCheckerStatistics: 799 SDtfs, 3379 SDslu, 175 SDs, 0 SdLazy, 8117 SolverSat, 1000 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 70 GetRequests, 21 SyntacticMatches, 4 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1896occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 14 MinimizatonAttempts, 2033 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 46 NumberOfFragments, 349 HoareAnnotationTreeSize, 3 FomulaSimplifications, 17216 FormulaSimplificationTreeSizeReduction, 0.3s HoareSimplificationTime, 3 FomulaSimplificationsInter, 316 FormulaSimplificationTreeSizeReductionInter, 0.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 2267 NumberOfCodeBlocks, 2267 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 2253 ConstructedInterpolants, 0 QuantifiedInterpolants, 1772182 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 1734/1734 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...