./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/bitvector/s3_srvr_3a.BV.c.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 30f4e4ab 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/bitvector/s3_srvr_3a.BV.c.cil.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 3c83e1c64d2af1ac92027e4b29fb95a984369de1 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-30f4e4a [2019-11-27 22:34:17,004 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-27 22:34:17,007 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-27 22:34:17,020 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-27 22:34:17,020 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-27 22:34:17,022 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-27 22:34:17,024 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-27 22:34:17,026 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-27 22:34:17,028 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-27 22:34:17,029 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-27 22:34:17,030 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-27 22:34:17,032 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-27 22:34:17,032 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-27 22:34:17,033 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-27 22:34:17,034 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-27 22:34:17,036 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-27 22:34:17,037 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-27 22:34:17,038 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-27 22:34:17,040 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-27 22:34:17,042 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-27 22:34:17,044 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-27 22:34:17,045 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-27 22:34:17,046 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-27 22:34:17,047 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-27 22:34:17,050 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-27 22:34:17,050 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-27 22:34:17,050 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-27 22:34:17,051 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-27 22:34:17,052 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-27 22:34:17,053 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-27 22:34:17,053 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-27 22:34:17,054 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-27 22:34:17,055 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-27 22:34:17,056 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-27 22:34:17,057 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-27 22:34:17,057 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-27 22:34:17,058 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-27 22:34:17,058 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-27 22:34:17,059 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-27 22:34:17,060 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-27 22:34:17,061 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-27 22:34:17,062 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-27 22:34:17,077 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-27 22:34:17,077 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-27 22:34:17,079 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-27 22:34:17,079 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-27 22:34:17,079 INFO L138 SettingsManager]: * Use SBE=true [2019-11-27 22:34:17,080 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-27 22:34:17,080 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-27 22:34:17,080 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-27 22:34:17,081 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-27 22:34:17,081 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-27 22:34:17,081 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-27 22:34:17,082 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-27 22:34:17,082 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-27 22:34:17,082 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-27 22:34:17,082 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-27 22:34:17,083 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-27 22:34:17,083 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-27 22:34:17,083 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-27 22:34:17,084 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-27 22:34:17,084 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-27 22:34:17,084 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-27 22:34:17,085 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-27 22:34:17,085 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-27 22:34:17,085 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-27 22:34:17,086 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-27 22:34:17,086 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-27 22:34:17,086 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-27 22:34:17,086 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-27 22:34:17,087 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 -> 3c83e1c64d2af1ac92027e4b29fb95a984369de1 [2019-11-27 22:34:17,424 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-27 22:34:17,438 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-27 22:34:17,442 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-27 22:34:17,443 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-27 22:34:17,444 INFO L275 PluginConnector]: CDTParser initialized [2019-11-27 22:34:17,445 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/s3_srvr_3a.BV.c.cil.c [2019-11-27 22:34:17,507 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/485ded42d/2fd6df189c7d413d879aa11443665ffe/FLAG8b8d14a97 [2019-11-27 22:34:18,012 INFO L306 CDTParser]: Found 1 translation units. [2019-11-27 22:34:18,015 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/s3_srvr_3a.BV.c.cil.c [2019-11-27 22:34:18,036 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/485ded42d/2fd6df189c7d413d879aa11443665ffe/FLAG8b8d14a97 [2019-11-27 22:34:18,348 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/485ded42d/2fd6df189c7d413d879aa11443665ffe [2019-11-27 22:34:18,352 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-27 22:34:18,354 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-27 22:34:18,355 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-27 22:34:18,356 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-27 22:34:18,360 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-27 22:34:18,361 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 10:34:18" (1/1) ... [2019-11-27 22:34:18,364 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@381b270f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:34:18, skipping insertion in model container [2019-11-27 22:34:18,365 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 10:34:18" (1/1) ... [2019-11-27 22:34:18,374 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-27 22:34:18,444 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-27 22:34:18,776 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 22:34:18,846 INFO L203 MainTranslator]: Completed pre-run [2019-11-27 22:34:18,922 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 22:34:18,937 INFO L208 MainTranslator]: Completed translation [2019-11-27 22:34:18,937 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:34:18 WrapperNode [2019-11-27 22:34:18,938 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-27 22:34:18,939 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-27 22:34:18,939 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-27 22:34:18,939 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-27 22:34:18,948 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:34:18" (1/1) ... [2019-11-27 22:34:18,959 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:34:18" (1/1) ... [2019-11-27 22:34:19,009 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-27 22:34:19,010 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-27 22:34:19,010 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-27 22:34:19,010 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-27 22:34:19,020 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:34:18" (1/1) ... [2019-11-27 22:34:19,020 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:34:18" (1/1) ... [2019-11-27 22:34:19,024 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:34:18" (1/1) ... [2019-11-27 22:34:19,024 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:34:18" (1/1) ... [2019-11-27 22:34:19,033 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:34:18" (1/1) ... [2019-11-27 22:34:19,043 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:34:18" (1/1) ... [2019-11-27 22:34:19,046 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:34:18" (1/1) ... [2019-11-27 22:34:19,051 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-27 22:34:19,052 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-27 22:34:19,052 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-27 22:34:19,052 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-27 22:34:19,053 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:34:18" (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-27 22:34:19,133 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-27 22:34:19,133 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-27 22:34:19,250 WARN L759 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-27 22:34:19,926 INFO L712 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2019-11-27 22:34:19,927 INFO L712 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2019-11-27 22:34:19,933 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-27 22:34:19,934 INFO L297 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-27 22:34:19,935 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 10:34:19 BoogieIcfgContainer [2019-11-27 22:34:19,936 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-27 22:34:19,939 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-27 22:34:19,939 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-27 22:34:19,943 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-27 22:34:19,943 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.11 10:34:18" (1/3) ... [2019-11-27 22:34:19,944 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3baa9dba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 10:34:19, skipping insertion in model container [2019-11-27 22:34:19,945 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:34:18" (2/3) ... [2019-11-27 22:34:19,945 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3baa9dba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 10:34:19, skipping insertion in model container [2019-11-27 22:34:19,945 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 10:34:19" (3/3) ... [2019-11-27 22:34:19,947 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr_3a.BV.c.cil.c [2019-11-27 22:34:19,957 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-27 22:34:19,965 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-27 22:34:19,978 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-27 22:34:20,005 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-27 22:34:20,005 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-27 22:34:20,005 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-27 22:34:20,005 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-27 22:34:20,006 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-27 22:34:20,006 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-27 22:34:20,006 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-27 22:34:20,006 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-27 22:34:20,025 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states. [2019-11-27 22:34:20,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-27 22:34:20,035 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:34:20,036 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] [2019-11-27 22:34:20,037 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:34:20,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:34:20,043 INFO L82 PathProgramCache]: Analyzing trace with hash -91608764, now seen corresponding path program 1 times [2019-11-27 22:34:20,053 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:34:20,054 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773807210] [2019-11-27 22:34:20,054 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:34:20,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:34:20,298 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-27 22:34:20,299 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773807210] [2019-11-27 22:34:20,301 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:34:20,302 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 22:34:20,305 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405545002] [2019-11-27 22:34:20,313 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:34:20,313 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:34:20,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:34:20,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:20,329 INFO L87 Difference]: Start difference. First operand 137 states. Second operand 3 states. [2019-11-27 22:34:20,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:34:20,686 INFO L93 Difference]: Finished difference Result 322 states and 558 transitions. [2019-11-27 22:34:20,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:34:20,690 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2019-11-27 22:34:20,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:34:20,702 INFO L225 Difference]: With dead ends: 322 [2019-11-27 22:34:20,703 INFO L226 Difference]: Without dead ends: 170 [2019-11-27 22:34:20,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-27 22:34:20,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2019-11-27 22:34:20,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 165. [2019-11-27 22:34:20,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-11-27 22:34:20,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 270 transitions. [2019-11-27 22:34:20,760 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 270 transitions. Word has length 43 [2019-11-27 22:34:20,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:34:20,761 INFO L462 AbstractCegarLoop]: Abstraction has 165 states and 270 transitions. [2019-11-27 22:34:20,761 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:34:20,761 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 270 transitions. [2019-11-27 22:34:20,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-27 22:34:20,764 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:34:20,764 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] [2019-11-27 22:34:20,765 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:34:20,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:34:20,765 INFO L82 PathProgramCache]: Analyzing trace with hash 1448030283, now seen corresponding path program 1 times [2019-11-27 22:34:20,765 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:34:20,766 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68106565] [2019-11-27 22:34:20,766 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:34:20,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:34:20,850 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-27 22:34:20,850 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68106565] [2019-11-27 22:34:20,851 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:34:20,851 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 22:34:20,851 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342647608] [2019-11-27 22:34:20,853 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:34:20,853 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:34:20,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:34:20,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:20,854 INFO L87 Difference]: Start difference. First operand 165 states and 270 transitions. Second operand 3 states. [2019-11-27 22:34:21,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:34:21,163 INFO L93 Difference]: Finished difference Result 371 states and 615 transitions. [2019-11-27 22:34:21,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:34:21,163 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2019-11-27 22:34:21,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:34:21,166 INFO L225 Difference]: With dead ends: 371 [2019-11-27 22:34:21,167 INFO L226 Difference]: Without dead ends: 211 [2019-11-27 22:34:21,168 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-27 22:34:21,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-11-27 22:34:21,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 206. [2019-11-27 22:34:21,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2019-11-27 22:34:21,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 347 transitions. [2019-11-27 22:34:21,200 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 347 transitions. Word has length 44 [2019-11-27 22:34:21,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:34:21,200 INFO L462 AbstractCegarLoop]: Abstraction has 206 states and 347 transitions. [2019-11-27 22:34:21,201 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:34:21,201 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 347 transitions. [2019-11-27 22:34:21,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-11-27 22:34:21,209 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:34:21,210 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, 1, 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-27 22:34:21,211 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:34:21,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:34:21,211 INFO L82 PathProgramCache]: Analyzing trace with hash 1359791455, now seen corresponding path program 1 times [2019-11-27 22:34:21,212 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:34:21,212 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617661023] [2019-11-27 22:34:21,212 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:34:21,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:34:21,327 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 22:34:21,327 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617661023] [2019-11-27 22:34:21,328 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:34:21,328 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 22:34:21,328 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508263892] [2019-11-27 22:34:21,329 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:34:21,329 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:34:21,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:34:21,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:21,330 INFO L87 Difference]: Start difference. First operand 206 states and 347 transitions. Second operand 3 states. [2019-11-27 22:34:21,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:34:21,551 INFO L93 Difference]: Finished difference Result 436 states and 741 transitions. [2019-11-27 22:34:21,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:34:21,553 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 71 [2019-11-27 22:34:21,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:34:21,555 INFO L225 Difference]: With dead ends: 436 [2019-11-27 22:34:21,556 INFO L226 Difference]: Without dead ends: 237 [2019-11-27 22:34:21,557 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-27 22:34:21,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2019-11-27 22:34:21,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 237. [2019-11-27 22:34:21,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2019-11-27 22:34:21,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 403 transitions. [2019-11-27 22:34:21,591 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 403 transitions. Word has length 71 [2019-11-27 22:34:21,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:34:21,592 INFO L462 AbstractCegarLoop]: Abstraction has 237 states and 403 transitions. [2019-11-27 22:34:21,592 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:34:21,593 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 403 transitions. [2019-11-27 22:34:21,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-11-27 22:34:21,599 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:34:21,599 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 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-27 22:34:21,599 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:34:21,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:34:21,601 INFO L82 PathProgramCache]: Analyzing trace with hash 1343129333, now seen corresponding path program 1 times [2019-11-27 22:34:21,601 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:34:21,603 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862226143] [2019-11-27 22:34:21,603 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:34:21,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:34:21,716 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-27 22:34:21,717 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862226143] [2019-11-27 22:34:21,717 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:34:21,718 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 22:34:21,718 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783744887] [2019-11-27 22:34:21,719 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:34:21,719 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:34:21,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:34:21,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:21,720 INFO L87 Difference]: Start difference. First operand 237 states and 403 transitions. Second operand 3 states. [2019-11-27 22:34:21,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:34:21,864 INFO L93 Difference]: Finished difference Result 484 states and 823 transitions. [2019-11-27 22:34:21,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:34:21,865 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-11-27 22:34:21,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:34:21,867 INFO L225 Difference]: With dead ends: 484 [2019-11-27 22:34:21,867 INFO L226 Difference]: Without dead ends: 254 [2019-11-27 22:34:21,869 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-27 22:34:21,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2019-11-27 22:34:21,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 252. [2019-11-27 22:34:21,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2019-11-27 22:34:21,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 426 transitions. [2019-11-27 22:34:21,885 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 426 transitions. Word has length 83 [2019-11-27 22:34:21,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:34:21,885 INFO L462 AbstractCegarLoop]: Abstraction has 252 states and 426 transitions. [2019-11-27 22:34:21,886 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:34:21,886 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 426 transitions. [2019-11-27 22:34:21,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-11-27 22:34:21,888 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:34:21,888 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:34:21,888 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:34:21,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:34:21,889 INFO L82 PathProgramCache]: Analyzing trace with hash -2058793378, now seen corresponding path program 1 times [2019-11-27 22:34:21,889 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:34:21,890 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715056304] [2019-11-27 22:34:21,890 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:34:21,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:34:21,984 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 22:34:21,984 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715056304] [2019-11-27 22:34:21,985 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:34:21,985 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 22:34:21,985 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264477084] [2019-11-27 22:34:21,987 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:34:21,987 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:34:21,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:34:21,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:21,988 INFO L87 Difference]: Start difference. First operand 252 states and 426 transitions. Second operand 3 states. [2019-11-27 22:34:22,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:34:22,198 INFO L93 Difference]: Finished difference Result 543 states and 922 transitions. [2019-11-27 22:34:22,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:34:22,199 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-11-27 22:34:22,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:34:22,202 INFO L225 Difference]: With dead ends: 543 [2019-11-27 22:34:22,202 INFO L226 Difference]: Without dead ends: 298 [2019-11-27 22:34:22,203 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-27 22:34:22,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2019-11-27 22:34:22,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 294. [2019-11-27 22:34:22,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2019-11-27 22:34:22,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 500 transitions. [2019-11-27 22:34:22,218 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 500 transitions. Word has length 83 [2019-11-27 22:34:22,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:34:22,218 INFO L462 AbstractCegarLoop]: Abstraction has 294 states and 500 transitions. [2019-11-27 22:34:22,219 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:34:22,219 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 500 transitions. [2019-11-27 22:34:22,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-27 22:34:22,221 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:34:22,221 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 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-27 22:34:22,221 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:34:22,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:34:22,222 INFO L82 PathProgramCache]: Analyzing trace with hash -1582529535, now seen corresponding path program 1 times [2019-11-27 22:34:22,222 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:34:22,223 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726913345] [2019-11-27 22:34:22,223 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:34:22,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:34:22,308 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-27 22:34:22,308 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726913345] [2019-11-27 22:34:22,309 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:34:22,309 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 22:34:22,310 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243222093] [2019-11-27 22:34:22,311 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:34:22,311 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:34:22,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:34:22,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:22,312 INFO L87 Difference]: Start difference. First operand 294 states and 500 transitions. Second operand 3 states. [2019-11-27 22:34:22,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:34:22,469 INFO L93 Difference]: Finished difference Result 583 states and 991 transitions. [2019-11-27 22:34:22,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:34:22,469 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-11-27 22:34:22,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:34:22,471 INFO L225 Difference]: With dead ends: 583 [2019-11-27 22:34:22,472 INFO L226 Difference]: Without dead ends: 296 [2019-11-27 22:34:22,472 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-27 22:34:22,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2019-11-27 22:34:22,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 294. [2019-11-27 22:34:22,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2019-11-27 22:34:22,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 496 transitions. [2019-11-27 22:34:22,485 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 496 transitions. Word has length 84 [2019-11-27 22:34:22,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:34:22,487 INFO L462 AbstractCegarLoop]: Abstraction has 294 states and 496 transitions. [2019-11-27 22:34:22,488 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:34:22,488 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 496 transitions. [2019-11-27 22:34:22,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-27 22:34:22,490 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:34:22,494 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:34:22,494 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:34:22,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:34:22,494 INFO L82 PathProgramCache]: Analyzing trace with hash 1574610693, now seen corresponding path program 1 times [2019-11-27 22:34:22,495 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:34:22,496 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771751881] [2019-11-27 22:34:22,496 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:34:22,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:34:22,548 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 22:34:22,549 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771751881] [2019-11-27 22:34:22,549 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:34:22,550 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 22:34:22,559 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339203726] [2019-11-27 22:34:22,559 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:34:22,560 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:34:22,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:34:22,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:22,561 INFO L87 Difference]: Start difference. First operand 294 states and 496 transitions. Second operand 3 states. [2019-11-27 22:34:22,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:34:22,754 INFO L93 Difference]: Finished difference Result 585 states and 986 transitions. [2019-11-27 22:34:22,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:34:22,755 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-11-27 22:34:22,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:34:22,757 INFO L225 Difference]: With dead ends: 585 [2019-11-27 22:34:22,757 INFO L226 Difference]: Without dead ends: 296 [2019-11-27 22:34:22,759 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-27 22:34:22,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2019-11-27 22:34:22,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 292. [2019-11-27 22:34:22,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2019-11-27 22:34:22,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 491 transitions. [2019-11-27 22:34:22,776 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 491 transitions. Word has length 84 [2019-11-27 22:34:22,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:34:22,776 INFO L462 AbstractCegarLoop]: Abstraction has 292 states and 491 transitions. [2019-11-27 22:34:22,777 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:34:22,777 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 491 transitions. [2019-11-27 22:34:22,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-27 22:34:22,779 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:34:22,779 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:34:22,779 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:34:22,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:34:22,780 INFO L82 PathProgramCache]: Analyzing trace with hash -544543676, now seen corresponding path program 1 times [2019-11-27 22:34:22,780 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:34:22,781 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92557329] [2019-11-27 22:34:22,781 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:34:22,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:34:22,834 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-11-27 22:34:22,835 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92557329] [2019-11-27 22:34:22,835 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:34:22,835 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 22:34:22,836 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041905573] [2019-11-27 22:34:22,836 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:34:22,836 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:34:22,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:34:22,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:22,837 INFO L87 Difference]: Start difference. First operand 292 states and 491 transitions. Second operand 3 states. [2019-11-27 22:34:22,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:34:22,952 INFO L93 Difference]: Finished difference Result 585 states and 982 transitions. [2019-11-27 22:34:22,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:34:22,953 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 95 [2019-11-27 22:34:22,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:34:22,955 INFO L225 Difference]: With dead ends: 585 [2019-11-27 22:34:22,955 INFO L226 Difference]: Without dead ends: 300 [2019-11-27 22:34:22,956 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-27 22:34:22,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2019-11-27 22:34:22,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 300. [2019-11-27 22:34:22,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 300 states. [2019-11-27 22:34:22,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 496 transitions. [2019-11-27 22:34:22,970 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 496 transitions. Word has length 95 [2019-11-27 22:34:22,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:34:22,971 INFO L462 AbstractCegarLoop]: Abstraction has 300 states and 496 transitions. [2019-11-27 22:34:22,971 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:34:22,971 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 496 transitions. [2019-11-27 22:34:22,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-11-27 22:34:22,973 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:34:22,973 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, 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] [2019-11-27 22:34:22,973 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:34:22,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:34:22,974 INFO L82 PathProgramCache]: Analyzing trace with hash -394257992, now seen corresponding path program 1 times [2019-11-27 22:34:22,974 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:34:22,975 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346687430] [2019-11-27 22:34:22,976 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:34:22,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:34:23,033 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-27 22:34:23,033 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346687430] [2019-11-27 22:34:23,034 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:34:23,034 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 22:34:23,038 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194016922] [2019-11-27 22:34:23,040 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:34:23,041 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:34:23,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:34:23,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:23,042 INFO L87 Difference]: Start difference. First operand 300 states and 496 transitions. Second operand 3 states. [2019-11-27 22:34:23,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:34:23,196 INFO L93 Difference]: Finished difference Result 624 states and 1034 transitions. [2019-11-27 22:34:23,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:34:23,196 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2019-11-27 22:34:23,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:34:23,199 INFO L225 Difference]: With dead ends: 624 [2019-11-27 22:34:23,199 INFO L226 Difference]: Without dead ends: 331 [2019-11-27 22:34:23,200 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-27 22:34:23,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2019-11-27 22:34:23,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 329. [2019-11-27 22:34:23,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2019-11-27 22:34:23,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 543 transitions. [2019-11-27 22:34:23,214 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 543 transitions. Word has length 97 [2019-11-27 22:34:23,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:34:23,214 INFO L462 AbstractCegarLoop]: Abstraction has 329 states and 543 transitions. [2019-11-27 22:34:23,214 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:34:23,214 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 543 transitions. [2019-11-27 22:34:23,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-27 22:34:23,216 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:34:23,216 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 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-27 22:34:23,216 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:34:23,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:34:23,217 INFO L82 PathProgramCache]: Analyzing trace with hash -580298112, now seen corresponding path program 1 times [2019-11-27 22:34:23,217 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:34:23,217 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887872535] [2019-11-27 22:34:23,217 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:34:23,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:34:23,252 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-27 22:34:23,253 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887872535] [2019-11-27 22:34:23,253 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:34:23,253 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 22:34:23,254 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846555104] [2019-11-27 22:34:23,254 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:34:23,254 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:34:23,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:34:23,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:23,255 INFO L87 Difference]: Start difference. First operand 329 states and 543 transitions. Second operand 3 states. [2019-11-27 22:34:23,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:34:23,428 INFO L93 Difference]: Finished difference Result 685 states and 1134 transitions. [2019-11-27 22:34:23,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:34:23,429 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-11-27 22:34:23,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:34:23,432 INFO L225 Difference]: With dead ends: 685 [2019-11-27 22:34:23,432 INFO L226 Difference]: Without dead ends: 363 [2019-11-27 22:34:23,433 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-27 22:34:23,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2019-11-27 22:34:23,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 356. [2019-11-27 22:34:23,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2019-11-27 22:34:23,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 585 transitions. [2019-11-27 22:34:23,448 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 585 transitions. Word has length 98 [2019-11-27 22:34:23,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:34:23,450 INFO L462 AbstractCegarLoop]: Abstraction has 356 states and 585 transitions. [2019-11-27 22:34:23,450 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:34:23,450 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 585 transitions. [2019-11-27 22:34:23,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-27 22:34:23,451 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:34:23,451 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, 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] [2019-11-27 22:34:23,452 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:34:23,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:34:23,452 INFO L82 PathProgramCache]: Analyzing trace with hash 1428014628, now seen corresponding path program 1 times [2019-11-27 22:34:23,452 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:34:23,452 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260260280] [2019-11-27 22:34:23,453 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:34:23,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:34:23,497 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-27 22:34:23,497 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260260280] [2019-11-27 22:34:23,497 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:34:23,498 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 22:34:23,498 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901276515] [2019-11-27 22:34:23,498 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:34:23,499 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:34:23,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:34:23,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:23,499 INFO L87 Difference]: Start difference. First operand 356 states and 585 transitions. Second operand 3 states. [2019-11-27 22:34:23,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:34:23,641 INFO L93 Difference]: Finished difference Result 707 states and 1161 transitions. [2019-11-27 22:34:23,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:34:23,641 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-11-27 22:34:23,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:34:23,644 INFO L225 Difference]: With dead ends: 707 [2019-11-27 22:34:23,644 INFO L226 Difference]: Without dead ends: 358 [2019-11-27 22:34:23,645 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-27 22:34:23,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2019-11-27 22:34:23,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 356. [2019-11-27 22:34:23,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2019-11-27 22:34:23,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 581 transitions. [2019-11-27 22:34:23,664 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 581 transitions. Word has length 98 [2019-11-27 22:34:23,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:34:23,664 INFO L462 AbstractCegarLoop]: Abstraction has 356 states and 581 transitions. [2019-11-27 22:34:23,664 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:34:23,664 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 581 transitions. [2019-11-27 22:34:23,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-27 22:34:23,667 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:34:23,667 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, 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] [2019-11-27 22:34:23,667 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:34:23,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:34:23,668 INFO L82 PathProgramCache]: Analyzing trace with hash -1781518284, now seen corresponding path program 1 times [2019-11-27 22:34:23,668 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:34:23,669 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694040540] [2019-11-27 22:34:23,669 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:34:23,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:34:23,708 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-27 22:34:23,709 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694040540] [2019-11-27 22:34:23,709 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:34:23,709 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 22:34:23,709 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813606919] [2019-11-27 22:34:23,709 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:34:23,710 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:34:23,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:34:23,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:23,711 INFO L87 Difference]: Start difference. First operand 356 states and 581 transitions. Second operand 3 states. [2019-11-27 22:34:23,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:34:23,882 INFO L93 Difference]: Finished difference Result 712 states and 1163 transitions. [2019-11-27 22:34:23,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:34:23,882 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-11-27 22:34:23,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:34:23,885 INFO L225 Difference]: With dead ends: 712 [2019-11-27 22:34:23,885 INFO L226 Difference]: Without dead ends: 363 [2019-11-27 22:34:23,886 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-27 22:34:23,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2019-11-27 22:34:23,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 356. [2019-11-27 22:34:23,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2019-11-27 22:34:23,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 576 transitions. [2019-11-27 22:34:23,903 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 576 transitions. Word has length 99 [2019-11-27 22:34:23,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:34:23,903 INFO L462 AbstractCegarLoop]: Abstraction has 356 states and 576 transitions. [2019-11-27 22:34:23,903 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:34:23,903 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 576 transitions. [2019-11-27 22:34:23,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-11-27 22:34:23,905 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:34:23,905 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-27 22:34:23,905 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:34:23,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:34:23,905 INFO L82 PathProgramCache]: Analyzing trace with hash -2059318320, now seen corresponding path program 1 times [2019-11-27 22:34:23,906 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:34:23,906 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059283546] [2019-11-27 22:34:23,906 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:34:23,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:34:23,938 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-11-27 22:34:23,939 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059283546] [2019-11-27 22:34:23,939 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:34:23,939 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 22:34:23,939 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839849578] [2019-11-27 22:34:23,940 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:34:23,940 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:34:23,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:34:23,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:23,941 INFO L87 Difference]: Start difference. First operand 356 states and 576 transitions. Second operand 3 states. [2019-11-27 22:34:24,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:34:24,085 INFO L93 Difference]: Finished difference Result 730 states and 1182 transitions. [2019-11-27 22:34:24,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:34:24,086 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2019-11-27 22:34:24,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:34:24,088 INFO L225 Difference]: With dead ends: 730 [2019-11-27 22:34:24,088 INFO L226 Difference]: Without dead ends: 381 [2019-11-27 22:34:24,089 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-27 22:34:24,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2019-11-27 22:34:24,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 377. [2019-11-27 22:34:24,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2019-11-27 22:34:24,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 605 transitions. [2019-11-27 22:34:24,108 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 605 transitions. Word has length 104 [2019-11-27 22:34:24,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:34:24,108 INFO L462 AbstractCegarLoop]: Abstraction has 377 states and 605 transitions. [2019-11-27 22:34:24,109 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:34:24,109 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 605 transitions. [2019-11-27 22:34:24,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-11-27 22:34:24,111 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:34:24,111 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-27 22:34:24,111 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:34:24,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:34:24,112 INFO L82 PathProgramCache]: Analyzing trace with hash -1279717276, now seen corresponding path program 1 times [2019-11-27 22:34:24,112 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:34:24,112 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129164227] [2019-11-27 22:34:24,112 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:34:24,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:34:24,155 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-11-27 22:34:24,156 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129164227] [2019-11-27 22:34:24,156 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:34:24,157 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 22:34:24,157 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564822854] [2019-11-27 22:34:24,157 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:34:24,157 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:34:24,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:34:24,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:24,158 INFO L87 Difference]: Start difference. First operand 377 states and 605 transitions. Second operand 3 states. [2019-11-27 22:34:24,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:34:24,326 INFO L93 Difference]: Finished difference Result 751 states and 1205 transitions. [2019-11-27 22:34:24,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:34:24,327 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2019-11-27 22:34:24,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:34:24,330 INFO L225 Difference]: With dead ends: 751 [2019-11-27 22:34:24,330 INFO L226 Difference]: Without dead ends: 381 [2019-11-27 22:34:24,331 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-27 22:34:24,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2019-11-27 22:34:24,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 377. [2019-11-27 22:34:24,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2019-11-27 22:34:24,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 599 transitions. [2019-11-27 22:34:24,381 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 599 transitions. Word has length 105 [2019-11-27 22:34:24,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:34:24,382 INFO L462 AbstractCegarLoop]: Abstraction has 377 states and 599 transitions. [2019-11-27 22:34:24,382 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:34:24,382 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 599 transitions. [2019-11-27 22:34:24,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-11-27 22:34:24,385 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:34:24,385 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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] [2019-11-27 22:34:24,386 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:34:24,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:34:24,386 INFO L82 PathProgramCache]: Analyzing trace with hash 2114985745, now seen corresponding path program 1 times [2019-11-27 22:34:24,386 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:34:24,387 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633994298] [2019-11-27 22:34:24,387 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:34:24,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:34:24,444 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-11-27 22:34:24,444 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633994298] [2019-11-27 22:34:24,445 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:34:24,445 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:34:24,445 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095669445] [2019-11-27 22:34:24,446 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:34:24,446 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:34:24,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:34:24,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:24,447 INFO L87 Difference]: Start difference. First operand 377 states and 599 transitions. Second operand 3 states. [2019-11-27 22:34:24,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:34:24,515 INFO L93 Difference]: Finished difference Result 747 states and 1187 transitions. [2019-11-27 22:34:24,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:34:24,516 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 120 [2019-11-27 22:34:24,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:34:24,521 INFO L225 Difference]: With dead ends: 747 [2019-11-27 22:34:24,521 INFO L226 Difference]: Without dead ends: 745 [2019-11-27 22:34:24,522 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:24,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 745 states. [2019-11-27 22:34:24,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 745 to 745. [2019-11-27 22:34:24,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 745 states. [2019-11-27 22:34:24,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 745 states to 745 states and 1185 transitions. [2019-11-27 22:34:24,554 INFO L78 Accepts]: Start accepts. Automaton has 745 states and 1185 transitions. Word has length 120 [2019-11-27 22:34:24,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:34:24,555 INFO L462 AbstractCegarLoop]: Abstraction has 745 states and 1185 transitions. [2019-11-27 22:34:24,555 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:34:24,555 INFO L276 IsEmpty]: Start isEmpty. Operand 745 states and 1185 transitions. [2019-11-27 22:34:24,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-11-27 22:34:24,558 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:34:24,558 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:34:24,558 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:34:24,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:34:24,559 INFO L82 PathProgramCache]: Analyzing trace with hash 1757690989, now seen corresponding path program 1 times [2019-11-27 22:34:24,559 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:34:24,559 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530964640] [2019-11-27 22:34:24,560 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:34:24,569 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-27 22:34:24,570 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [174231540] [2019-11-27 22:34:24,570 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 22:34:24,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:34:24,657 INFO L255 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-27 22:34:24,669 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 22:34:24,709 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-11-27 22:34:24,710 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530964640] [2019-11-27 22:34:24,710 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-27 22:34:24,710 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [174231540] [2019-11-27 22:34:24,711 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:34:24,711 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 22:34:24,711 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874334839] [2019-11-27 22:34:24,712 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:34:24,712 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:34:24,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:34:24,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:24,713 INFO L87 Difference]: Start difference. First operand 745 states and 1185 transitions. Second operand 3 states. [2019-11-27 22:34:24,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:34:24,792 INFO L93 Difference]: Finished difference Result 1851 states and 2945 transitions. [2019-11-27 22:34:24,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:34:24,793 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2019-11-27 22:34:24,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:34:24,800 INFO L225 Difference]: With dead ends: 1851 [2019-11-27 22:34:24,801 INFO L226 Difference]: Without dead ends: 1113 [2019-11-27 22:34:24,803 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 119 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-27 22:34:24,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1113 states. [2019-11-27 22:34:24,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1113 to 1113. [2019-11-27 22:34:24,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1113 states. [2019-11-27 22:34:24,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1113 states to 1113 states and 1768 transitions. [2019-11-27 22:34:24,857 INFO L78 Accepts]: Start accepts. Automaton has 1113 states and 1768 transitions. Word has length 121 [2019-11-27 22:34:24,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:34:24,858 INFO L462 AbstractCegarLoop]: Abstraction has 1113 states and 1768 transitions. [2019-11-27 22:34:24,858 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:34:24,858 INFO L276 IsEmpty]: Start isEmpty. Operand 1113 states and 1768 transitions. [2019-11-27 22:34:24,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-11-27 22:34:24,864 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:34:24,864 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 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-27 22:34:25,069 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 22:34:25,069 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:34:25,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:34:25,071 INFO L82 PathProgramCache]: Analyzing trace with hash -1944046772, now seen corresponding path program 1 times [2019-11-27 22:34:25,071 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:34:25,071 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528269019] [2019-11-27 22:34:25,071 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:34:25,082 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-27 22:34:25,083 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1130590323] [2019-11-27 22:34:25,083 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 22:34:25,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:34:25,170 INFO L255 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-27 22:34:25,185 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 22:34:25,224 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-11-27 22:34:25,224 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528269019] [2019-11-27 22:34:25,224 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-27 22:34:25,224 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1130590323] [2019-11-27 22:34:25,225 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:34:25,225 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:34:25,226 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729868895] [2019-11-27 22:34:25,227 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:34:25,227 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:34:25,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:34:25,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:25,227 INFO L87 Difference]: Start difference. First operand 1113 states and 1768 transitions. Second operand 3 states. [2019-11-27 22:34:25,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:34:25,306 INFO L93 Difference]: Finished difference Result 2219 states and 3528 transitions. [2019-11-27 22:34:25,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:34:25,307 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 137 [2019-11-27 22:34:25,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:34:25,316 INFO L225 Difference]: With dead ends: 2219 [2019-11-27 22:34:25,316 INFO L226 Difference]: Without dead ends: 1481 [2019-11-27 22:34:25,319 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 135 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-27 22:34:25,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1481 states. [2019-11-27 22:34:25,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1481 to 1481. [2019-11-27 22:34:25,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1481 states. [2019-11-27 22:34:25,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1481 states to 1481 states and 2352 transitions. [2019-11-27 22:34:25,404 INFO L78 Accepts]: Start accepts. Automaton has 1481 states and 2352 transitions. Word has length 137 [2019-11-27 22:34:25,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:34:25,404 INFO L462 AbstractCegarLoop]: Abstraction has 1481 states and 2352 transitions. [2019-11-27 22:34:25,405 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:34:25,405 INFO L276 IsEmpty]: Start isEmpty. Operand 1481 states and 2352 transitions. [2019-11-27 22:34:25,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-11-27 22:34:25,411 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:34:25,412 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-27 22:34:25,615 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 22:34:25,616 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:34:25,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:34:25,617 INFO L82 PathProgramCache]: Analyzing trace with hash -1334074210, now seen corresponding path program 1 times [2019-11-27 22:34:25,617 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:34:25,618 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135907624] [2019-11-27 22:34:25,618 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:34:25,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:34:25,722 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2019-11-27 22:34:25,722 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135907624] [2019-11-27 22:34:25,723 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:34:25,723 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:34:25,723 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339548596] [2019-11-27 22:34:25,724 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:34:25,724 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:34:25,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:34:25,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:25,725 INFO L87 Difference]: Start difference. First operand 1481 states and 2352 transitions. Second operand 3 states. [2019-11-27 22:34:25,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:34:25,968 INFO L93 Difference]: Finished difference Result 3059 states and 4857 transitions. [2019-11-27 22:34:25,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:34:25,969 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 158 [2019-11-27 22:34:25,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:34:25,978 INFO L225 Difference]: With dead ends: 3059 [2019-11-27 22:34:25,979 INFO L226 Difference]: Without dead ends: 1585 [2019-11-27 22:34:25,982 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:25,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1585 states. [2019-11-27 22:34:26,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1585 to 1573. [2019-11-27 22:34:26,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2019-11-27 22:34:26,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 2464 transitions. [2019-11-27 22:34:26,050 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 2464 transitions. Word has length 158 [2019-11-27 22:34:26,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:34:26,050 INFO L462 AbstractCegarLoop]: Abstraction has 1573 states and 2464 transitions. [2019-11-27 22:34:26,050 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:34:26,051 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 2464 transitions. [2019-11-27 22:34:26,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-11-27 22:34:26,055 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:34:26,056 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-27 22:34:26,056 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:34:26,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:34:26,057 INFO L82 PathProgramCache]: Analyzing trace with hash -241439008, now seen corresponding path program 1 times [2019-11-27 22:34:26,057 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:34:26,057 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034291000] [2019-11-27 22:34:26,058 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:34:26,070 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-27 22:34:26,071 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [640039691] [2019-11-27 22:34:26,071 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 22:34:26,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:34:26,163 INFO L255 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-27 22:34:26,175 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 22:34:26,209 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-11-27 22:34:26,210 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034291000] [2019-11-27 22:34:26,210 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-27 22:34:26,211 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [640039691] [2019-11-27 22:34:26,211 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:34:26,212 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:34:26,212 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116715290] [2019-11-27 22:34:26,213 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:34:26,213 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:34:26,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:34:26,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:26,214 INFO L87 Difference]: Start difference. First operand 1573 states and 2464 transitions. Second operand 3 states. [2019-11-27 22:34:26,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:34:26,299 INFO L93 Difference]: Finished difference Result 3139 states and 4920 transitions. [2019-11-27 22:34:26,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:34:26,300 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 158 [2019-11-27 22:34:26,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:34:26,310 INFO L225 Difference]: With dead ends: 3139 [2019-11-27 22:34:26,310 INFO L226 Difference]: Without dead ends: 1964 [2019-11-27 22:34:26,313 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 156 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-27 22:34:26,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1964 states. [2019-11-27 22:34:26,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1964 to 1964. [2019-11-27 22:34:26,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1964 states. [2019-11-27 22:34:26,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1964 states to 1964 states and 3077 transitions. [2019-11-27 22:34:26,395 INFO L78 Accepts]: Start accepts. Automaton has 1964 states and 3077 transitions. Word has length 158 [2019-11-27 22:34:26,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:34:26,396 INFO L462 AbstractCegarLoop]: Abstraction has 1964 states and 3077 transitions. [2019-11-27 22:34:26,396 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:34:26,396 INFO L276 IsEmpty]: Start isEmpty. Operand 1964 states and 3077 transitions. [2019-11-27 22:34:26,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-11-27 22:34:26,403 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:34:26,403 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 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] [2019-11-27 22:34:26,612 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 22:34:26,612 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:34:26,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:34:26,613 INFO L82 PathProgramCache]: Analyzing trace with hash 332308346, now seen corresponding path program 1 times [2019-11-27 22:34:26,613 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:34:26,613 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35019015] [2019-11-27 22:34:26,614 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:34:26,630 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-27 22:34:26,631 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1049470815] [2019-11-27 22:34:26,631 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 22:34:26,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:34:26,717 INFO L255 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-27 22:34:26,721 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 22:34:26,796 INFO L134 CoverageAnalysis]: Checked inductivity of 328 backedges. 249 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2019-11-27 22:34:26,796 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35019015] [2019-11-27 22:34:26,796 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-27 22:34:26,797 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1049470815] [2019-11-27 22:34:26,797 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:34:26,797 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:34:26,798 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368881849] [2019-11-27 22:34:26,798 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:34:26,798 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:34:26,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:34:26,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:26,799 INFO L87 Difference]: Start difference. First operand 1964 states and 3077 transitions. Second operand 3 states. [2019-11-27 22:34:26,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:34:26,929 INFO L93 Difference]: Finished difference Result 5743 states and 9049 transitions. [2019-11-27 22:34:26,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:34:26,930 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 198 [2019-11-27 22:34:26,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:34:26,950 INFO L225 Difference]: With dead ends: 5743 [2019-11-27 22:34:26,950 INFO L226 Difference]: Without dead ends: 3786 [2019-11-27 22:34:26,954 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 196 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-27 22:34:26,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3786 states. [2019-11-27 22:34:27,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3786 to 3784. [2019-11-27 22:34:27,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3784 states. [2019-11-27 22:34:27,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3784 states to 3784 states and 5967 transitions. [2019-11-27 22:34:27,094 INFO L78 Accepts]: Start accepts. Automaton has 3784 states and 5967 transitions. Word has length 198 [2019-11-27 22:34:27,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:34:27,095 INFO L462 AbstractCegarLoop]: Abstraction has 3784 states and 5967 transitions. [2019-11-27 22:34:27,095 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:34:27,095 INFO L276 IsEmpty]: Start isEmpty. Operand 3784 states and 5967 transitions. [2019-11-27 22:34:27,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2019-11-27 22:34:27,106 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:34:27,106 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-27 22:34:27,309 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 22:34:27,310 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:34:27,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:34:27,311 INFO L82 PathProgramCache]: Analyzing trace with hash 1226220023, now seen corresponding path program 1 times [2019-11-27 22:34:27,311 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:34:27,312 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959531030] [2019-11-27 22:34:27,312 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:34:27,328 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-27 22:34:27,329 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1081639902] [2019-11-27 22:34:27,329 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 22:34:27,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:34:27,446 INFO L255 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-27 22:34:27,450 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 22:34:27,496 INFO L134 CoverageAnalysis]: Checked inductivity of 516 backedges. 372 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-11-27 22:34:27,496 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959531030] [2019-11-27 22:34:27,496 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-27 22:34:27,496 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1081639902] [2019-11-27 22:34:27,497 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:34:27,497 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:34:27,497 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905126277] [2019-11-27 22:34:27,498 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:34:27,498 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:34:27,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:34:27,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:27,499 INFO L87 Difference]: Start difference. First operand 3784 states and 5967 transitions. Second operand 3 states. [2019-11-27 22:34:27,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:34:27,797 INFO L93 Difference]: Finished difference Result 7651 states and 12033 transitions. [2019-11-27 22:34:27,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:34:27,798 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 235 [2019-11-27 22:34:27,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:34:27,819 INFO L225 Difference]: With dead ends: 7651 [2019-11-27 22:34:27,820 INFO L226 Difference]: Without dead ends: 3874 [2019-11-27 22:34:27,827 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 233 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-27 22:34:27,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3874 states. [2019-11-27 22:34:27,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3874 to 3784. [2019-11-27 22:34:27,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3784 states. [2019-11-27 22:34:27,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3784 states to 3784 states and 5787 transitions. [2019-11-27 22:34:27,991 INFO L78 Accepts]: Start accepts. Automaton has 3784 states and 5787 transitions. Word has length 235 [2019-11-27 22:34:27,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:34:27,992 INFO L462 AbstractCegarLoop]: Abstraction has 3784 states and 5787 transitions. [2019-11-27 22:34:27,992 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:34:27,992 INFO L276 IsEmpty]: Start isEmpty. Operand 3784 states and 5787 transitions. [2019-11-27 22:34:28,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2019-11-27 22:34:28,006 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:34:28,007 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-27 22:34:28,220 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 22:34:28,221 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:34:28,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:34:28,222 INFO L82 PathProgramCache]: Analyzing trace with hash 1255317410, now seen corresponding path program 1 times [2019-11-27 22:34:28,223 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:34:28,223 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945614131] [2019-11-27 22:34:28,223 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:34:28,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:34:28,323 INFO L134 CoverageAnalysis]: Checked inductivity of 562 backedges. 323 proven. 0 refuted. 0 times theorem prover too weak. 239 trivial. 0 not checked. [2019-11-27 22:34:28,324 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945614131] [2019-11-27 22:34:28,324 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:34:28,324 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:34:28,325 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890900071] [2019-11-27 22:34:28,325 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:34:28,326 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:34:28,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:34:28,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:28,328 INFO L87 Difference]: Start difference. First operand 3784 states and 5787 transitions. Second operand 3 states. [2019-11-27 22:34:28,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:34:28,679 INFO L93 Difference]: Finished difference Result 7683 states and 11706 transitions. [2019-11-27 22:34:28,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:34:28,680 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 248 [2019-11-27 22:34:28,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:34:28,699 INFO L225 Difference]: With dead ends: 7683 [2019-11-27 22:34:28,700 INFO L226 Difference]: Without dead ends: 3906 [2019-11-27 22:34:28,706 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:28,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3906 states. [2019-11-27 22:34:28,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3906 to 3784. [2019-11-27 22:34:28,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3784 states. [2019-11-27 22:34:28,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3784 states to 3784 states and 5627 transitions. [2019-11-27 22:34:28,863 INFO L78 Accepts]: Start accepts. Automaton has 3784 states and 5627 transitions. Word has length 248 [2019-11-27 22:34:28,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:34:28,863 INFO L462 AbstractCegarLoop]: Abstraction has 3784 states and 5627 transitions. [2019-11-27 22:34:28,864 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:34:28,864 INFO L276 IsEmpty]: Start isEmpty. Operand 3784 states and 5627 transitions. [2019-11-27 22:34:28,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2019-11-27 22:34:28,874 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:34:28,875 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 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] [2019-11-27 22:34:28,875 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:34:28,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:34:28,876 INFO L82 PathProgramCache]: Analyzing trace with hash -1963060854, now seen corresponding path program 1 times [2019-11-27 22:34:28,876 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:34:28,876 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438421623] [2019-11-27 22:34:28,877 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:34:28,895 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-27 22:34:28,895 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [90593102] [2019-11-27 22:34:28,896 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 22:34:29,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:34:29,013 INFO L255 TraceCheckSpWp]: Trace formula consists of 457 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-27 22:34:29,018 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 22:34:29,081 INFO L134 CoverageAnalysis]: Checked inductivity of 714 backedges. 494 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2019-11-27 22:34:29,081 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438421623] [2019-11-27 22:34:29,082 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-27 22:34:29,082 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [90593102] [2019-11-27 22:34:29,082 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:34:29,082 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:34:29,083 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119392928] [2019-11-27 22:34:29,083 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:34:29,084 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:34:29,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:34:29,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:29,084 INFO L87 Difference]: Start difference. First operand 3784 states and 5627 transitions. Second operand 3 states. [2019-11-27 22:34:29,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:34:29,343 INFO L93 Difference]: Finished difference Result 7561 states and 11243 transitions. [2019-11-27 22:34:29,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:34:29,343 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 277 [2019-11-27 22:34:29,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:34:29,376 INFO L225 Difference]: With dead ends: 7561 [2019-11-27 22:34:29,376 INFO L226 Difference]: Without dead ends: 3784 [2019-11-27 22:34:29,382 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 275 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-27 22:34:29,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3784 states. [2019-11-27 22:34:29,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3784 to 3784. [2019-11-27 22:34:29,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3784 states. [2019-11-27 22:34:29,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3784 states to 3784 states and 5517 transitions. [2019-11-27 22:34:29,510 INFO L78 Accepts]: Start accepts. Automaton has 3784 states and 5517 transitions. Word has length 277 [2019-11-27 22:34:29,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:34:29,510 INFO L462 AbstractCegarLoop]: Abstraction has 3784 states and 5517 transitions. [2019-11-27 22:34:29,511 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:34:29,511 INFO L276 IsEmpty]: Start isEmpty. Operand 3784 states and 5517 transitions. [2019-11-27 22:34:29,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2019-11-27 22:34:29,521 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:34:29,522 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 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] [2019-11-27 22:34:29,734 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 22:34:29,735 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:34:29,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:34:29,735 INFO L82 PathProgramCache]: Analyzing trace with hash 2084683919, now seen corresponding path program 1 times [2019-11-27 22:34:29,736 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:34:29,736 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271757269] [2019-11-27 22:34:29,736 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:34:29,754 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-27 22:34:29,755 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1295894460] [2019-11-27 22:34:29,755 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 22:34:29,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:34:29,889 INFO L255 TraceCheckSpWp]: Trace formula consists of 489 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-27 22:34:29,894 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 22:34:29,967 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 535 proven. 0 refuted. 0 times theorem prover too weak. 365 trivial. 0 not checked. [2019-11-27 22:34:29,968 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271757269] [2019-11-27 22:34:29,968 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-27 22:34:29,968 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1295894460] [2019-11-27 22:34:29,968 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:34:29,969 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:34:29,969 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009342224] [2019-11-27 22:34:29,970 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:34:29,970 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:34:29,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:34:29,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:29,971 INFO L87 Difference]: Start difference. First operand 3784 states and 5517 transitions. Second operand 3 states. [2019-11-27 22:34:30,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:34:30,255 INFO L93 Difference]: Finished difference Result 7951 states and 11633 transitions. [2019-11-27 22:34:30,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:34:30,256 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 305 [2019-11-27 22:34:30,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:34:30,264 INFO L225 Difference]: With dead ends: 7951 [2019-11-27 22:34:30,265 INFO L226 Difference]: Without dead ends: 2307 [2019-11-27 22:34:30,277 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 303 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-27 22:34:30,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2307 states. [2019-11-27 22:34:30,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2307 to 2307. [2019-11-27 22:34:30,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2307 states. [2019-11-27 22:34:30,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2307 states to 2307 states and 3307 transitions. [2019-11-27 22:34:30,395 INFO L78 Accepts]: Start accepts. Automaton has 2307 states and 3307 transitions. Word has length 305 [2019-11-27 22:34:30,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:34:30,396 INFO L462 AbstractCegarLoop]: Abstraction has 2307 states and 3307 transitions. [2019-11-27 22:34:30,396 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:34:30,397 INFO L276 IsEmpty]: Start isEmpty. Operand 2307 states and 3307 transitions. [2019-11-27 22:34:30,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2019-11-27 22:34:30,407 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:34:30,407 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 4, 4, 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] [2019-11-27 22:34:30,652 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 22:34:30,653 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:34:30,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:34:30,654 INFO L82 PathProgramCache]: Analyzing trace with hash -1859888105, now seen corresponding path program 1 times [2019-11-27 22:34:30,654 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:34:30,654 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696210061] [2019-11-27 22:34:30,654 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:34:30,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:34:30,788 INFO L134 CoverageAnalysis]: Checked inductivity of 1030 backedges. 435 proven. 0 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2019-11-27 22:34:30,788 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696210061] [2019-11-27 22:34:30,789 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:34:30,789 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:34:30,789 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421444459] [2019-11-27 22:34:30,790 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:34:30,790 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:34:30,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:34:30,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:30,791 INFO L87 Difference]: Start difference. First operand 2307 states and 3307 transitions. Second operand 3 states. [2019-11-27 22:34:30,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:34:30,987 INFO L93 Difference]: Finished difference Result 4829 states and 6951 transitions. [2019-11-27 22:34:30,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:34:30,988 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 326 [2019-11-27 22:34:30,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:34:30,995 INFO L225 Difference]: With dead ends: 4829 [2019-11-27 22:34:30,996 INFO L226 Difference]: Without dead ends: 2529 [2019-11-27 22:34:31,001 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:31,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2529 states. [2019-11-27 22:34:31,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2529 to 2457. [2019-11-27 22:34:31,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2457 states. [2019-11-27 22:34:31,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2457 states to 2457 states and 3487 transitions. [2019-11-27 22:34:31,097 INFO L78 Accepts]: Start accepts. Automaton has 2457 states and 3487 transitions. Word has length 326 [2019-11-27 22:34:31,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:34:31,097 INFO L462 AbstractCegarLoop]: Abstraction has 2457 states and 3487 transitions. [2019-11-27 22:34:31,098 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:34:31,098 INFO L276 IsEmpty]: Start isEmpty. Operand 2457 states and 3487 transitions. [2019-11-27 22:34:31,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2019-11-27 22:34:31,114 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:34:31,115 INFO L410 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 9, 9, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:34:31,117 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:34:31,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:34:31,118 INFO L82 PathProgramCache]: Analyzing trace with hash -743110197, now seen corresponding path program 1 times [2019-11-27 22:34:31,118 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:34:31,119 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970145345] [2019-11-27 22:34:31,119 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:34:31,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:34:31,320 INFO L134 CoverageAnalysis]: Checked inductivity of 1215 backedges. 587 proven. 0 refuted. 0 times theorem prover too weak. 628 trivial. 0 not checked. [2019-11-27 22:34:31,323 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970145345] [2019-11-27 22:34:31,324 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:34:31,324 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:34:31,325 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162737486] [2019-11-27 22:34:31,326 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:34:31,326 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:34:31,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:34:31,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:31,328 INFO L87 Difference]: Start difference. First operand 2457 states and 3487 transitions. Second operand 3 states. [2019-11-27 22:34:31,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:34:31,534 INFO L93 Difference]: Finished difference Result 4949 states and 7035 transitions. [2019-11-27 22:34:31,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:34:31,534 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 352 [2019-11-27 22:34:31,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:34:31,540 INFO L225 Difference]: With dead ends: 4949 [2019-11-27 22:34:31,541 INFO L226 Difference]: Without dead ends: 2499 [2019-11-27 22:34:31,545 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:31,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2499 states. [2019-11-27 22:34:31,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2499 to 2457. [2019-11-27 22:34:31,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2457 states. [2019-11-27 22:34:31,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2457 states to 2457 states and 3427 transitions. [2019-11-27 22:34:31,623 INFO L78 Accepts]: Start accepts. Automaton has 2457 states and 3427 transitions. Word has length 352 [2019-11-27 22:34:31,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:34:31,623 INFO L462 AbstractCegarLoop]: Abstraction has 2457 states and 3427 transitions. [2019-11-27 22:34:31,623 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:34:31,624 INFO L276 IsEmpty]: Start isEmpty. Operand 2457 states and 3427 transitions. [2019-11-27 22:34:31,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 370 [2019-11-27 22:34:31,633 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:34:31,634 INFO L410 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 10, 10, 9, 9, 8, 8, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 4, 4, 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] [2019-11-27 22:34:31,634 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:34:31,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:34:31,635 INFO L82 PathProgramCache]: Analyzing trace with hash -865406346, now seen corresponding path program 1 times [2019-11-27 22:34:31,635 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:34:31,635 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321928686] [2019-11-27 22:34:31,635 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:34:31,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:34:31,825 INFO L134 CoverageAnalysis]: Checked inductivity of 1396 backedges. 905 proven. 26 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2019-11-27 22:34:31,825 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321928686] [2019-11-27 22:34:31,826 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1452542741] [2019-11-27 22:34:31,826 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 22:34:31,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:34:31,963 INFO L255 TraceCheckSpWp]: Trace formula consists of 573 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-27 22:34:31,971 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 22:34:32,098 INFO L134 CoverageAnalysis]: Checked inductivity of 1396 backedges. 905 proven. 26 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2019-11-27 22:34:32,098 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-27 22:34:32,099 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-27 22:34:32,099 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038006515] [2019-11-27 22:34:32,100 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-27 22:34:32,100 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:34:32,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-27 22:34:32,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-27 22:34:32,101 INFO L87 Difference]: Start difference. First operand 2457 states and 3427 transitions. Second operand 4 states. [2019-11-27 22:34:32,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:34:32,528 INFO L93 Difference]: Finished difference Result 6557 states and 9123 transitions. [2019-11-27 22:34:32,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-27 22:34:32,529 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 369 [2019-11-27 22:34:32,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:34:32,542 INFO L225 Difference]: With dead ends: 6557 [2019-11-27 22:34:32,542 INFO L226 Difference]: Without dead ends: 3975 [2019-11-27 22:34:32,548 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 374 GetRequests, 371 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-27 22:34:32,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3975 states. [2019-11-27 22:34:32,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3975 to 2534. [2019-11-27 22:34:32,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2534 states. [2019-11-27 22:34:32,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2534 states to 2534 states and 3492 transitions. [2019-11-27 22:34:32,659 INFO L78 Accepts]: Start accepts. Automaton has 2534 states and 3492 transitions. Word has length 369 [2019-11-27 22:34:32,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:34:32,659 INFO L462 AbstractCegarLoop]: Abstraction has 2534 states and 3492 transitions. [2019-11-27 22:34:32,660 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-27 22:34:32,660 INFO L276 IsEmpty]: Start isEmpty. Operand 2534 states and 3492 transitions. [2019-11-27 22:34:32,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 438 [2019-11-27 22:34:32,672 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:34:32,672 INFO L410 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 11, 11, 10, 10, 9, 9, 9, 9, 8, 6, 6, 6, 6, 6, 6, 4, 4, 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] [2019-11-27 22:34:32,877 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 22:34:32,878 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:34:32,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:34:32,878 INFO L82 PathProgramCache]: Analyzing trace with hash 347179712, now seen corresponding path program 1 times [2019-11-27 22:34:32,879 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:34:32,879 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018466217] [2019-11-27 22:34:32,879 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:34:32,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:34:33,038 INFO L134 CoverageAnalysis]: Checked inductivity of 2015 backedges. 975 proven. 0 refuted. 0 times theorem prover too weak. 1040 trivial. 0 not checked. [2019-11-27 22:34:33,039 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018466217] [2019-11-27 22:34:33,039 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:34:33,039 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:34:33,040 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238264495] [2019-11-27 22:34:33,040 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:34:33,041 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:34:33,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:34:33,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:33,041 INFO L87 Difference]: Start difference. First operand 2534 states and 3492 transitions. Second operand 3 states. [2019-11-27 22:34:33,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:34:33,302 INFO L93 Difference]: Finished difference Result 5073 states and 6985 transitions. [2019-11-27 22:34:33,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:34:33,303 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 437 [2019-11-27 22:34:33,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:34:33,311 INFO L225 Difference]: With dead ends: 5073 [2019-11-27 22:34:33,312 INFO L226 Difference]: Without dead ends: 2546 [2019-11-27 22:34:33,317 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:33,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2546 states. [2019-11-27 22:34:33,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2546 to 2534. [2019-11-27 22:34:33,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2534 states. [2019-11-27 22:34:33,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2534 states to 2534 states and 3432 transitions. [2019-11-27 22:34:33,440 INFO L78 Accepts]: Start accepts. Automaton has 2534 states and 3432 transitions. Word has length 437 [2019-11-27 22:34:33,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:34:33,441 INFO L462 AbstractCegarLoop]: Abstraction has 2534 states and 3432 transitions. [2019-11-27 22:34:33,441 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:34:33,441 INFO L276 IsEmpty]: Start isEmpty. Operand 2534 states and 3432 transitions. [2019-11-27 22:34:33,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 470 [2019-11-27 22:34:33,466 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:34:33,467 INFO L410 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 13, 13, 12, 12, 11, 11, 10, 10, 10, 10, 8, 6, 6, 6, 6, 6, 6, 4, 4, 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] [2019-11-27 22:34:33,467 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:34:33,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:34:33,468 INFO L82 PathProgramCache]: Analyzing trace with hash -1485463445, now seen corresponding path program 1 times [2019-11-27 22:34:33,468 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:34:33,468 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322087738] [2019-11-27 22:34:33,469 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:34:33,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:34:33,745 INFO L134 CoverageAnalysis]: Checked inductivity of 2338 backedges. 1323 proven. 0 refuted. 0 times theorem prover too weak. 1015 trivial. 0 not checked. [2019-11-27 22:34:33,746 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322087738] [2019-11-27 22:34:33,746 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:34:33,746 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:34:33,747 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092108432] [2019-11-27 22:34:33,747 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:34:33,747 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:34:33,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:34:33,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:33,748 INFO L87 Difference]: Start difference. First operand 2534 states and 3432 transitions. Second operand 3 states. [2019-11-27 22:34:33,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:34:33,937 INFO L93 Difference]: Finished difference Result 5277 states and 7171 transitions. [2019-11-27 22:34:33,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:34:33,938 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 469 [2019-11-27 22:34:33,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:34:33,944 INFO L225 Difference]: With dead ends: 5277 [2019-11-27 22:34:33,944 INFO L226 Difference]: Without dead ends: 2750 [2019-11-27 22:34:33,949 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:33,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2750 states. [2019-11-27 22:34:34,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2750 to 2738. [2019-11-27 22:34:34,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2738 states. [2019-11-27 22:34:34,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2738 states to 2738 states and 3666 transitions. [2019-11-27 22:34:34,025 INFO L78 Accepts]: Start accepts. Automaton has 2738 states and 3666 transitions. Word has length 469 [2019-11-27 22:34:34,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:34:34,026 INFO L462 AbstractCegarLoop]: Abstraction has 2738 states and 3666 transitions. [2019-11-27 22:34:34,026 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:34:34,027 INFO L276 IsEmpty]: Start isEmpty. Operand 2738 states and 3666 transitions. [2019-11-27 22:34:34,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 532 [2019-11-27 22:34:34,042 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:34:34,042 INFO L410 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 15, 15, 14, 14, 13, 13, 12, 12, 12, 12, 10, 8, 8, 6, 6, 6, 6, 4, 4, 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] [2019-11-27 22:34:34,043 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:34:34,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:34:34,043 INFO L82 PathProgramCache]: Analyzing trace with hash 741321217, now seen corresponding path program 1 times [2019-11-27 22:34:34,043 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:34:34,046 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294926361] [2019-11-27 22:34:34,046 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:34:34,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:34:34,296 INFO L134 CoverageAnalysis]: Checked inductivity of 3103 backedges. 1760 proven. 0 refuted. 0 times theorem prover too weak. 1343 trivial. 0 not checked. [2019-11-27 22:34:34,296 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294926361] [2019-11-27 22:34:34,296 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:34:34,297 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:34:34,297 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774526264] [2019-11-27 22:34:34,298 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:34:34,298 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:34:34,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:34:34,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:34,299 INFO L87 Difference]: Start difference. First operand 2738 states and 3666 transitions. Second operand 3 states. [2019-11-27 22:34:34,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:34:34,494 INFO L93 Difference]: Finished difference Result 5697 states and 7663 transitions. [2019-11-27 22:34:34,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:34:34,495 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 531 [2019-11-27 22:34:34,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:34:34,501 INFO L225 Difference]: With dead ends: 5697 [2019-11-27 22:34:34,502 INFO L226 Difference]: Without dead ends: 2966 [2019-11-27 22:34:34,507 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:34,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2966 states. [2019-11-27 22:34:34,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2966 to 2954. [2019-11-27 22:34:34,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2954 states. [2019-11-27 22:34:34,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2954 states to 2954 states and 3912 transitions. [2019-11-27 22:34:34,581 INFO L78 Accepts]: Start accepts. Automaton has 2954 states and 3912 transitions. Word has length 531 [2019-11-27 22:34:34,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:34:34,582 INFO L462 AbstractCegarLoop]: Abstraction has 2954 states and 3912 transitions. [2019-11-27 22:34:34,582 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:34:34,582 INFO L276 IsEmpty]: Start isEmpty. Operand 2954 states and 3912 transitions. [2019-11-27 22:34:34,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 598 [2019-11-27 22:34:34,603 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:34:34,604 INFO L410 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 18, 18, 18, 18, 18, 17, 17, 16, 16, 15, 15, 14, 14, 14, 14, 12, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:34:34,604 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:34:34,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:34:34,605 INFO L82 PathProgramCache]: Analyzing trace with hash -1801113525, now seen corresponding path program 1 times [2019-11-27 22:34:34,605 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:34:34,606 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227332699] [2019-11-27 22:34:34,606 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:34:34,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:34:34,968 INFO L134 CoverageAnalysis]: Checked inductivity of 4010 backedges. 2316 proven. 26 refuted. 0 times theorem prover too weak. 1668 trivial. 0 not checked. [2019-11-27 22:34:34,969 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227332699] [2019-11-27 22:34:34,969 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [978614587] [2019-11-27 22:34:34,969 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 22:34:35,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:34:35,177 INFO L255 TraceCheckSpWp]: Trace formula consists of 879 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-27 22:34:35,184 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 22:34:35,464 INFO L134 CoverageAnalysis]: Checked inductivity of 4010 backedges. 2316 proven. 26 refuted. 0 times theorem prover too weak. 1668 trivial. 0 not checked. [2019-11-27 22:34:35,465 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-27 22:34:35,465 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-27 22:34:35,466 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660689353] [2019-11-27 22:34:35,467 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-27 22:34:35,468 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:34:35,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-27 22:34:35,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-27 22:34:35,468 INFO L87 Difference]: Start difference. First operand 2954 states and 3912 transitions. Second operand 4 states. [2019-11-27 22:34:35,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:34:35,728 INFO L93 Difference]: Finished difference Result 4704 states and 6236 transitions. [2019-11-27 22:34:35,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-27 22:34:35,728 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 597 [2019-11-27 22:34:35,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:34:35,730 INFO L225 Difference]: With dead ends: 4704 [2019-11-27 22:34:35,730 INFO L226 Difference]: Without dead ends: 0 [2019-11-27 22:34:35,734 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 602 GetRequests, 599 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-27 22:34:35,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-27 22:34:35,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-27 22:34:35,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-27 22:34:35,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-27 22:34:35,735 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 597 [2019-11-27 22:34:35,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:34:35,735 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-27 22:34:35,736 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-27 22:34:35,736 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-27 22:34:35,736 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-27 22:34:35,940 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 22:34:35,942 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-27 22:34:36,613 WARN L192 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 204 DAG size of output: 80 [2019-11-27 22:34:36,816 WARN L192 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 204 DAG size of output: 80 [2019-11-27 22:34:37,149 WARN L192 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 52 [2019-11-27 22:34:37,316 WARN L192 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 20 [2019-11-27 22:34:37,655 WARN L192 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 47 [2019-11-27 22:34:37,837 WARN L192 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 47 [2019-11-27 22:34:38,029 WARN L192 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 52 [2019-11-27 22:34:38,199 WARN L192 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 48 [2019-11-27 22:34:38,375 WARN L192 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 54 [2019-11-27 22:34:38,608 WARN L192 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 52 [2019-11-27 22:34:38,779 WARN L192 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 50 [2019-11-27 22:34:38,957 WARN L192 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 47 [2019-11-27 22:34:39,115 WARN L192 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 52 [2019-11-27 22:34:39,340 WARN L192 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 50 [2019-11-27 22:34:39,603 WARN L192 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 46 [2019-11-27 22:34:39,759 WARN L192 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 46 [2019-11-27 22:34:40,016 WARN L192 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 46 [2019-11-27 22:34:40,206 WARN L192 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 50 [2019-11-27 22:34:40,514 WARN L192 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 53 [2019-11-27 22:34:40,663 WARN L192 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 48 [2019-11-27 22:34:40,819 WARN L192 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 44 [2019-11-27 22:34:40,823 INFO L246 CegarLoopResult]: For program point L399(lines 399 405) no Hoare annotation was computed. [2019-11-27 22:34:40,823 INFO L246 CegarLoopResult]: For program point L201(lines 201 591) no Hoare annotation was computed. [2019-11-27 22:34:40,823 INFO L246 CegarLoopResult]: For program point L168(lines 168 602) no Hoare annotation was computed. [2019-11-27 22:34:40,824 INFO L246 CegarLoopResult]: For program point L135(lines 135 613) no Hoare annotation was computed. [2019-11-27 22:34:40,824 INFO L246 CegarLoopResult]: For program point L102(lines 102 624) no Hoare annotation was computed. [2019-11-27 22:34:40,824 INFO L246 CegarLoopResult]: For program point L466(lines 466 470) no Hoare annotation was computed. [2019-11-27 22:34:40,824 INFO L242 CegarLoopResult]: At program point L202(lines 198 592) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~0) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292))) [2019-11-27 22:34:40,824 INFO L242 CegarLoopResult]: At program point L103(lines 102 624) the Hoare annotation is: (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~0) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) [2019-11-27 22:34:40,824 INFO L246 CegarLoopResult]: For program point L500(lines 500 504) no Hoare annotation was computed. [2019-11-27 22:34:40,825 INFO L246 CegarLoopResult]: For program point L500-2(lines 209 586) no Hoare annotation was computed. [2019-11-27 22:34:40,825 INFO L246 CegarLoopResult]: For program point L237(lines 237 242) no Hoare annotation was computed. [2019-11-27 22:34:40,825 INFO L246 CegarLoopResult]: For program point L204(lines 204 590) no Hoare annotation was computed. [2019-11-27 22:34:40,825 INFO L246 CegarLoopResult]: For program point L171(lines 171 601) no Hoare annotation was computed. [2019-11-27 22:34:40,825 INFO L246 CegarLoopResult]: For program point L138(lines 138 612) no Hoare annotation was computed. [2019-11-27 22:34:40,825 INFO L246 CegarLoopResult]: For program point L105(lines 105 623) no Hoare annotation was computed. [2019-11-27 22:34:40,825 INFO L242 CegarLoopResult]: At program point L205(lines 204 590) the Hoare annotation is: (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) [2019-11-27 22:34:40,826 INFO L242 CegarLoopResult]: At program point L172(lines 168 602) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-11-27 22:34:40,826 INFO L242 CegarLoopResult]: At program point L139(lines 135 613) the Hoare annotation is: (let ((.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)))) (or (and (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse0 .cse1 .cse2 .cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse4 .cse5 .cse6 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse2 .cse3 .cse4 .cse5 .cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse6 .cse1))) [2019-11-27 22:34:40,827 INFO L246 CegarLoopResult]: For program point L73(lines 73 81) no Hoare annotation was computed. [2019-11-27 22:34:40,827 INFO L246 CegarLoopResult]: For program point L272(lines 272 276) no Hoare annotation was computed. [2019-11-27 22:34:40,827 INFO L246 CegarLoopResult]: For program point L570(lines 570 580) no Hoare annotation was computed. [2019-11-27 22:34:40,827 INFO L246 CegarLoopResult]: For program point L570-1(lines 570 580) no Hoare annotation was computed. [2019-11-27 22:34:40,827 INFO L246 CegarLoopResult]: For program point L306(lines 306 310) no Hoare annotation was computed. [2019-11-27 22:34:40,827 INFO L246 CegarLoopResult]: For program point L306-2(lines 209 586) no Hoare annotation was computed. [2019-11-27 22:34:40,827 INFO L246 CegarLoopResult]: For program point L174(lines 174 600) no Hoare annotation was computed. [2019-11-27 22:34:40,827 INFO L246 CegarLoopResult]: For program point L141(lines 141 611) no Hoare annotation was computed. [2019-11-27 22:34:40,828 INFO L246 CegarLoopResult]: For program point L108(lines 108 622) no Hoare annotation was computed. [2019-11-27 22:34:40,828 INFO L246 CegarLoopResult]: For program point L439-1(lines 439 451) no Hoare annotation was computed. [2019-11-27 22:34:40,828 INFO L242 CegarLoopResult]: At program point L208(lines 207 589) the Hoare annotation is: (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) [2019-11-27 22:34:40,828 INFO L246 CegarLoopResult]: For program point L76(lines 76 80) no Hoare annotation was computed. [2019-11-27 22:34:40,828 INFO L246 CegarLoopResult]: For program point L76-2(lines 73 81) no Hoare annotation was computed. [2019-11-27 22:34:40,828 INFO L249 CegarLoopResult]: At program point L671(lines 64 673) the Hoare annotation is: true [2019-11-27 22:34:40,828 INFO L246 CegarLoopResult]: For program point L638(lines 638 644) no Hoare annotation was computed. [2019-11-27 22:34:40,828 INFO L246 CegarLoopResult]: For program point L539(lines 539 544) no Hoare annotation was computed. [2019-11-27 22:34:40,829 INFO L242 CegarLoopResult]: At program point L407(lines 398 418) the Hoare annotation is: (let ((.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse0 .cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse2 .cse3 .cse4 .cse5 .cse6 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse1 .cse2 .cse3 .cse4 .cse0 .cse5 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse6))) [2019-11-27 22:34:40,829 INFO L246 CegarLoopResult]: For program point L341(lines 341 345) no Hoare annotation was computed. [2019-11-27 22:34:40,829 INFO L246 CegarLoopResult]: For program point L341-2(lines 209 586) no Hoare annotation was computed. [2019-11-27 22:34:40,829 INFO L249 CegarLoopResult]: At program point L672(lines 9 674) the Hoare annotation is: true [2019-11-27 22:34:40,829 INFO L246 CegarLoopResult]: For program point L573(lines 573 577) no Hoare annotation was computed. [2019-11-27 22:34:40,829 INFO L246 CegarLoopResult]: For program point L177(lines 177 599) no Hoare annotation was computed. [2019-11-27 22:34:40,829 INFO L246 CegarLoopResult]: For program point L144(lines 144 610) no Hoare annotation was computed. [2019-11-27 22:34:40,829 INFO L246 CegarLoopResult]: For program point L111(lines 111 621) no Hoare annotation was computed. [2019-11-27 22:34:40,829 INFO L246 CegarLoopResult]: For program point L442(lines 442 447) no Hoare annotation was computed. [2019-11-27 22:34:40,830 INFO L242 CegarLoopResult]: At program point L178(lines 174 600) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-11-27 22:34:40,830 INFO L242 CegarLoopResult]: At program point L145(lines 141 611) the Hoare annotation is: (let ((.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)))) (or (and (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse0 .cse1 .cse2 .cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse4 .cse5 .cse6 .cse7 .cse8 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse2 .cse3 .cse4 .cse5 .cse6 .cse0 .cse7 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse8 .cse1))) [2019-11-27 22:34:40,830 INFO L246 CegarLoopResult]: For program point L410(lines 410 414) no Hoare annotation was computed. [2019-11-27 22:34:40,830 INFO L242 CegarLoopResult]: At program point L212(lines 105 623) the Hoare annotation is: (let ((.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse0 .cse1 .cse2 .cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse4 .cse5 .cse6 .cse7 .cse8 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse2 .cse3 .cse4 .cse5 .cse6 .cse0 .cse7 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse8 .cse1))) [2019-11-27 22:34:40,830 INFO L246 CegarLoopResult]: For program point L510(lines 510 514) no Hoare annotation was computed. [2019-11-27 22:34:40,830 INFO L246 CegarLoopResult]: For program point L510-2(lines 510 514) no Hoare annotation was computed. [2019-11-27 22:34:40,831 INFO L246 CegarLoopResult]: For program point L180(lines 180 598) no Hoare annotation was computed. [2019-11-27 22:34:40,831 INFO L246 CegarLoopResult]: For program point L147(lines 147 609) no Hoare annotation was computed. [2019-11-27 22:34:40,831 INFO L246 CegarLoopResult]: For program point L114(lines 114 620) no Hoare annotation was computed. [2019-11-27 22:34:40,831 INFO L246 CegarLoopResult]: For program point L478(lines 478 482) no Hoare annotation was computed. [2019-11-27 22:34:40,831 INFO L246 CegarLoopResult]: For program point L83(lines 83 91) no Hoare annotation was computed. [2019-11-27 22:34:40,831 INFO L246 CegarLoopResult]: For program point L83-1(lines 64 673) no Hoare annotation was computed. [2019-11-27 22:34:40,831 INFO L246 CegarLoopResult]: For program point L183(lines 183 597) no Hoare annotation was computed. [2019-11-27 22:34:40,831 INFO L246 CegarLoopResult]: For program point L150(lines 150 608) no Hoare annotation was computed. [2019-11-27 22:34:40,831 INFO L246 CegarLoopResult]: For program point L117(lines 117 619) no Hoare annotation was computed. [2019-11-27 22:34:40,831 INFO L246 CegarLoopResult]: For program point L84(lines 84 88) no Hoare annotation was computed. [2019-11-27 22:34:40,832 INFO L246 CegarLoopResult]: For program point L349(lines 349 380) no Hoare annotation was computed. [2019-11-27 22:34:40,832 INFO L246 CegarLoopResult]: For program point L316(lines 316 320) no Hoare annotation was computed. [2019-11-27 22:34:40,832 INFO L246 CegarLoopResult]: For program point L316-2(lines 316 320) no Hoare annotation was computed. [2019-11-27 22:34:40,832 INFO L246 CegarLoopResult]: For program point L217(lines 217 221) no Hoare annotation was computed. [2019-11-27 22:34:40,832 INFO L242 CegarLoopResult]: At program point L184(lines 180 598) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-11-27 22:34:40,832 INFO L242 CegarLoopResult]: At program point L151(lines 147 609) the Hoare annotation is: (let ((.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)))) (or (and (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse0 .cse1 .cse2 .cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse4 .cse5 .cse6 .cse7 .cse8 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse2 .cse3 .cse4 .cse5 .cse6 .cse0 .cse7 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse8 .cse1))) [2019-11-27 22:34:40,832 INFO L246 CegarLoopResult]: For program point L217-2(lines 209 586) no Hoare annotation was computed. [2019-11-27 22:34:40,833 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-27 22:34:40,833 INFO L246 CegarLoopResult]: For program point L549(lines 549 553) no Hoare annotation was computed. [2019-11-27 22:34:40,833 INFO L246 CegarLoopResult]: For program point L186(lines 186 596) no Hoare annotation was computed. [2019-11-27 22:34:40,833 INFO L246 CegarLoopResult]: For program point L153(lines 153 607) no Hoare annotation was computed. [2019-11-27 22:34:40,833 INFO L246 CegarLoopResult]: For program point L120(lines 120 618) no Hoare annotation was computed. [2019-11-27 22:34:40,833 INFO L242 CegarLoopResult]: At program point L550(lines 64 673) the Hoare annotation is: false [2019-11-27 22:34:40,833 INFO L246 CegarLoopResult]: For program point L352(lines 352 379) no Hoare annotation was computed. [2019-11-27 22:34:40,833 INFO L246 CegarLoopResult]: For program point L352-1(lines 352 379) no Hoare annotation was computed. [2019-11-27 22:34:40,833 INFO L242 CegarLoopResult]: At program point L121(lines 117 619) the Hoare annotation is: (let ((.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)))) (or (and (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse0 .cse1 .cse2 .cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse4 .cse5 .cse6 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse2 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse3 .cse4 .cse5 .cse0 .cse6 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse1))) [2019-11-27 22:34:40,834 INFO L246 CegarLoopResult]: For program point L353(lines 353 376) no Hoare annotation was computed. [2019-11-27 22:34:40,834 INFO L246 CegarLoopResult]: For program point L254(lines 254 266) no Hoare annotation was computed. [2019-11-27 22:34:40,834 INFO L249 CegarLoopResult]: At program point L684(lines 675 686) the Hoare annotation is: true [2019-11-27 22:34:40,834 INFO L246 CegarLoopResult]: For program point L255(lines 255 260) no Hoare annotation was computed. [2019-11-27 22:34:40,834 INFO L246 CegarLoopResult]: For program point L189(lines 189 595) no Hoare annotation was computed. [2019-11-27 22:34:40,834 INFO L246 CegarLoopResult]: For program point L156(lines 156 606) no Hoare annotation was computed. [2019-11-27 22:34:40,834 INFO L246 CegarLoopResult]: For program point L123(lines 123 617) no Hoare annotation was computed. [2019-11-27 22:34:40,834 INFO L246 CegarLoopResult]: For program point L520(lines 520 525) no Hoare annotation was computed. [2019-11-27 22:34:40,834 INFO L246 CegarLoopResult]: For program point L388(lines 388 419) no Hoare annotation was computed. [2019-11-27 22:34:40,834 INFO L246 CegarLoopResult]: For program point L289(lines 289 293) no Hoare annotation was computed. [2019-11-27 22:34:40,835 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-27 22:34:40,835 INFO L246 CegarLoopResult]: For program point L289-2(lines 209 586) no Hoare annotation was computed. [2019-11-27 22:34:40,835 INFO L242 CegarLoopResult]: At program point L190(lines 186 596) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12))) [2019-11-27 22:34:40,835 INFO L242 CegarLoopResult]: At program point L157(lines 153 607) the Hoare annotation is: (let ((.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse0 .cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse2 .cse3 .cse4 .cse5 .cse6 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse1 .cse2 .cse3 .cse4 .cse0 .cse5 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse6))) [2019-11-27 22:34:40,835 INFO L242 CegarLoopResult]: At program point L124(lines 123 617) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) [2019-11-27 22:34:40,836 INFO L242 CegarLoopResult]: At program point L587(lines 99 655) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse2 (= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (.cse3 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3))) (or (<= ULTIMATE.start_ssl3_accept_~s__state~0 3) (and .cse0 .cse1 (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)) (and .cse1 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3) .cse2) (and .cse3 .cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)) (not .cse2) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (and .cse3 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (and .cse1 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-11-27 22:34:40,836 INFO L246 CegarLoopResult]: For program point L554(lines 554 558) no Hoare annotation was computed. [2019-11-27 22:34:40,836 INFO L246 CegarLoopResult]: For program point L389(lines 389 395) no Hoare annotation was computed. [2019-11-27 22:34:40,836 INFO L246 CegarLoopResult]: For program point L356(lines 356 375) no Hoare annotation was computed. [2019-11-27 22:34:40,836 INFO L246 CegarLoopResult]: For program point L489(lines 489 493) no Hoare annotation was computed. [2019-11-27 22:34:40,836 INFO L246 CegarLoopResult]: For program point L357(lines 357 361) no Hoare annotation was computed. [2019-11-27 22:34:40,836 INFO L246 CegarLoopResult]: For program point L357-2(lines 356 373) no Hoare annotation was computed. [2019-11-27 22:34:40,836 INFO L246 CegarLoopResult]: For program point L192(lines 192 594) no Hoare annotation was computed. [2019-11-27 22:34:40,836 INFO L246 CegarLoopResult]: For program point L159(lines 159 605) no Hoare annotation was computed. [2019-11-27 22:34:40,836 INFO L246 CegarLoopResult]: For program point L126(lines 126 616) no Hoare annotation was computed. [2019-11-27 22:34:40,836 INFO L246 CegarLoopResult]: For program point L457(lines 457 461) no Hoare annotation was computed. [2019-11-27 22:34:40,837 INFO L246 CegarLoopResult]: For program point L325-1(lines 325 334) no Hoare annotation was computed. [2019-11-27 22:34:40,837 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-27 22:34:40,837 INFO L249 CegarLoopResult]: At program point L656(lines 98 657) the Hoare annotation is: true [2019-11-27 22:34:40,837 INFO L246 CegarLoopResult]: For program point L195(lines 195 593) no Hoare annotation was computed. [2019-11-27 22:34:40,837 INFO L246 CegarLoopResult]: For program point L162(lines 162 604) no Hoare annotation was computed. [2019-11-27 22:34:40,837 INFO L246 CegarLoopResult]: For program point L129(lines 129 615) no Hoare annotation was computed. [2019-11-27 22:34:40,837 INFO L246 CegarLoopResult]: For program point L625(lines 625 653) no Hoare annotation was computed. [2019-11-27 22:34:40,837 INFO L246 CegarLoopResult]: For program point L229(lines 229 246) no Hoare annotation was computed. [2019-11-27 22:34:40,837 INFO L242 CegarLoopResult]: At program point L196(lines 192 594) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse5 .cse7 .cse10 .cse1 .cse2 .cse3 .cse4 .cse6 .cse8 .cse9 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-11-27 22:34:40,838 INFO L242 CegarLoopResult]: At program point L163(lines 159 605) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse11) (and (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-11-27 22:34:40,838 INFO L246 CegarLoopResult]: For program point L229-2(lines 209 586) no Hoare annotation was computed. [2019-11-27 22:34:40,838 INFO L246 CegarLoopResult]: For program point L626(lines 626 650) no Hoare annotation was computed. [2019-11-27 22:34:40,838 INFO L246 CegarLoopResult]: For program point L560(lines 560 564) no Hoare annotation was computed. [2019-11-27 22:34:40,838 INFO L246 CegarLoopResult]: For program point L527(lines 527 531) no Hoare annotation was computed. [2019-11-27 22:34:40,838 INFO L246 CegarLoopResult]: For program point L560-2(lines 560 564) no Hoare annotation was computed. [2019-11-27 22:34:40,838 INFO L246 CegarLoopResult]: For program point L527-2(lines 209 586) no Hoare annotation was computed. [2019-11-27 22:34:40,838 INFO L246 CegarLoopResult]: For program point L329(lines 329 333) no Hoare annotation was computed. [2019-11-27 22:34:40,838 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 667) no Hoare annotation was computed. [2019-11-27 22:34:40,839 INFO L246 CegarLoopResult]: For program point L660(lines 660 664) no Hoare annotation was computed. [2019-11-27 22:34:40,839 INFO L246 CegarLoopResult]: For program point L627(lines 627 636) no Hoare annotation was computed. [2019-11-27 22:34:40,839 INFO L246 CegarLoopResult]: For program point L660-2(lines 660 664) no Hoare annotation was computed. [2019-11-27 22:34:40,839 INFO L246 CegarLoopResult]: For program point L627-2(lines 626 648) no Hoare annotation was computed. [2019-11-27 22:34:40,839 INFO L246 CegarLoopResult]: For program point L462(lines 462 473) no Hoare annotation was computed. [2019-11-27 22:34:40,839 INFO L246 CegarLoopResult]: For program point L429(lines 429 433) no Hoare annotation was computed. [2019-11-27 22:34:40,839 INFO L242 CegarLoopResult]: At program point L363(lines 346 381) the Hoare annotation is: (let ((.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)))) (or (and (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse0 .cse1 .cse2 .cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse4 .cse5 .cse6 .cse7 .cse8 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse2 .cse3 .cse4 .cse5 .cse6 .cse0 .cse7 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse8 .cse1))) [2019-11-27 22:34:40,839 INFO L246 CegarLoopResult]: For program point L231(lines 231 236) no Hoare annotation was computed. [2019-11-27 22:34:40,839 INFO L246 CegarLoopResult]: For program point L198(lines 198 592) no Hoare annotation was computed. [2019-11-27 22:34:40,840 INFO L246 CegarLoopResult]: For program point L165(lines 165 603) no Hoare annotation was computed. [2019-11-27 22:34:40,840 INFO L246 CegarLoopResult]: For program point L132(lines 132 614) no Hoare annotation was computed. [2019-11-27 22:34:40,840 INFO L242 CegarLoopResult]: At program point L99-2(lines 99 655) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse2 (= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (.cse3 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3))) (or (<= ULTIMATE.start_ssl3_accept_~s__state~0 3) (and .cse0 .cse1 (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)) (and .cse1 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3) .cse2) (and .cse3 .cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)) (not .cse2) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (and .cse3 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (and .cse1 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-11-27 22:34:40,840 INFO L242 CegarLoopResult]: At program point L397(lines 388 419) the Hoare annotation is: (let ((.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse0 .cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse2 .cse3 .cse4 .cse5 .cse6 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse1 .cse2 .cse3 .cse4 .cse0 .cse5 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse6))) [2019-11-27 22:34:40,840 INFO L242 CegarLoopResult]: At program point L166(lines 165 603) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3)) (.cse1 (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (or (and .cse0 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3) .cse1) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse1) (and .cse0 .cse1 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-11-27 22:34:40,841 INFO L242 CegarLoopResult]: At program point L133(lines 126 616) the Hoare annotation is: (let ((.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)))) (or (and (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse0 .cse1 .cse2 .cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse4 .cse5 .cse6 .cse7 .cse8 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse2 .cse3 .cse4 .cse5 .cse6 .cse0 .cse7 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse8 .cse1))) [2019-11-27 22:34:40,841 INFO L246 CegarLoopResult]: For program point L100(line 100) no Hoare annotation was computed. [2019-11-27 22:34:40,841 INFO L246 CegarLoopResult]: For program point L629(lines 629 633) no Hoare annotation was computed. [2019-11-27 22:34:40,841 INFO L246 CegarLoopResult]: For program point L365(lines 365 369) no Hoare annotation was computed. [2019-11-27 22:34:40,886 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.11 10:34:40 BoogieIcfgContainer [2019-11-27 22:34:40,886 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-27 22:34:40,886 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-27 22:34:40,886 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-27 22:34:40,887 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-27 22:34:40,887 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 10:34:19" (3/4) ... [2019-11-27 22:34:40,891 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-27 22:34:40,913 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-27 22:34:40,914 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-27 22:34:41,019 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-27 22:34:41,019 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-27 22:34:41,020 INFO L168 Benchmark]: Toolchain (without parser) took 22667.00 ms. Allocated memory was 1.0 GB in the beginning and 1.8 GB in the end (delta: 722.5 MB). Free memory was 961.7 MB in the beginning and 762.6 MB in the end (delta: 199.1 MB). Peak memory consumption was 921.6 MB. Max. memory is 11.5 GB. [2019-11-27 22:34:41,021 INFO L168 Benchmark]: CDTParser took 0.29 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-27 22:34:41,021 INFO L168 Benchmark]: CACSL2BoogieTranslator took 582.75 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 93.8 MB). Free memory was 961.7 MB in the beginning and 1.1 GB in the end (delta: -121.2 MB). Peak memory consumption was 25.9 MB. Max. memory is 11.5 GB. [2019-11-27 22:34:41,021 INFO L168 Benchmark]: Boogie Procedure Inliner took 70.70 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.6 MB). Peak memory consumption was 8.6 MB. Max. memory is 11.5 GB. [2019-11-27 22:34:41,022 INFO L168 Benchmark]: Boogie Preprocessor took 41.92 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-27 22:34:41,022 INFO L168 Benchmark]: RCFGBuilder took 883.98 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 53.6 MB). Peak memory consumption was 53.6 MB. Max. memory is 11.5 GB. [2019-11-27 22:34:41,022 INFO L168 Benchmark]: TraceAbstraction took 20947.07 ms. Allocated memory was 1.1 GB in the beginning and 1.8 GB in the end (delta: 628.6 MB). Free memory was 1.0 GB in the beginning and 762.6 MB in the end (delta: 258.1 MB). Peak memory consumption was 886.7 MB. Max. memory is 11.5 GB. [2019-11-27 22:34:41,023 INFO L168 Benchmark]: Witness Printer took 132.60 ms. Allocated memory is still 1.8 GB. Free memory is still 762.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-27 22:34:41,024 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.29 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 582.75 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 93.8 MB). Free memory was 961.7 MB in the beginning and 1.1 GB in the end (delta: -121.2 MB). Peak memory consumption was 25.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 70.70 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.6 MB). Peak memory consumption was 8.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 41.92 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 883.98 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 53.6 MB). Peak memory consumption was 53.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 20947.07 ms. Allocated memory was 1.1 GB in the beginning and 1.8 GB in the end (delta: 628.6 MB). Free memory was 1.0 GB in the beginning and 762.6 MB in the end (delta: 258.1 MB). Peak memory consumption was 886.7 MB. Max. memory is 11.5 GB. * Witness Printer took 132.60 ms. Allocated memory is still 1.8 GB. Free memory is still 762.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 667]: 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: 126]: Loop Invariant Derived loop invariant: ((((((((((((((s__state <= 8672 && blastFlag <= 3) && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8656)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) && !(0 == s__hit)) || ((((((((((blastFlag <= 2 && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8560)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) && !(s__state == 8545)) - InvariantResult [Line: 207]: Loop Invariant Derived loop invariant: !(s__state == 8672) - InvariantResult [Line: 165]: Loop Invariant Derived loop invariant: (((blastFlag <= 3 && s__s3__tmp__next_state___0 <= 3) && s__state == 8448) || ((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 8576) && s__state == 8448)) || ((blastFlag <= 3 && s__state == 8448) && !(0 == s__hit)) - InvariantResult [Line: 123]: Loop Invariant Derived loop invariant: (((((((((((s__state <= 8672 && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8656)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480) - InvariantResult [Line: 398]: Loop Invariant Derived loop invariant: ((((((((((((s__state <= 8672 && blastFlag <= 3) && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8656)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) && !(0 == s__hit)) || ((((((((blastFlag <= 2 && !(s__state == 8561)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8560)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) - InvariantResult [Line: 153]: Loop Invariant Derived loop invariant: ((((((((((((s__state <= 8672 && blastFlag <= 3) && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8656)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) && !(0 == s__hit)) || ((((((((blastFlag <= 2 && !(s__state == 8561)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8560)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) - InvariantResult [Line: 346]: Loop Invariant Derived loop invariant: ((((((((((((((s__state <= 8672 && blastFlag <= 3) && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8656)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) && !(0 == s__hit)) || ((((((((((blastFlag <= 2 && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8560)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) && !(s__state == 8545)) - InvariantResult [Line: 9]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 186]: Loop Invariant Derived loop invariant: (((((((((((((s__state <= 8672 && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8656)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) && !(0 == s__hit)) || (((((((((((((blastFlag <= 2 && s__state <= 8672) && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8656)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) - InvariantResult [Line: 105]: Loop Invariant Derived loop invariant: ((((((((((((((blastFlag <= 3 && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8673)) && !(s__state == 8656)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) && !(0 == s__hit)) || ((((((((((blastFlag <= 2 && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8560)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) && !(s__state == 8545)) - InvariantResult [Line: 198]: Loop Invariant Derived loop invariant: (blastFlag <= 3 && 8672 <= s__state) && !(s__state == 12292) - InvariantResult [Line: 147]: Loop Invariant Derived loop invariant: ((((((((((((((s__state <= 8672 && blastFlag <= 3) && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8656)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) && !(0 == s__hit)) || ((((((((((blastFlag <= 2 && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8560)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) && !(s__state == 8545)) - InvariantResult [Line: 64]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 180]: Loop Invariant Derived loop invariant: (((((((((((((blastFlag <= 2 && s__state <= 8672) && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8656)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) || ((((((((((((((s__state <= 8672 && blastFlag <= 3) && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8656)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) && !(0 == s__hit)) - InvariantResult [Line: 98]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 388]: Loop Invariant Derived loop invariant: ((((((((((((s__state <= 8672 && blastFlag <= 3) && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8656)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) && !(0 == s__hit)) || ((((((((blastFlag <= 2 && !(s__state == 8561)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8560)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) - InvariantResult [Line: 141]: Loop Invariant Derived loop invariant: ((((((((((((((s__state <= 8672 && blastFlag <= 3) && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8656)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) && !(0 == s__hit)) || ((((((((((blastFlag <= 2 && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8560)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) && !(s__state == 8545)) - InvariantResult [Line: 675]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 102]: Loop Invariant Derived loop invariant: (((!(s__state == 8673) && blastFlag <= 3) && 8672 <= s__state) && !(s__state == 8672)) && !(0 == s__hit) - InvariantResult [Line: 174]: Loop Invariant Derived loop invariant: (((((((((((((blastFlag <= 2 && s__state <= 8672) && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8656)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) || ((((((((((((((s__state <= 8672 && blastFlag <= 3) && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8656)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) && !(0 == s__hit)) - InvariantResult [Line: 99]: Loop Invariant Derived loop invariant: ((((s__state <= 3 || ((s__state <= 8672 && blastFlag <= 3) && 8672 <= s__state)) || ((blastFlag <= 3 && s__s3__tmp__next_state___0 <= 3) && s__state == 8448)) || ((((((((blastFlag <= 2 && s__state <= 8672) && !(s__state == 8561)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8657)) && !(s__state == 8497)) && !(s__state == 8480)) && !(s__state == 8545))) || ((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8576)) || (blastFlag <= 3 && !(0 == s__hit)) - InvariantResult [Line: 64]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 135]: Loop Invariant Derived loop invariant: ((((((((((((s__state <= 8672 && blastFlag <= 3) && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8656)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8480)) && !(0 == s__hit)) || ((((((((blastFlag <= 2 && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8560)) && s__state <= 8576) && !(s__state == 8480)) && !(s__state == 8545)) - InvariantResult [Line: 99]: Loop Invariant Derived loop invariant: ((((s__state <= 3 || ((s__state <= 8672 && blastFlag <= 3) && 8672 <= s__state)) || ((blastFlag <= 3 && s__s3__tmp__next_state___0 <= 3) && s__state == 8448)) || ((((((((blastFlag <= 2 && s__state <= 8672) && !(s__state == 8561)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8657)) && !(s__state == 8497)) && !(s__state == 8480)) && !(s__state == 8545))) || ((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8576)) || (blastFlag <= 3 && !(0 == s__hit)) - InvariantResult [Line: 168]: Loop Invariant Derived loop invariant: (((((((((((((blastFlag <= 2 && s__state <= 8672) && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8656)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) || ((((((((((((((s__state <= 8672 && blastFlag <= 3) && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8656)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) && !(0 == s__hit)) - InvariantResult [Line: 204]: Loop Invariant Derived loop invariant: !(s__state == 8672) - InvariantResult [Line: 159]: Loop Invariant Derived loop invariant: (((((((((((((blastFlag <= 2 && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 12292)) && !(s__state == 8545)) && !(s__state == 8544)) && !(s__state == 8673)) && !(s__state == 8656)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) || ((((((((((((((s__state <= 8672 && blastFlag <= 3) && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 12292)) && !(s__state == 8545)) && !(s__state == 8544)) && !(s__state == 8673)) && !(s__state == 8656)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) && !(0 == s__hit)) - InvariantResult [Line: 117]: Loop Invariant Derived loop invariant: ((((((((((((s__state <= 8672 && blastFlag <= 3) && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(0 == s__hit)) || (((((((((blastFlag <= 2 && !(s__state == 8561)) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8544)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8560)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8545)) - InvariantResult [Line: 192]: Loop Invariant Derived loop invariant: (((((((((((blastFlag <= 2 && s__state <= 8672) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8672)) && !(s__state == 8497)) && !(s__state == 8560)) && !(s__state == 8496)) && !(s__state == 8480)) && !(s__state == 8545)) || ((((((((((((s__state <= 8672 && blastFlag <= 3) && !(s__state == 8672)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) && !(0 == s__hit)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 137 locations, 1 error locations. Result: SAFE, OverallTime: 15.9s, OverallIterations: 31, TraceHistogramMax: 19, AutomataDifference: 6.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 4.8s, HoareTripleCheckerStatistics: 5245 SDtfs, 3316 SDslu, 2433 SDs, 0 SdLazy, 2970 SolverSat, 875 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2452 GetRequests, 2417 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3784occurred in iteration=20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.8s AutomataMinimizationTime, 31 MinimizatonAttempts, 1865 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 29 LocationsWithAnnotation, 29 PreInvPairs, 377 NumberOfFragments, 1906 HoareAnnotationTreeSize, 29 FomulaSimplifications, 40806 FormulaSimplificationTreeSizeReduction, 0.9s HoareSimplificationTime, 29 FomulaSimplificationsInter, 6404 FormulaSimplificationTreeSizeReductionInter, 3.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 7192 NumberOfCodeBlocks, 7192 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 7159 ConstructedInterpolants, 0 QuantifiedInterpolants, 2978515 SizeOfPredicates, 6 NumberOfNonLiveVariables, 3918 ConjunctsInSsa, 22 ConjunctsInUnsatCore, 33 InterpolantComputations, 29 PerfectInterpolantSequences, 24782/24886 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...