./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/systemc/pc_sfifo_1.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_2279c3c7-69c1-49d7-8784-2f49eea7617c/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_2279c3c7-69c1-49d7-8784-2f49eea7617c/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_2279c3c7-69c1-49d7-8784-2f49eea7617c/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_2279c3c7-69c1-49d7-8784-2f49eea7617c/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/systemc/pc_sfifo_1.cil-2.c -s /tmp/vcloud-vcloud-master/worker/working_dir_2279c3c7-69c1-49d7-8784-2f49eea7617c/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_2279c3c7-69c1-49d7-8784-2f49eea7617c/bin/uautomizer --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 aa63abe8d244d72d8b78f82e911235dbe511cfc8 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-10-22 08:59:37,007 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 08:59:37,010 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 08:59:37,020 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 08:59:37,021 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 08:59:37,022 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 08:59:37,023 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 08:59:37,025 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 08:59:37,027 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 08:59:37,030 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 08:59:37,031 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 08:59:37,032 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 08:59:37,037 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 08:59:37,039 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 08:59:37,040 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 08:59:37,041 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 08:59:37,041 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 08:59:37,042 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 08:59:37,045 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 08:59:37,047 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 08:59:37,048 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 08:59:37,048 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 08:59:37,049 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 08:59:37,050 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 08:59:37,056 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 08:59:37,057 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 08:59:37,057 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 08:59:37,058 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 08:59:37,059 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 08:59:37,060 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 08:59:37,061 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 08:59:37,061 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 08:59:37,062 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 08:59:37,062 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 08:59:37,063 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 08:59:37,063 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 08:59:37,063 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 08:59:37,064 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 08:59:37,064 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 08:59:37,064 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 08:59:37,065 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 08:59:37,065 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_2279c3c7-69c1-49d7-8784-2f49eea7617c/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-22 08:59:37,079 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 08:59:37,079 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 08:59:37,080 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 08:59:37,081 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 08:59:37,081 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 08:59:37,081 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 08:59:37,081 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 08:59:37,081 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 08:59:37,081 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 08:59:37,082 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 08:59:37,082 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-22 08:59:37,082 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-22 08:59:37,092 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-22 08:59:37,092 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 08:59:37,092 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 08:59:37,092 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 08:59:37,092 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-22 08:59:37,093 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 08:59:37,093 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 08:59:37,093 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-22 08:59:37,093 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-22 08:59:37,093 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 08:59:37,094 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 08:59:37,094 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-22 08:59:37,094 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-22 08:59:37,094 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 08:59:37,094 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-22 08:59:37,094 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-22 08:59:37,095 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_2279c3c7-69c1-49d7-8784-2f49eea7617c/bin/uautomizer 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 -> aa63abe8d244d72d8b78f82e911235dbe511cfc8 [2019-10-22 08:59:37,130 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 08:59:37,140 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 08:59:37,143 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 08:59:37,144 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 08:59:37,144 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 08:59:37,145 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_2279c3c7-69c1-49d7-8784-2f49eea7617c/bin/uautomizer/../../sv-benchmarks/c/systemc/pc_sfifo_1.cil-2.c [2019-10-22 08:59:37,204 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_2279c3c7-69c1-49d7-8784-2f49eea7617c/bin/uautomizer/data/1899f1d9b/0829f4b46ff4451cbf214ec15c078aeb/FLAGf92796907 [2019-10-22 08:59:37,586 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 08:59:37,587 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_2279c3c7-69c1-49d7-8784-2f49eea7617c/sv-benchmarks/c/systemc/pc_sfifo_1.cil-2.c [2019-10-22 08:59:37,595 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_2279c3c7-69c1-49d7-8784-2f49eea7617c/bin/uautomizer/data/1899f1d9b/0829f4b46ff4451cbf214ec15c078aeb/FLAGf92796907 [2019-10-22 08:59:37,608 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_2279c3c7-69c1-49d7-8784-2f49eea7617c/bin/uautomizer/data/1899f1d9b/0829f4b46ff4451cbf214ec15c078aeb [2019-10-22 08:59:37,611 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 08:59:37,612 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 08:59:37,613 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 08:59:37,613 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 08:59:37,617 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 08:59:37,617 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:59:37" (1/1) ... [2019-10-22 08:59:37,620 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e6d2bfc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:37, skipping insertion in model container [2019-10-22 08:59:37,620 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:59:37" (1/1) ... [2019-10-22 08:59:37,627 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 08:59:37,650 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 08:59:37,865 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:59:37,869 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 08:59:37,905 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:59:37,922 INFO L192 MainTranslator]: Completed translation [2019-10-22 08:59:37,923 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:37 WrapperNode [2019-10-22 08:59:37,923 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 08:59:37,923 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 08:59:37,924 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 08:59:37,924 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 08:59:37,932 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:37" (1/1) ... [2019-10-22 08:59:37,938 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:37" (1/1) ... [2019-10-22 08:59:37,963 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 08:59:37,963 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 08:59:37,963 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 08:59:37,970 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 08:59:37,979 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:37" (1/1) ... [2019-10-22 08:59:37,979 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:37" (1/1) ... [2019-10-22 08:59:37,981 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:37" (1/1) ... [2019-10-22 08:59:37,983 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:37" (1/1) ... [2019-10-22 08:59:37,988 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:37" (1/1) ... [2019-10-22 08:59:38,006 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:37" (1/1) ... [2019-10-22 08:59:38,010 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:37" (1/1) ... [2019-10-22 08:59:38,018 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 08:59:38,018 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 08:59:38,018 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 08:59:38,018 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 08:59:38,019 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:37" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2279c3c7-69c1-49d7-8784-2f49eea7617c/bin/uautomizer/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-10-22 08:59:38,099 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 08:59:38,099 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 08:59:38,501 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 08:59:38,502 INFO L284 CfgBuilder]: Removed 42 assume(true) statements. [2019-10-22 08:59:38,503 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:59:38 BoogieIcfgContainer [2019-10-22 08:59:38,503 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 08:59:38,504 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-22 08:59:38,504 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-22 08:59:38,507 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-22 08:59:38,507 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 08:59:37" (1/3) ... [2019-10-22 08:59:38,508 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37a60de8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 08:59:38, skipping insertion in model container [2019-10-22 08:59:38,509 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:37" (2/3) ... [2019-10-22 08:59:38,509 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37a60de8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 08:59:38, skipping insertion in model container [2019-10-22 08:59:38,509 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:59:38" (3/3) ... [2019-10-22 08:59:38,511 INFO L109 eAbstractionObserver]: Analyzing ICFG pc_sfifo_1.cil-2.c [2019-10-22 08:59:38,520 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-22 08:59:38,526 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-10-22 08:59:38,536 INFO L249 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-10-22 08:59:38,557 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-22 08:59:38,557 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-22 08:59:38,557 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-22 08:59:38,557 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 08:59:38,558 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 08:59:38,558 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-22 08:59:38,558 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 08:59:38,558 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-22 08:59:38,572 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states. [2019-10-22 08:59:38,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-10-22 08:59:38,581 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:59:38,582 INFO L380 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] [2019-10-22 08:59:38,584 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:59:38,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:38,594 INFO L82 PathProgramCache]: Analyzing trace with hash -1325512836, now seen corresponding path program 1 times [2019-10-22 08:59:38,602 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:38,603 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967794455] [2019-10-22 08:59:38,604 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:38,604 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:38,604 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:38,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:38,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:59:38,738 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967794455] [2019-10-22 08:59:38,738 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:59:38,739 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:59:38,739 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587069160] [2019-10-22 08:59:38,743 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:59:38,744 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:59:38,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:59:38,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:59:38,758 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 3 states. [2019-10-22 08:59:38,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:59:38,830 INFO L93 Difference]: Finished difference Result 214 states and 326 transitions. [2019-10-22 08:59:38,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:59:38,831 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2019-10-22 08:59:38,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:59:38,842 INFO L225 Difference]: With dead ends: 214 [2019-10-22 08:59:38,842 INFO L226 Difference]: Without dead ends: 135 [2019-10-22 08:59:38,845 INFO L600 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-10-22 08:59:38,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-10-22 08:59:38,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 114. [2019-10-22 08:59:38,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-10-22 08:59:38,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 160 transitions. [2019-10-22 08:59:38,888 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 160 transitions. Word has length 34 [2019-10-22 08:59:38,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:59:38,888 INFO L462 AbstractCegarLoop]: Abstraction has 114 states and 160 transitions. [2019-10-22 08:59:38,888 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:59:38,888 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 160 transitions. [2019-10-22 08:59:38,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-10-22 08:59:38,890 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:59:38,890 INFO L380 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] [2019-10-22 08:59:38,890 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:59:38,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:38,891 INFO L82 PathProgramCache]: Analyzing trace with hash 317140105, now seen corresponding path program 1 times [2019-10-22 08:59:38,891 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:38,891 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523996584] [2019-10-22 08:59:38,891 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:38,891 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:38,892 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:38,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:38,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:59:38,933 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523996584] [2019-10-22 08:59:38,933 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:59:38,933 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:59:38,933 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015959368] [2019-10-22 08:59:38,935 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:59:38,935 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:59:38,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:59:38,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:59:38,936 INFO L87 Difference]: Start difference. First operand 114 states and 160 transitions. Second operand 3 states. [2019-10-22 08:59:38,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:59:38,981 INFO L93 Difference]: Finished difference Result 323 states and 450 transitions. [2019-10-22 08:59:38,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:59:38,981 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2019-10-22 08:59:38,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:59:38,983 INFO L225 Difference]: With dead ends: 323 [2019-10-22 08:59:38,983 INFO L226 Difference]: Without dead ends: 215 [2019-10-22 08:59:38,985 INFO L600 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-10-22 08:59:38,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2019-10-22 08:59:39,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 211. [2019-10-22 08:59:39,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2019-10-22 08:59:39,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 292 transitions. [2019-10-22 08:59:39,005 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 292 transitions. Word has length 35 [2019-10-22 08:59:39,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:59:39,006 INFO L462 AbstractCegarLoop]: Abstraction has 211 states and 292 transitions. [2019-10-22 08:59:39,006 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:59:39,006 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 292 transitions. [2019-10-22 08:59:39,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-10-22 08:59:39,007 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:59:39,008 INFO L380 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] [2019-10-22 08:59:39,008 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:59:39,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:39,008 INFO L82 PathProgramCache]: Analyzing trace with hash -658420813, now seen corresponding path program 1 times [2019-10-22 08:59:39,009 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:39,009 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825140870] [2019-10-22 08:59:39,009 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:39,009 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:39,009 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:39,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:39,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:59:39,078 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825140870] [2019-10-22 08:59:39,078 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:59:39,078 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:59:39,078 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445133025] [2019-10-22 08:59:39,079 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:59:39,079 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:59:39,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:59:39,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:59:39,080 INFO L87 Difference]: Start difference. First operand 211 states and 292 transitions. Second operand 3 states. [2019-10-22 08:59:39,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:59:39,123 INFO L93 Difference]: Finished difference Result 526 states and 727 transitions. [2019-10-22 08:59:39,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:59:39,124 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2019-10-22 08:59:39,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:59:39,125 INFO L225 Difference]: With dead ends: 526 [2019-10-22 08:59:39,126 INFO L226 Difference]: Without dead ends: 321 [2019-10-22 08:59:39,126 INFO L600 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-10-22 08:59:39,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2019-10-22 08:59:39,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 297. [2019-10-22 08:59:39,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2019-10-22 08:59:39,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 408 transitions. [2019-10-22 08:59:39,170 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 408 transitions. Word has length 35 [2019-10-22 08:59:39,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:59:39,170 INFO L462 AbstractCegarLoop]: Abstraction has 297 states and 408 transitions. [2019-10-22 08:59:39,177 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:59:39,177 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 408 transitions. [2019-10-22 08:59:39,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-10-22 08:59:39,179 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:59:39,179 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-10-22 08:59:39,180 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:59:39,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:39,180 INFO L82 PathProgramCache]: Analyzing trace with hash -1720921163, now seen corresponding path program 1 times [2019-10-22 08:59:39,180 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:39,180 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484712721] [2019-10-22 08:59:39,180 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:39,181 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:39,181 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:39,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:39,264 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:59:39,264 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484712721] [2019-10-22 08:59:39,264 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:59:39,264 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:59:39,265 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091002964] [2019-10-22 08:59:39,265 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:59:39,265 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:59:39,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:59:39,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:59:39,266 INFO L87 Difference]: Start difference. First operand 297 states and 408 transitions. Second operand 3 states. [2019-10-22 08:59:39,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:59:39,351 INFO L93 Difference]: Finished difference Result 740 states and 1007 transitions. [2019-10-22 08:59:39,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:59:39,353 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2019-10-22 08:59:39,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:59:39,355 INFO L225 Difference]: With dead ends: 740 [2019-10-22 08:59:39,355 INFO L226 Difference]: Without dead ends: 449 [2019-10-22 08:59:39,356 INFO L600 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-10-22 08:59:39,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2019-10-22 08:59:39,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 449. [2019-10-22 08:59:39,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 449 states. [2019-10-22 08:59:39,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 592 transitions. [2019-10-22 08:59:39,405 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 592 transitions. Word has length 48 [2019-10-22 08:59:39,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:59:39,405 INFO L462 AbstractCegarLoop]: Abstraction has 449 states and 592 transitions. [2019-10-22 08:59:39,405 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:59:39,406 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 592 transitions. [2019-10-22 08:59:39,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-10-22 08:59:39,407 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:59:39,408 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:59:39,408 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:59:39,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:39,408 INFO L82 PathProgramCache]: Analyzing trace with hash 1954870014, now seen corresponding path program 1 times [2019-10-22 08:59:39,408 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:39,408 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923500645] [2019-10-22 08:59:39,409 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:39,409 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:39,409 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:39,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:39,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:59:39,467 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923500645] [2019-10-22 08:59:39,467 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:59:39,467 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:59:39,468 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080586482] [2019-10-22 08:59:39,468 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:59:39,468 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:59:39,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:59:39,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:59:39,469 INFO L87 Difference]: Start difference. First operand 449 states and 592 transitions. Second operand 3 states. [2019-10-22 08:59:39,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:59:39,523 INFO L93 Difference]: Finished difference Result 914 states and 1200 transitions. [2019-10-22 08:59:39,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:59:39,524 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-10-22 08:59:39,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:59:39,526 INFO L225 Difference]: With dead ends: 914 [2019-10-22 08:59:39,526 INFO L226 Difference]: Without dead ends: 555 [2019-10-22 08:59:39,527 INFO L600 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-10-22 08:59:39,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2019-10-22 08:59:39,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 555. [2019-10-22 08:59:39,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 555 states. [2019-10-22 08:59:39,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 718 transitions. [2019-10-22 08:59:39,560 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 718 transitions. Word has length 52 [2019-10-22 08:59:39,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:59:39,561 INFO L462 AbstractCegarLoop]: Abstraction has 555 states and 718 transitions. [2019-10-22 08:59:39,561 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:59:39,561 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 718 transitions. [2019-10-22 08:59:39,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-10-22 08:59:39,566 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:59:39,567 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:59:39,567 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:59:39,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:39,567 INFO L82 PathProgramCache]: Analyzing trace with hash -1072726839, now seen corresponding path program 1 times [2019-10-22 08:59:39,567 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:39,568 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509061604] [2019-10-22 08:59:39,568 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:39,568 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:39,568 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:39,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:39,629 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-22 08:59:39,629 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509061604] [2019-10-22 08:59:39,629 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:59:39,630 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:59:39,630 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391904874] [2019-10-22 08:59:39,630 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:59:39,630 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:59:39,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:59:39,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:59:39,631 INFO L87 Difference]: Start difference. First operand 555 states and 718 transitions. Second operand 3 states. [2019-10-22 08:59:39,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:59:39,683 INFO L93 Difference]: Finished difference Result 970 states and 1263 transitions. [2019-10-22 08:59:39,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:59:39,684 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-10-22 08:59:39,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:59:39,686 INFO L225 Difference]: With dead ends: 970 [2019-10-22 08:59:39,686 INFO L226 Difference]: Without dead ends: 553 [2019-10-22 08:59:39,687 INFO L600 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-10-22 08:59:39,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2019-10-22 08:59:39,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 512. [2019-10-22 08:59:39,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 512 states. [2019-10-22 08:59:39,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 649 transitions. [2019-10-22 08:59:39,705 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 649 transitions. Word has length 53 [2019-10-22 08:59:39,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:59:39,705 INFO L462 AbstractCegarLoop]: Abstraction has 512 states and 649 transitions. [2019-10-22 08:59:39,705 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:59:39,706 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 649 transitions. [2019-10-22 08:59:39,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-10-22 08:59:39,709 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:59:39,709 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:59:39,710 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:59:39,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:39,717 INFO L82 PathProgramCache]: Analyzing trace with hash -68365718, now seen corresponding path program 1 times [2019-10-22 08:59:39,717 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:39,717 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002737464] [2019-10-22 08:59:39,717 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:39,718 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:39,718 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:39,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:39,765 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:59:39,765 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002737464] [2019-10-22 08:59:39,765 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:59:39,765 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 08:59:39,766 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165632048] [2019-10-22 08:59:39,766 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 08:59:39,766 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:59:39,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:59:39,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:59:39,771 INFO L87 Difference]: Start difference. First operand 512 states and 649 transitions. Second operand 4 states. [2019-10-22 08:59:39,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:59:39,814 INFO L93 Difference]: Finished difference Result 557 states and 702 transitions. [2019-10-22 08:59:39,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 08:59:39,814 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 53 [2019-10-22 08:59:39,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:59:39,817 INFO L225 Difference]: With dead ends: 557 [2019-10-22 08:59:39,817 INFO L226 Difference]: Without dead ends: 555 [2019-10-22 08:59:39,817 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-10-22 08:59:39,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2019-10-22 08:59:39,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 510. [2019-10-22 08:59:39,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 510 states. [2019-10-22 08:59:39,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 646 transitions. [2019-10-22 08:59:39,851 INFO L78 Accepts]: Start accepts. Automaton has 510 states and 646 transitions. Word has length 53 [2019-10-22 08:59:39,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:59:39,851 INFO L462 AbstractCegarLoop]: Abstraction has 510 states and 646 transitions. [2019-10-22 08:59:39,851 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 08:59:39,852 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 646 transitions. [2019-10-22 08:59:39,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-10-22 08:59:39,853 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:59:39,853 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:59:39,853 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:59:39,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:39,854 INFO L82 PathProgramCache]: Analyzing trace with hash -2119348827, now seen corresponding path program 1 times [2019-10-22 08:59:39,854 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:39,854 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502454911] [2019-10-22 08:59:39,855 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:39,855 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:39,855 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:39,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:39,964 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:59:39,964 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502454911] [2019-10-22 08:59:39,965 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [5046323] [2019-10-22 08:59:39,965 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2279c3c7-69c1-49d7-8784-2f49eea7617c/bin/uautomizer/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-10-22 08:59:40,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:40,030 INFO L256 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-22 08:59:40,036 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:59:40,103 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:59:40,104 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 08:59:40,104 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 7 [2019-10-22 08:59:40,104 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293656410] [2019-10-22 08:59:40,106 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-22 08:59:40,107 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:59:40,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-22 08:59:40,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-10-22 08:59:40,108 INFO L87 Difference]: Start difference. First operand 510 states and 646 transitions. Second operand 7 states. [2019-10-22 08:59:40,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:59:40,192 INFO L93 Difference]: Finished difference Result 1064 states and 1348 transitions. [2019-10-22 08:59:40,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-22 08:59:40,193 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-10-22 08:59:40,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:59:40,196 INFO L225 Difference]: With dead ends: 1064 [2019-10-22 08:59:40,196 INFO L226 Difference]: Without dead ends: 1062 [2019-10-22 08:59:40,197 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-10-22 08:59:40,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1062 states. [2019-10-22 08:59:40,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1062 to 761. [2019-10-22 08:59:40,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 761 states. [2019-10-22 08:59:40,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 761 states to 761 states and 971 transitions. [2019-10-22 08:59:40,237 INFO L78 Accepts]: Start accepts. Automaton has 761 states and 971 transitions. Word has length 54 [2019-10-22 08:59:40,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:59:40,237 INFO L462 AbstractCegarLoop]: Abstraction has 761 states and 971 transitions. [2019-10-22 08:59:40,237 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-22 08:59:40,237 INFO L276 IsEmpty]: Start isEmpty. Operand 761 states and 971 transitions. [2019-10-22 08:59:40,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-10-22 08:59:40,239 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:59:40,240 INFO L380 BasicCegarLoop]: trace histogram [3, 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-10-22 08:59:40,440 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:59:40,441 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:59:40,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:40,441 INFO L82 PathProgramCache]: Analyzing trace with hash -797889608, now seen corresponding path program 2 times [2019-10-22 08:59:40,441 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:40,441 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075304410] [2019-10-22 08:59:40,442 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:40,442 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:40,442 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:40,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:40,481 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:59:40,482 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075304410] [2019-10-22 08:59:40,483 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:59:40,483 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:59:40,483 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301478294] [2019-10-22 08:59:40,483 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:59:40,484 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:59:40,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:59:40,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:59:40,484 INFO L87 Difference]: Start difference. First operand 761 states and 971 transitions. Second operand 3 states. [2019-10-22 08:59:40,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:59:40,539 INFO L93 Difference]: Finished difference Result 1240 states and 1589 transitions. [2019-10-22 08:59:40,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:59:40,540 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2019-10-22 08:59:40,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:59:40,542 INFO L225 Difference]: With dead ends: 1240 [2019-10-22 08:59:40,542 INFO L226 Difference]: Without dead ends: 705 [2019-10-22 08:59:40,543 INFO L600 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-10-22 08:59:40,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 705 states. [2019-10-22 08:59:40,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 705 to 685. [2019-10-22 08:59:40,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 685 states. [2019-10-22 08:59:40,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 685 states to 685 states and 860 transitions. [2019-10-22 08:59:40,604 INFO L78 Accepts]: Start accepts. Automaton has 685 states and 860 transitions. Word has length 69 [2019-10-22 08:59:40,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:59:40,604 INFO L462 AbstractCegarLoop]: Abstraction has 685 states and 860 transitions. [2019-10-22 08:59:40,604 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:59:40,605 INFO L276 IsEmpty]: Start isEmpty. Operand 685 states and 860 transitions. [2019-10-22 08:59:40,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-10-22 08:59:40,606 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:59:40,606 INFO L380 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:59:40,606 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:59:40,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:40,607 INFO L82 PathProgramCache]: Analyzing trace with hash -5008021, now seen corresponding path program 1 times [2019-10-22 08:59:40,607 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:40,607 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275790667] [2019-10-22 08:59:40,607 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:40,607 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:40,612 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:40,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:40,646 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:59:40,647 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275790667] [2019-10-22 08:59:40,647 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:59:40,647 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:59:40,647 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118837442] [2019-10-22 08:59:40,648 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:59:40,648 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:59:40,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:59:40,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:59:40,649 INFO L87 Difference]: Start difference. First operand 685 states and 860 transitions. Second operand 3 states. [2019-10-22 08:59:40,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:59:40,696 INFO L93 Difference]: Finished difference Result 1271 states and 1598 transitions. [2019-10-22 08:59:40,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:59:40,697 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 80 [2019-10-22 08:59:40,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:59:40,699 INFO L225 Difference]: With dead ends: 1271 [2019-10-22 08:59:40,699 INFO L226 Difference]: Without dead ends: 703 [2019-10-22 08:59:40,700 INFO L600 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-10-22 08:59:40,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 703 states. [2019-10-22 08:59:40,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 703 to 685. [2019-10-22 08:59:40,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 685 states. [2019-10-22 08:59:40,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 685 states to 685 states and 840 transitions. [2019-10-22 08:59:40,729 INFO L78 Accepts]: Start accepts. Automaton has 685 states and 840 transitions. Word has length 80 [2019-10-22 08:59:40,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:59:40,729 INFO L462 AbstractCegarLoop]: Abstraction has 685 states and 840 transitions. [2019-10-22 08:59:40,729 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:59:40,729 INFO L276 IsEmpty]: Start isEmpty. Operand 685 states and 840 transitions. [2019-10-22 08:59:40,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-10-22 08:59:40,731 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:59:40,731 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:59:40,731 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:59:40,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:40,731 INFO L82 PathProgramCache]: Analyzing trace with hash 184036267, now seen corresponding path program 1 times [2019-10-22 08:59:40,732 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:40,732 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187591390] [2019-10-22 08:59:40,732 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:40,732 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:40,732 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:40,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:40,748 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-10-22 08:59:40,749 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187591390] [2019-10-22 08:59:40,749 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:59:40,749 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:59:40,749 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543524606] [2019-10-22 08:59:40,749 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:59:40,749 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:59:40,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:59:40,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:59:40,750 INFO L87 Difference]: Start difference. First operand 685 states and 840 transitions. Second operand 3 states. [2019-10-22 08:59:40,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:59:40,777 INFO L93 Difference]: Finished difference Result 1147 states and 1413 transitions. [2019-10-22 08:59:40,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:59:40,777 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 80 [2019-10-22 08:59:40,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:59:40,779 INFO L225 Difference]: With dead ends: 1147 [2019-10-22 08:59:40,779 INFO L226 Difference]: Without dead ends: 574 [2019-10-22 08:59:40,780 INFO L600 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-10-22 08:59:40,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2019-10-22 08:59:40,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 574. [2019-10-22 08:59:40,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 574 states. [2019-10-22 08:59:40,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 706 transitions. [2019-10-22 08:59:40,807 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 706 transitions. Word has length 80 [2019-10-22 08:59:40,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:59:40,807 INFO L462 AbstractCegarLoop]: Abstraction has 574 states and 706 transitions. [2019-10-22 08:59:40,807 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:59:40,807 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 706 transitions. [2019-10-22 08:59:40,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-10-22 08:59:40,809 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:59:40,809 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:59:40,809 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:59:40,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:40,810 INFO L82 PathProgramCache]: Analyzing trace with hash -1014536047, now seen corresponding path program 1 times [2019-10-22 08:59:40,810 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:40,810 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478316106] [2019-10-22 08:59:40,810 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:40,811 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:40,811 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:40,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:40,838 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-22 08:59:40,839 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478316106] [2019-10-22 08:59:40,839 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:59:40,839 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:59:40,839 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644678010] [2019-10-22 08:59:40,840 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:59:40,840 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:59:40,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:59:40,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:59:40,840 INFO L87 Difference]: Start difference. First operand 574 states and 706 transitions. Second operand 3 states. [2019-10-22 08:59:40,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:59:40,881 INFO L93 Difference]: Finished difference Result 812 states and 995 transitions. [2019-10-22 08:59:40,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:59:40,882 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 81 [2019-10-22 08:59:40,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:59:40,883 INFO L225 Difference]: With dead ends: 812 [2019-10-22 08:59:40,883 INFO L226 Difference]: Without dead ends: 0 [2019-10-22 08:59:40,884 INFO L600 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-10-22 08:59:40,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-22 08:59:40,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-22 08:59:40,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-22 08:59:40,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-22 08:59:40,885 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 81 [2019-10-22 08:59:40,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:59:40,885 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:59:40,885 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:59:40,885 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-22 08:59:40,885 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-22 08:59:40,890 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-22 08:59:41,899 WARN L191 SmtUtils]: Spent 312.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 46 [2019-10-22 08:59:42,266 WARN L191 SmtUtils]: Spent 320.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 46 [2019-10-22 08:59:42,578 WARN L191 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 46 [2019-10-22 08:59:43,061 WARN L191 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 46 [2019-10-22 08:59:43,310 WARN L191 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 46 [2019-10-22 08:59:43,532 WARN L191 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 37 [2019-10-22 08:59:43,791 WARN L191 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 46 [2019-10-22 08:59:43,983 WARN L191 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 46 [2019-10-22 08:59:44,234 WARN L191 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 46 [2019-10-22 08:59:44,458 WARN L191 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 46 [2019-10-22 08:59:44,682 WARN L191 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 46 [2019-10-22 08:59:44,693 INFO L443 ceAbstractionStarter]: For program point L151(lines 150 185) no Hoare annotation was computed. [2019-10-22 08:59:44,693 INFO L443 ceAbstractionStarter]: For program point L52(lines 52 57) no Hoare annotation was computed. [2019-10-22 08:59:44,693 INFO L443 ceAbstractionStarter]: For program point L52-1(lines 52 57) no Hoare annotation was computed. [2019-10-22 08:59:44,693 INFO L439 ceAbstractionStarter]: At program point L300(lines 284 302) the Hoare annotation is: (let ((.cse12 (<= 2 ~c_dr_st~0)) (.cse16 (= ~p_dw_pc~0 1)) (.cse9 (= ~p_last_write~0 ~q_buf_0~0))) (let ((.cse2 (and .cse12 .cse16 .cse9)) (.cse13 (<= ~c_num_read~0 ~p_num_write~0)) (.cse14 (<= ~p_num_write~0 ~c_num_read~0)) (.cse0 (= 0 ~q_free~0)) (.cse1 (<= 2 ~p_dw_st~0)) (.cse4 (= ~c_num_read~0 0)) (.cse5 (= ~q_free~0 1)) (.cse6 (= ~c_last_read~0 ~p_last_write~0)) (.cse15 (= 0 ~p_dw_st~0)) (.cse7 (= ~c_dr_pc~0 0)) (.cse8 (= 0 ~p_dw_pc~0)) (.cse10 (= ~c_dr_st~0 0)) (.cse3 (= ~c_dr_i~0 1)) (.cse11 (= 0 ~p_num_write~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse1 .cse6 .cse7 .cse8 .cse9 .cse10 .cse3 .cse11) (and .cse4 .cse5 .cse1 .cse12 .cse6 .cse8 .cse9 .cse3 .cse11) (and (and .cse13 .cse14 .cse2) .cse1 .cse3) (and .cse4 .cse5 .cse12 .cse6 .cse15 .cse8 .cse9 .cse3 .cse11) (and (and .cse13 .cse14 .cse12 .cse16 .cse15 .cse9) .cse3) (and .cse0 .cse1 (let ((.cse17 (+ ~c_num_read~0 1))) (and (<= .cse17 ~p_num_write~0) .cse16 (<= ~p_num_write~0 .cse17) .cse9)) .cse10 .cse3) (and .cse4 .cse5 .cse6 .cse15 .cse7 .cse8 .cse9 .cse10 .cse3 .cse11)))) [2019-10-22 08:59:44,693 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-10-22 08:59:44,693 INFO L443 ceAbstractionStarter]: For program point L251(lines 251 258) no Hoare annotation was computed. [2019-10-22 08:59:44,693 INFO L443 ceAbstractionStarter]: For program point L218(lines 218 223) no Hoare annotation was computed. [2019-10-22 08:59:44,694 INFO L443 ceAbstractionStarter]: For program point L218-1(lines 218 223) no Hoare annotation was computed. [2019-10-22 08:59:44,694 INFO L443 ceAbstractionStarter]: For program point L152-1(lines 152 162) no Hoare annotation was computed. [2019-10-22 08:59:44,694 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 9) no Hoare annotation was computed. [2019-10-22 08:59:44,694 INFO L443 ceAbstractionStarter]: For program point L320(lines 320 324) no Hoare annotation was computed. [2019-10-22 08:59:44,694 INFO L443 ceAbstractionStarter]: For program point L238(line 238) no Hoare annotation was computed. [2019-10-22 08:59:44,694 INFO L443 ceAbstractionStarter]: For program point L172(lines 172 184) no Hoare annotation was computed. [2019-10-22 08:59:44,694 INFO L443 ceAbstractionStarter]: For program point L139(lines 139 147) no Hoare annotation was computed. [2019-10-22 08:59:44,694 INFO L443 ceAbstractionStarter]: For program point L173(lines 173 179) no Hoare annotation was computed. [2019-10-22 08:59:44,694 INFO L443 ceAbstractionStarter]: For program point L74(lines 74 78) no Hoare annotation was computed. [2019-10-22 08:59:44,695 INFO L439 ceAbstractionStarter]: At program point L107-1(lines 95 132) the Hoare annotation is: (let ((.cse5 (= ~p_dw_pc~0 1)) (.cse1 (= 0 ~q_free~0)) (.cse6 (= ~c_dr_st~0 0)) (.cse0 (= ~c_num_read~0 0)) (.cse9 (= ~q_free~0 1)) (.cse8 (<= 2 ~c_dr_st~0)) (.cse10 (= ~c_last_read~0 ~p_last_write~0)) (.cse2 (= 0 ~p_dw_pc~0)) (.cse3 (= ~p_last_write~0 ~q_buf_0~0)) (.cse7 (= ~c_dr_i~0 1)) (.cse11 (= 0 ~p_num_write~0))) (or (and (or (and .cse0 .cse1 (= 1 ~p_num_write~0) .cse2 .cse3) (let ((.cse4 (+ ~c_num_read~0 1))) (and (<= .cse4 ~p_num_write~0) .cse1 .cse5 (<= ~p_num_write~0 .cse4) .cse3))) .cse6 .cse7) (and (or (and .cse1 .cse8 .cse5 .cse3) (and .cse1 .cse8 .cse2 .cse3)) .cse7) (and .cse0 .cse9 .cse10 (= ~c_dr_pc~0 0) .cse2 .cse3 .cse6 .cse7 .cse11) (and .cse0 .cse9 .cse8 .cse10 .cse2 .cse3 .cse7 .cse11))) [2019-10-22 08:59:44,695 INFO L443 ceAbstractionStarter]: For program point L74-2(lines 74 78) no Hoare annotation was computed. [2019-10-22 08:59:44,695 INFO L443 ceAbstractionStarter]: For program point L74-3(lines 74 78) no Hoare annotation was computed. [2019-10-22 08:59:44,695 INFO L443 ceAbstractionStarter]: For program point L74-5(lines 74 78) no Hoare annotation was computed. [2019-10-22 08:59:44,695 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-22 08:59:44,695 INFO L443 ceAbstractionStarter]: For program point L108(lines 107 127) no Hoare annotation was computed. [2019-10-22 08:59:44,695 INFO L443 ceAbstractionStarter]: For program point L9(line 9) no Hoare annotation was computed. [2019-10-22 08:59:44,695 INFO L443 ceAbstractionStarter]: For program point L9-1(line 9) no Hoare annotation was computed. [2019-10-22 08:59:44,695 INFO L443 ceAbstractionStarter]: For program point L142(lines 142 146) no Hoare annotation was computed. [2019-10-22 08:59:44,696 INFO L439 ceAbstractionStarter]: At program point L109(lines 95 132) the Hoare annotation is: (let ((.cse0 (= ~c_num_read~0 0)) (.cse5 (<= 2 ~c_dr_st~0)) (.cse1 (= 0 ~p_dw_pc~0)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse3 (= ~c_dr_i~0 1)) (.cse4 (= 0 ~p_num_write~0))) (or (and .cse0 (= ~c_dr_pc~0 0) .cse1 .cse2 (= ~c_dr_st~0 0) .cse3 .cse4) (and (and (<= ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 ~c_num_read~0) .cse5 (= ~p_dw_pc~0 1) .cse2) .cse3) (and .cse0 .cse5 .cse1 .cse2 .cse3 .cse4))) [2019-10-22 08:59:44,696 INFO L439 ceAbstractionStarter]: At program point L43(lines 31 45) the Hoare annotation is: (let ((.cse0 (= ~c_num_read~0 0)) (.cse1 (= 0 ~q_free~0)) (.cse2 (= 1 ~p_num_write~0)) (.cse3 (= 0 ~p_dw_pc~0)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (= ~c_dr_i~0 1))) (or (and .cse0 .cse1 .cse2 (= ~c_dr_pc~0 0) .cse3 .cse4 (= ~c_dr_st~0 0) .cse5) (and (let ((.cse7 (<= 2 ~c_dr_st~0))) (or (let ((.cse6 (+ ~c_num_read~0 1))) (and (<= .cse6 ~p_num_write~0) .cse1 .cse7 (= ~p_dw_pc~0 1) (<= ~p_num_write~0 .cse6) .cse4)) (and .cse0 .cse1 .cse2 .cse7 .cse3 .cse4))) .cse5))) [2019-10-22 08:59:44,696 INFO L439 ceAbstractionStarter]: At program point L43-1(lines 31 45) the Hoare annotation is: (and (<= ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 ~c_num_read~0) (= ~q_free~0 1) (<= 2 ~p_dw_st~0) (= ~c_last_read~0 ~p_last_write~0) (= ~p_dw_pc~0 1) (= ~p_last_write~0 ~q_buf_0~0) (= ~c_dr_i~0 1)) [2019-10-22 08:59:44,696 INFO L439 ceAbstractionStarter]: At program point L10-1(lines 138 190) the Hoare annotation is: (let ((.cse1 (<= ~c_num_read~0 ~p_num_write~0)) (.cse2 (<= ~p_num_write~0 ~c_num_read~0)) (.cse8 (<= 2 ~p_dw_st~0)) (.cse5 (= ~p_dw_pc~0 1)) (.cse9 (= ~c_num_read~0 0)) (.cse3 (= ~q_free~0 1)) (.cse4 (= ~c_last_read~0 ~p_last_write~0)) (.cse6 (= 0 ~p_dw_st~0)) (.cse10 (= 0 ~p_dw_pc~0)) (.cse7 (= ~p_last_write~0 ~q_buf_0~0)) (.cse0 (= ~c_dr_i~0 1)) (.cse11 (= 0 ~p_num_write~0))) (or (and .cse0 (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7)) (and .cse8 (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse7) .cse0) (and .cse9 .cse3 .cse8 .cse4 .cse10 .cse7 .cse0 .cse11) (and (= 0 ~q_free~0) .cse8 (let ((.cse12 (+ ~c_num_read~0 1))) (and (<= .cse12 ~p_num_write~0) .cse5 (<= ~p_num_write~0 .cse12) .cse7)) .cse0) (and .cse9 .cse3 .cse4 .cse6 .cse10 .cse7 .cse0 .cse11))) [2019-10-22 08:59:44,696 INFO L443 ceAbstractionStarter]: For program point L242(lines 242 246) no Hoare annotation was computed. [2019-10-22 08:59:44,696 INFO L443 ceAbstractionStarter]: For program point L242-1(lines 237 277) no Hoare annotation was computed. [2019-10-22 08:59:44,696 INFO L439 ceAbstractionStarter]: At program point L143(lines 138 190) the Hoare annotation is: (let ((.cse0 (+ ~c_num_read~0 1))) (and (<= .cse0 ~p_num_write~0) (= 0 ~q_free~0) (<= 2 ~p_dw_st~0) (= ~p_dw_pc~0 1) (<= ~p_num_write~0 .cse0) (= ~p_last_write~0 ~q_buf_0~0) (= ~c_dr_i~0 1))) [2019-10-22 08:59:44,697 INFO L439 ceAbstractionStarter]: At program point L44(lines 28 46) the Hoare annotation is: (let ((.cse0 (= ~c_num_read~0 0)) (.cse1 (= 0 ~q_free~0)) (.cse2 (= 1 ~p_num_write~0)) (.cse3 (= 0 ~p_dw_pc~0)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (= ~c_dr_i~0 1))) (or (and .cse0 .cse1 .cse2 (= ~c_dr_pc~0 0) .cse3 .cse4 (= ~c_dr_st~0 0) .cse5) (and (let ((.cse7 (<= 2 ~c_dr_st~0))) (or (let ((.cse6 (+ ~c_num_read~0 1))) (and (<= .cse6 ~p_num_write~0) .cse1 .cse7 (= ~p_dw_pc~0 1) (<= ~p_num_write~0 .cse6) .cse4)) (and .cse0 .cse1 .cse2 .cse7 .cse3 .cse4))) .cse5))) [2019-10-22 08:59:44,697 INFO L439 ceAbstractionStarter]: At program point L44-1(lines 28 46) the Hoare annotation is: (and (<= ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 ~c_num_read~0) (= ~q_free~0 1) (<= 2 ~p_dw_st~0) (= ~c_last_read~0 ~p_last_write~0) (= ~p_dw_pc~0 1) (= ~p_last_write~0 ~q_buf_0~0) (= ~c_dr_i~0 1)) [2019-10-22 08:59:44,697 INFO L446 ceAbstractionStarter]: At program point L358(lines 349 360) the Hoare annotation is: true [2019-10-22 08:59:44,697 INFO L443 ceAbstractionStarter]: For program point L292(lines 292 297) no Hoare annotation was computed. [2019-10-22 08:59:44,697 INFO L439 ceAbstractionStarter]: At program point L226(lines 213 228) the Hoare annotation is: (let ((.cse12 (<= 2 ~c_dr_st~0)) (.cse16 (= ~p_dw_pc~0 1)) (.cse9 (= ~p_last_write~0 ~q_buf_0~0))) (let ((.cse2 (and .cse12 .cse16 .cse9)) (.cse13 (<= ~c_num_read~0 ~p_num_write~0)) (.cse14 (<= ~p_num_write~0 ~c_num_read~0)) (.cse0 (= 0 ~q_free~0)) (.cse1 (<= 2 ~p_dw_st~0)) (.cse4 (= ~c_num_read~0 0)) (.cse5 (= ~q_free~0 1)) (.cse6 (= ~c_last_read~0 ~p_last_write~0)) (.cse15 (= 0 ~p_dw_st~0)) (.cse7 (= ~c_dr_pc~0 0)) (.cse8 (= 0 ~p_dw_pc~0)) (.cse10 (= ~c_dr_st~0 0)) (.cse3 (= ~c_dr_i~0 1)) (.cse11 (= 0 ~p_num_write~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse1 .cse6 .cse7 .cse8 .cse9 .cse10 .cse3 .cse11) (and .cse4 .cse5 .cse1 .cse12 .cse6 .cse8 .cse9 .cse3 .cse11) (and (and .cse13 .cse14 .cse2) .cse1 .cse3) (and .cse4 .cse5 .cse12 .cse6 .cse15 .cse8 .cse9 .cse3 .cse11) (and (and .cse13 .cse14 .cse12 .cse16 .cse15 .cse9) .cse3) (and .cse0 .cse1 (let ((.cse17 (+ ~c_num_read~0 1))) (and (<= .cse17 ~p_num_write~0) .cse16 (<= ~p_num_write~0 .cse17) .cse9)) .cse10 .cse3) (and .cse4 .cse5 .cse6 .cse15 .cse7 .cse8 .cse9 .cse10 .cse3 .cse11)))) [2019-10-22 08:59:44,697 INFO L439 ceAbstractionStarter]: At program point L226-1(lines 213 228) the Hoare annotation is: (let ((.cse12 (<= 2 ~c_dr_st~0)) (.cse16 (= ~p_dw_pc~0 1)) (.cse9 (= ~p_last_write~0 ~q_buf_0~0))) (let ((.cse2 (and .cse12 .cse16 .cse9)) (.cse13 (<= ~c_num_read~0 ~p_num_write~0)) (.cse14 (<= ~p_num_write~0 ~c_num_read~0)) (.cse0 (= 0 ~q_free~0)) (.cse1 (<= 2 ~p_dw_st~0)) (.cse4 (= ~c_num_read~0 0)) (.cse5 (= ~q_free~0 1)) (.cse6 (= ~c_last_read~0 ~p_last_write~0)) (.cse15 (= 0 ~p_dw_st~0)) (.cse7 (= ~c_dr_pc~0 0)) (.cse8 (= 0 ~p_dw_pc~0)) (.cse10 (= ~c_dr_st~0 0)) (.cse3 (= ~c_dr_i~0 1)) (.cse11 (= 0 ~p_num_write~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse1 .cse6 .cse7 .cse8 .cse9 .cse10 .cse3 .cse11) (and .cse4 .cse5 .cse1 .cse12 .cse6 .cse8 .cse9 .cse3 .cse11) (and (and .cse13 .cse14 .cse2) .cse1 .cse3) (and .cse4 .cse5 .cse12 .cse6 .cse15 .cse8 .cse9 .cse3 .cse11) (and (and .cse13 .cse14 .cse12 .cse16 .cse15 .cse9) .cse3) (and .cse0 .cse1 (let ((.cse17 (+ ~c_num_read~0 1))) (and (<= .cse17 ~p_num_write~0) .cse16 (<= ~p_num_write~0 .cse17) .cse9)) .cse10 .cse3) (and .cse4 .cse5 .cse6 .cse15 .cse7 .cse8 .cse9 .cse10 .cse3 .cse11)))) [2019-10-22 08:59:44,697 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-22 08:59:44,698 INFO L446 ceAbstractionStarter]: At program point L326(lines 303 331) the Hoare annotation is: true [2019-10-22 08:59:44,698 INFO L439 ceAbstractionStarter]: At program point L227(lines 210 229) the Hoare annotation is: (let ((.cse12 (<= 2 ~c_dr_st~0)) (.cse16 (= ~p_dw_pc~0 1)) (.cse9 (= ~p_last_write~0 ~q_buf_0~0))) (let ((.cse2 (and .cse12 .cse16 .cse9)) (.cse13 (<= ~c_num_read~0 ~p_num_write~0)) (.cse14 (<= ~p_num_write~0 ~c_num_read~0)) (.cse0 (= 0 ~q_free~0)) (.cse1 (<= 2 ~p_dw_st~0)) (.cse4 (= ~c_num_read~0 0)) (.cse5 (= ~q_free~0 1)) (.cse6 (= ~c_last_read~0 ~p_last_write~0)) (.cse15 (= 0 ~p_dw_st~0)) (.cse7 (= ~c_dr_pc~0 0)) (.cse8 (= 0 ~p_dw_pc~0)) (.cse10 (= ~c_dr_st~0 0)) (.cse3 (= ~c_dr_i~0 1)) (.cse11 (= 0 ~p_num_write~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse1 .cse6 .cse7 .cse8 .cse9 .cse10 .cse3 .cse11) (and .cse4 .cse5 .cse1 .cse12 .cse6 .cse8 .cse9 .cse3 .cse11) (and (and .cse13 .cse14 .cse2) .cse1 .cse3) (and .cse4 .cse5 .cse12 .cse6 .cse15 .cse8 .cse9 .cse3 .cse11) (and (and .cse13 .cse14 .cse12 .cse16 .cse15 .cse9) .cse3) (and .cse0 .cse1 (let ((.cse17 (+ ~c_num_read~0 1))) (and (<= .cse17 ~p_num_write~0) .cse16 (<= ~p_num_write~0 .cse17) .cse9)) .cse10 .cse3) (and .cse4 .cse5 .cse6 .cse15 .cse7 .cse8 .cse9 .cse10 .cse3 .cse11)))) [2019-10-22 08:59:44,698 INFO L439 ceAbstractionStarter]: At program point L227-1(lines 210 229) the Hoare annotation is: (let ((.cse12 (<= 2 ~c_dr_st~0)) (.cse16 (= ~p_dw_pc~0 1)) (.cse9 (= ~p_last_write~0 ~q_buf_0~0))) (let ((.cse2 (and .cse12 .cse16 .cse9)) (.cse13 (<= ~c_num_read~0 ~p_num_write~0)) (.cse14 (<= ~p_num_write~0 ~c_num_read~0)) (.cse0 (= 0 ~q_free~0)) (.cse1 (<= 2 ~p_dw_st~0)) (.cse4 (= ~c_num_read~0 0)) (.cse5 (= ~q_free~0 1)) (.cse6 (= ~c_last_read~0 ~p_last_write~0)) (.cse15 (= 0 ~p_dw_st~0)) (.cse7 (= ~c_dr_pc~0 0)) (.cse8 (= 0 ~p_dw_pc~0)) (.cse10 (= ~c_dr_st~0 0)) (.cse3 (= ~c_dr_i~0 1)) (.cse11 (= 0 ~p_num_write~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse1 .cse6 .cse7 .cse8 .cse9 .cse10 .cse3 .cse11) (and .cse4 .cse5 .cse1 .cse12 .cse6 .cse8 .cse9 .cse3 .cse11) (and (and .cse13 .cse14 .cse2) .cse1 .cse3) (and .cse4 .cse5 .cse12 .cse6 .cse15 .cse8 .cse9 .cse3 .cse11) (and (and .cse13 .cse14 .cse12 .cse16 .cse15 .cse9) .cse3) (and .cse0 .cse1 (let ((.cse17 (+ ~c_num_read~0 1))) (and (<= .cse17 ~p_num_write~0) .cse16 (<= ~p_num_write~0 .cse17) .cse9)) .cse10 .cse3) (and .cse4 .cse5 .cse6 .cse15 .cse7 .cse8 .cse9 .cse10 .cse3 .cse11)))) [2019-10-22 08:59:44,699 INFO L439 ceAbstractionStarter]: At program point L62(lines 50 64) the Hoare annotation is: (let ((.cse0 (= ~c_num_read~0 0)) (.cse1 (= 0 ~q_free~0)) (.cse2 (= 1 ~p_num_write~0)) (.cse3 (= 0 ~p_dw_pc~0)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (= ~c_dr_i~0 1))) (or (and .cse0 .cse1 .cse2 (= ~c_dr_pc~0 0) .cse3 .cse4 (= ~c_dr_st~0 0) .cse5) (and (let ((.cse7 (<= 2 ~c_dr_st~0))) (or (let ((.cse6 (+ ~c_num_read~0 1))) (and (<= .cse6 ~p_num_write~0) .cse1 .cse7 (= ~p_dw_pc~0 1) (<= ~p_num_write~0 .cse6) .cse4)) (and .cse0 .cse1 .cse2 .cse7 .cse3 .cse4))) .cse5))) [2019-10-22 08:59:44,699 INFO L439 ceAbstractionStarter]: At program point L62-1(lines 50 64) the Hoare annotation is: (let ((.cse0 (<= ~c_num_read~0 ~p_num_write~0)) (.cse1 (<= ~p_num_write~0 ~c_num_read~0)) (.cse2 (= ~q_free~0 1)) (.cse3 (= ~c_last_read~0 ~p_last_write~0)) (.cse4 (= ~p_dw_pc~0 1)) (.cse5 (= ~p_last_write~0 ~q_buf_0~0)) (.cse6 (= ~c_dr_i~0 1))) (or (and (<= 2 ~p_dw_st~0) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) .cse6) (and (and .cse0 .cse1 .cse2 .cse3 .cse4 (= 0 ~p_dw_st~0) .cse5) .cse6))) [2019-10-22 08:59:44,699 INFO L443 ceAbstractionStarter]: For program point L96(lines 96 104) no Hoare annotation was computed. [2019-10-22 08:59:44,700 INFO L439 ceAbstractionStarter]: At program point L63(lines 47 65) the Hoare annotation is: (let ((.cse0 (= ~c_num_read~0 0)) (.cse1 (= 0 ~q_free~0)) (.cse2 (= 1 ~p_num_write~0)) (.cse3 (= 0 ~p_dw_pc~0)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (= ~c_dr_i~0 1))) (or (and .cse0 .cse1 .cse2 (= ~c_dr_pc~0 0) .cse3 .cse4 (= ~c_dr_st~0 0) .cse5) (and (let ((.cse7 (<= 2 ~c_dr_st~0))) (or (let ((.cse6 (+ ~c_num_read~0 1))) (and (<= .cse6 ~p_num_write~0) .cse1 .cse7 (= ~p_dw_pc~0 1) (<= ~p_num_write~0 .cse6) .cse4)) (and .cse0 .cse1 .cse2 .cse7 .cse3 .cse4))) .cse5))) [2019-10-22 08:59:44,700 INFO L439 ceAbstractionStarter]: At program point L63-1(lines 47 65) the Hoare annotation is: (let ((.cse0 (<= ~c_num_read~0 ~p_num_write~0)) (.cse1 (<= ~p_num_write~0 ~c_num_read~0)) (.cse2 (= ~q_free~0 1)) (.cse3 (= ~c_last_read~0 ~p_last_write~0)) (.cse4 (= ~p_dw_pc~0 1)) (.cse5 (= ~p_last_write~0 ~q_buf_0~0)) (.cse6 (= ~c_dr_i~0 1))) (or (and (<= 2 ~p_dw_st~0) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) .cse6) (and (and .cse0 .cse1 .cse2 .cse3 .cse4 (= 0 ~p_dw_st~0) .cse5) .cse6))) [2019-10-22 08:59:44,700 INFO L439 ceAbstractionStarter]: At program point L278(lines 230 283) the Hoare annotation is: (let ((.cse12 (<= 2 ~c_dr_st~0)) (.cse16 (= ~p_dw_pc~0 1)) (.cse9 (= ~p_last_write~0 ~q_buf_0~0))) (let ((.cse2 (and .cse12 .cse16 .cse9)) (.cse13 (<= ~c_num_read~0 ~p_num_write~0)) (.cse14 (<= ~p_num_write~0 ~c_num_read~0)) (.cse0 (= 0 ~q_free~0)) (.cse1 (<= 2 ~p_dw_st~0)) (.cse4 (= ~c_num_read~0 0)) (.cse5 (= ~q_free~0 1)) (.cse6 (= ~c_last_read~0 ~p_last_write~0)) (.cse15 (= 0 ~p_dw_st~0)) (.cse7 (= ~c_dr_pc~0 0)) (.cse8 (= 0 ~p_dw_pc~0)) (.cse10 (= ~c_dr_st~0 0)) (.cse3 (= ~c_dr_i~0 1)) (.cse11 (= 0 ~p_num_write~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse1 .cse6 .cse7 .cse8 .cse9 .cse10 .cse3 .cse11) (and .cse4 .cse5 .cse1 .cse12 .cse6 .cse8 .cse9 .cse3 .cse11) (and (and .cse13 .cse14 .cse2) .cse1 .cse3) (and .cse4 .cse5 .cse12 .cse6 .cse15 .cse8 .cse9 .cse3 .cse11) (and (and .cse13 .cse14 .cse12 .cse16 .cse15 .cse9) .cse3) (and .cse0 .cse1 (let ((.cse17 (+ ~c_num_read~0 1))) (and (<= .cse17 ~p_num_write~0) .cse16 (<= ~p_num_write~0 .cse17) .cse9)) .cse10 .cse3) (and .cse4 .cse5 .cse6 .cse15 .cse7 .cse8 .cse9 .cse10 .cse3 .cse11)))) [2019-10-22 08:59:44,700 INFO L439 ceAbstractionStarter]: At program point L262(lines 237 277) the Hoare annotation is: (let ((.cse12 (<= 2 ~c_dr_st~0)) (.cse16 (= ~p_dw_pc~0 1)) (.cse9 (= ~p_last_write~0 ~q_buf_0~0))) (let ((.cse2 (and .cse12 .cse16 .cse9)) (.cse13 (<= ~c_num_read~0 ~p_num_write~0)) (.cse14 (<= ~p_num_write~0 ~c_num_read~0)) (.cse0 (= 0 ~q_free~0)) (.cse1 (<= 2 ~p_dw_st~0)) (.cse4 (= ~c_num_read~0 0)) (.cse5 (= ~q_free~0 1)) (.cse6 (= ~c_last_read~0 ~p_last_write~0)) (.cse15 (= 0 ~p_dw_st~0)) (.cse7 (= ~c_dr_pc~0 0)) (.cse8 (= 0 ~p_dw_pc~0)) (.cse10 (= ~c_dr_st~0 0)) (.cse3 (= ~c_dr_i~0 1)) (.cse11 (= 0 ~p_num_write~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse1 .cse6 .cse7 .cse8 .cse9 .cse10 .cse3 .cse11) (and .cse4 .cse5 .cse1 .cse12 .cse6 .cse8 .cse9 .cse3 .cse11) (and (and .cse13 .cse14 .cse2) .cse1 .cse3) (and .cse4 .cse5 .cse12 .cse6 .cse15 .cse8 .cse9 .cse3 .cse11) (and (and .cse13 .cse14 .cse12 .cse16 .cse15 .cse9) .cse3) (and .cse0 .cse1 (let ((.cse17 (+ ~c_num_read~0 1))) (and (<= .cse17 ~p_num_write~0) .cse16 (<= ~p_num_write~0 .cse17) .cse9)) .cse10 .cse3) (and .cse4 .cse5 .cse6 .cse15 .cse7 .cse8 .cse9 .cse10 .cse3 .cse11)))) [2019-10-22 08:59:44,700 INFO L443 ceAbstractionStarter]: For program point L196(lines 196 200) no Hoare annotation was computed. [2019-10-22 08:59:44,700 INFO L443 ceAbstractionStarter]: For program point L196-2(lines 195 208) no Hoare annotation was computed. [2019-10-22 08:59:44,701 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 9) no Hoare annotation was computed. [2019-10-22 08:59:44,701 INFO L443 ceAbstractionStarter]: For program point L32(lines 32 41) no Hoare annotation was computed. [2019-10-22 08:59:44,701 INFO L443 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-10-22 08:59:44,701 INFO L443 ceAbstractionStarter]: For program point L32-2(lines 32 41) no Hoare annotation was computed. [2019-10-22 08:59:44,701 INFO L443 ceAbstractionStarter]: For program point L32-3(lines 32 41) no Hoare annotation was computed. [2019-10-22 08:59:44,701 INFO L443 ceAbstractionStarter]: For program point L32-5(lines 32 41) no Hoare annotation was computed. [2019-10-22 08:59:44,701 INFO L439 ceAbstractionStarter]: At program point L346(lines 332 348) the Hoare annotation is: (and (= ~c_num_read~0 0) (= ~q_free~0 1) (= ~c_last_read~0 ~p_last_write~0) (= 0 ~p_dw_st~0) (= ~c_dr_pc~0 0) (= 0 ~p_dw_pc~0) (= ~p_last_write~0 ~q_buf_0~0) (= ~c_dr_st~0 0) (= ~c_dr_i~0 1) (= 0 ~p_num_write~0)) [2019-10-22 08:59:44,701 INFO L439 ceAbstractionStarter]: At program point L313-1(lines 192 325) the Hoare annotation is: (let ((.cse12 (<= 2 ~c_dr_st~0)) (.cse16 (= ~p_dw_pc~0 1)) (.cse9 (= ~p_last_write~0 ~q_buf_0~0))) (let ((.cse2 (and .cse12 .cse16 .cse9)) (.cse13 (<= ~c_num_read~0 ~p_num_write~0)) (.cse14 (<= ~p_num_write~0 ~c_num_read~0)) (.cse0 (= 0 ~q_free~0)) (.cse1 (<= 2 ~p_dw_st~0)) (.cse4 (= ~c_num_read~0 0)) (.cse5 (= ~q_free~0 1)) (.cse6 (= ~c_last_read~0 ~p_last_write~0)) (.cse15 (= 0 ~p_dw_st~0)) (.cse7 (= ~c_dr_pc~0 0)) (.cse8 (= 0 ~p_dw_pc~0)) (.cse10 (= ~c_dr_st~0 0)) (.cse3 (= ~c_dr_i~0 1)) (.cse11 (= 0 ~p_num_write~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse1 .cse6 .cse7 .cse8 .cse9 .cse10 .cse3 .cse11) (and .cse4 .cse5 .cse1 .cse12 .cse6 .cse8 .cse9 .cse3 .cse11) (and (and .cse13 .cse14 .cse2) .cse1 .cse3) (and .cse4 .cse5 .cse12 .cse6 .cse15 .cse8 .cse9 .cse3 .cse11) (and (and .cse13 .cse14 .cse12 .cse16 .cse15 .cse9) .cse3) (and .cse0 .cse1 (let ((.cse17 (+ ~c_num_read~0 1))) (and (<= .cse17 ~p_num_write~0) .cse16 (<= ~p_num_write~0 .cse17) .cse9)) .cse10 .cse3) (and .cse4 .cse5 .cse6 .cse15 .cse7 .cse8 .cse9 .cse10 .cse3 .cse11)))) [2019-10-22 08:59:44,701 INFO L439 ceAbstractionStarter]: At program point L247(lines 237 277) the Hoare annotation is: (let ((.cse12 (<= 2 ~c_dr_st~0)) (.cse16 (= ~p_dw_pc~0 1)) (.cse9 (= ~p_last_write~0 ~q_buf_0~0))) (let ((.cse2 (and .cse12 .cse16 .cse9)) (.cse13 (<= ~c_num_read~0 ~p_num_write~0)) (.cse14 (<= ~p_num_write~0 ~c_num_read~0)) (.cse0 (= 0 ~q_free~0)) (.cse1 (<= 2 ~p_dw_st~0)) (.cse4 (= ~c_num_read~0 0)) (.cse5 (= ~q_free~0 1)) (.cse6 (= ~c_last_read~0 ~p_last_write~0)) (.cse15 (= 0 ~p_dw_st~0)) (.cse7 (= ~c_dr_pc~0 0)) (.cse8 (= 0 ~p_dw_pc~0)) (.cse10 (= ~c_dr_st~0 0)) (.cse3 (= ~c_dr_i~0 1)) (.cse11 (= 0 ~p_num_write~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse1 .cse6 .cse7 .cse8 .cse9 .cse10 .cse3 .cse11) (and .cse4 .cse5 .cse1 .cse12 .cse6 .cse8 .cse9 .cse3 .cse11) (and (and .cse13 .cse14 .cse2) .cse1 .cse3) (and .cse4 .cse5 .cse12 .cse6 .cse15 .cse8 .cse9 .cse3 .cse11) (and (and .cse13 .cse14 .cse12 .cse16 .cse15 .cse9) .cse3) (and .cse0 .cse1 (let ((.cse17 (+ ~c_num_read~0 1))) (and (<= .cse17 ~p_num_write~0) .cse16 (<= ~p_num_write~0 .cse17) .cse9)) .cse10 .cse3) (and .cse4 .cse5 .cse6 .cse15 .cse7 .cse8 .cse9 .cse10 .cse3 .cse11)))) [2019-10-22 08:59:44,702 INFO L443 ceAbstractionStarter]: For program point L214(lines 214 224) no Hoare annotation was computed. [2019-10-22 08:59:44,702 INFO L443 ceAbstractionStarter]: For program point L214-1(lines 214 224) no Hoare annotation was computed. [2019-10-22 08:59:44,702 INFO L443 ceAbstractionStarter]: For program point L82(lines 82 86) no Hoare annotation was computed. [2019-10-22 08:59:44,702 INFO L439 ceAbstractionStarter]: At program point L82-2(lines 66 90) the Hoare annotation is: (let ((.cse4 (= ~p_dw_pc~0 1)) (.cse0 (= 0 ~q_free~0)) (.cse1 (= 0 ~p_dw_pc~0)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (= ~c_dr_i~0 1))) (or (and (or (and (= ~c_num_read~0 0) .cse0 (= 1 ~p_num_write~0) .cse1 .cse2) (let ((.cse3 (+ ~c_num_read~0 1))) (and (<= .cse3 ~p_num_write~0) .cse0 .cse4 (<= ~p_num_write~0 .cse3) .cse2))) (= ~c_dr_st~0 0) .cse5) (and (let ((.cse6 (<= 2 ~c_dr_st~0))) (or (and .cse0 .cse6 .cse4 .cse2) (and .cse0 .cse6 .cse1 .cse2))) .cse5))) [2019-10-22 08:59:44,702 INFO L443 ceAbstractionStarter]: For program point L82-3(lines 82 86) no Hoare annotation was computed. [2019-10-22 08:59:44,703 INFO L439 ceAbstractionStarter]: At program point L82-5(lines 66 90) the Hoare annotation is: (let ((.cse1 (<= ~c_num_read~0 ~p_num_write~0)) (.cse2 (<= ~p_num_write~0 ~c_num_read~0)) (.cse3 (= ~q_free~0 1)) (.cse4 (= ~c_last_read~0 ~p_last_write~0)) (.cse5 (= ~p_dw_pc~0 1)) (.cse6 (= ~p_last_write~0 ~q_buf_0~0)) (.cse0 (= ~c_dr_i~0 1))) (or (and .cse0 (and .cse1 .cse2 .cse3 .cse4 .cse5 (= 0 ~p_dw_st~0) .cse6)) (and (<= 2 ~p_dw_st~0) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) .cse0))) [2019-10-22 08:59:44,703 INFO L443 ceAbstractionStarter]: For program point L99(lines 99 103) no Hoare annotation was computed. [2019-10-22 08:59:44,703 INFO L443 ceAbstractionStarter]: For program point L33(lines 33 38) no Hoare annotation was computed. [2019-10-22 08:59:44,703 INFO L443 ceAbstractionStarter]: For program point L33-1(lines 33 38) no Hoare annotation was computed. [2019-10-22 08:59:44,703 INFO L443 ceAbstractionStarter]: For program point L314(line 314) no Hoare annotation was computed. [2019-10-22 08:59:44,703 INFO L443 ceAbstractionStarter]: For program point L51(lines 51 60) no Hoare annotation was computed. [2019-10-22 08:59:44,703 INFO L443 ceAbstractionStarter]: For program point L51-2(lines 51 60) no Hoare annotation was computed. [2019-10-22 08:59:44,703 INFO L443 ceAbstractionStarter]: For program point L51-3(lines 51 60) no Hoare annotation was computed. [2019-10-22 08:59:44,703 INFO L443 ceAbstractionStarter]: For program point L51-5(lines 51 60) no Hoare annotation was computed. [2019-10-22 08:59:44,704 INFO L439 ceAbstractionStarter]: At program point L299(lines 288 301) the Hoare annotation is: (let ((.cse12 (<= 2 ~c_dr_st~0)) (.cse16 (= ~p_dw_pc~0 1)) (.cse9 (= ~p_last_write~0 ~q_buf_0~0))) (let ((.cse2 (and .cse12 .cse16 .cse9)) (.cse13 (<= ~c_num_read~0 ~p_num_write~0)) (.cse14 (<= ~p_num_write~0 ~c_num_read~0)) (.cse0 (= 0 ~q_free~0)) (.cse1 (<= 2 ~p_dw_st~0)) (.cse4 (= ~c_num_read~0 0)) (.cse5 (= ~q_free~0 1)) (.cse6 (= ~c_last_read~0 ~p_last_write~0)) (.cse15 (= 0 ~p_dw_st~0)) (.cse7 (= ~c_dr_pc~0 0)) (.cse8 (= 0 ~p_dw_pc~0)) (.cse10 (= ~c_dr_st~0 0)) (.cse3 (= ~c_dr_i~0 1)) (.cse11 (= 0 ~p_num_write~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse1 .cse6 .cse7 .cse8 .cse9 .cse10 .cse3 .cse11) (and .cse4 .cse5 .cse1 .cse12 .cse6 .cse8 .cse9 .cse3 .cse11) (and (and .cse13 .cse14 .cse2) .cse1 .cse3) (and .cse4 .cse5 .cse12 .cse6 .cse15 .cse8 .cse9 .cse3 .cse11) (and (and .cse13 .cse14 .cse12 .cse16 .cse15 .cse9) .cse3) (and .cse0 .cse1 (let ((.cse17 (+ ~c_num_read~0 1))) (and (<= .cse17 ~p_num_write~0) .cse16 (<= ~p_num_write~0 .cse17) .cse9)) .cse10 .cse3) (and .cse4 .cse5 .cse6 .cse15 .cse7 .cse8 .cse9 .cse10 .cse3 .cse11)))) [2019-10-22 08:59:44,704 INFO L443 ceAbstractionStarter]: For program point L266(lines 266 273) no Hoare annotation was computed. [2019-10-22 08:59:44,755 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 08:59:44 BoogieIcfgContainer [2019-10-22 08:59:44,756 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-22 08:59:44,756 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 08:59:44,756 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 08:59:44,757 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 08:59:44,757 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:59:38" (3/4) ... [2019-10-22 08:59:44,760 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-10-22 08:59:44,774 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-10-22 08:59:44,775 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-10-22 08:59:44,869 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_2279c3c7-69c1-49d7-8784-2f49eea7617c/bin/uautomizer/witness.graphml [2019-10-22 08:59:44,869 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 08:59:44,870 INFO L168 Benchmark]: Toolchain (without parser) took 7258.47 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 327.7 MB). Free memory was 943.4 MB in the beginning and 1.3 GB in the end (delta: -310.5 MB). Peak memory consumption was 17.2 MB. Max. memory is 11.5 GB. [2019-10-22 08:59:44,871 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:59:44,871 INFO L168 Benchmark]: CACSL2BoogieTranslator took 310.05 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 165.2 MB). Free memory was 943.4 MB in the beginning and 1.2 GB in the end (delta: -213.3 MB). Peak memory consumption was 23.3 MB. Max. memory is 11.5 GB. [2019-10-22 08:59:44,871 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.38 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:59:44,873 INFO L168 Benchmark]: Boogie Preprocessor took 54.95 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-10-22 08:59:44,873 INFO L168 Benchmark]: RCFGBuilder took 485.02 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 29.3 MB). Peak memory consumption was 29.3 MB. Max. memory is 11.5 GB. [2019-10-22 08:59:44,874 INFO L168 Benchmark]: TraceAbstraction took 6251.65 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 162.5 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -145.1 MB). Peak memory consumption was 422.9 MB. Max. memory is 11.5 GB. [2019-10-22 08:59:44,874 INFO L168 Benchmark]: Witness Printer took 113.14 ms. Allocated memory is still 1.4 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 11.5 GB. [2019-10-22 08:59:44,876 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 310.05 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 165.2 MB). Free memory was 943.4 MB in the beginning and 1.2 GB in the end (delta: -213.3 MB). Peak memory consumption was 23.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 39.38 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 54.95 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 485.02 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 29.3 MB). Peak memory consumption was 29.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 6251.65 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 162.5 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -145.1 MB). Peak memory consumption was 422.9 MB. Max. memory is 11.5 GB. * Witness Printer took 113.14 ms. Allocated memory is still 1.4 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 9]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 9]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold - InvariantResult [Line: 66]: Loop Invariant Derived loop invariant: (((((((c_num_read == 0 && 0 == q_free) && 1 == p_num_write) && 0 == p_dw_pc) && p_last_write == q_buf_0) || ((((c_num_read + 1 <= p_num_write && 0 == q_free) && p_dw_pc == 1) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0)) && c_dr_st == 0) && c_dr_i == 1) || (((((0 == q_free && 2 <= c_dr_st) && p_dw_pc == 1) && p_last_write == q_buf_0) || (((0 == q_free && 2 <= c_dr_st) && 0 == p_dw_pc) && p_last_write == q_buf_0)) && c_dr_i == 1) - InvariantResult [Line: 50]: Loop Invariant Derived loop invariant: ((2 <= p_dw_st && ((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && c_last_read == p_last_write) && p_dw_pc == 1) && p_last_write == q_buf_0) && c_dr_i == 1) || (((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && c_last_read == p_last_write) && p_dw_pc == 1) && 0 == p_dw_st) && p_last_write == q_buf_0) && c_dr_i == 1) - InvariantResult [Line: 50]: Loop Invariant Derived loop invariant: (((((((c_num_read == 0 && 0 == q_free) && 1 == p_num_write) && c_dr_pc == 0) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_dr_st == 0) && c_dr_i == 1) || (((((((c_num_read + 1 <= p_num_write && 0 == q_free) && 2 <= c_dr_st) && p_dw_pc == 1) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) || (((((c_num_read == 0 && 0 == q_free) && 1 == p_num_write) && 2 <= c_dr_st) && 0 == p_dw_pc) && p_last_write == q_buf_0)) && c_dr_i == 1) - InvariantResult [Line: 47]: Loop Invariant Derived loop invariant: (((((((c_num_read == 0 && 0 == q_free) && 1 == p_num_write) && c_dr_pc == 0) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_dr_st == 0) && c_dr_i == 1) || (((((((c_num_read + 1 <= p_num_write && 0 == q_free) && 2 <= c_dr_st) && p_dw_pc == 1) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) || (((((c_num_read == 0 && 0 == q_free) && 1 == p_num_write) && 2 <= c_dr_st) && 0 == p_dw_pc) && p_last_write == q_buf_0)) && c_dr_i == 1) - InvariantResult [Line: 95]: Loop Invariant Derived loop invariant: (((((((((c_num_read == 0 && 0 == q_free) && 1 == p_num_write) && 0 == p_dw_pc) && p_last_write == q_buf_0) || ((((c_num_read + 1 <= p_num_write && 0 == q_free) && p_dw_pc == 1) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0)) && c_dr_st == 0) && c_dr_i == 1) || (((((0 == q_free && 2 <= c_dr_st) && p_dw_pc == 1) && p_last_write == q_buf_0) || (((0 == q_free && 2 <= c_dr_st) && 0 == p_dw_pc) && p_last_write == q_buf_0)) && c_dr_i == 1)) || ((((((((c_num_read == 0 && q_free == 1) && c_last_read == p_last_write) && c_dr_pc == 0) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_dr_st == 0) && c_dr_i == 1) && 0 == p_num_write)) || (((((((c_num_read == 0 && q_free == 1) && 2 <= c_dr_st) && c_last_read == p_last_write) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_dr_i == 1) && 0 == p_num_write) - InvariantResult [Line: 31]: Loop Invariant Derived loop invariant: ((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= p_dw_st) && c_last_read == p_last_write) && p_dw_pc == 1) && p_last_write == q_buf_0) && c_dr_i == 1 - InvariantResult [Line: 288]: Loop Invariant Derived loop invariant: (((((((((0 == q_free && 2 <= p_dw_st) && (2 <= c_dr_st && p_dw_pc == 1) && p_last_write == q_buf_0) && c_dr_i == 1) || (((((((((c_num_read == 0 && q_free == 1) && 2 <= p_dw_st) && c_last_read == p_last_write) && c_dr_pc == 0) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_dr_st == 0) && c_dr_i == 1) && 0 == p_num_write)) || ((((((((c_num_read == 0 && q_free == 1) && 2 <= p_dw_st) && 2 <= c_dr_st) && c_last_read == p_last_write) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_dr_i == 1) && 0 == p_num_write)) || ((((c_num_read <= p_num_write && p_num_write <= c_num_read) && (2 <= c_dr_st && p_dw_pc == 1) && p_last_write == q_buf_0) && 2 <= p_dw_st) && c_dr_i == 1)) || ((((((((c_num_read == 0 && q_free == 1) && 2 <= c_dr_st) && c_last_read == p_last_write) && 0 == p_dw_st) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_dr_i == 1) && 0 == p_num_write)) || ((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= c_dr_st) && p_dw_pc == 1) && 0 == p_dw_st) && p_last_write == q_buf_0) && c_dr_i == 1)) || ((((0 == q_free && 2 <= p_dw_st) && ((c_num_read + 1 <= p_num_write && p_dw_pc == 1) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && c_dr_st == 0) && c_dr_i == 1)) || (((((((((c_num_read == 0 && q_free == 1) && c_last_read == p_last_write) && 0 == p_dw_st) && c_dr_pc == 0) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_dr_st == 0) && c_dr_i == 1) && 0 == p_num_write) - InvariantResult [Line: 31]: Loop Invariant Derived loop invariant: (((((((c_num_read == 0 && 0 == q_free) && 1 == p_num_write) && c_dr_pc == 0) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_dr_st == 0) && c_dr_i == 1) || (((((((c_num_read + 1 <= p_num_write && 0 == q_free) && 2 <= c_dr_st) && p_dw_pc == 1) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) || (((((c_num_read == 0 && 0 == q_free) && 1 == p_num_write) && 2 <= c_dr_st) && 0 == p_dw_pc) && p_last_write == q_buf_0)) && c_dr_i == 1) - InvariantResult [Line: 213]: Loop Invariant Derived loop invariant: (((((((((0 == q_free && 2 <= p_dw_st) && (2 <= c_dr_st && p_dw_pc == 1) && p_last_write == q_buf_0) && c_dr_i == 1) || (((((((((c_num_read == 0 && q_free == 1) && 2 <= p_dw_st) && c_last_read == p_last_write) && c_dr_pc == 0) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_dr_st == 0) && c_dr_i == 1) && 0 == p_num_write)) || ((((((((c_num_read == 0 && q_free == 1) && 2 <= p_dw_st) && 2 <= c_dr_st) && c_last_read == p_last_write) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_dr_i == 1) && 0 == p_num_write)) || ((((c_num_read <= p_num_write && p_num_write <= c_num_read) && (2 <= c_dr_st && p_dw_pc == 1) && p_last_write == q_buf_0) && 2 <= p_dw_st) && c_dr_i == 1)) || ((((((((c_num_read == 0 && q_free == 1) && 2 <= c_dr_st) && c_last_read == p_last_write) && 0 == p_dw_st) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_dr_i == 1) && 0 == p_num_write)) || ((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= c_dr_st) && p_dw_pc == 1) && 0 == p_dw_st) && p_last_write == q_buf_0) && c_dr_i == 1)) || ((((0 == q_free && 2 <= p_dw_st) && ((c_num_read + 1 <= p_num_write && p_dw_pc == 1) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && c_dr_st == 0) && c_dr_i == 1)) || (((((((((c_num_read == 0 && q_free == 1) && c_last_read == p_last_write) && 0 == p_dw_st) && c_dr_pc == 0) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_dr_st == 0) && c_dr_i == 1) && 0 == p_num_write) - InvariantResult [Line: 213]: Loop Invariant Derived loop invariant: (((((((((0 == q_free && 2 <= p_dw_st) && (2 <= c_dr_st && p_dw_pc == 1) && p_last_write == q_buf_0) && c_dr_i == 1) || (((((((((c_num_read == 0 && q_free == 1) && 2 <= p_dw_st) && c_last_read == p_last_write) && c_dr_pc == 0) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_dr_st == 0) && c_dr_i == 1) && 0 == p_num_write)) || ((((((((c_num_read == 0 && q_free == 1) && 2 <= p_dw_st) && 2 <= c_dr_st) && c_last_read == p_last_write) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_dr_i == 1) && 0 == p_num_write)) || ((((c_num_read <= p_num_write && p_num_write <= c_num_read) && (2 <= c_dr_st && p_dw_pc == 1) && p_last_write == q_buf_0) && 2 <= p_dw_st) && c_dr_i == 1)) || ((((((((c_num_read == 0 && q_free == 1) && 2 <= c_dr_st) && c_last_read == p_last_write) && 0 == p_dw_st) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_dr_i == 1) && 0 == p_num_write)) || ((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= c_dr_st) && p_dw_pc == 1) && 0 == p_dw_st) && p_last_write == q_buf_0) && c_dr_i == 1)) || ((((0 == q_free && 2 <= p_dw_st) && ((c_num_read + 1 <= p_num_write && p_dw_pc == 1) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && c_dr_st == 0) && c_dr_i == 1)) || (((((((((c_num_read == 0 && q_free == 1) && c_last_read == p_last_write) && 0 == p_dw_st) && c_dr_pc == 0) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_dr_st == 0) && c_dr_i == 1) && 0 == p_num_write) - InvariantResult [Line: 349]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 95]: Loop Invariant Derived loop invariant: (((((((c_num_read == 0 && c_dr_pc == 0) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_dr_st == 0) && c_dr_i == 1) && 0 == p_num_write) || (((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= c_dr_st) && p_dw_pc == 1) && p_last_write == q_buf_0) && c_dr_i == 1)) || (((((c_num_read == 0 && 2 <= c_dr_st) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_dr_i == 1) && 0 == p_num_write) - InvariantResult [Line: 66]: Loop Invariant Derived loop invariant: (c_dr_i == 1 && (((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && c_last_read == p_last_write) && p_dw_pc == 1) && 0 == p_dw_st) && p_last_write == q_buf_0) || ((2 <= p_dw_st && ((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && c_last_read == p_last_write) && p_dw_pc == 1) && p_last_write == q_buf_0) && c_dr_i == 1) - InvariantResult [Line: 138]: Loop Invariant Derived loop invariant: (((((c_num_read + 1 <= p_num_write && 0 == q_free) && 2 <= p_dw_st) && p_dw_pc == 1) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && c_dr_i == 1 - InvariantResult [Line: 192]: Loop Invariant Derived loop invariant: (((((((((0 == q_free && 2 <= p_dw_st) && (2 <= c_dr_st && p_dw_pc == 1) && p_last_write == q_buf_0) && c_dr_i == 1) || (((((((((c_num_read == 0 && q_free == 1) && 2 <= p_dw_st) && c_last_read == p_last_write) && c_dr_pc == 0) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_dr_st == 0) && c_dr_i == 1) && 0 == p_num_write)) || ((((((((c_num_read == 0 && q_free == 1) && 2 <= p_dw_st) && 2 <= c_dr_st) && c_last_read == p_last_write) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_dr_i == 1) && 0 == p_num_write)) || ((((c_num_read <= p_num_write && p_num_write <= c_num_read) && (2 <= c_dr_st && p_dw_pc == 1) && p_last_write == q_buf_0) && 2 <= p_dw_st) && c_dr_i == 1)) || ((((((((c_num_read == 0 && q_free == 1) && 2 <= c_dr_st) && c_last_read == p_last_write) && 0 == p_dw_st) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_dr_i == 1) && 0 == p_num_write)) || ((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= c_dr_st) && p_dw_pc == 1) && 0 == p_dw_st) && p_last_write == q_buf_0) && c_dr_i == 1)) || ((((0 == q_free && 2 <= p_dw_st) && ((c_num_read + 1 <= p_num_write && p_dw_pc == 1) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && c_dr_st == 0) && c_dr_i == 1)) || (((((((((c_num_read == 0 && q_free == 1) && c_last_read == p_last_write) && 0 == p_dw_st) && c_dr_pc == 0) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_dr_st == 0) && c_dr_i == 1) && 0 == p_num_write) - InvariantResult [Line: 237]: Loop Invariant Derived loop invariant: (((((((((0 == q_free && 2 <= p_dw_st) && (2 <= c_dr_st && p_dw_pc == 1) && p_last_write == q_buf_0) && c_dr_i == 1) || (((((((((c_num_read == 0 && q_free == 1) && 2 <= p_dw_st) && c_last_read == p_last_write) && c_dr_pc == 0) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_dr_st == 0) && c_dr_i == 1) && 0 == p_num_write)) || ((((((((c_num_read == 0 && q_free == 1) && 2 <= p_dw_st) && 2 <= c_dr_st) && c_last_read == p_last_write) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_dr_i == 1) && 0 == p_num_write)) || ((((c_num_read <= p_num_write && p_num_write <= c_num_read) && (2 <= c_dr_st && p_dw_pc == 1) && p_last_write == q_buf_0) && 2 <= p_dw_st) && c_dr_i == 1)) || ((((((((c_num_read == 0 && q_free == 1) && 2 <= c_dr_st) && c_last_read == p_last_write) && 0 == p_dw_st) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_dr_i == 1) && 0 == p_num_write)) || ((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= c_dr_st) && p_dw_pc == 1) && 0 == p_dw_st) && p_last_write == q_buf_0) && c_dr_i == 1)) || ((((0 == q_free && 2 <= p_dw_st) && ((c_num_read + 1 <= p_num_write && p_dw_pc == 1) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && c_dr_st == 0) && c_dr_i == 1)) || (((((((((c_num_read == 0 && q_free == 1) && c_last_read == p_last_write) && 0 == p_dw_st) && c_dr_pc == 0) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_dr_st == 0) && c_dr_i == 1) && 0 == p_num_write) - InvariantResult [Line: 47]: Loop Invariant Derived loop invariant: ((2 <= p_dw_st && ((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && c_last_read == p_last_write) && p_dw_pc == 1) && p_last_write == q_buf_0) && c_dr_i == 1) || (((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && c_last_read == p_last_write) && p_dw_pc == 1) && 0 == p_dw_st) && p_last_write == q_buf_0) && c_dr_i == 1) - InvariantResult [Line: 138]: Loop Invariant Derived loop invariant: ((((c_dr_i == 1 && (((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && c_last_read == p_last_write) && p_dw_pc == 1) && 0 == p_dw_st) && p_last_write == q_buf_0) || ((2 <= p_dw_st && ((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && c_last_read == p_last_write) && p_dw_pc == 1) && p_last_write == q_buf_0) && c_dr_i == 1)) || (((((((c_num_read == 0 && q_free == 1) && 2 <= p_dw_st) && c_last_read == p_last_write) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_dr_i == 1) && 0 == p_num_write)) || (((0 == q_free && 2 <= p_dw_st) && ((c_num_read + 1 <= p_num_write && p_dw_pc == 1) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && c_dr_i == 1)) || (((((((c_num_read == 0 && q_free == 1) && c_last_read == p_last_write) && 0 == p_dw_st) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_dr_i == 1) && 0 == p_num_write) - InvariantResult [Line: 28]: Loop Invariant Derived loop invariant: ((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= p_dw_st) && c_last_read == p_last_write) && p_dw_pc == 1) && p_last_write == q_buf_0) && c_dr_i == 1 - InvariantResult [Line: 230]: Loop Invariant Derived loop invariant: (((((((((0 == q_free && 2 <= p_dw_st) && (2 <= c_dr_st && p_dw_pc == 1) && p_last_write == q_buf_0) && c_dr_i == 1) || (((((((((c_num_read == 0 && q_free == 1) && 2 <= p_dw_st) && c_last_read == p_last_write) && c_dr_pc == 0) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_dr_st == 0) && c_dr_i == 1) && 0 == p_num_write)) || ((((((((c_num_read == 0 && q_free == 1) && 2 <= p_dw_st) && 2 <= c_dr_st) && c_last_read == p_last_write) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_dr_i == 1) && 0 == p_num_write)) || ((((c_num_read <= p_num_write && p_num_write <= c_num_read) && (2 <= c_dr_st && p_dw_pc == 1) && p_last_write == q_buf_0) && 2 <= p_dw_st) && c_dr_i == 1)) || ((((((((c_num_read == 0 && q_free == 1) && 2 <= c_dr_st) && c_last_read == p_last_write) && 0 == p_dw_st) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_dr_i == 1) && 0 == p_num_write)) || ((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= c_dr_st) && p_dw_pc == 1) && 0 == p_dw_st) && p_last_write == q_buf_0) && c_dr_i == 1)) || ((((0 == q_free && 2 <= p_dw_st) && ((c_num_read + 1 <= p_num_write && p_dw_pc == 1) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && c_dr_st == 0) && c_dr_i == 1)) || (((((((((c_num_read == 0 && q_free == 1) && c_last_read == p_last_write) && 0 == p_dw_st) && c_dr_pc == 0) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_dr_st == 0) && c_dr_i == 1) && 0 == p_num_write) - InvariantResult [Line: 284]: Loop Invariant Derived loop invariant: (((((((((0 == q_free && 2 <= p_dw_st) && (2 <= c_dr_st && p_dw_pc == 1) && p_last_write == q_buf_0) && c_dr_i == 1) || (((((((((c_num_read == 0 && q_free == 1) && 2 <= p_dw_st) && c_last_read == p_last_write) && c_dr_pc == 0) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_dr_st == 0) && c_dr_i == 1) && 0 == p_num_write)) || ((((((((c_num_read == 0 && q_free == 1) && 2 <= p_dw_st) && 2 <= c_dr_st) && c_last_read == p_last_write) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_dr_i == 1) && 0 == p_num_write)) || ((((c_num_read <= p_num_write && p_num_write <= c_num_read) && (2 <= c_dr_st && p_dw_pc == 1) && p_last_write == q_buf_0) && 2 <= p_dw_st) && c_dr_i == 1)) || ((((((((c_num_read == 0 && q_free == 1) && 2 <= c_dr_st) && c_last_read == p_last_write) && 0 == p_dw_st) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_dr_i == 1) && 0 == p_num_write)) || ((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= c_dr_st) && p_dw_pc == 1) && 0 == p_dw_st) && p_last_write == q_buf_0) && c_dr_i == 1)) || ((((0 == q_free && 2 <= p_dw_st) && ((c_num_read + 1 <= p_num_write && p_dw_pc == 1) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && c_dr_st == 0) && c_dr_i == 1)) || (((((((((c_num_read == 0 && q_free == 1) && c_last_read == p_last_write) && 0 == p_dw_st) && c_dr_pc == 0) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_dr_st == 0) && c_dr_i == 1) && 0 == p_num_write) - InvariantResult [Line: 28]: Loop Invariant Derived loop invariant: (((((((c_num_read == 0 && 0 == q_free) && 1 == p_num_write) && c_dr_pc == 0) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_dr_st == 0) && c_dr_i == 1) || (((((((c_num_read + 1 <= p_num_write && 0 == q_free) && 2 <= c_dr_st) && p_dw_pc == 1) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) || (((((c_num_read == 0 && 0 == q_free) && 1 == p_num_write) && 2 <= c_dr_st) && 0 == p_dw_pc) && p_last_write == q_buf_0)) && c_dr_i == 1) - InvariantResult [Line: 237]: Loop Invariant Derived loop invariant: (((((((((0 == q_free && 2 <= p_dw_st) && (2 <= c_dr_st && p_dw_pc == 1) && p_last_write == q_buf_0) && c_dr_i == 1) || (((((((((c_num_read == 0 && q_free == 1) && 2 <= p_dw_st) && c_last_read == p_last_write) && c_dr_pc == 0) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_dr_st == 0) && c_dr_i == 1) && 0 == p_num_write)) || ((((((((c_num_read == 0 && q_free == 1) && 2 <= p_dw_st) && 2 <= c_dr_st) && c_last_read == p_last_write) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_dr_i == 1) && 0 == p_num_write)) || ((((c_num_read <= p_num_write && p_num_write <= c_num_read) && (2 <= c_dr_st && p_dw_pc == 1) && p_last_write == q_buf_0) && 2 <= p_dw_st) && c_dr_i == 1)) || ((((((((c_num_read == 0 && q_free == 1) && 2 <= c_dr_st) && c_last_read == p_last_write) && 0 == p_dw_st) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_dr_i == 1) && 0 == p_num_write)) || ((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= c_dr_st) && p_dw_pc == 1) && 0 == p_dw_st) && p_last_write == q_buf_0) && c_dr_i == 1)) || ((((0 == q_free && 2 <= p_dw_st) && ((c_num_read + 1 <= p_num_write && p_dw_pc == 1) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && c_dr_st == 0) && c_dr_i == 1)) || (((((((((c_num_read == 0 && q_free == 1) && c_last_read == p_last_write) && 0 == p_dw_st) && c_dr_pc == 0) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_dr_st == 0) && c_dr_i == 1) && 0 == p_num_write) - InvariantResult [Line: 210]: Loop Invariant Derived loop invariant: (((((((((0 == q_free && 2 <= p_dw_st) && (2 <= c_dr_st && p_dw_pc == 1) && p_last_write == q_buf_0) && c_dr_i == 1) || (((((((((c_num_read == 0 && q_free == 1) && 2 <= p_dw_st) && c_last_read == p_last_write) && c_dr_pc == 0) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_dr_st == 0) && c_dr_i == 1) && 0 == p_num_write)) || ((((((((c_num_read == 0 && q_free == 1) && 2 <= p_dw_st) && 2 <= c_dr_st) && c_last_read == p_last_write) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_dr_i == 1) && 0 == p_num_write)) || ((((c_num_read <= p_num_write && p_num_write <= c_num_read) && (2 <= c_dr_st && p_dw_pc == 1) && p_last_write == q_buf_0) && 2 <= p_dw_st) && c_dr_i == 1)) || ((((((((c_num_read == 0 && q_free == 1) && 2 <= c_dr_st) && c_last_read == p_last_write) && 0 == p_dw_st) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_dr_i == 1) && 0 == p_num_write)) || ((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= c_dr_st) && p_dw_pc == 1) && 0 == p_dw_st) && p_last_write == q_buf_0) && c_dr_i == 1)) || ((((0 == q_free && 2 <= p_dw_st) && ((c_num_read + 1 <= p_num_write && p_dw_pc == 1) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && c_dr_st == 0) && c_dr_i == 1)) || (((((((((c_num_read == 0 && q_free == 1) && c_last_read == p_last_write) && 0 == p_dw_st) && c_dr_pc == 0) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_dr_st == 0) && c_dr_i == 1) && 0 == p_num_write) - InvariantResult [Line: 303]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 210]: Loop Invariant Derived loop invariant: (((((((((0 == q_free && 2 <= p_dw_st) && (2 <= c_dr_st && p_dw_pc == 1) && p_last_write == q_buf_0) && c_dr_i == 1) || (((((((((c_num_read == 0 && q_free == 1) && 2 <= p_dw_st) && c_last_read == p_last_write) && c_dr_pc == 0) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_dr_st == 0) && c_dr_i == 1) && 0 == p_num_write)) || ((((((((c_num_read == 0 && q_free == 1) && 2 <= p_dw_st) && 2 <= c_dr_st) && c_last_read == p_last_write) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_dr_i == 1) && 0 == p_num_write)) || ((((c_num_read <= p_num_write && p_num_write <= c_num_read) && (2 <= c_dr_st && p_dw_pc == 1) && p_last_write == q_buf_0) && 2 <= p_dw_st) && c_dr_i == 1)) || ((((((((c_num_read == 0 && q_free == 1) && 2 <= c_dr_st) && c_last_read == p_last_write) && 0 == p_dw_st) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_dr_i == 1) && 0 == p_num_write)) || ((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= c_dr_st) && p_dw_pc == 1) && 0 == p_dw_st) && p_last_write == q_buf_0) && c_dr_i == 1)) || ((((0 == q_free && 2 <= p_dw_st) && ((c_num_read + 1 <= p_num_write && p_dw_pc == 1) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && c_dr_st == 0) && c_dr_i == 1)) || (((((((((c_num_read == 0 && q_free == 1) && c_last_read == p_last_write) && 0 == p_dw_st) && c_dr_pc == 0) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_dr_st == 0) && c_dr_i == 1) && 0 == p_num_write) - InvariantResult [Line: 332]: Loop Invariant Derived loop invariant: ((((((((c_num_read == 0 && q_free == 1) && c_last_read == p_last_write) && 0 == p_dw_st) && c_dr_pc == 0) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_dr_st == 0) && c_dr_i == 1) && 0 == p_num_write - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 76 locations, 2 error locations. Result: SAFE, OverallTime: 6.1s, OverallIterations: 12, TraceHistogramMax: 3, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 3.8s, HoareTripleCheckerStatistics: 1443 SDtfs, 1095 SDslu, 1141 SDs, 0 SdLazy, 117 SolverSat, 41 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 94 GetRequests, 75 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=761occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 12 MinimizatonAttempts, 474 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 27 LocationsWithAnnotation, 27 PreInvPairs, 157 NumberOfFragments, 3120 HoareAnnotationTreeSize, 27 FomulaSimplifications, 2984 FormulaSimplificationTreeSizeReduction, 0.3s HoareSimplificationTime, 27 FomulaSimplificationsInter, 1955 FormulaSimplificationTreeSizeReductionInter, 3.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 728 NumberOfCodeBlocks, 728 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 715 ConstructedInterpolants, 0 QuantifiedInterpolants, 92635 SizeOfPredicates, 2 NumberOfNonLiveVariables, 192 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 13 InterpolantComputations, 11 PerfectInterpolantSequences, 119/123 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...