./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/systemc/pc_sfifo_2.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 839c364b Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/systemc/pc_sfifo_2.cil-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b74079121634b4e5d8b815834e604eed77442466d93875e78a8cab3fe135fa1f --- Real Ultimate output --- This is Ultimate 0.2.2-839c364b5d67a0f615c82cb70ab247790648d4a9-839c364 [2021-12-14 14:51:53,285 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-14 14:51:53,299 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-14 14:51:53,341 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-14 14:51:53,342 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-14 14:51:53,342 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-14 14:51:53,343 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-14 14:51:53,344 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-14 14:51:53,345 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-14 14:51:53,346 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-14 14:51:53,347 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-14 14:51:53,347 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-14 14:51:53,349 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-14 14:51:53,349 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-14 14:51:53,352 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-14 14:51:53,353 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-14 14:51:53,354 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-14 14:51:53,358 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-14 14:51:53,359 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-14 14:51:53,360 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-14 14:51:53,363 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-14 14:51:53,365 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-14 14:51:53,365 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-14 14:51:53,366 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-14 14:51:53,368 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-14 14:51:53,371 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-14 14:51:53,371 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-14 14:51:53,372 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-14 14:51:53,373 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-14 14:51:53,373 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-14 14:51:53,373 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-14 14:51:53,374 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-14 14:51:53,375 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-14 14:51:53,376 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-14 14:51:53,377 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-14 14:51:53,377 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-14 14:51:53,378 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-14 14:51:53,378 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-14 14:51:53,378 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-14 14:51:53,379 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-14 14:51:53,379 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-14 14:51:53,380 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-14 14:51:53,407 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-14 14:51:53,407 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-14 14:51:53,407 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-14 14:51:53,408 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-14 14:51:53,408 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-14 14:51:53,408 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-14 14:51:53,409 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-14 14:51:53,409 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-14 14:51:53,409 INFO L138 SettingsManager]: * Use SBE=true [2021-12-14 14:51:53,409 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-14 14:51:53,410 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-14 14:51:53,410 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-14 14:51:53,410 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-14 14:51:53,411 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-14 14:51:53,411 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-14 14:51:53,411 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-14 14:51:53,411 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-14 14:51:53,411 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-14 14:51:53,411 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-14 14:51:53,411 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-14 14:51:53,412 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-14 14:51:53,412 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-14 14:51:53,412 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-14 14:51:53,412 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-14 14:51:53,412 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-14 14:51:53,412 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-14 14:51:53,413 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-14 14:51:53,413 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-14 14:51:53,414 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-14 14:51:53,414 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-14 14:51:53,414 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-14 14:51:53,414 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-14 14:51:53,414 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-14 14:51:53,414 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-14 14:51:53,415 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_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 -> b74079121634b4e5d8b815834e604eed77442466d93875e78a8cab3fe135fa1f [2021-12-14 14:51:53,614 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-14 14:51:53,633 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-14 14:51:53,635 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-14 14:51:53,636 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-14 14:51:53,637 INFO L275 PluginConnector]: CDTParser initialized [2021-12-14 14:51:53,638 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/pc_sfifo_2.cil-1.c [2021-12-14 14:51:53,705 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/41f35200e/b3d6752a022448d5bf549d9013d170fb/FLAG3019ea44d [2021-12-14 14:51:54,084 INFO L306 CDTParser]: Found 1 translation units. [2021-12-14 14:51:54,084 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/pc_sfifo_2.cil-1.c [2021-12-14 14:51:54,090 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/41f35200e/b3d6752a022448d5bf549d9013d170fb/FLAG3019ea44d [2021-12-14 14:51:54,099 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/41f35200e/b3d6752a022448d5bf549d9013d170fb [2021-12-14 14:51:54,101 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-14 14:51:54,102 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-14 14:51:54,103 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-14 14:51:54,103 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-14 14:51:54,114 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-14 14:51:54,115 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 02:51:54" (1/1) ... [2021-12-14 14:51:54,116 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ff69445 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:51:54, skipping insertion in model container [2021-12-14 14:51:54,116 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 02:51:54" (1/1) ... [2021-12-14 14:51:54,120 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-14 14:51:54,139 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-14 14:51:54,257 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/pc_sfifo_2.cil-1.c[643,656] [2021-12-14 14:51:54,292 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 14:51:54,306 INFO L203 MainTranslator]: Completed pre-run [2021-12-14 14:51:54,318 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/pc_sfifo_2.cil-1.c[643,656] [2021-12-14 14:51:54,348 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 14:51:54,366 INFO L208 MainTranslator]: Completed translation [2021-12-14 14:51:54,366 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:51:54 WrapperNode [2021-12-14 14:51:54,366 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-14 14:51:54,367 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-14 14:51:54,368 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-14 14:51:54,368 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-14 14:51:54,373 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:51:54" (1/1) ... [2021-12-14 14:51:54,386 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:51:54" (1/1) ... [2021-12-14 14:51:54,406 INFO L137 Inliner]: procedures = 29, calls = 31, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 187 [2021-12-14 14:51:54,406 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-14 14:51:54,407 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-14 14:51:54,407 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-14 14:51:54,407 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-14 14:51:54,413 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:51:54" (1/1) ... [2021-12-14 14:51:54,413 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:51:54" (1/1) ... [2021-12-14 14:51:54,421 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:51:54" (1/1) ... [2021-12-14 14:51:54,421 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:51:54" (1/1) ... [2021-12-14 14:51:54,425 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:51:54" (1/1) ... [2021-12-14 14:51:54,429 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:51:54" (1/1) ... [2021-12-14 14:51:54,430 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:51:54" (1/1) ... [2021-12-14 14:51:54,432 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-14 14:51:54,433 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-14 14:51:54,433 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-14 14:51:54,433 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-14 14:51:54,438 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:51:54" (1/1) ... [2021-12-14 14:51:54,445 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-14 14:51:54,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 14:51:54,464 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-14 14:51:54,465 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-14 14:51:54,487 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-14 14:51:54,487 INFO L130 BoogieDeclarations]: Found specification of procedure error [2021-12-14 14:51:54,487 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2021-12-14 14:51:54,488 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2021-12-14 14:51:54,488 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2021-12-14 14:51:54,488 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2021-12-14 14:51:54,488 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2021-12-14 14:51:54,488 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2021-12-14 14:51:54,488 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2021-12-14 14:51:54,489 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2021-12-14 14:51:54,489 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2021-12-14 14:51:54,489 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2021-12-14 14:51:54,489 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2021-12-14 14:51:54,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-14 14:51:54,489 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2021-12-14 14:51:54,489 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2021-12-14 14:51:54,489 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-14 14:51:54,490 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-14 14:51:54,490 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2021-12-14 14:51:54,490 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2021-12-14 14:51:54,568 INFO L236 CfgBuilder]: Building ICFG [2021-12-14 14:51:54,569 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-14 14:51:54,834 INFO L277 CfgBuilder]: Performing block encoding [2021-12-14 14:51:54,844 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-14 14:51:54,844 INFO L301 CfgBuilder]: Removed 4 assume(true) statements. [2021-12-14 14:51:54,846 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 02:51:54 BoogieIcfgContainer [2021-12-14 14:51:54,847 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-14 14:51:54,848 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-14 14:51:54,848 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-14 14:51:54,850 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-14 14:51:54,850 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 02:51:54" (1/3) ... [2021-12-14 14:51:54,851 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bce929f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 02:51:54, skipping insertion in model container [2021-12-14 14:51:54,851 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:51:54" (2/3) ... [2021-12-14 14:51:54,852 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bce929f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 02:51:54, skipping insertion in model container [2021-12-14 14:51:54,852 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 02:51:54" (3/3) ... [2021-12-14 14:51:54,853 INFO L111 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-1.c [2021-12-14 14:51:54,856 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-14 14:51:54,857 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-14 14:51:54,896 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-14 14:51:54,902 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-12-14 14:51:54,902 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-14 14:51:54,928 INFO L276 IsEmpty]: Start isEmpty. Operand has 103 states, 79 states have (on average 1.518987341772152) internal successors, (120), 83 states have internal predecessors, (120), 14 states have call successors, (14), 8 states have call predecessors, (14), 8 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2021-12-14 14:51:54,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-12-14 14:51:54,934 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 14:51:54,935 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 14:51:54,935 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 14:51:54,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 14:51:54,939 INFO L85 PathProgramCache]: Analyzing trace with hash 1645662907, now seen corresponding path program 1 times [2021-12-14 14:51:54,945 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 14:51:54,945 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560395745] [2021-12-14 14:51:54,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 14:51:54,946 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 14:51:55,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:51:55,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:51:55,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:51:55,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-14 14:51:55,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:51:55,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-14 14:51:55,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:51:55,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 14:51:55,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:51:55,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:51:55,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:51:55,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-12-14 14:51:55,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:51:55,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-14 14:51:55,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:51:55,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 14:51:55,234 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 14:51:55,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560395745] [2021-12-14 14:51:55,235 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560395745] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 14:51:55,235 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 14:51:55,235 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-14 14:51:55,236 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963716703] [2021-12-14 14:51:55,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 14:51:55,240 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 14:51:55,240 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 14:51:55,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 14:51:55,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-14 14:51:55,263 INFO L87 Difference]: Start difference. First operand has 103 states, 79 states have (on average 1.518987341772152) internal successors, (120), 83 states have internal predecessors, (120), 14 states have call successors, (14), 8 states have call predecessors, (14), 8 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 3 states have internal predecessors, (49), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2021-12-14 14:51:55,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 14:51:55,547 INFO L93 Difference]: Finished difference Result 215 states and 313 transitions. [2021-12-14 14:51:55,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-14 14:51:55,550 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 3 states have internal predecessors, (49), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 64 [2021-12-14 14:51:55,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 14:51:55,558 INFO L225 Difference]: With dead ends: 215 [2021-12-14 14:51:55,558 INFO L226 Difference]: Without dead ends: 115 [2021-12-14 14:51:55,561 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-12-14 14:51:55,563 INFO L933 BasicCegarLoop]: 135 mSDtfsCounter, 209 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 14:51:55,564 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [219 Valid, 299 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 14:51:55,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2021-12-14 14:51:55,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 97. [2021-12-14 14:51:55,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 75 states have (on average 1.4) internal successors, (105), 77 states have internal predecessors, (105), 14 states have call successors, (14), 8 states have call predecessors, (14), 7 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2021-12-14 14:51:55,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 131 transitions. [2021-12-14 14:51:55,602 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 131 transitions. Word has length 64 [2021-12-14 14:51:55,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 14:51:55,602 INFO L470 AbstractCegarLoop]: Abstraction has 97 states and 131 transitions. [2021-12-14 14:51:55,602 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 3 states have internal predecessors, (49), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2021-12-14 14:51:55,603 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 131 transitions. [2021-12-14 14:51:55,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-12-14 14:51:55,605 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 14:51:55,605 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 14:51:55,605 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-14 14:51:55,605 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 14:51:55,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 14:51:55,606 INFO L85 PathProgramCache]: Analyzing trace with hash 258877497, now seen corresponding path program 1 times [2021-12-14 14:51:55,606 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 14:51:55,606 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216930614] [2021-12-14 14:51:55,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 14:51:55,606 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 14:51:55,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:51:55,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:51:55,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:51:55,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-14 14:51:55,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:51:55,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-14 14:51:55,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:51:55,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 14:51:55,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:51:55,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:51:55,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:51:55,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-12-14 14:51:55,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:51:55,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-14 14:51:55,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:51:55,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 14:51:55,708 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 14:51:55,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216930614] [2021-12-14 14:51:55,709 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216930614] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 14:51:55,709 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 14:51:55,709 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-14 14:51:55,709 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107286929] [2021-12-14 14:51:55,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 14:51:55,710 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-14 14:51:55,711 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 14:51:55,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-14 14:51:55,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-12-14 14:51:55,712 INFO L87 Difference]: Start difference. First operand 97 states and 131 transitions. Second operand has 8 states, 8 states have (on average 6.125) internal successors, (49), 5 states have internal predecessors, (49), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2021-12-14 14:51:56,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 14:51:56,163 INFO L93 Difference]: Finished difference Result 320 states and 445 transitions. [2021-12-14 14:51:56,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-14 14:51:56,163 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 5 states have internal predecessors, (49), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 64 [2021-12-14 14:51:56,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 14:51:56,166 INFO L225 Difference]: With dead ends: 320 [2021-12-14 14:51:56,166 INFO L226 Difference]: Without dead ends: 232 [2021-12-14 14:51:56,166 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2021-12-14 14:51:56,167 INFO L933 BasicCegarLoop]: 137 mSDtfsCounter, 399 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 385 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 404 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-14 14:51:56,168 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [404 Valid, 432 Invalid, 500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 385 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-14 14:51:56,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2021-12-14 14:51:56,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 193. [2021-12-14 14:51:56,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 151 states have (on average 1.3841059602649006) internal successors, (209), 155 states have internal predecessors, (209), 25 states have call successors, (25), 15 states have call predecessors, (25), 16 states have return successors, (28), 24 states have call predecessors, (28), 23 states have call successors, (28) [2021-12-14 14:51:56,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 262 transitions. [2021-12-14 14:51:56,201 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 262 transitions. Word has length 64 [2021-12-14 14:51:56,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 14:51:56,201 INFO L470 AbstractCegarLoop]: Abstraction has 193 states and 262 transitions. [2021-12-14 14:51:56,201 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 5 states have internal predecessors, (49), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2021-12-14 14:51:56,202 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 262 transitions. [2021-12-14 14:51:56,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-12-14 14:51:56,203 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 14:51:56,204 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 14:51:56,204 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-14 14:51:56,204 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 14:51:56,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 14:51:56,204 INFO L85 PathProgramCache]: Analyzing trace with hash 662663448, now seen corresponding path program 1 times [2021-12-14 14:51:56,205 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 14:51:56,205 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719586801] [2021-12-14 14:51:56,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 14:51:56,205 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 14:51:56,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:51:56,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:51:56,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:51:56,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-14 14:51:56,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:51:56,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-14 14:51:56,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:51:56,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 14:51:56,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:51:56,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:51:56,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:51:56,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-12-14 14:51:56,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:51:56,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-14 14:51:56,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:51:56,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 14:51:56,296 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 14:51:56,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719586801] [2021-12-14 14:51:56,297 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719586801] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 14:51:56,297 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 14:51:56,297 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-14 14:51:56,297 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916272703] [2021-12-14 14:51:56,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 14:51:56,298 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-14 14:51:56,298 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 14:51:56,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-14 14:51:56,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-12-14 14:51:56,298 INFO L87 Difference]: Start difference. First operand 193 states and 262 transitions. Second operand has 8 states, 8 states have (on average 6.125) internal successors, (49), 6 states have internal predecessors, (49), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2021-12-14 14:51:56,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 14:51:56,745 INFO L93 Difference]: Finished difference Result 540 states and 738 transitions. [2021-12-14 14:51:56,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-14 14:51:56,746 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 6 states have internal predecessors, (49), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 64 [2021-12-14 14:51:56,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 14:51:56,748 INFO L225 Difference]: With dead ends: 540 [2021-12-14 14:51:56,748 INFO L226 Difference]: Without dead ends: 363 [2021-12-14 14:51:56,749 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2021-12-14 14:51:56,750 INFO L933 BasicCegarLoop]: 205 mSDtfsCounter, 446 mSDsluCounter, 486 mSDsCounter, 0 mSdLazyCounter, 504 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 453 SdHoareTripleChecker+Valid, 691 SdHoareTripleChecker+Invalid, 619 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 504 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-14 14:51:56,750 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [453 Valid, 691 Invalid, 619 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 504 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-14 14:51:56,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2021-12-14 14:51:56,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 289. [2021-12-14 14:51:56,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 227 states have (on average 1.3744493392070485) internal successors, (312), 233 states have internal predecessors, (312), 36 states have call successors, (36), 22 states have call predecessors, (36), 25 states have return successors, (47), 36 states have call predecessors, (47), 34 states have call successors, (47) [2021-12-14 14:51:56,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 395 transitions. [2021-12-14 14:51:56,781 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 395 transitions. Word has length 64 [2021-12-14 14:51:56,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 14:51:56,781 INFO L470 AbstractCegarLoop]: Abstraction has 289 states and 395 transitions. [2021-12-14 14:51:56,782 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 6 states have internal predecessors, (49), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2021-12-14 14:51:56,782 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 395 transitions. [2021-12-14 14:51:56,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-12-14 14:51:56,784 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 14:51:56,784 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 14:51:56,784 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-14 14:51:56,784 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 14:51:56,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 14:51:56,785 INFO L85 PathProgramCache]: Analyzing trace with hash -1365922662, now seen corresponding path program 1 times [2021-12-14 14:51:56,785 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 14:51:56,785 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741537865] [2021-12-14 14:51:56,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 14:51:56,785 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 14:51:56,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:51:56,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:51:56,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:51:56,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-14 14:51:56,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:51:56,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-14 14:51:56,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:51:56,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 14:51:56,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:51:56,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:51:56,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:51:56,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-12-14 14:51:56,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:51:56,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-14 14:51:56,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:51:56,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 14:51:56,886 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 14:51:56,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741537865] [2021-12-14 14:51:56,886 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741537865] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 14:51:56,886 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 14:51:56,886 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-14 14:51:56,886 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926394534] [2021-12-14 14:51:56,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 14:51:56,887 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-14 14:51:56,887 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 14:51:56,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-14 14:51:56,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-12-14 14:51:56,887 INFO L87 Difference]: Start difference. First operand 289 states and 395 transitions. Second operand has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 5 states have internal predecessors, (49), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2021-12-14 14:51:57,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 14:51:57,145 INFO L93 Difference]: Finished difference Result 590 states and 809 transitions. [2021-12-14 14:51:57,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-14 14:51:57,146 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 5 states have internal predecessors, (49), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 64 [2021-12-14 14:51:57,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 14:51:57,149 INFO L225 Difference]: With dead ends: 590 [2021-12-14 14:51:57,149 INFO L226 Difference]: Without dead ends: 323 [2021-12-14 14:51:57,152 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2021-12-14 14:51:57,158 INFO L933 BasicCegarLoop]: 120 mSDtfsCounter, 114 mSDsluCounter, 484 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 604 SdHoareTripleChecker+Invalid, 402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 14:51:57,158 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [115 Valid, 604 Invalid, 402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 14:51:57,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2021-12-14 14:51:57,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 294. [2021-12-14 14:51:57,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 231 states have (on average 1.3593073593073592) internal successors, (314), 237 states have internal predecessors, (314), 36 states have call successors, (36), 22 states have call predecessors, (36), 26 states have return successors, (48), 37 states have call predecessors, (48), 34 states have call successors, (48) [2021-12-14 14:51:57,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 398 transitions. [2021-12-14 14:51:57,181 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 398 transitions. Word has length 64 [2021-12-14 14:51:57,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 14:51:57,182 INFO L470 AbstractCegarLoop]: Abstraction has 294 states and 398 transitions. [2021-12-14 14:51:57,182 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 5 states have internal predecessors, (49), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2021-12-14 14:51:57,182 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 398 transitions. [2021-12-14 14:51:57,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-12-14 14:51:57,185 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 14:51:57,186 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 14:51:57,186 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-14 14:51:57,186 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 14:51:57,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 14:51:57,186 INFO L85 PathProgramCache]: Analyzing trace with hash 1899685336, now seen corresponding path program 1 times [2021-12-14 14:51:57,186 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 14:51:57,186 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494170577] [2021-12-14 14:51:57,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 14:51:57,186 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 14:51:57,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:51:57,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:51:57,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:51:57,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-14 14:51:57,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:51:57,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-14 14:51:57,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:51:57,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 14:51:57,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:51:57,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:51:57,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:51:57,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-12-14 14:51:57,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:51:57,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-14 14:51:57,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:51:57,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 14:51:57,341 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 14:51:57,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494170577] [2021-12-14 14:51:57,342 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494170577] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 14:51:57,342 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 14:51:57,342 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-14 14:51:57,343 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916529479] [2021-12-14 14:51:57,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 14:51:57,344 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-14 14:51:57,344 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 14:51:57,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-14 14:51:57,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-12-14 14:51:57,345 INFO L87 Difference]: Start difference. First operand 294 states and 398 transitions. Second operand has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 6 states have internal predecessors, (49), 4 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2021-12-14 14:51:58,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 14:51:58,350 INFO L93 Difference]: Finished difference Result 1956 states and 2670 transitions. [2021-12-14 14:51:58,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-12-14 14:51:58,351 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 6 states have internal predecessors, (49), 4 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 64 [2021-12-14 14:51:58,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 14:51:58,357 INFO L225 Difference]: With dead ends: 1956 [2021-12-14 14:51:58,358 INFO L226 Difference]: Without dead ends: 1684 [2021-12-14 14:51:58,359 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 298 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=235, Invalid=887, Unknown=0, NotChecked=0, Total=1122 [2021-12-14 14:51:58,360 INFO L933 BasicCegarLoop]: 345 mSDtfsCounter, 1150 mSDsluCounter, 582 mSDsCounter, 0 mSdLazyCounter, 832 mSolverCounterSat, 396 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1168 SdHoareTripleChecker+Valid, 927 SdHoareTripleChecker+Invalid, 1228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 396 IncrementalHoareTripleChecker+Valid, 832 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-12-14 14:51:58,360 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1168 Valid, 927 Invalid, 1228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [396 Valid, 832 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-12-14 14:51:58,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1684 states. [2021-12-14 14:51:58,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1684 to 1434. [2021-12-14 14:51:58,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1434 states, 1131 states have (on average 1.3218390804597702) internal successors, (1495), 1157 states have internal predecessors, (1495), 153 states have call successors, (153), 124 states have call predecessors, (153), 149 states have return successors, (234), 155 states have call predecessors, (234), 151 states have call successors, (234) [2021-12-14 14:51:58,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1434 states to 1434 states and 1882 transitions. [2021-12-14 14:51:58,432 INFO L78 Accepts]: Start accepts. Automaton has 1434 states and 1882 transitions. Word has length 64 [2021-12-14 14:51:58,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 14:51:58,433 INFO L470 AbstractCegarLoop]: Abstraction has 1434 states and 1882 transitions. [2021-12-14 14:51:58,433 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 6 states have internal predecessors, (49), 4 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2021-12-14 14:51:58,433 INFO L276 IsEmpty]: Start isEmpty. Operand 1434 states and 1882 transitions. [2021-12-14 14:51:58,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-12-14 14:51:58,440 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 14:51:58,441 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 14:51:58,441 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-14 14:51:58,441 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 14:51:58,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 14:51:58,442 INFO L85 PathProgramCache]: Analyzing trace with hash -1343832871, now seen corresponding path program 1 times [2021-12-14 14:51:58,442 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 14:51:58,442 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420999142] [2021-12-14 14:51:58,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 14:51:58,442 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 14:51:58,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:51:58,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:51:58,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:51:58,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-14 14:51:58,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:51:58,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-14 14:51:58,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:51:58,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 14:51:58,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:51:58,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:51:58,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:51:58,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-12-14 14:51:58,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:51:58,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-14 14:51:58,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:51:58,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 14:51:58,541 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 14:51:58,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420999142] [2021-12-14 14:51:58,541 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420999142] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 14:51:58,541 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 14:51:58,541 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-14 14:51:58,542 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557422082] [2021-12-14 14:51:58,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 14:51:58,542 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-14 14:51:58,542 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 14:51:58,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-14 14:51:58,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-12-14 14:51:58,542 INFO L87 Difference]: Start difference. First operand 1434 states and 1882 transitions. Second operand has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 5 states have internal predecessors, (49), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2021-12-14 14:51:58,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 14:51:58,880 INFO L93 Difference]: Finished difference Result 3035 states and 4006 transitions. [2021-12-14 14:51:58,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-14 14:51:58,880 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 5 states have internal predecessors, (49), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 64 [2021-12-14 14:51:58,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 14:51:58,886 INFO L225 Difference]: With dead ends: 3035 [2021-12-14 14:51:58,886 INFO L226 Difference]: Without dead ends: 1623 [2021-12-14 14:51:58,888 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2021-12-14 14:51:58,888 INFO L933 BasicCegarLoop]: 118 mSDtfsCounter, 112 mSDsluCounter, 479 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 597 SdHoareTripleChecker+Invalid, 406 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 14:51:58,888 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [113 Valid, 597 Invalid, 406 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 364 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 14:51:58,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1623 states. [2021-12-14 14:51:58,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1623 to 1479. [2021-12-14 14:51:58,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1479 states, 1167 states have (on average 1.3041988003427591) internal successors, (1522), 1193 states have internal predecessors, (1522), 153 states have call successors, (153), 124 states have call predecessors, (153), 158 states have return successors, (246), 164 states have call predecessors, (246), 151 states have call successors, (246) [2021-12-14 14:51:58,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1479 states to 1479 states and 1921 transitions. [2021-12-14 14:51:58,942 INFO L78 Accepts]: Start accepts. Automaton has 1479 states and 1921 transitions. Word has length 64 [2021-12-14 14:51:58,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 14:51:58,943 INFO L470 AbstractCegarLoop]: Abstraction has 1479 states and 1921 transitions. [2021-12-14 14:51:58,943 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 5 states have internal predecessors, (49), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2021-12-14 14:51:58,943 INFO L276 IsEmpty]: Start isEmpty. Operand 1479 states and 1921 transitions. [2021-12-14 14:51:58,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-12-14 14:51:58,944 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 14:51:58,944 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 14:51:58,944 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-14 14:51:58,944 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 14:51:58,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 14:51:58,945 INFO L85 PathProgramCache]: Analyzing trace with hash 42370523, now seen corresponding path program 1 times [2021-12-14 14:51:58,945 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 14:51:58,945 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279533491] [2021-12-14 14:51:58,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 14:51:58,945 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 14:51:58,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:51:58,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:51:58,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:51:58,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-14 14:51:58,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:51:58,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-14 14:51:59,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:51:59,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 14:51:59,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:51:59,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:51:59,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:51:59,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-12-14 14:51:59,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:51:59,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-14 14:51:59,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:51:59,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 14:51:59,039 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 14:51:59,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279533491] [2021-12-14 14:51:59,039 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279533491] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 14:51:59,040 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 14:51:59,040 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-14 14:51:59,040 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383037786] [2021-12-14 14:51:59,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 14:51:59,040 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-14 14:51:59,040 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 14:51:59,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-14 14:51:59,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-12-14 14:51:59,041 INFO L87 Difference]: Start difference. First operand 1479 states and 1921 transitions. Second operand has 8 states, 8 states have (on average 6.125) internal successors, (49), 6 states have internal predecessors, (49), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2021-12-14 14:51:59,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 14:51:59,514 INFO L93 Difference]: Finished difference Result 2914 states and 3760 transitions. [2021-12-14 14:51:59,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-14 14:51:59,527 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 6 states have internal predecessors, (49), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 64 [2021-12-14 14:51:59,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 14:51:59,533 INFO L225 Difference]: With dead ends: 2914 [2021-12-14 14:51:59,533 INFO L226 Difference]: Without dead ends: 1677 [2021-12-14 14:51:59,536 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2021-12-14 14:51:59,536 INFO L933 BasicCegarLoop]: 152 mSDtfsCounter, 332 mSDsluCounter, 365 mSDsCounter, 0 mSdLazyCounter, 511 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 336 SdHoareTripleChecker+Valid, 517 SdHoareTripleChecker+Invalid, 609 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 511 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-14 14:51:59,536 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [336 Valid, 517 Invalid, 609 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 511 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-14 14:51:59,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1677 states. [2021-12-14 14:51:59,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1677 to 1457. [2021-12-14 14:51:59,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1457 states, 1153 states have (on average 1.2992194275802256) internal successors, (1498), 1173 states have internal predecessors, (1498), 153 states have call successors, (153), 124 states have call predecessors, (153), 150 states have return successors, (230), 162 states have call predecessors, (230), 151 states have call successors, (230) [2021-12-14 14:51:59,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1457 states to 1457 states and 1881 transitions. [2021-12-14 14:51:59,639 INFO L78 Accepts]: Start accepts. Automaton has 1457 states and 1881 transitions. Word has length 64 [2021-12-14 14:51:59,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 14:51:59,639 INFO L470 AbstractCegarLoop]: Abstraction has 1457 states and 1881 transitions. [2021-12-14 14:51:59,640 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 6 states have internal predecessors, (49), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2021-12-14 14:51:59,640 INFO L276 IsEmpty]: Start isEmpty. Operand 1457 states and 1881 transitions. [2021-12-14 14:51:59,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-12-14 14:51:59,640 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 14:51:59,640 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 14:51:59,640 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-14 14:51:59,641 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 14:51:59,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 14:51:59,641 INFO L85 PathProgramCache]: Analyzing trace with hash -91642983, now seen corresponding path program 1 times [2021-12-14 14:51:59,641 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 14:51:59,641 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361701345] [2021-12-14 14:51:59,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 14:51:59,641 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 14:51:59,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:51:59,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:51:59,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:51:59,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-14 14:51:59,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:51:59,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-14 14:51:59,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:51:59,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 14:51:59,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:51:59,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:51:59,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:51:59,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-12-14 14:51:59,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:51:59,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-14 14:51:59,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:51:59,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 14:51:59,716 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 14:51:59,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361701345] [2021-12-14 14:51:59,716 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361701345] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 14:51:59,716 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 14:51:59,717 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-14 14:51:59,717 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852403072] [2021-12-14 14:51:59,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 14:51:59,717 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-14 14:51:59,717 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 14:51:59,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-14 14:51:59,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-12-14 14:51:59,718 INFO L87 Difference]: Start difference. First operand 1457 states and 1881 transitions. Second operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 4 states have internal predecessors, (49), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2021-12-14 14:52:00,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 14:52:00,041 INFO L93 Difference]: Finished difference Result 4532 states and 5857 transitions. [2021-12-14 14:52:00,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-14 14:52:00,042 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 4 states have internal predecessors, (49), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 64 [2021-12-14 14:52:00,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 14:52:00,054 INFO L225 Difference]: With dead ends: 4532 [2021-12-14 14:52:00,054 INFO L226 Difference]: Without dead ends: 3100 [2021-12-14 14:52:00,058 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2021-12-14 14:52:00,059 INFO L933 BasicCegarLoop]: 122 mSDtfsCounter, 295 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 305 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 14:52:00,059 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [305 Valid, 377 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 276 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 14:52:00,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3100 states. [2021-12-14 14:52:00,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3100 to 2828. [2021-12-14 14:52:00,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2828 states, 2219 states have (on average 1.2672374943668319) internal successors, (2812), 2260 states have internal predecessors, (2812), 305 states have call successors, (305), 247 states have call predecessors, (305), 303 states have return successors, (502), 326 states have call predecessors, (502), 303 states have call successors, (502) [2021-12-14 14:52:00,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2828 states to 2828 states and 3619 transitions. [2021-12-14 14:52:00,193 INFO L78 Accepts]: Start accepts. Automaton has 2828 states and 3619 transitions. Word has length 64 [2021-12-14 14:52:00,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 14:52:00,194 INFO L470 AbstractCegarLoop]: Abstraction has 2828 states and 3619 transitions. [2021-12-14 14:52:00,194 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 4 states have internal predecessors, (49), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2021-12-14 14:52:00,194 INFO L276 IsEmpty]: Start isEmpty. Operand 2828 states and 3619 transitions. [2021-12-14 14:52:00,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-12-14 14:52:00,195 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 14:52:00,195 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 14:52:00,195 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-14 14:52:00,196 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 14:52:00,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 14:52:00,196 INFO L85 PathProgramCache]: Analyzing trace with hash 2137648849, now seen corresponding path program 1 times [2021-12-14 14:52:00,196 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 14:52:00,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678091110] [2021-12-14 14:52:00,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 14:52:00,197 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 14:52:00,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:00,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:52:00,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:00,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-14 14:52:00,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:00,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-14 14:52:00,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:00,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 14:52:00,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:00,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:52:00,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:00,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-12-14 14:52:00,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:00,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-14 14:52:00,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:00,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 14:52:00,244 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 14:52:00,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678091110] [2021-12-14 14:52:00,244 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678091110] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 14:52:00,244 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 14:52:00,244 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-14 14:52:00,244 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924278853] [2021-12-14 14:52:00,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 14:52:00,245 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 14:52:00,245 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 14:52:00,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 14:52:00,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-14 14:52:00,245 INFO L87 Difference]: Start difference. First operand 2828 states and 3619 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2021-12-14 14:52:00,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 14:52:00,533 INFO L93 Difference]: Finished difference Result 7846 states and 10129 transitions. [2021-12-14 14:52:00,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-14 14:52:00,534 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 65 [2021-12-14 14:52:00,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 14:52:00,553 INFO L225 Difference]: With dead ends: 7846 [2021-12-14 14:52:00,553 INFO L226 Difference]: Without dead ends: 5022 [2021-12-14 14:52:00,560 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-12-14 14:52:00,562 INFO L933 BasicCegarLoop]: 133 mSDtfsCounter, 377 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 385 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 14:52:00,563 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [385 Valid, 298 Invalid, 275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 14:52:00,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5022 states. [2021-12-14 14:52:00,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5022 to 4506. [2021-12-14 14:52:00,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4506 states, 3504 states have (on average 1.259703196347032) internal successors, (4414), 3552 states have internal predecessors, (4414), 499 states have call successors, (499), 421 states have call predecessors, (499), 502 states have return successors, (823), 538 states have call predecessors, (823), 497 states have call successors, (823) [2021-12-14 14:52:00,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4506 states to 4506 states and 5736 transitions. [2021-12-14 14:52:00,743 INFO L78 Accepts]: Start accepts. Automaton has 4506 states and 5736 transitions. Word has length 65 [2021-12-14 14:52:00,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 14:52:00,744 INFO L470 AbstractCegarLoop]: Abstraction has 4506 states and 5736 transitions. [2021-12-14 14:52:00,744 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2021-12-14 14:52:00,744 INFO L276 IsEmpty]: Start isEmpty. Operand 4506 states and 5736 transitions. [2021-12-14 14:52:00,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-12-14 14:52:00,745 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 14:52:00,746 INFO L514 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 14:52:00,746 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-14 14:52:00,746 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 14:52:00,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 14:52:00,746 INFO L85 PathProgramCache]: Analyzing trace with hash -78334537, now seen corresponding path program 1 times [2021-12-14 14:52:00,747 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 14:52:00,747 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584206515] [2021-12-14 14:52:00,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 14:52:00,747 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 14:52:00,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:00,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:52:00,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:00,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-14 14:52:00,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:00,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-14 14:52:00,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:00,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 14:52:00,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:00,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:52:00,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:00,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-12-14 14:52:00,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:00,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-14 14:52:00,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:00,798 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 14:52:00,798 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 14:52:00,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584206515] [2021-12-14 14:52:00,798 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584206515] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 14:52:00,799 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 14:52:00,799 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-14 14:52:00,799 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741658412] [2021-12-14 14:52:00,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 14:52:00,799 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-14 14:52:00,799 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 14:52:00,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-14 14:52:00,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-14 14:52:00,800 INFO L87 Difference]: Start difference. First operand 4506 states and 5736 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2021-12-14 14:52:01,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 14:52:01,170 INFO L93 Difference]: Finished difference Result 6136 states and 7738 transitions. [2021-12-14 14:52:01,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-14 14:52:01,170 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 72 [2021-12-14 14:52:01,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 14:52:01,191 INFO L225 Difference]: With dead ends: 6136 [2021-12-14 14:52:01,191 INFO L226 Difference]: Without dead ends: 6133 [2021-12-14 14:52:01,193 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2021-12-14 14:52:01,194 INFO L933 BasicCegarLoop]: 132 mSDtfsCounter, 549 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 159 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 558 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 159 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 14:52:01,194 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [558 Valid, 281 Invalid, 348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [159 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 14:52:01,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6133 states. [2021-12-14 14:52:01,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6133 to 5560. [2021-12-14 14:52:01,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5560 states, 4307 states have (on average 1.2500580450429533) internal successors, (5384), 4364 states have internal predecessors, (5384), 625 states have call successors, (625), 535 states have call predecessors, (625), 627 states have return successors, (1016), 666 states have call predecessors, (1016), 624 states have call successors, (1016) [2021-12-14 14:52:01,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5560 states to 5560 states and 7025 transitions. [2021-12-14 14:52:01,407 INFO L78 Accepts]: Start accepts. Automaton has 5560 states and 7025 transitions. Word has length 72 [2021-12-14 14:52:01,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 14:52:01,407 INFO L470 AbstractCegarLoop]: Abstraction has 5560 states and 7025 transitions. [2021-12-14 14:52:01,407 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2021-12-14 14:52:01,407 INFO L276 IsEmpty]: Start isEmpty. Operand 5560 states and 7025 transitions. [2021-12-14 14:52:01,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-12-14 14:52:01,409 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 14:52:01,409 INFO L514 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 14:52:01,409 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-14 14:52:01,409 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 14:52:01,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 14:52:01,409 INFO L85 PathProgramCache]: Analyzing trace with hash 1866244794, now seen corresponding path program 1 times [2021-12-14 14:52:01,410 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 14:52:01,410 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113306746] [2021-12-14 14:52:01,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 14:52:01,410 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 14:52:01,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:01,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:52:01,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:01,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-14 14:52:01,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:01,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-14 14:52:01,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:01,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 14:52:01,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:01,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:52:01,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:01,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-12-14 14:52:01,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:01,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-14 14:52:01,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:01,497 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 14:52:01,497 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 14:52:01,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113306746] [2021-12-14 14:52:01,498 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113306746] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 14:52:01,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [316411246] [2021-12-14 14:52:01,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 14:52:01,498 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 14:52:01,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 14:52:01,500 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 14:52:01,543 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-14 14:52:01,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:01,575 INFO L263 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 9 conjunts are in the unsatisfiable core [2021-12-14 14:52:01,581 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 14:52:01,934 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 14:52:01,934 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 14:52:02,127 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 14:52:02,128 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [316411246] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 14:52:02,128 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 14:52:02,128 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 4] total 10 [2021-12-14 14:52:02,128 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247370394] [2021-12-14 14:52:02,128 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 14:52:02,128 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-14 14:52:02,129 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 14:52:02,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-14 14:52:02,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-12-14 14:52:02,129 INFO L87 Difference]: Start difference. First operand 5560 states and 7025 transitions. Second operand has 10 states, 10 states have (on average 11.9) internal successors, (119), 7 states have internal predecessors, (119), 4 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2021-12-14 14:52:03,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 14:52:03,227 INFO L93 Difference]: Finished difference Result 13206 states and 16553 transitions. [2021-12-14 14:52:03,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-12-14 14:52:03,228 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.9) internal successors, (119), 7 states have internal predecessors, (119), 4 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) Word has length 73 [2021-12-14 14:52:03,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 14:52:03,279 INFO L225 Difference]: With dead ends: 13206 [2021-12-14 14:52:03,280 INFO L226 Difference]: Without dead ends: 13203 [2021-12-14 14:52:03,286 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 172 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=170, Invalid=642, Unknown=0, NotChecked=0, Total=812 [2021-12-14 14:52:03,287 INFO L933 BasicCegarLoop]: 298 mSDtfsCounter, 1021 mSDsluCounter, 527 mSDsCounter, 0 mSdLazyCounter, 872 mSolverCounterSat, 230 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1065 SdHoareTripleChecker+Valid, 825 SdHoareTripleChecker+Invalid, 1102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 230 IncrementalHoareTripleChecker+Valid, 872 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-14 14:52:03,287 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1065 Valid, 825 Invalid, 1102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [230 Valid, 872 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-14 14:52:03,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13203 states. [2021-12-14 14:52:03,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13203 to 10818. [2021-12-14 14:52:03,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10818 states, 8399 states have (on average 1.249315394689844) internal successors, (10493), 8508 states have internal predecessors, (10493), 1191 states have call successors, (1191), 1025 states have call predecessors, (1191), 1227 states have return successors, (1955), 1290 states have call predecessors, (1955), 1190 states have call successors, (1955) [2021-12-14 14:52:03,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10818 states to 10818 states and 13639 transitions. [2021-12-14 14:52:03,748 INFO L78 Accepts]: Start accepts. Automaton has 10818 states and 13639 transitions. Word has length 73 [2021-12-14 14:52:03,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 14:52:03,749 INFO L470 AbstractCegarLoop]: Abstraction has 10818 states and 13639 transitions. [2021-12-14 14:52:03,749 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.9) internal successors, (119), 7 states have internal predecessors, (119), 4 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2021-12-14 14:52:03,749 INFO L276 IsEmpty]: Start isEmpty. Operand 10818 states and 13639 transitions. [2021-12-14 14:52:03,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-12-14 14:52:03,751 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 14:52:03,751 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 14:52:03,767 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-14 14:52:03,966 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2021-12-14 14:52:03,966 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 14:52:03,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 14:52:03,967 INFO L85 PathProgramCache]: Analyzing trace with hash -1600677641, now seen corresponding path program 2 times [2021-12-14 14:52:03,967 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 14:52:03,967 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620323255] [2021-12-14 14:52:03,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 14:52:03,967 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 14:52:03,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:03,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:52:03,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:03,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-14 14:52:03,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:04,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-14 14:52:04,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:04,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 14:52:04,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:04,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:52:04,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:04,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-12-14 14:52:04,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:04,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-14 14:52:04,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:04,013 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 14:52:04,013 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 14:52:04,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620323255] [2021-12-14 14:52:04,013 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620323255] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 14:52:04,013 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 14:52:04,013 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-14 14:52:04,013 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244478284] [2021-12-14 14:52:04,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 14:52:04,014 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 14:52:04,014 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 14:52:04,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 14:52:04,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-14 14:52:04,015 INFO L87 Difference]: Start difference. First operand 10818 states and 13639 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 3 states have internal predecessors, (61), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2021-12-14 14:52:04,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 14:52:04,501 INFO L93 Difference]: Finished difference Result 17361 states and 21981 transitions. [2021-12-14 14:52:04,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-14 14:52:04,502 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 3 states have internal predecessors, (61), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 76 [2021-12-14 14:52:04,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 14:52:04,526 INFO L225 Difference]: With dead ends: 17361 [2021-12-14 14:52:04,527 INFO L226 Difference]: Without dead ends: 7423 [2021-12-14 14:52:04,549 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-12-14 14:52:04,550 INFO L933 BasicCegarLoop]: 177 mSDtfsCounter, 202 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 458 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 14:52:04,550 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [212 Valid, 458 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 14:52:04,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7423 states. [2021-12-14 14:52:04,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7423 to 6871. [2021-12-14 14:52:04,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6871 states, 5346 states have (on average 1.222035166479611) internal successors, (6533), 5411 states have internal predecessors, (6533), 758 states have call successors, (758), 649 states have call predecessors, (758), 766 states have return successors, (1174), 816 states have call predecessors, (1174), 757 states have call successors, (1174) [2021-12-14 14:52:04,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6871 states to 6871 states and 8465 transitions. [2021-12-14 14:52:04,877 INFO L78 Accepts]: Start accepts. Automaton has 6871 states and 8465 transitions. Word has length 76 [2021-12-14 14:52:04,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 14:52:04,878 INFO L470 AbstractCegarLoop]: Abstraction has 6871 states and 8465 transitions. [2021-12-14 14:52:04,878 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 3 states have internal predecessors, (61), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2021-12-14 14:52:04,879 INFO L276 IsEmpty]: Start isEmpty. Operand 6871 states and 8465 transitions. [2021-12-14 14:52:04,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-12-14 14:52:04,880 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 14:52:04,881 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 14:52:04,881 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-12-14 14:52:04,881 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 14:52:04,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 14:52:04,881 INFO L85 PathProgramCache]: Analyzing trace with hash -1691663828, now seen corresponding path program 1 times [2021-12-14 14:52:04,881 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 14:52:04,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147173874] [2021-12-14 14:52:04,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 14:52:04,882 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 14:52:04,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:04,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:52:04,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:04,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-14 14:52:04,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:04,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-14 14:52:04,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:04,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 14:52:04,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:04,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:52:04,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:04,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-12-14 14:52:04,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:04,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-14 14:52:04,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:04,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2021-12-14 14:52:04,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:04,958 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-14 14:52:04,959 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 14:52:04,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147173874] [2021-12-14 14:52:04,959 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147173874] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 14:52:04,959 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 14:52:04,959 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-14 14:52:04,959 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917685201] [2021-12-14 14:52:04,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 14:52:04,960 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-14 14:52:04,960 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 14:52:04,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-14 14:52:04,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-12-14 14:52:04,960 INFO L87 Difference]: Start difference. First operand 6871 states and 8465 transitions. Second operand has 8 states, 8 states have (on average 7.75) internal successors, (62), 5 states have internal predecessors, (62), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2021-12-14 14:52:05,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 14:52:05,801 INFO L93 Difference]: Finished difference Result 20729 states and 25646 transitions. [2021-12-14 14:52:05,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-12-14 14:52:05,802 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 5 states have internal predecessors, (62), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 83 [2021-12-14 14:52:05,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 14:52:05,845 INFO L225 Difference]: With dead ends: 20729 [2021-12-14 14:52:05,846 INFO L226 Difference]: Without dead ends: 13886 [2021-12-14 14:52:05,862 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2021-12-14 14:52:05,863 INFO L933 BasicCegarLoop]: 182 mSDtfsCounter, 715 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 481 mSolverCounterSat, 241 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 728 SdHoareTripleChecker+Valid, 465 SdHoareTripleChecker+Invalid, 722 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 241 IncrementalHoareTripleChecker+Valid, 481 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-14 14:52:05,864 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [728 Valid, 465 Invalid, 722 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [241 Valid, 481 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-14 14:52:05,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13886 states. [2021-12-14 14:52:06,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13886 to 13027. [2021-12-14 14:52:06,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13027 states, 10018 states have (on average 1.19944100618886) internal successors, (12016), 10185 states have internal predecessors, (12016), 1462 states have call successors, (1462), 1253 states have call predecessors, (1462), 1546 states have return successors, (2563), 1594 states have call predecessors, (2563), 1461 states have call successors, (2563) [2021-12-14 14:52:06,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13027 states to 13027 states and 16041 transitions. [2021-12-14 14:52:06,361 INFO L78 Accepts]: Start accepts. Automaton has 13027 states and 16041 transitions. Word has length 83 [2021-12-14 14:52:06,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 14:52:06,361 INFO L470 AbstractCegarLoop]: Abstraction has 13027 states and 16041 transitions. [2021-12-14 14:52:06,362 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 5 states have internal predecessors, (62), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2021-12-14 14:52:06,362 INFO L276 IsEmpty]: Start isEmpty. Operand 13027 states and 16041 transitions. [2021-12-14 14:52:06,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2021-12-14 14:52:06,366 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 14:52:06,366 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 14:52:06,366 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-14 14:52:06,366 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 14:52:06,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 14:52:06,367 INFO L85 PathProgramCache]: Analyzing trace with hash -1092647019, now seen corresponding path program 1 times [2021-12-14 14:52:06,367 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 14:52:06,367 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801612460] [2021-12-14 14:52:06,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 14:52:06,367 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 14:52:06,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:06,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:52:06,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:06,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-14 14:52:06,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:06,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-14 14:52:06,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:06,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 14:52:06,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:06,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:52:06,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:06,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-12-14 14:52:06,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:06,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-14 14:52:06,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:06,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-14 14:52:06,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:06,440 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-14 14:52:06,441 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 14:52:06,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801612460] [2021-12-14 14:52:06,441 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801612460] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 14:52:06,441 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 14:52:06,441 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-14 14:52:06,441 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561030683] [2021-12-14 14:52:06,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 14:52:06,442 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-14 14:52:06,442 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 14:52:06,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-14 14:52:06,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-12-14 14:52:06,443 INFO L87 Difference]: Start difference. First operand 13027 states and 16041 transitions. Second operand has 9 states, 9 states have (on average 8.11111111111111) internal successors, (73), 6 states have internal predecessors, (73), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2021-12-14 14:52:07,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 14:52:07,456 INFO L93 Difference]: Finished difference Result 23901 states and 29354 transitions. [2021-12-14 14:52:07,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-12-14 14:52:07,457 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.11111111111111) internal successors, (73), 6 states have internal predecessors, (73), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 92 [2021-12-14 14:52:07,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 14:52:07,490 INFO L225 Difference]: With dead ends: 23901 [2021-12-14 14:52:07,490 INFO L226 Difference]: Without dead ends: 11510 [2021-12-14 14:52:07,518 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=162, Invalid=540, Unknown=0, NotChecked=0, Total=702 [2021-12-14 14:52:07,518 INFO L933 BasicCegarLoop]: 185 mSDtfsCounter, 1035 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 684 mSolverCounterSat, 335 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1056 SdHoareTripleChecker+Valid, 520 SdHoareTripleChecker+Invalid, 1019 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 335 IncrementalHoareTripleChecker+Valid, 684 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-14 14:52:07,518 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1056 Valid, 520 Invalid, 1019 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [335 Valid, 684 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-14 14:52:07,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11510 states. [2021-12-14 14:52:07,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11510 to 10610. [2021-12-14 14:52:07,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10610 states, 8186 states have (on average 1.1887368678231127) internal successors, (9731), 8322 states have internal predecessors, (9731), 1169 states have call successors, (1169), 1002 states have call predecessors, (1169), 1254 states have return successors, (1902), 1291 states have call predecessors, (1902), 1168 states have call successors, (1902) [2021-12-14 14:52:07,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10610 states to 10610 states and 12802 transitions. [2021-12-14 14:52:07,997 INFO L78 Accepts]: Start accepts. Automaton has 10610 states and 12802 transitions. Word has length 92 [2021-12-14 14:52:07,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 14:52:07,998 INFO L470 AbstractCegarLoop]: Abstraction has 10610 states and 12802 transitions. [2021-12-14 14:52:07,998 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.11111111111111) internal successors, (73), 6 states have internal predecessors, (73), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2021-12-14 14:52:07,998 INFO L276 IsEmpty]: Start isEmpty. Operand 10610 states and 12802 transitions. [2021-12-14 14:52:08,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2021-12-14 14:52:08,006 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 14:52:08,006 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 14:52:08,007 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-12-14 14:52:08,007 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 14:52:08,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 14:52:08,007 INFO L85 PathProgramCache]: Analyzing trace with hash 578230399, now seen corresponding path program 1 times [2021-12-14 14:52:08,007 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 14:52:08,007 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98035594] [2021-12-14 14:52:08,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 14:52:08,008 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 14:52:08,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:08,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:52:08,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:08,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-14 14:52:08,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:08,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-14 14:52:08,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:08,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 14:52:08,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:08,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:52:08,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:08,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-12-14 14:52:08,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:08,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-14 14:52:08,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:08,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2021-12-14 14:52:08,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:08,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-14 14:52:08,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:08,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2021-12-14 14:52:08,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:08,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2021-12-14 14:52:08,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:08,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 14:52:08,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:08,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:52:08,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:08,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2021-12-14 14:52:08,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:08,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2021-12-14 14:52:08,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:08,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2021-12-14 14:52:08,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:08,095 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 20 proven. 6 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2021-12-14 14:52:08,095 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 14:52:08,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98035594] [2021-12-14 14:52:08,095 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98035594] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 14:52:08,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2093665195] [2021-12-14 14:52:08,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 14:52:08,096 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 14:52:08,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 14:52:08,097 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 14:52:08,098 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-14 14:52:08,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:08,162 INFO L263 TraceCheckSpWp]: Trace formula consists of 446 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-14 14:52:08,164 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 14:52:08,399 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-14 14:52:08,400 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 14:52:08,400 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2093665195] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 14:52:08,400 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-14 14:52:08,400 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 12 [2021-12-14 14:52:08,400 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928268383] [2021-12-14 14:52:08,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 14:52:08,400 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 14:52:08,400 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 14:52:08,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 14:52:08,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2021-12-14 14:52:08,401 INFO L87 Difference]: Start difference. First operand 10610 states and 12802 transitions. Second operand has 6 states, 6 states have (on average 17.5) internal successors, (105), 5 states have internal predecessors, (105), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) [2021-12-14 14:52:08,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 14:52:08,573 INFO L93 Difference]: Finished difference Result 15682 states and 18945 transitions. [2021-12-14 14:52:08,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-14 14:52:08,573 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.5) internal successors, (105), 5 states have internal predecessors, (105), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) Word has length 144 [2021-12-14 14:52:08,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 14:52:08,587 INFO L225 Difference]: With dead ends: 15682 [2021-12-14 14:52:08,588 INFO L226 Difference]: Without dead ends: 5100 [2021-12-14 14:52:08,603 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2021-12-14 14:52:08,603 INFO L933 BasicCegarLoop]: 129 mSDtfsCounter, 34 mSDsluCounter, 479 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 608 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 14:52:08,603 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 608 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 14:52:08,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5100 states. [2021-12-14 14:52:08,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5100 to 4667. [2021-12-14 14:52:08,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4667 states, 3699 states have (on average 1.1732900783995674) internal successors, (4340), 3735 states have internal predecessors, (4340), 467 states have call successors, (467), 386 states have call predecessors, (467), 500 states have return successors, (738), 545 states have call predecessors, (738), 466 states have call successors, (738) [2021-12-14 14:52:08,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4667 states to 4667 states and 5545 transitions. [2021-12-14 14:52:08,750 INFO L78 Accepts]: Start accepts. Automaton has 4667 states and 5545 transitions. Word has length 144 [2021-12-14 14:52:08,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 14:52:08,750 INFO L470 AbstractCegarLoop]: Abstraction has 4667 states and 5545 transitions. [2021-12-14 14:52:08,751 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.5) internal successors, (105), 5 states have internal predecessors, (105), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) [2021-12-14 14:52:08,751 INFO L276 IsEmpty]: Start isEmpty. Operand 4667 states and 5545 transitions. [2021-12-14 14:52:08,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2021-12-14 14:52:08,756 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 14:52:08,756 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 14:52:08,772 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2021-12-14 14:52:08,972 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-12-14 14:52:08,972 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 14:52:08,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 14:52:08,973 INFO L85 PathProgramCache]: Analyzing trace with hash -371595989, now seen corresponding path program 1 times [2021-12-14 14:52:08,973 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 14:52:08,973 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243864032] [2021-12-14 14:52:08,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 14:52:08,973 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 14:52:08,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:08,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:52:08,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:08,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-14 14:52:08,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:09,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-14 14:52:09,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:09,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 14:52:09,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:09,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:52:09,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:09,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-12-14 14:52:09,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:09,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-14 14:52:09,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:09,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2021-12-14 14:52:09,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:09,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-14 14:52:09,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:09,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-14 14:52:09,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:09,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2021-12-14 14:52:09,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:09,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 14:52:09,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:09,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:52:09,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:09,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-12-14 14:52:09,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:09,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2021-12-14 14:52:09,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:09,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2021-12-14 14:52:09,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:09,030 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2021-12-14 14:52:09,031 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 14:52:09,031 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243864032] [2021-12-14 14:52:09,031 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243864032] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 14:52:09,031 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 14:52:09,031 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-14 14:52:09,031 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787365159] [2021-12-14 14:52:09,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 14:52:09,032 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 14:52:09,032 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 14:52:09,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 14:52:09,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-14 14:52:09,032 INFO L87 Difference]: Start difference. First operand 4667 states and 5545 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 3 states have internal predecessors, (68), 3 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2021-12-14 14:52:09,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 14:52:09,213 INFO L93 Difference]: Finished difference Result 5210 states and 6157 transitions. [2021-12-14 14:52:09,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-14 14:52:09,213 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 3 states have internal predecessors, (68), 3 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 146 [2021-12-14 14:52:09,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 14:52:09,223 INFO L225 Difference]: With dead ends: 5210 [2021-12-14 14:52:09,223 INFO L226 Difference]: Without dead ends: 4461 [2021-12-14 14:52:09,226 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-12-14 14:52:09,226 INFO L933 BasicCegarLoop]: 110 mSDtfsCounter, 215 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 14:52:09,226 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [229 Valid, 248 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 14:52:09,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4461 states. [2021-12-14 14:52:09,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4461 to 4242. [2021-12-14 14:52:09,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4242 states, 3370 states have (on average 1.175074183976261) internal successors, (3960), 3403 states have internal predecessors, (3960), 421 states have call successors, (421), 346 states have call predecessors, (421), 450 states have return successors, (674), 492 states have call predecessors, (674), 420 states have call successors, (674) [2021-12-14 14:52:09,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4242 states to 4242 states and 5055 transitions. [2021-12-14 14:52:09,392 INFO L78 Accepts]: Start accepts. Automaton has 4242 states and 5055 transitions. Word has length 146 [2021-12-14 14:52:09,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 14:52:09,392 INFO L470 AbstractCegarLoop]: Abstraction has 4242 states and 5055 transitions. [2021-12-14 14:52:09,393 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 3 states have internal predecessors, (68), 3 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2021-12-14 14:52:09,393 INFO L276 IsEmpty]: Start isEmpty. Operand 4242 states and 5055 transitions. [2021-12-14 14:52:09,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2021-12-14 14:52:09,398 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 14:52:09,398 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 14:52:09,398 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-12-14 14:52:09,399 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 14:52:09,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 14:52:09,399 INFO L85 PathProgramCache]: Analyzing trace with hash 83168210, now seen corresponding path program 1 times [2021-12-14 14:52:09,399 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 14:52:09,399 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010613527] [2021-12-14 14:52:09,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 14:52:09,399 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 14:52:09,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:09,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:52:09,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:09,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-14 14:52:09,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:09,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-14 14:52:09,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:09,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 14:52:09,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:09,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:52:09,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:09,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-14 14:52:09,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:09,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-12-14 14:52:09,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:09,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2021-12-14 14:52:09,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:09,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-12-14 14:52:09,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:09,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-12-14 14:52:09,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:09,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2021-12-14 14:52:09,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:09,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 14:52:09,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:09,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:52:09,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:09,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2021-12-14 14:52:09,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:09,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2021-12-14 14:52:09,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:09,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2021-12-14 14:52:09,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:09,457 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2021-12-14 14:52:09,457 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 14:52:09,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010613527] [2021-12-14 14:52:09,457 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010613527] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 14:52:09,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1514282861] [2021-12-14 14:52:09,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 14:52:09,457 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 14:52:09,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 14:52:09,458 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 14:52:09,459 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-14 14:52:09,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:09,527 INFO L263 TraceCheckSpWp]: Trace formula consists of 511 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-14 14:52:09,530 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 14:52:09,717 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2021-12-14 14:52:09,717 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 14:52:09,717 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1514282861] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 14:52:09,717 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-14 14:52:09,717 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-12-14 14:52:09,718 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144768336] [2021-12-14 14:52:09,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 14:52:09,718 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 14:52:09,718 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 14:52:09,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 14:52:09,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-12-14 14:52:09,719 INFO L87 Difference]: Start difference. First operand 4242 states and 5055 transitions. Second operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2021-12-14 14:52:09,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 14:52:09,800 INFO L93 Difference]: Finished difference Result 6078 states and 7215 transitions. [2021-12-14 14:52:09,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 14:52:09,800 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 157 [2021-12-14 14:52:09,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 14:52:09,805 INFO L225 Difference]: With dead ends: 6078 [2021-12-14 14:52:09,805 INFO L226 Difference]: Without dead ends: 2113 [2021-12-14 14:52:09,809 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-12-14 14:52:09,810 INFO L933 BasicCegarLoop]: 132 mSDtfsCounter, 36 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 14:52:09,810 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 237 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 14:52:09,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2113 states. [2021-12-14 14:52:09,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2113 to 2113. [2021-12-14 14:52:09,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2113 states, 1690 states have (on average 1.16094674556213) internal successors, (1962), 1707 states have internal predecessors, (1962), 202 states have call successors, (202), 168 states have call predecessors, (202), 220 states have return successors, (303), 237 states have call predecessors, (303), 201 states have call successors, (303) [2021-12-14 14:52:09,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2113 states to 2113 states and 2467 transitions. [2021-12-14 14:52:09,880 INFO L78 Accepts]: Start accepts. Automaton has 2113 states and 2467 transitions. Word has length 157 [2021-12-14 14:52:09,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 14:52:09,880 INFO L470 AbstractCegarLoop]: Abstraction has 2113 states and 2467 transitions. [2021-12-14 14:52:09,880 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2021-12-14 14:52:09,880 INFO L276 IsEmpty]: Start isEmpty. Operand 2113 states and 2467 transitions. [2021-12-14 14:52:09,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2021-12-14 14:52:09,884 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 14:52:09,885 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 14:52:09,904 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-12-14 14:52:10,099 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 14:52:10,099 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 14:52:10,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 14:52:10,100 INFO L85 PathProgramCache]: Analyzing trace with hash 702759848, now seen corresponding path program 1 times [2021-12-14 14:52:10,100 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 14:52:10,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571411608] [2021-12-14 14:52:10,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 14:52:10,100 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 14:52:10,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:10,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:52:10,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:10,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-14 14:52:10,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:10,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-14 14:52:10,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:10,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 14:52:10,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:10,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:52:10,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:10,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-12-14 14:52:10,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:10,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-14 14:52:10,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:10,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2021-12-14 14:52:10,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:10,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-12-14 14:52:10,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:10,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-14 14:52:10,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:10,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2021-12-14 14:52:10,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:10,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 14:52:10,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:10,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:52:10,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:10,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2021-12-14 14:52:10,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:10,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2021-12-14 14:52:10,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:10,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2021-12-14 14:52:10,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:10,169 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2021-12-14 14:52:10,170 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 14:52:10,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571411608] [2021-12-14 14:52:10,170 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571411608] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 14:52:10,170 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 14:52:10,170 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-14 14:52:10,170 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725642467] [2021-12-14 14:52:10,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 14:52:10,171 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-14 14:52:10,171 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 14:52:10,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-14 14:52:10,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-14 14:52:10,171 INFO L87 Difference]: Start difference. First operand 2113 states and 2467 transitions. Second operand has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 4 states have internal predecessors, (93), 3 states have call successors, (15), 5 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2021-12-14 14:52:10,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 14:52:10,379 INFO L93 Difference]: Finished difference Result 3977 states and 4677 transitions. [2021-12-14 14:52:10,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-14 14:52:10,380 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 4 states have internal predecessors, (93), 3 states have call successors, (15), 5 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 158 [2021-12-14 14:52:10,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 14:52:10,384 INFO L225 Difference]: With dead ends: 3977 [2021-12-14 14:52:10,384 INFO L226 Difference]: Without dead ends: 2216 [2021-12-14 14:52:10,387 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2021-12-14 14:52:10,387 INFO L933 BasicCegarLoop]: 141 mSDtfsCounter, 187 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 14:52:10,388 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [188 Valid, 418 Invalid, 285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 14:52:10,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2216 states. [2021-12-14 14:52:10,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2216 to 1672. [2021-12-14 14:52:10,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1672 states, 1341 states have (on average 1.1670395227442207) internal successors, (1565), 1357 states have internal predecessors, (1565), 158 states have call successors, (158), 132 states have call predecessors, (158), 172 states have return successors, (235), 182 states have call predecessors, (235), 157 states have call successors, (235) [2021-12-14 14:52:10,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1672 states to 1672 states and 1958 transitions. [2021-12-14 14:52:10,445 INFO L78 Accepts]: Start accepts. Automaton has 1672 states and 1958 transitions. Word has length 158 [2021-12-14 14:52:10,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 14:52:10,445 INFO L470 AbstractCegarLoop]: Abstraction has 1672 states and 1958 transitions. [2021-12-14 14:52:10,445 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 4 states have internal predecessors, (93), 3 states have call successors, (15), 5 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2021-12-14 14:52:10,445 INFO L276 IsEmpty]: Start isEmpty. Operand 1672 states and 1958 transitions. [2021-12-14 14:52:10,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2021-12-14 14:52:10,448 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 14:52:10,448 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 14:52:10,448 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-12-14 14:52:10,448 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 14:52:10,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 14:52:10,448 INFO L85 PathProgramCache]: Analyzing trace with hash -1973905068, now seen corresponding path program 1 times [2021-12-14 14:52:10,449 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 14:52:10,449 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644397246] [2021-12-14 14:52:10,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 14:52:10,449 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 14:52:10,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:10,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:52:10,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:10,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-14 14:52:10,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:10,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-14 14:52:10,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:10,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 14:52:10,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:10,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:52:10,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:10,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-12-14 14:52:10,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:10,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-14 14:52:10,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:10,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2021-12-14 14:52:10,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:10,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-12-14 14:52:10,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:10,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2021-12-14 14:52:10,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:10,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2021-12-14 14:52:10,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:10,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 14:52:10,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:10,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:52:10,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:10,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2021-12-14 14:52:10,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:10,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2021-12-14 14:52:10,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:10,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2021-12-14 14:52:10,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:10,548 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 19 proven. 7 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2021-12-14 14:52:10,548 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 14:52:10,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644397246] [2021-12-14 14:52:10,548 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644397246] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 14:52:10,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [810806975] [2021-12-14 14:52:10,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 14:52:10,549 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 14:52:10,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 14:52:10,550 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 14:52:10,552 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-14 14:52:10,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:10,620 INFO L263 TraceCheckSpWp]: Trace formula consists of 514 conjuncts, 12 conjunts are in the unsatisfiable core [2021-12-14 14:52:10,625 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 14:52:10,895 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 61 proven. 2 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2021-12-14 14:52:10,896 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 14:52:11,225 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 20 proven. 4 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2021-12-14 14:52:11,225 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [810806975] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 14:52:11,225 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 14:52:11,226 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 14 [2021-12-14 14:52:11,226 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764506159] [2021-12-14 14:52:11,226 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 14:52:11,226 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-14 14:52:11,226 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 14:52:11,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-14 14:52:11,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2021-12-14 14:52:11,227 INFO L87 Difference]: Start difference. First operand 1672 states and 1958 transitions. Second operand has 14 states, 14 states have (on average 17.5) internal successors, (245), 12 states have internal predecessors, (245), 6 states have call successors, (38), 8 states have call predecessors, (38), 10 states have return successors, (35), 6 states have call predecessors, (35), 6 states have call successors, (35) [2021-12-14 14:52:11,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 14:52:11,807 INFO L93 Difference]: Finished difference Result 3707 states and 4436 transitions. [2021-12-14 14:52:11,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-12-14 14:52:11,807 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 17.5) internal successors, (245), 12 states have internal predecessors, (245), 6 states have call successors, (38), 8 states have call predecessors, (38), 10 states have return successors, (35), 6 states have call predecessors, (35), 6 states have call successors, (35) Word has length 161 [2021-12-14 14:52:11,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 14:52:11,812 INFO L225 Difference]: With dead ends: 3707 [2021-12-14 14:52:11,812 INFO L226 Difference]: Without dead ends: 1959 [2021-12-14 14:52:11,815 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 383 GetRequests, 356 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=220, Invalid=592, Unknown=0, NotChecked=0, Total=812 [2021-12-14 14:52:11,816 INFO L933 BasicCegarLoop]: 102 mSDtfsCounter, 1013 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 555 mSolverCounterSat, 369 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1020 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 924 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 369 IncrementalHoareTripleChecker+Valid, 555 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-14 14:52:11,816 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1020 Valid, 379 Invalid, 924 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [369 Valid, 555 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-14 14:52:11,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1959 states. [2021-12-14 14:52:11,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1959 to 1759. [2021-12-14 14:52:11,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1759 states, 1386 states have (on average 1.1392496392496392) internal successors, (1579), 1407 states have internal predecessors, (1579), 180 states have call successors, (180), 156 states have call predecessors, (180), 192 states have return successors, (286), 195 states have call predecessors, (286), 179 states have call successors, (286) [2021-12-14 14:52:11,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1759 states to 1759 states and 2045 transitions. [2021-12-14 14:52:11,905 INFO L78 Accepts]: Start accepts. Automaton has 1759 states and 2045 transitions. Word has length 161 [2021-12-14 14:52:11,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 14:52:11,906 INFO L470 AbstractCegarLoop]: Abstraction has 1759 states and 2045 transitions. [2021-12-14 14:52:11,906 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 17.5) internal successors, (245), 12 states have internal predecessors, (245), 6 states have call successors, (38), 8 states have call predecessors, (38), 10 states have return successors, (35), 6 states have call predecessors, (35), 6 states have call successors, (35) [2021-12-14 14:52:11,906 INFO L276 IsEmpty]: Start isEmpty. Operand 1759 states and 2045 transitions. [2021-12-14 14:52:11,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2021-12-14 14:52:11,909 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 14:52:11,909 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 14:52:11,928 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-12-14 14:52:12,126 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 14:52:12,126 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 14:52:12,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 14:52:12,127 INFO L85 PathProgramCache]: Analyzing trace with hash 11419214, now seen corresponding path program 1 times [2021-12-14 14:52:12,127 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 14:52:12,127 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110023452] [2021-12-14 14:52:12,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 14:52:12,127 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 14:52:12,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:12,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:52:12,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:12,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-14 14:52:12,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:12,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-14 14:52:12,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:12,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 14:52:12,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:12,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:52:12,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:12,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-14 14:52:12,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:12,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-12-14 14:52:12,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:12,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-12-14 14:52:12,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:12,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2021-12-14 14:52:12,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:12,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-12-14 14:52:12,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:12,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-12-14 14:52:12,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:12,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2021-12-14 14:52:12,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:12,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 14:52:12,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:12,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:52:12,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:12,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2021-12-14 14:52:12,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:12,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2021-12-14 14:52:12,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:12,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2021-12-14 14:52:12,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:12,183 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2021-12-14 14:52:12,183 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 14:52:12,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110023452] [2021-12-14 14:52:12,183 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110023452] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 14:52:12,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1343518090] [2021-12-14 14:52:12,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 14:52:12,183 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 14:52:12,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 14:52:12,184 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 14:52:12,185 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-12-14 14:52:12,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:12,257 INFO L263 TraceCheckSpWp]: Trace formula consists of 564 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-14 14:52:12,261 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 14:52:12,465 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2021-12-14 14:52:12,465 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 14:52:12,465 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1343518090] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 14:52:12,465 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-14 14:52:12,465 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2021-12-14 14:52:12,465 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704314845] [2021-12-14 14:52:12,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 14:52:12,466 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-14 14:52:12,466 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 14:52:12,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-14 14:52:12,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-12-14 14:52:12,467 INFO L87 Difference]: Start difference. First operand 1759 states and 2045 transitions. Second operand has 5 states, 5 states have (on average 19.0) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2021-12-14 14:52:12,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 14:52:12,642 INFO L93 Difference]: Finished difference Result 3404 states and 3968 transitions. [2021-12-14 14:52:12,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-14 14:52:12,643 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 178 [2021-12-14 14:52:12,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 14:52:12,646 INFO L225 Difference]: With dead ends: 3404 [2021-12-14 14:52:12,646 INFO L226 Difference]: Without dead ends: 1476 [2021-12-14 14:52:12,648 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 205 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2021-12-14 14:52:12,649 INFO L933 BasicCegarLoop]: 125 mSDtfsCounter, 151 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 14:52:12,649 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [159 Valid, 273 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 14:52:12,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1476 states. [2021-12-14 14:52:12,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1476 to 1439. [2021-12-14 14:52:12,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1439 states, 1142 states have (on average 1.1287215411558669) internal successors, (1289), 1154 states have internal predecessors, (1289), 145 states have call successors, (145), 124 states have call predecessors, (145), 151 states have return successors, (214), 160 states have call predecessors, (214), 144 states have call successors, (214) [2021-12-14 14:52:12,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1439 states to 1439 states and 1648 transitions. [2021-12-14 14:52:12,703 INFO L78 Accepts]: Start accepts. Automaton has 1439 states and 1648 transitions. Word has length 178 [2021-12-14 14:52:12,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 14:52:12,704 INFO L470 AbstractCegarLoop]: Abstraction has 1439 states and 1648 transitions. [2021-12-14 14:52:12,704 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2021-12-14 14:52:12,704 INFO L276 IsEmpty]: Start isEmpty. Operand 1439 states and 1648 transitions. [2021-12-14 14:52:12,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2021-12-14 14:52:12,707 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 14:52:12,707 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 7, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 14:52:12,726 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-12-14 14:52:12,915 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 14:52:12,915 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 14:52:12,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 14:52:12,916 INFO L85 PathProgramCache]: Analyzing trace with hash -1242735248, now seen corresponding path program 1 times [2021-12-14 14:52:12,916 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 14:52:12,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114237299] [2021-12-14 14:52:12,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 14:52:12,916 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 14:52:12,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:12,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:52:12,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:12,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-14 14:52:12,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:12,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-14 14:52:12,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:12,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 14:52:12,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:12,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:52:12,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:12,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-12-14 14:52:12,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:12,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-14 14:52:12,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:12,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2021-12-14 14:52:12,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:12,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-12-14 14:52:12,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:12,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2021-12-14 14:52:12,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:12,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2021-12-14 14:52:12,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:12,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 14:52:12,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:12,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:52:12,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:12,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-12-14 14:52:12,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:12,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2021-12-14 14:52:12,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:12,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2021-12-14 14:52:12,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:13,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2021-12-14 14:52:13,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:13,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2021-12-14 14:52:13,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:13,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2021-12-14 14:52:13,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:13,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2021-12-14 14:52:13,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:13,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 14:52:13,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:13,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:52:13,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:13,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2021-12-14 14:52:13,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:13,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2021-12-14 14:52:13,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:13,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 226 [2021-12-14 14:52:13,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:13,023 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 75 proven. 16 refuted. 0 times theorem prover too weak. 209 trivial. 0 not checked. [2021-12-14 14:52:13,023 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 14:52:13,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114237299] [2021-12-14 14:52:13,024 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114237299] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 14:52:13,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1402859467] [2021-12-14 14:52:13,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 14:52:13,024 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 14:52:13,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 14:52:13,025 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 14:52:13,026 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-12-14 14:52:13,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:13,125 INFO L263 TraceCheckSpWp]: Trace formula consists of 760 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-14 14:52:13,127 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 14:52:13,446 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 256 proven. 3 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2021-12-14 14:52:13,447 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 14:52:13,831 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 107 proven. 7 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2021-12-14 14:52:13,831 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1402859467] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 14:52:13,831 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 14:52:13,832 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 11 [2021-12-14 14:52:13,832 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171385121] [2021-12-14 14:52:13,832 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 14:52:13,832 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-14 14:52:13,832 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 14:52:13,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-14 14:52:13,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2021-12-14 14:52:13,833 INFO L87 Difference]: Start difference. First operand 1439 states and 1648 transitions. Second operand has 11 states, 11 states have (on average 20.636363636363637) internal successors, (227), 8 states have internal predecessors, (227), 4 states have call successors, (47), 8 states have call predecessors, (47), 8 states have return successors, (39), 4 states have call predecessors, (39), 4 states have call successors, (39) [2021-12-14 14:52:14,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 14:52:14,275 INFO L93 Difference]: Finished difference Result 1742 states and 1983 transitions. [2021-12-14 14:52:14,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-14 14:52:14,275 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 20.636363636363637) internal successors, (227), 8 states have internal predecessors, (227), 4 states have call successors, (47), 8 states have call predecessors, (47), 8 states have return successors, (39), 4 states have call predecessors, (39), 4 states have call successors, (39) Word has length 252 [2021-12-14 14:52:14,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 14:52:14,276 INFO L225 Difference]: With dead ends: 1742 [2021-12-14 14:52:14,276 INFO L226 Difference]: Without dead ends: 0 [2021-12-14 14:52:14,278 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 572 GetRequests, 549 SyntacticMatches, 4 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=125, Invalid=295, Unknown=0, NotChecked=0, Total=420 [2021-12-14 14:52:14,278 INFO L933 BasicCegarLoop]: 159 mSDtfsCounter, 270 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 479 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 577 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 479 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-14 14:52:14,278 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [271 Valid, 454 Invalid, 577 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 479 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-14 14:52:14,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-12-14 14:52:14,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-12-14 14:52:14,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 14:52:14,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-12-14 14:52:14,279 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 252 [2021-12-14 14:52:14,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 14:52:14,279 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-12-14 14:52:14,279 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 20.636363636363637) internal successors, (227), 8 states have internal predecessors, (227), 4 states have call successors, (47), 8 states have call predecessors, (47), 8 states have return successors, (39), 4 states have call predecessors, (39), 4 states have call successors, (39) [2021-12-14 14:52:14,280 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-12-14 14:52:14,280 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-12-14 14:52:14,281 INFO L764 garLoopResultBuilder]: Registering result SAFE for location errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-12-14 14:52:14,300 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-12-14 14:52:14,483 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 14:52:14,485 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-12-14 14:52:33,320 INFO L858 garLoopResultBuilder]: For program point L321(line 321) no Hoare annotation was computed. [2021-12-14 14:52:33,320 INFO L858 garLoopResultBuilder]: For program point L323-2(lines 307 331) no Hoare annotation was computed. [2021-12-14 14:52:33,320 INFO L858 garLoopResultBuilder]: For program point L315(lines 315 319) no Hoare annotation was computed. [2021-12-14 14:52:33,321 INFO L854 garLoopResultBuilder]: At program point L313(line 313) the Hoare annotation is: (let ((.cse21 (= ~c_dr_st~0 |old(~c_dr_st~0)|))) (let ((.cse6 (and (not (<= ~p_dw_pc~0 0)) (not (< 1 ~p_dw_pc~0)))) (.cse20 (not (<= ~c_dr_pc~0 0))) (.cse2 (not (= ~p_num_write~0 0))) (.cse4 (not (= ~c_num_read~0 0))) (.cse17 (not (= ~q_free~0 0))) (.cse5 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse19 (not (= ~q_read_ev~0 2))) (.cse0 (= |old(~p_dw_st~0)| 0)) (.cse1 (and (= |old(~p_dw_st~0)| ~p_dw_st~0) .cse21)) (.cse11 (not (< ~c_num_read~0 (+ ~p_num_write~0 1)))) (.cse3 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse12 (not (<= ~p_num_write~0 ~c_num_read~0))) (.cse13 (not (<= ~c_dr_pc~0 1))) (.cse14 (not (<= 2 ~q_write_ev~0))) (.cse15 (not (<= 1 ~c_dr_pc~0))) (.cse16 (not (= ~p_dw_i~0 1))) (.cse7 (not (= ~q_free~0 1))) (.cse8 (= |old(~c_dr_st~0)| 0)) (.cse18 (not (<= ~q_req_up~0 0))) (.cse9 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse10 (not (= 1 ~c_dr_i~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse0 .cse1 .cse11 .cse3 .cse12 .cse13 .cse6 .cse14 .cse15 .cse16 .cse7 .cse8 .cse9 .cse10) (or .cse0 (not (<= ~p_num_write~0 (+ ~c_num_read~0 1))) .cse1 (not (< ~c_num_read~0 ~p_num_write~0)) .cse3 .cse17 .cse13 .cse5 (= ~q_write_ev~0 0) .cse16 .cse8 .cse18 .cse19 .cse10) (or .cse20 .cse0 .cse1 .cse3 .cse17 .cse16 .cse8 .cse10) (or .cse20 (not (= ~q_write_ev~0 ~q_read_ev~0)) .cse2 .cse3 .cse4 .cse5 (and .cse21 (= ~p_dw_st~0 0)) .cse16 .cse7 (not .cse0) .cse18 .cse19 .cse9 .cse10) (or .cse0 .cse1 .cse3 .cse17 .cse13 .cse5 .cse14 .cse16 .cse8 .cse18 .cse19 .cse10) (or .cse0 .cse1 .cse11 .cse3 .cse12 .cse13 .cse14 .cse15 .cse16 .cse7 .cse8 .cse18 .cse9 .cse10)))) [2021-12-14 14:52:33,321 INFO L854 garLoopResultBuilder]: At program point L315-2(lines 315 319) the Hoare annotation is: (let ((.cse22 (= ~p_dw_st~0 0)) (.cse26 (< 0 (+ activate_threads_~tmp~1 1))) (.cse27 (<= activate_threads_~tmp~1 0)) (.cse29 (= |old(~p_dw_st~0)| ~p_dw_st~0)) (.cse28 (= ~c_dr_st~0 |old(~c_dr_st~0)|))) (let ((.cse21 (not (= ~c_dr_st~0 0))) (.cse23 (and .cse29 .cse28)) (.cse5 (and (not (<= ~p_dw_pc~0 0)) (not (< 1 ~p_dw_pc~0)))) (.cse25 (and .cse29 .cse26 .cse28 .cse27)) (.cse9 (not (< ~c_num_read~0 (+ ~p_num_write~0 1)))) (.cse10 (not (<= ~p_num_write~0 ~c_num_read~0))) (.cse11 (not (<= ~c_dr_pc~0 1))) (.cse12 (not (<= 2 ~q_write_ev~0))) (.cse13 (not (<= 1 ~c_dr_pc~0))) (.cse17 (and .cse26 .cse27)) (.cse1 (not .cse22)) (.cse4 (not (= ~q_free~0 0))) (.cse7 (= |old(~c_dr_st~0)| 0)) (.cse0 (not (<= ~c_dr_pc~0 0))) (.cse18 (not (= ~p_num_write~0 0))) (.cse3 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse19 (not (= ~c_num_read~0 0))) (.cse20 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse6 (not (= ~p_dw_i~0 1))) (.cse14 (not (= ~q_free~0 1))) (.cse2 (= |old(~p_dw_st~0)| 0)) (.cse24 (not (<= ~q_req_up~0 0))) (.cse15 (not (= ~q_read_ev~0 2))) (.cse16 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse8 (not (= 1 ~c_dr_i~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse2 .cse9 .cse3 .cse10 .cse11 .cse5 .cse12 .cse13 .cse6 .cse14 .cse7 .cse15 .cse16 .cse17 .cse8) (or .cse2 .cse18 .cse3 .cse19 .cse20 .cse5 .cse14 .cse7 .cse15 .cse16 .cse17 .cse8) (or .cse0 (and .cse21 .cse22) .cse2 .cse23 .cse3 .cse4 .cse6 .cse7 .cse8) (or (and (= ~q_read_ev~0 1) .cse21 .cse22) .cse2 .cse23 .cse9 .cse3 .cse10 .cse11 .cse12 .cse13 .cse6 .cse14 .cse7 .cse24 .cse16 .cse8) (or .cse25 .cse2 (not (<= ~p_num_write~0 (+ ~c_num_read~0 1))) (not (< ~c_num_read~0 ~p_num_write~0)) .cse3 .cse4 .cse11 .cse20 (= ~q_write_ev~0 0) .cse6 .cse7 .cse24 .cse15 .cse8) (or .cse2 .cse23 .cse18 .cse3 .cse19 .cse20 .cse5 .cse14 .cse7 .cse16 .cse8) (or .cse2 .cse23 .cse9 .cse3 .cse10 .cse11 .cse5 .cse12 .cse13 .cse6 .cse14 .cse7 .cse16 .cse8) (or .cse25 .cse2 .cse3 .cse4 .cse11 .cse20 .cse12 .cse6 .cse7 .cse24 .cse15 .cse8) (or .cse2 .cse9 .cse3 .cse10 .cse11 .cse12 .cse13 .cse6 .cse14 .cse7 .cse24 .cse15 .cse16 .cse17 .cse8) (or (and .cse1 .cse26 .cse27) .cse0 .cse2 .cse3 .cse4 .cse6 .cse7 .cse15 .cse8) (or .cse0 (not (= ~q_write_ev~0 ~q_read_ev~0)) .cse18 .cse3 .cse19 (and .cse26 .cse28 .cse22 .cse27) .cse20 .cse6 .cse14 (not .cse2) .cse24 .cse15 .cse16 .cse8)))) [2021-12-14 14:52:33,321 INFO L858 garLoopResultBuilder]: For program point L313-1(line 313) no Hoare annotation was computed. [2021-12-14 14:52:33,322 INFO L854 garLoopResultBuilder]: At program point activate_threadsENTRY(lines 307 331) the Hoare annotation is: (let ((.cse21 (= ~c_dr_st~0 |old(~c_dr_st~0)|))) (let ((.cse6 (and (not (<= ~p_dw_pc~0 0)) (not (< 1 ~p_dw_pc~0)))) (.cse20 (not (<= ~c_dr_pc~0 0))) (.cse2 (not (= ~p_num_write~0 0))) (.cse4 (not (= ~c_num_read~0 0))) (.cse17 (not (= ~q_free~0 0))) (.cse5 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse19 (not (= ~q_read_ev~0 2))) (.cse0 (= |old(~p_dw_st~0)| 0)) (.cse1 (and (= |old(~p_dw_st~0)| ~p_dw_st~0) .cse21)) (.cse11 (not (< ~c_num_read~0 (+ ~p_num_write~0 1)))) (.cse3 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse12 (not (<= ~p_num_write~0 ~c_num_read~0))) (.cse13 (not (<= ~c_dr_pc~0 1))) (.cse14 (not (<= 2 ~q_write_ev~0))) (.cse15 (not (<= 1 ~c_dr_pc~0))) (.cse16 (not (= ~p_dw_i~0 1))) (.cse7 (not (= ~q_free~0 1))) (.cse8 (= |old(~c_dr_st~0)| 0)) (.cse18 (not (<= ~q_req_up~0 0))) (.cse9 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse10 (not (= 1 ~c_dr_i~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse0 .cse1 .cse11 .cse3 .cse12 .cse13 .cse6 .cse14 .cse15 .cse16 .cse7 .cse8 .cse9 .cse10) (or .cse0 (not (<= ~p_num_write~0 (+ ~c_num_read~0 1))) .cse1 (not (< ~c_num_read~0 ~p_num_write~0)) .cse3 .cse17 .cse13 .cse5 (= ~q_write_ev~0 0) .cse16 .cse8 .cse18 .cse19 .cse10) (or .cse20 .cse0 .cse1 .cse3 .cse17 .cse16 .cse8 .cse10) (or .cse20 (not (= ~q_write_ev~0 ~q_read_ev~0)) .cse2 .cse3 .cse4 .cse5 (and .cse21 (= ~p_dw_st~0 0)) .cse16 .cse7 (not .cse0) .cse18 .cse19 .cse9 .cse10) (or .cse0 .cse1 .cse3 .cse17 .cse13 .cse5 .cse14 .cse16 .cse8 .cse18 .cse19 .cse10) (or .cse0 .cse1 .cse11 .cse3 .cse12 .cse13 .cse14 .cse15 .cse16 .cse7 .cse8 .cse18 .cse9 .cse10)))) [2021-12-14 14:52:33,322 INFO L858 garLoopResultBuilder]: For program point activate_threadsEXIT(lines 307 331) no Hoare annotation was computed. [2021-12-14 14:52:33,322 INFO L858 garLoopResultBuilder]: For program point L323(lines 323 327) no Hoare annotation was computed. [2021-12-14 14:52:33,322 INFO L858 garLoopResultBuilder]: For program point L255(lines 255 265) no Hoare annotation was computed. [2021-12-14 14:52:33,322 INFO L858 garLoopResultBuilder]: For program point exists_runnable_threadEXIT(lines 251 270) no Hoare annotation was computed. [2021-12-14 14:52:33,322 INFO L861 garLoopResultBuilder]: At program point exists_runnable_threadENTRY(lines 251 270) the Hoare annotation is: true [2021-12-14 14:52:33,323 INFO L854 garLoopResultBuilder]: At program point L267(lines 254 269) the Hoare annotation is: (let ((.cse9 (= ~q_read_ev~0 2)) (.cse11 (= ~c_dr_st~0 0)) (.cse5 (= ~p_dw_st~0 0))) (let ((.cse1 (not (<= ~c_dr_pc~0 0))) (.cse12 (not .cse5)) (.cse20 (not (= ~p_num_write~0 0))) (.cse3 (not (= ~c_num_read~0 0))) (.cse16 (not (= ~q_free~0 1))) (.cse19 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse0 (<= 1 exists_runnable_thread_~__retres1~2)) (.cse8 (not .cse11)) (.cse2 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse4 (not (= ~q_free~0 0))) (.cse13 (not (<= ~c_dr_pc~0 1))) (.cse14 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse6 (not (<= 2 ~q_write_ev~0))) (.cse15 (not (<= 1 ~c_dr_pc~0))) (.cse7 (not (= ~p_dw_i~0 1))) (.cse17 (not (<= ~q_req_up~0 0))) (.cse18 (not .cse9)) (.cse10 (not (= 1 ~c_dr_i~0)))) (and (or .cse0 .cse1 (not (= ~q_req_up~0 1)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (<= 1 ~p_num_write~0)) (not (<= 1 ~q_read_ev~0)) (and .cse8 .cse9) (not (<= ~p_num_write~0 1)) .cse10) (or .cse0 .cse11 .cse1 .cse12 .cse2 .cse4 .cse7 .cse10) (or .cse0 .cse11 .cse12 (not (< ~c_num_read~0 (+ ~p_num_write~0 1))) .cse2 (not (<= ~p_num_write~0 ~c_num_read~0)) .cse13 .cse14 .cse6 .cse15 .cse7 .cse16 .cse17 .cse18 .cse19 .cse10) (or .cse0 .cse1 .cse12 .cse20 .cse2 .cse3 .cse14 .cse6 .cse7 .cse16 .cse17 .cse18 .cse19 .cse10) (or .cse0 .cse11 .cse1 .cse12 .cse20 .cse2 .cse3 .cse14 .cse7 .cse16 .cse19 .cse10) (or .cse0 .cse11 .cse12 .cse20 .cse2 .cse3 .cse13 .cse6 .cse15 .cse7 .cse16 .cse17 .cse18 .cse19 .cse10) (or .cse0 (not (<= ~p_num_write~0 (+ ~c_num_read~0 1))) .cse8 (not (< ~c_num_read~0 ~p_num_write~0)) .cse2 .cse4 .cse13 .cse5 .cse14 .cse6 .cse15 .cse7 .cse17 .cse18 .cse10)))) [2021-12-14 14:52:33,323 INFO L858 garLoopResultBuilder]: For program point L259(lines 259 264) no Hoare annotation was computed. [2021-12-14 14:52:33,323 INFO L858 garLoopResultBuilder]: For program point exists_runnable_threadFINAL(lines 251 270) no Hoare annotation was computed. [2021-12-14 14:52:33,323 INFO L854 garLoopResultBuilder]: At program point L95(lines 83 97) the Hoare annotation is: (let ((.cse14 (not (= ~q_free~0 0))) (.cse18 (and (not (<= ~p_dw_pc~0 0)) (not (< 1 ~p_dw_pc~0)))) (.cse17 (not (<= ~c_dr_pc~0 0))) (.cse19 (not (= ~p_num_write~0 0))) (.cse20 (not (= ~c_num_read~0 0))) (.cse16 (not (= ~q_read_ev~0 2))) (.cse0 (= ~c_dr_st~0 0)) (.cse1 (not (< ~c_num_read~0 (+ ~p_num_write~0 1)))) (.cse2 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse3 (not (<= ~p_num_write~0 ~c_num_read~0))) (.cse4 (not (<= ~c_dr_pc~0 1))) (.cse15 (= ~p_dw_st~0 0)) (.cse5 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse6 (and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))) (.cse7 (not (<= 2 ~q_write_ev~0))) (.cse8 (not (<= 1 ~c_dr_pc~0))) (.cse9 (not (= ~p_dw_i~0 1))) (.cse10 (not (= ~q_free~0 1))) (.cse11 (not (<= ~q_req_up~0 0))) (.cse12 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse13 (not (= 1 ~c_dr_i~0)))) (and (or .cse0 (not (= ~q_read_ev~0 1)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (or .cse0 (not (<= ~p_num_write~0 (+ ~c_num_read~0 1))) (< 0 ~q_write_ev~0) (not (< ~c_num_read~0 ~p_num_write~0)) .cse2 .cse14 .cse4 .cse15 .cse5 (= ~q_write_ev~0 0) .cse6 .cse9 .cse11 .cse16 .cse13) (or .cse0 .cse2 .cse14 .cse4 .cse15 .cse5 .cse6 .cse7 .cse9 .cse11 .cse16 .cse13) (or .cse0 .cse17 .cse2 .cse14 .cse6 .cse9 .cse13) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse15 .cse18 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13) (or .cse0 .cse19 .cse2 .cse20 .cse15 .cse5 .cse18 .cse6 .cse10 .cse12 .cse13) (or .cse17 (not .cse15) (not (= ~q_write_ev~0 ~q_read_ev~0)) .cse19 .cse2 .cse20 .cse5 .cse6 .cse9 .cse10 .cse11 .cse16 .cse12 .cse13) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse15 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13))) [2021-12-14 14:52:33,324 INFO L861 garLoopResultBuilder]: At program point is_do_read_c_triggeredENTRY(lines 80 98) the Hoare annotation is: true [2021-12-14 14:52:33,324 INFO L858 garLoopResultBuilder]: For program point L85(lines 85 90) no Hoare annotation was computed. [2021-12-14 14:52:33,324 INFO L858 garLoopResultBuilder]: For program point L84(lines 84 93) no Hoare annotation was computed. [2021-12-14 14:52:33,324 INFO L858 garLoopResultBuilder]: For program point L84-2(lines 84 93) no Hoare annotation was computed. [2021-12-14 14:52:33,324 INFO L858 garLoopResultBuilder]: For program point is_do_read_c_triggeredFINAL(lines 80 98) no Hoare annotation was computed. [2021-12-14 14:52:33,324 INFO L858 garLoopResultBuilder]: For program point is_do_read_c_triggeredEXIT(lines 80 98) no Hoare annotation was computed. [2021-12-14 14:52:33,324 INFO L854 garLoopResultBuilder]: At program point fire_delta_eventsENTRY(lines 271 288) the Hoare annotation is: (let ((.cse22 (= ~q_write_ev~0 |old(~q_write_ev~0)|))) (let ((.cse4 (not (= ~q_free~0 0))) (.cse1 (not (<= ~c_dr_pc~0 0))) (.cse12 (not (= ~p_num_write~0 0))) (.cse13 (not (= ~c_num_read~0 0))) (.cse9 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse10 (not (= |old(~q_read_ev~0)| 2))) (.cse18 (and .cse22 (= ~q_read_ev~0 2))) (.cse11 (not (<= ~q_req_up~0 0))) (.cse0 (= ~c_dr_st~0 0)) (.cse19 (not (< ~c_num_read~0 (+ ~p_num_write~0 1)))) (.cse2 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse20 (not (<= ~p_num_write~0 ~c_num_read~0))) (.cse3 (and .cse22 (= |old(~q_read_ev~0)| ~q_read_ev~0))) (.cse8 (not (<= ~c_dr_pc~0 1))) (.cse5 (= ~p_dw_st~0 0)) (.cse17 (not (<= 2 |old(~q_write_ev~0)|))) (.cse14 (and (not (<= ~p_dw_pc~0 0)) (not (< 1 ~p_dw_pc~0)))) (.cse21 (not (<= 1 ~c_dr_pc~0))) (.cse6 (not (= ~p_dw_i~0 1))) (.cse15 (not (= ~q_free~0 1))) (.cse16 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse7 (not (= 1 ~c_dr_i~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (or .cse0 (not (<= ~p_num_write~0 (+ ~c_num_read~0 1))) (not (< ~c_num_read~0 ~p_num_write~0)) .cse2 .cse3 .cse4 .cse8 .cse5 .cse9 .cse10 .cse6 .cse11 .cse7) (or .cse0 .cse12 .cse2 .cse3 .cse13 .cse5 .cse9 .cse14 .cse15 .cse16 .cse7) (or .cse0 .cse2 .cse4 .cse8 .cse5 .cse9 .cse17 .cse10 .cse6 .cse11 .cse18 .cse7) (or .cse1 (not .cse5) (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|)) .cse12 .cse2 .cse13 .cse9 .cse10 .cse6 .cse15 .cse11 .cse16 .cse18 .cse7) (or .cse0 .cse19 .cse2 .cse20 .cse3 .cse8 .cse5 .cse17 .cse21 .cse6 .cse15 .cse11 .cse16 .cse7) (or .cse0 .cse19 .cse2 .cse20 .cse3 .cse8 .cse5 .cse17 .cse14 .cse21 .cse6 .cse15 .cse16 .cse7)))) [2021-12-14 14:52:33,324 INFO L858 garLoopResultBuilder]: For program point L280-1(lines 271 288) no Hoare annotation was computed. [2021-12-14 14:52:33,324 INFO L858 garLoopResultBuilder]: For program point L275-1(lines 274 287) no Hoare annotation was computed. [2021-12-14 14:52:33,324 INFO L858 garLoopResultBuilder]: For program point fire_delta_eventsEXIT(lines 271 288) no Hoare annotation was computed. [2021-12-14 14:52:33,325 INFO L858 garLoopResultBuilder]: For program point L35-2(lines 34 49) no Hoare annotation was computed. [2021-12-14 14:52:33,325 INFO L858 garLoopResultBuilder]: For program point L222-1(lines 218 232) no Hoare annotation was computed. [2021-12-14 14:52:33,325 INFO L854 garLoopResultBuilder]: At program point update_channelsENTRY(lines 218 232) the Hoare annotation is: (let ((.cse25 (= ~q_ev~0 |old(~q_ev~0)|)) (.cse26 (= ~q_write_ev~0 |old(~q_write_ev~0)|)) (.cse27 (= ~q_req_up~0 |old(~q_req_up~0)|))) (let ((.cse1 (not (= |old(~q_req_up~0)| 1))) (.cse3 (not (<= ~p_num_write~0 (+ ~c_num_read~0 1)))) (.cse4 (not (< ~c_num_read~0 ~p_num_write~0))) (.cse22 (and .cse25 .cse26 .cse27 (= ~q_read_ev~0 2))) (.cse14 (not (= ~p_num_write~0 0))) (.cse15 (not (= ~c_num_read~0 0))) (.cse23 (not (<= |old(~q_req_up~0)| 0))) (.cse9 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse11 (not (= |old(~q_read_ev~0)| 2))) (.cse24 (not (<= ~c_dr_pc~0 0))) (.cse6 (not (= ~q_free~0 0))) (.cse0 (= ~c_dr_st~0 0)) (.cse2 (and .cse25 .cse26 (= |old(~q_read_ev~0)| ~q_read_ev~0) .cse27)) (.cse19 (not (< ~c_num_read~0 (+ ~p_num_write~0 1)))) (.cse5 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse20 (not (<= ~p_num_write~0 ~c_num_read~0))) (.cse7 (not (<= ~c_dr_pc~0 1))) (.cse8 (= ~p_dw_st~0 0)) (.cse10 (not (<= 2 |old(~q_write_ev~0)|))) (.cse16 (and (not (<= ~p_dw_pc~0 0)) (not (< 1 ~p_dw_pc~0)))) (.cse21 (not (<= 1 ~c_dr_pc~0))) (.cse12 (not (= ~p_dw_i~0 1))) (.cse17 (not (= ~q_free~0 1))) (.cse18 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse13 (not (= 1 ~c_dr_i~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (or .cse0 .cse2 .cse14 .cse5 .cse15 .cse8 .cse9 .cse16 .cse17 .cse18 .cse13) (or .cse0 (not (<= 1 |old(~q_read_ev~0)|)) .cse1 .cse2 .cse19 .cse5 .cse20 .cse7 .cse8 .cse10 .cse21 .cse12 .cse17 .cse18 .cse13) (or .cse0 .cse22 .cse5 .cse6 .cse7 .cse23 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (or .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse23 .cse8 .cse9 .cse11 .cse12 (= |old(~q_write_ev~0)| 0) .cse13) (or .cse0 .cse2 .cse19 .cse5 .cse20 .cse7 .cse23 .cse8 .cse10 .cse21 .cse12 .cse17 .cse18 .cse13) (or .cse24 (not .cse8) .cse22 (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|)) .cse14 .cse5 .cse15 .cse23 .cse9 .cse11 .cse12 .cse17 .cse18 .cse13) (or .cse0 .cse24 .cse2 .cse5 .cse6 .cse8 .cse12 .cse13) (or .cse0 .cse2 .cse19 .cse5 .cse20 .cse7 .cse8 .cse10 .cse16 .cse21 .cse12 .cse17 .cse18 .cse13)))) [2021-12-14 14:52:33,325 INFO L854 garLoopResultBuilder]: At program point L48(lines 31 50) the Hoare annotation is: (let ((.cse15 (not (= |old(~q_req_up~0)| 1))) (.cse14 (<= ~q_req_up~0 0)) (.cse16 (not (<= ~p_num_write~0 (+ ~c_num_read~0 1)))) (.cse17 (not (< ~c_num_read~0 ~p_num_write~0))) (.cse20 (not (<= ~c_dr_pc~0 0))) (.cse1 (not (< ~c_num_read~0 (+ ~p_num_write~0 1)))) (.cse3 (not (<= ~p_num_write~0 ~c_num_read~0))) (.cse21 (= ~q_write_ev~0 |old(~q_write_ev~0)|)) (.cse11 (not (= ~q_free~0 1))) (.cse12 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse0 (= ~c_dr_st~0 0)) (.cse2 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse18 (not (= ~q_free~0 0))) (.cse4 (not (<= ~c_dr_pc~0 1))) (.cse5 (not (<= |old(~q_req_up~0)| 0))) (.cse6 (= ~p_dw_st~0 0)) (.cse7 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse8 (not (<= 2 |old(~q_write_ev~0)|))) (.cse19 (not (= |old(~q_read_ev~0)| 2))) (.cse9 (not (<= 1 ~c_dr_pc~0))) (.cse10 (not (= ~p_dw_i~0 1))) (.cse13 (not (= 1 ~c_dr_i~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (or .cse0 (and .cse14 (= ~q_read_ev~0 2)) .cse15 .cse16 .cse17 .cse2 .cse18 .cse4 .cse6 .cse7 .cse8 .cse19 .cse9 .cse10 .cse13) (or .cse0 .cse20 .cse2 .cse18 .cse6 (= |old(~q_read_ev~0)| ~q_read_ev~0) .cse10 .cse13) (or .cse0 (not (<= 1 |old(~q_read_ev~0)|)) .cse15 .cse1 .cse2 .cse3 .cse4 .cse6 .cse8 (and .cse14 .cse21) .cse9 .cse10 .cse11 .cse12 .cse13) (or .cse0 .cse16 .cse17 .cse2 .cse18 .cse4 .cse5 .cse6 .cse7 .cse19 .cse9 .cse10 (= |old(~q_write_ev~0)| 0) .cse13) (or .cse20 (not .cse6) (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|)) (not (= ~p_num_write~0 0)) .cse2 (not (= ~c_num_read~0 0)) .cse5 .cse7 .cse19 .cse10 .cse11 .cse12 .cse13) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse21 .cse6 .cse8 (and (not (<= ~p_dw_pc~0 0)) (not (< 1 ~p_dw_pc~0))) .cse9 .cse10 .cse11 .cse12 .cse13) (or .cse0 .cse2 .cse18 .cse4 .cse5 .cse6 .cse7 .cse8 .cse19 .cse9 .cse10 .cse13))) [2021-12-14 14:52:33,325 INFO L858 garLoopResultBuilder]: For program point update_channelsEXIT(lines 218 232) no Hoare annotation was computed. [2021-12-14 14:52:33,325 INFO L858 garLoopResultBuilder]: For program point L40-1(lines 40 44) no Hoare annotation was computed. [2021-12-14 14:52:33,325 INFO L858 garLoopResultBuilder]: For program point L35(lines 35 39) no Hoare annotation was computed. [2021-12-14 14:52:33,325 INFO L858 garLoopResultBuilder]: For program point reset_delta_eventsEXIT(lines 289 306) no Hoare annotation was computed. [2021-12-14 14:52:33,325 INFO L858 garLoopResultBuilder]: For program point L298-1(lines 289 306) no Hoare annotation was computed. [2021-12-14 14:52:33,326 INFO L858 garLoopResultBuilder]: For program point L293-1(lines 292 305) no Hoare annotation was computed. [2021-12-14 14:52:33,326 INFO L854 garLoopResultBuilder]: At program point reset_delta_eventsENTRY(lines 289 306) the Hoare annotation is: (let ((.cse25 (= ~q_write_ev~0 |old(~q_write_ev~0)|))) (let ((.cse1 (not (= ~p_num_write~0 0))) (.cse4 (not (= ~c_num_read~0 0))) (.cse22 (not (<= ~c_dr_pc~0 0))) (.cse0 (= ~c_dr_st~0 0)) (.cse11 (not (< ~c_num_read~0 (+ ~p_num_write~0 1)))) (.cse12 (not (<= ~p_num_write~0 ~c_num_read~0))) (.cse3 (and .cse25 (= |old(~q_read_ev~0)| ~q_read_ev~0))) (.cse14 (not (<= 2 |old(~q_write_ev~0)|))) (.cse7 (and (not (<= ~p_dw_pc~0 0)) (not (< 1 ~p_dw_pc~0)))) (.cse8 (not (= ~q_free~0 1))) (.cse9 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse23 (not (<= ~p_num_write~0 (+ ~c_num_read~0 1)))) (.cse24 (not (< ~c_num_read~0 ~p_num_write~0))) (.cse2 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse18 (not (= ~q_free~0 0))) (.cse13 (not (<= ~c_dr_pc~0 1))) (.cse5 (= ~p_dw_st~0 0)) (.cse6 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse19 (not (= |old(~q_read_ev~0)| 2))) (.cse20 (not (< 0 |old(~q_write_ev~0)|))) (.cse15 (not (<= 1 ~c_dr_pc~0))) (.cse16 (not (= ~p_dw_i~0 1))) (.cse17 (not (<= ~q_req_up~0 0))) (.cse21 (and .cse25 (= ~q_read_ev~0 2))) (.cse10 (not (= 1 ~c_dr_i~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse0 .cse11 .cse2 .cse12 .cse3 .cse13 .cse6 (not (= |old(~q_read_ev~0)| 1)) .cse14 .cse15 .cse16 .cse8 .cse17 .cse9 .cse10) (or .cse0 .cse11 .cse2 .cse12 .cse3 .cse13 .cse5 .cse6 .cse14 .cse15 .cse16 .cse8 .cse17 .cse9 .cse10) (or .cse0 .cse2 .cse18 .cse13 .cse5 .cse6 .cse19 .cse20 .cse16 .cse17 .cse21 .cse10) (or .cse22 (not .cse5) (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|)) .cse1 .cse2 .cse4 .cse6 .cse19 .cse16 .cse8 .cse17 .cse9 .cse21 .cse10) (or .cse0 .cse22 .cse2 .cse3 .cse18 .cse16 .cse10) (or .cse0 .cse23 .cse24 .cse2 .cse3 .cse18 .cse13 .cse5 .cse6 .cse19 .cse16 (= |old(~q_write_ev~0)| 0) .cse17 .cse10) (or .cse0 .cse11 .cse2 .cse12 .cse3 .cse13 .cse5 .cse14 .cse7 .cse15 .cse16 .cse8 .cse9 .cse10) (or .cse23 .cse24 .cse2 .cse18 .cse13 .cse5 .cse6 .cse19 .cse20 .cse15 .cse16 .cse17 .cse21 .cse10)))) [2021-12-14 14:52:33,326 INFO L854 garLoopResultBuilder]: At program point L415(line 415) the Hoare annotation is: (and (= ~p_num_write~0 0) (= ~c_num_read~0 0) (= ~p_last_write~0 ~q_buf_0~0) (= ~q_write_ev~0 ~q_read_ev~0) (= ~q_free~0 1) (= 1 ~c_dr_i~0) (= ~c_dr_pc~0 ~p_dw_pc~0) (<= ~q_req_up~0 0) (= ~p_dw_st~0 0) (= ~q_read_ev~0 2) (= ~p_dw_i~0 1) (= ~c_last_read~0 ~p_last_write~0) (<= ~c_dr_pc~0 0)) [2021-12-14 14:52:33,326 INFO L858 garLoopResultBuilder]: For program point L349(lines 339 379) no Hoare annotation was computed. [2021-12-14 14:52:33,326 INFO L854 garLoopResultBuilder]: At program point L242-1(lines 233 250) the Hoare annotation is: (and (= ~p_num_write~0 0) (= ~c_num_read~0 0) (= ~p_last_write~0 ~q_buf_0~0) (= ~q_write_ev~0 ~q_read_ev~0) (= ~q_free~0 1) (= 1 ~c_dr_i~0) (= ~c_dr_pc~0 ~p_dw_pc~0) (<= ~q_req_up~0 0) (= ~p_dw_st~0 0) (= ~q_read_ev~0 2) (= ~p_dw_i~0 1) (= ~c_last_read~0 ~p_last_write~0) (<= ~c_dr_pc~0 0)) [2021-12-14 14:52:33,326 INFO L854 garLoopResultBuilder]: At program point L432(line 432) the Hoare annotation is: (let ((.cse9 (or (<= ~p_dw_pc~0 0) (< 1 ~p_dw_pc~0))) (.cse3 (= ~q_free~0 1)) (.cse4 (<= 2 ~q_write_ev~0)) (.cse6 (not (= ~c_dr_st~0 0))) (.cse8 (<= ~p_num_write~0 ~c_num_read~0)) (.cse11 (= ~c_last_read~0 ~p_last_write~0)) (.cse12 (< ~c_num_read~0 (+ ~p_num_write~0 1))) (.cse0 (not (= ~p_dw_st~0 0))) (.cse1 (= ~p_last_write~0 ~q_buf_0~0)) (.cse13 (< ~c_num_read~0 ~p_num_write~0)) (.cse2 (<= 1 ~c_dr_pc~0)) (.cse5 (<= ~c_dr_pc~0 1)) (.cse7 (= 1 ~c_dr_i~0)) (.cse14 (= ~q_free~0 0)) (.cse15 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse19 (< 0 ~q_write_ev~0)) (.cse16 (<= ~q_req_up~0 0)) (.cse17 (= ~q_read_ev~0 2)) (.cse10 (= ~p_dw_i~0 1)) (.cse18 (<= ~p_num_write~0 (+ ~c_num_read~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 (not (= ~q_write_ev~0 0)) .cse13 .cse5 .cse6 .cse7 .cse14 .cse15 .cse16 .cse17 .cse10 .cse18) (and .cse1 .cse6 .cse7 .cse14 .cse10 (<= ~c_dr_pc~0 0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse15 .cse8 .cse16 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse5 .cse6 .cse7 .cse14 .cse15 .cse19 .cse16 .cse17 .cse10) (and (= ~p_num_write~0 0) .cse0 (= ~c_num_read~0 0) .cse1 .cse3 .cse6 .cse7 .cse15 .cse9 .cse11) (and .cse1 .cse2 .cse3 (= ~q_read_ev~0 1) .cse4 .cse5 .cse6 .cse7 .cse15 .cse8 .cse16 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse13 .cse2 .cse5 .cse7 .cse14 .cse15 .cse19 .cse16 .cse17 .cse10 .cse18))) [2021-12-14 14:52:33,326 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-12-14 14:52:33,326 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-12-14 14:52:33,326 INFO L854 garLoopResultBuilder]: At program point L474(lines 465 476) the Hoare annotation is: (= 1 ~c_dr_i~0) [2021-12-14 14:52:33,326 INFO L858 garLoopResultBuilder]: For program point L342(line 342) no Hoare annotation was computed. [2021-12-14 14:52:33,326 INFO L858 garLoopResultBuilder]: For program point L433(line 433) no Hoare annotation was computed. [2021-12-14 14:52:33,326 INFO L858 garLoopResultBuilder]: For program point L169(lines 169 177) no Hoare annotation was computed. [2021-12-14 14:52:33,326 INFO L854 garLoopResultBuilder]: At program point L392(line 392) the Hoare annotation is: (let ((.cse14 (< ~c_num_read~0 ~p_num_write~0)) (.cse18 (<= ~p_num_write~0 (+ ~c_num_read~0 1))) (.cse9 (or (<= ~p_dw_pc~0 0) (< 1 ~p_dw_pc~0))) (.cse2 (<= 1 ~c_dr_pc~0)) (.cse3 (= ~q_free~0 1)) (.cse8 (<= ~p_num_write~0 ~c_num_read~0)) (.cse11 (= ~c_last_read~0 ~p_last_write~0)) (.cse12 (< ~c_num_read~0 (+ ~p_num_write~0 1))) (.cse0 (not (= ~p_dw_st~0 0))) (.cse1 (= ~p_last_write~0 ~q_buf_0~0)) (.cse4 (<= 2 ~q_write_ev~0)) (.cse5 (<= ~c_dr_pc~0 1)) (.cse6 (not (= ~c_dr_st~0 0))) (.cse7 (= 1 ~c_dr_i~0)) (.cse15 (= ~q_free~0 0)) (.cse16 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse13 (<= ~q_req_up~0 0)) (.cse17 (= ~q_read_ev~0 2)) (.cse10 (= ~p_dw_i~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse13 .cse10 .cse11 .cse12) (and .cse0 .cse1 (not (= ~q_write_ev~0 0)) .cse14 .cse5 .cse6 .cse7 .cse15 .cse16 .cse13 .cse17 .cse10 .cse18) (and .cse1 .cse6 .cse7 .cse15 .cse10 (<= ~c_dr_pc~0 0)) (and .cse0 .cse1 .cse14 .cse2 .cse4 .cse5 .cse7 .cse15 .cse16 .cse13 .cse17 .cse10 .cse18) (and (= ~p_num_write~0 0) .cse0 (= ~c_num_read~0 0) .cse1 .cse3 .cse6 .cse7 .cse16 .cse9 .cse11) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse16 .cse8 .cse13 .cse17 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse4 .cse5 .cse6 .cse7 .cse15 .cse16 .cse13 .cse17 .cse10))) [2021-12-14 14:52:33,326 INFO L858 garLoopResultBuilder]: For program point L392-1(line 392) no Hoare annotation was computed. [2021-12-14 14:52:33,327 INFO L858 garLoopResultBuilder]: For program point L128(lines 128 136) no Hoare annotation was computed. [2021-12-14 14:52:33,327 INFO L854 garLoopResultBuilder]: At program point L442(lines 405 447) the Hoare annotation is: (= 1 ~c_dr_i~0) [2021-12-14 14:52:33,327 INFO L854 garLoopResultBuilder]: At program point L401(lines 390 403) the Hoare annotation is: (let ((.cse14 (< ~c_num_read~0 ~p_num_write~0)) (.cse18 (<= ~p_num_write~0 (+ ~c_num_read~0 1))) (.cse9 (or (<= ~p_dw_pc~0 0) (< 1 ~p_dw_pc~0))) (.cse2 (<= 1 ~c_dr_pc~0)) (.cse3 (= ~q_free~0 1)) (.cse8 (<= ~p_num_write~0 ~c_num_read~0)) (.cse11 (= ~c_last_read~0 ~p_last_write~0)) (.cse12 (< ~c_num_read~0 (+ ~p_num_write~0 1))) (.cse0 (not (= ~p_dw_st~0 0))) (.cse1 (= ~p_last_write~0 ~q_buf_0~0)) (.cse4 (<= 2 ~q_write_ev~0)) (.cse5 (<= ~c_dr_pc~0 1)) (.cse6 (not (= ~c_dr_st~0 0))) (.cse7 (= 1 ~c_dr_i~0)) (.cse15 (= ~q_free~0 0)) (.cse16 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse13 (<= ~q_req_up~0 0)) (.cse17 (= ~q_read_ev~0 2)) (.cse10 (= ~p_dw_i~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse13 .cse10 .cse11 .cse12) (and .cse0 .cse1 (not (= ~q_write_ev~0 0)) .cse14 .cse5 .cse6 .cse7 .cse15 .cse16 .cse13 .cse17 .cse10 .cse18) (and .cse1 .cse6 .cse7 .cse15 .cse10 (<= ~c_dr_pc~0 0)) (and .cse0 .cse1 .cse14 .cse2 .cse4 .cse5 .cse7 .cse15 .cse16 .cse13 .cse17 .cse10 .cse18) (and (= ~p_num_write~0 0) .cse0 (= ~c_num_read~0 0) .cse1 .cse3 .cse6 .cse7 .cse16 .cse9 .cse11) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse16 .cse8 .cse13 .cse17 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse4 .cse5 .cse6 .cse7 .cse15 .cse16 .cse13 .cse17 .cse10))) [2021-12-14 14:52:33,327 INFO L858 garLoopResultBuilder]: For program point L368(lines 368 375) no Hoare annotation was computed. [2021-12-14 14:52:33,327 INFO L854 garLoopResultBuilder]: At program point L203(line 203) the Hoare annotation is: false [2021-12-14 14:52:33,327 INFO L858 garLoopResultBuilder]: For program point L344(lines 344 348) no Hoare annotation was computed. [2021-12-14 14:52:33,327 INFO L858 garLoopResultBuilder]: For program point L344-1(lines 339 379) no Hoare annotation was computed. [2021-12-14 14:52:33,327 INFO L854 garLoopResultBuilder]: At program point L212(lines 165 217) the Hoare annotation is: (let ((.cse8 (= ~p_dw_st~0 0)) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (<= 1 ~c_dr_pc~0)) (.cse2 (= ~q_free~0 1)) (.cse3 (<= 2 ~q_write_ev~0)) (.cse4 (<= ~c_dr_pc~0 1)) (.cse5 (not (= ~c_dr_st~0 0))) (.cse6 (= 1 ~c_dr_i~0)) (.cse7 (<= 1 |ULTIMATE.start_eval_~tmp___1~0#1|)) (.cse9 (= ~p_dw_i~0 1)) (.cse10 (= ~c_last_read~0 ~p_last_write~0))) (or (and (= ~p_num_write~0 0) (= ~c_num_read~0 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (or (<= ~p_dw_pc~0 0) (< 1 ~p_dw_pc~0)) (<= ~q_req_up~0 0) .cse8 (= ~q_read_ev~0 2) .cse9 .cse10) (and (= ~q_req_up~0 1) (not .cse8) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= ~p_num_write~0 ~c_num_read~0) (<= 1 ~q_read_ev~0) .cse9 .cse10 (< ~c_num_read~0 (+ ~p_num_write~0 1))))) [2021-12-14 14:52:33,328 INFO L854 garLoopResultBuilder]: At program point L402(lines 386 404) the Hoare annotation is: (let ((.cse14 (< ~c_num_read~0 ~p_num_write~0)) (.cse18 (<= ~p_num_write~0 (+ ~c_num_read~0 1))) (.cse9 (or (<= ~p_dw_pc~0 0) (< 1 ~p_dw_pc~0))) (.cse2 (<= 1 ~c_dr_pc~0)) (.cse3 (= ~q_free~0 1)) (.cse8 (<= ~p_num_write~0 ~c_num_read~0)) (.cse11 (= ~c_last_read~0 ~p_last_write~0)) (.cse12 (< ~c_num_read~0 (+ ~p_num_write~0 1))) (.cse0 (not (= ~p_dw_st~0 0))) (.cse1 (= ~p_last_write~0 ~q_buf_0~0)) (.cse4 (<= 2 ~q_write_ev~0)) (.cse5 (<= ~c_dr_pc~0 1)) (.cse6 (not (= ~c_dr_st~0 0))) (.cse7 (= 1 ~c_dr_i~0)) (.cse15 (= ~q_free~0 0)) (.cse16 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse13 (<= ~q_req_up~0 0)) (.cse17 (= ~q_read_ev~0 2)) (.cse10 (= ~p_dw_i~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse13 .cse10 .cse11 .cse12) (and .cse0 .cse1 (not (= ~q_write_ev~0 0)) .cse14 .cse5 .cse6 .cse7 .cse15 .cse16 .cse13 .cse17 .cse10 .cse18) (and .cse1 .cse6 .cse7 .cse15 .cse10 (<= ~c_dr_pc~0 0)) (and .cse0 .cse1 .cse14 .cse2 .cse4 .cse5 .cse7 .cse15 .cse16 .cse13 .cse17 .cse10 .cse18) (and (= ~p_num_write~0 0) .cse0 (= ~c_num_read~0 0) .cse1 .cse3 .cse6 .cse7 .cse16 .cse9 .cse11) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse16 .cse8 .cse13 .cse17 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse4 .cse5 .cse6 .cse7 .cse15 .cse16 .cse13 .cse17 .cse10))) [2021-12-14 14:52:33,328 INFO L858 garLoopResultBuilder]: For program point L237(lines 237 241) no Hoare annotation was computed. [2021-12-14 14:52:33,328 INFO L858 garLoopResultBuilder]: For program point L237-2(lines 236 249) no Hoare annotation was computed. [2021-12-14 14:52:33,328 INFO L854 garLoopResultBuilder]: At program point L427(line 427) the Hoare annotation is: (let ((.cse3 (<= 1 ~c_dr_pc~0)) (.cse9 (<= ~p_num_write~0 ~c_num_read~0)) (.cse12 (< ~c_num_read~0 (+ ~p_num_write~0 1))) (.cse4 (= ~q_free~0 1)) (.cse13 (or (<= ~p_dw_pc~0 0) (< 1 ~p_dw_pc~0))) (.cse11 (= ~c_last_read~0 ~p_last_write~0)) (.cse0 (= ~q_req_up~0 1)) (.cse15 (< ~c_num_read~0 ~p_num_write~0)) (.cse19 (<= ~p_num_write~0 (+ ~c_num_read~0 1))) (.cse1 (not (= ~p_dw_st~0 0))) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (<= 2 ~q_write_ev~0)) (.cse6 (<= ~c_dr_pc~0 1)) (.cse7 (not (= ~c_dr_st~0 0))) (.cse8 (= 1 ~c_dr_i~0)) (.cse16 (= ~q_free~0 0)) (.cse17 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse14 (<= ~q_req_up~0 0)) (.cse18 (= ~q_read_ev~0 2)) (.cse10 (= ~p_dw_i~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (<= 1 ~q_read_ev~0) .cse10 .cse11 .cse12) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse13 .cse10 .cse11 .cse12) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse14 .cse10 .cse11 .cse12) (and .cse1 .cse2 (not (= ~q_write_ev~0 0)) .cse15 .cse6 .cse7 .cse8 .cse16 .cse17 .cse14 .cse18 .cse10 .cse19) (and (= ~p_num_write~0 0) .cse1 (= ~c_num_read~0 0) .cse2 .cse4 .cse7 .cse8 .cse17 .cse13 .cse11) (and .cse1 .cse2 .cse7 .cse8 .cse16 .cse10 (<= ~c_dr_pc~0 0)) (and .cse0 .cse1 .cse2 .cse15 .cse5 .cse6 .cse7 .cse8 .cse16 .cse17 .cse18 .cse10 .cse19) (and .cse1 .cse2 .cse5 .cse6 .cse7 .cse8 .cse16 .cse17 .cse14 .cse18 .cse10))) [2021-12-14 14:52:33,328 INFO L858 garLoopResultBuilder]: For program point L427-1(line 427) no Hoare annotation was computed. [2021-12-14 14:52:33,329 INFO L858 garLoopResultBuilder]: For program point L394(lines 394 399) no Hoare annotation was computed. [2021-12-14 14:52:33,329 INFO L854 garLoopResultBuilder]: At program point L419-1(lines 416 441) the Hoare annotation is: (let ((.cse17 (= ~p_dw_st~0 0))) (let ((.cse19 (<= ~c_dr_pc~0 0)) (.cse20 (< ~c_num_read~0 ~p_num_write~0)) (.cse22 (<= ~p_num_write~0 (+ ~c_num_read~0 1))) (.cse14 (= ~p_num_write~0 0)) (.cse15 (= ~c_num_read~0 0)) (.cse9 (or (<= ~p_dw_pc~0 0) (< 1 ~p_dw_pc~0))) (.cse2 (<= 1 ~c_dr_pc~0)) (.cse3 (= ~q_free~0 1)) (.cse8 (<= ~p_num_write~0 ~c_num_read~0)) (.cse11 (= ~c_last_read~0 ~p_last_write~0)) (.cse12 (< ~c_num_read~0 (+ ~p_num_write~0 1))) (.cse0 (not .cse17)) (.cse1 (= ~p_last_write~0 ~q_buf_0~0)) (.cse4 (<= 2 ~q_write_ev~0)) (.cse5 (<= ~c_dr_pc~0 1)) (.cse6 (not (= ~c_dr_st~0 0))) (.cse7 (= 1 ~c_dr_i~0)) (.cse21 (= ~q_free~0 0)) (.cse16 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse13 (<= ~q_req_up~0 0)) (.cse18 (= ~q_read_ev~0 2)) (.cse10 (= ~p_dw_i~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse13 .cse10 .cse11 .cse12) (and .cse14 .cse15 .cse1 .cse3 .cse4 .cse7 .cse16 .cse13 .cse17 .cse18 .cse10 .cse11 .cse19) (and .cse0 .cse1 (not (= ~q_write_ev~0 0)) .cse20 .cse5 .cse6 .cse7 .cse21 .cse16 .cse13 .cse18 .cse10 .cse22) (and .cse1 .cse6 .cse7 .cse21 .cse10 .cse19) (and .cse0 .cse1 .cse20 .cse2 .cse4 .cse5 .cse7 .cse21 .cse16 .cse13 .cse18 .cse10 .cse22) (and .cse14 .cse0 .cse15 .cse1 .cse3 .cse6 .cse7 .cse16 .cse9 .cse11) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse16 .cse8 .cse13 .cse18 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse4 .cse5 .cse6 .cse7 .cse21 .cse16 .cse13 .cse18 .cse10)))) [2021-12-14 14:52:33,329 INFO L858 garLoopResultBuilder]: For program point L353(lines 353 360) no Hoare annotation was computed. [2021-12-14 14:52:33,329 INFO L858 garLoopResultBuilder]: For program point L436(lines 436 440) no Hoare annotation was computed. [2021-12-14 14:52:33,329 INFO L858 garLoopResultBuilder]: For program point L172(lines 172 176) no Hoare annotation was computed. [2021-12-14 14:52:33,329 INFO L854 garLoopResultBuilder]: At program point L139-1(lines 127 162) the Hoare annotation is: (let ((.cse0 (= ~p_num_write~0 0)) (.cse4 (= ~q_free~0 1)) (.cse11 (<= ~q_req_up~0 0)) (.cse14 (<= 1 ~c_dr_pc~0)) (.cse15 (<= ~c_dr_pc~0 1)) (.cse5 (not (= ~c_dr_st~0 0))) (.cse16 (= ~q_read_ev~0 2)) (.cse17 (= ~q_req_up~0 1)) (.cse1 (not (= ~p_dw_st~0 0))) (.cse2 (= ~c_num_read~0 0)) (.cse3 (= ~p_last_write~0 ~q_buf_0~0)) (.cse10 (<= 2 ~q_write_ev~0)) (.cse6 (= 1 ~c_dr_i~0)) (.cse13 (= ~q_free~0 0)) (.cse7 (<= 1 |ULTIMATE.start_eval_~tmp___1~0#1|)) (.cse12 (<= 1 ~q_read_ev~0)) (.cse8 (= ~p_dw_i~0 1)) (.cse9 (<= ~c_dr_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse10 .cse6 .cse7 .cse11 .cse12 .cse8 .cse9) (and .cse1 .cse3 .cse5 .cse6 .cse13 .cse7 .cse8 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse14 .cse4 .cse10 .cse15 .cse5 .cse6 .cse7 .cse11 .cse16 .cse8) (and .cse17 .cse1 .cse3 (< ~c_num_read~0 ~p_num_write~0) .cse14 .cse10 .cse15 .cse5 .cse6 .cse13 .cse7 .cse16 .cse8 (<= ~p_num_write~0 (+ ~c_num_read~0 1))) (and .cse17 .cse1 .cse2 .cse3 .cse10 .cse6 .cse13 .cse7 (<= ~p_num_write~0 1) .cse12 .cse8 .cse9 (<= 1 ~p_num_write~0)))) [2021-12-14 14:52:33,329 INFO L858 garLoopResultBuilder]: For program point L420(line 420) no Hoare annotation was computed. [2021-12-14 14:52:33,329 INFO L858 garLoopResultBuilder]: For program point L131(lines 131 135) no Hoare annotation was computed. [2021-12-14 14:52:33,329 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-12-14 14:52:33,330 INFO L854 garLoopResultBuilder]: At program point L412(line 412) the Hoare annotation is: (and (= ~p_num_write~0 0) (= ~c_num_read~0 0) (= ~p_last_write~0 ~q_buf_0~0) (= ~q_write_ev~0 ~q_read_ev~0) (= ~q_free~0 1) (= 1 ~c_dr_i~0) (= ~c_dr_pc~0 ~p_dw_pc~0) (<= ~q_req_up~0 0) (= ~p_dw_st~0 0) (= ~q_read_ev~0 2) (= ~p_dw_i~0 1) (= ~c_last_read~0 ~p_last_write~0) (<= ~c_dr_pc~0 0)) [2021-12-14 14:52:33,330 INFO L858 garLoopResultBuilder]: For program point L412-1(line 412) no Hoare annotation was computed. [2021-12-14 14:52:33,330 INFO L858 garLoopResultBuilder]: For program point L181(lines 180 211) no Hoare annotation was computed. [2021-12-14 14:52:33,330 INFO L854 garLoopResultBuilder]: At program point L462(lines 448 464) the Hoare annotation is: (and (= ~p_num_write~0 0) (= ~c_num_read~0 0) (= ~p_last_write~0 ~q_buf_0~0) (= ~q_write_ev~0 ~q_read_ev~0) (= ~q_free~0 1) (= 1 ~c_dr_i~0) (= ~c_dr_pc~0 ~p_dw_pc~0) (<= ~q_req_up~0 0) (= ~p_dw_st~0 0) (= ~q_read_ev~0 2) (= ~p_dw_i~0 1) (= ~c_last_read~0 ~p_last_write~0) (<= ~c_dr_pc~0 0)) [2021-12-14 14:52:33,330 INFO L854 garLoopResultBuilder]: At program point L173(lines 168 216) the Hoare annotation is: (and (not (= ~p_dw_st~0 0)) (= ~p_last_write~0 ~q_buf_0~0) (< ~c_num_read~0 ~p_num_write~0) (<= 1 ~c_dr_pc~0) (<= 2 ~q_write_ev~0) (<= ~c_dr_pc~0 1) (not (= ~c_dr_st~0 0)) (= 1 ~c_dr_i~0) (= ~q_free~0 0) (= ~c_dr_pc~0 ~p_dw_pc~0) (<= 1 |ULTIMATE.start_eval_~tmp___1~0#1|) (<= ~q_req_up~0 0) (<= 1 ~q_read_ev~0) (= ~p_dw_i~0 1) (<= ~p_num_write~0 (+ ~c_num_read~0 1))) [2021-12-14 14:52:33,330 INFO L858 garLoopResultBuilder]: For program point L140(lines 139 157) no Hoare annotation was computed. [2021-12-14 14:52:33,330 INFO L858 garLoopResultBuilder]: For program point L198(lines 198 210) no Hoare annotation was computed. [2021-12-14 14:52:33,330 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-12-14 14:52:33,330 INFO L854 garLoopResultBuilder]: At program point L380(lines 332 385) the Hoare annotation is: (let ((.cse3 (<= 1 ~c_dr_pc~0)) (.cse9 (<= ~p_num_write~0 ~c_num_read~0)) (.cse12 (< ~c_num_read~0 (+ ~p_num_write~0 1))) (.cse4 (= ~q_free~0 1)) (.cse13 (or (<= ~p_dw_pc~0 0) (< 1 ~p_dw_pc~0))) (.cse11 (= ~c_last_read~0 ~p_last_write~0)) (.cse0 (= ~q_req_up~0 1)) (.cse15 (< ~c_num_read~0 ~p_num_write~0)) (.cse19 (<= ~p_num_write~0 (+ ~c_num_read~0 1))) (.cse1 (not (= ~p_dw_st~0 0))) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (<= 2 ~q_write_ev~0)) (.cse6 (<= ~c_dr_pc~0 1)) (.cse7 (not (= ~c_dr_st~0 0))) (.cse8 (= 1 ~c_dr_i~0)) (.cse16 (= ~q_free~0 0)) (.cse17 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse14 (<= ~q_req_up~0 0)) (.cse18 (= ~q_read_ev~0 2)) (.cse10 (= ~p_dw_i~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (<= 1 ~q_read_ev~0) .cse10 .cse11 .cse12) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse13 .cse10 .cse11 .cse12) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse14 .cse10 .cse11 .cse12) (and .cse1 .cse2 (not (= ~q_write_ev~0 0)) .cse15 .cse6 .cse7 .cse8 .cse16 .cse17 .cse14 .cse18 .cse10 .cse19) (and (= ~p_num_write~0 0) .cse1 (= ~c_num_read~0 0) .cse2 .cse4 .cse7 .cse8 .cse17 .cse13 .cse11) (and .cse1 .cse2 .cse7 .cse8 .cse16 .cse10 (<= ~c_dr_pc~0 0)) (and .cse0 .cse1 .cse2 .cse15 .cse5 .cse6 .cse7 .cse8 .cse16 .cse17 .cse18 .cse10 .cse19) (and .cse1 .cse2 .cse5 .cse6 .cse7 .cse8 .cse16 .cse17 .cse14 .cse18 .cse10))) [2021-12-14 14:52:33,331 INFO L858 garLoopResultBuilder]: For program point L182-1(lines 182 192) no Hoare annotation was computed. [2021-12-14 14:52:33,331 INFO L854 garLoopResultBuilder]: At program point L141(lines 127 162) the Hoare annotation is: (let ((.cse0 (= ~p_num_write~0 0)) (.cse2 (= ~c_num_read~0 0)) (.cse8 (<= ~c_dr_pc~0 0)) (.cse1 (not (= ~p_dw_st~0 0))) (.cse3 (= ~p_last_write~0 ~q_buf_0~0)) (.cse4 (<= 2 ~q_write_ev~0)) (.cse9 (not (= ~c_dr_st~0 0))) (.cse5 (= 1 ~c_dr_i~0)) (.cse6 (<= 1 |ULTIMATE.start_eval_~tmp___1~0#1|)) (.cse7 (= ~p_dw_i~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= ~q_req_up~0 0) (<= 1 ~q_read_ev~0) .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse9 .cse5 .cse6 .cse7 .cse8) (and .cse1 .cse3 .cse9 .cse5 (= ~q_free~0 0) .cse6 .cse7 .cse8) (and .cse1 .cse3 (<= 1 ~c_dr_pc~0) .cse4 (<= ~c_dr_pc~0 1) .cse9 .cse5 .cse6 (<= ~p_num_write~0 ~c_num_read~0) (= ~q_read_ev~0 2) .cse7 (< ~c_num_read~0 (+ ~p_num_write~0 1))))) [2021-12-14 14:52:33,331 INFO L854 garLoopResultBuilder]: At program point L364(lines 339 379) the Hoare annotation is: (let ((.cse21 (= ~p_dw_st~0 0))) (let ((.cse16 (or (<= ~p_dw_pc~0 0) (< 1 ~p_dw_pc~0))) (.cse0 (= ~p_num_write~0 0)) (.cse12 (<= 1 ~c_dr_pc~0)) (.cse3 (= ~q_free~0 1)) (.cse15 (<= ~p_num_write~0 ~c_num_read~0)) (.cse9 (= ~c_last_read~0 ~p_last_write~0)) (.cse17 (< ~c_num_read~0 (+ ~p_num_write~0 1))) (.cse1 (= ~c_num_read~0 0)) (.cse7 (<= 1 |ULTIMATE.start_eval_~tmp___1~0#1|)) (.cse19 (<= 1 ~q_read_ev~0)) (.cse10 (<= ~c_dr_pc~0 0)) (.cse18 (= ~q_req_up~0 1)) (.cse23 (< ~c_num_read~0 ~p_num_write~0)) (.cse25 (<= ~p_num_write~0 (+ ~c_num_read~0 1))) (.cse11 (not .cse21)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse13 (<= 2 ~q_write_ev~0)) (.cse14 (<= ~c_dr_pc~0 1)) (.cse4 (not (= ~c_dr_st~0 0))) (.cse5 (= 1 ~c_dr_i~0)) (.cse24 (= ~q_free~0 0)) (.cse6 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse20 (<= ~q_req_up~0 0)) (.cse22 (= ~q_read_ev~0 2)) (.cse8 (= ~p_dw_i~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse2 .cse12 .cse3 .cse13 .cse14 .cse4 .cse5 .cse15 .cse16 .cse8 .cse9 .cse17) (and .cse18 .cse11 .cse2 .cse12 .cse3 .cse13 .cse14 .cse4 .cse5 .cse6 .cse15 .cse19 .cse8 .cse9 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse13 .cse5 .cse6 .cse20 .cse21 .cse22 .cse8 .cse9 .cse10) (and .cse11 .cse2 (not (= ~q_write_ev~0 0)) .cse23 .cse14 .cse4 .cse5 .cse24 .cse6 .cse20 .cse22 .cse8 .cse25) (and .cse2 .cse4 .cse5 .cse24 .cse8 .cse10) (and .cse11 .cse2 .cse12 .cse3 .cse13 .cse14 .cse4 .cse5 .cse6 .cse15 .cse20 .cse8 .cse9 .cse17) (and .cse11 .cse2 .cse23 .cse12 .cse13 .cse14 .cse5 .cse24 .cse6 .cse20 .cse22 .cse8 .cse25) (and .cse0 .cse11 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse16 .cse9) (and .cse0 .cse1 .cse2 .cse12 .cse3 .cse13 .cse14 .cse4 .cse5 .cse7 .cse20 .cse22 .cse8 .cse9) (and .cse2 .cse12 .cse3 .cse13 .cse14 .cse4 .cse5 .cse6 .cse15 .cse20 .cse22 .cse8 .cse9 .cse17) (and .cse18 .cse11 .cse1 .cse2 .cse13 .cse5 .cse24 .cse7 (<= ~p_num_write~0 1) .cse19 .cse8 .cse10 (<= 1 ~p_num_write~0)) (and .cse18 .cse11 .cse2 .cse23 .cse13 .cse14 .cse4 .cse5 .cse24 .cse6 .cse22 .cse8 .cse25) (and .cse11 .cse2 .cse13 .cse14 .cse4 .cse5 .cse24 .cse6 .cse20 .cse22 .cse8)))) [2021-12-14 14:52:33,331 INFO L858 garLoopResultBuilder]: For program point L199(lines 199 205) no Hoare annotation was computed. [2021-12-14 14:52:33,332 INFO L854 garLoopResultBuilder]: At program point L414(line 414) the Hoare annotation is: (and (= ~p_num_write~0 0) (= ~c_num_read~0 0) (= ~p_last_write~0 ~q_buf_0~0) (= ~q_write_ev~0 ~q_read_ev~0) (= ~q_free~0 1) (= 1 ~c_dr_i~0) (= ~c_dr_pc~0 ~p_dw_pc~0) (<= ~q_req_up~0 0) (= ~p_dw_st~0 0) (= ~q_read_ev~0 2) (= ~p_dw_i~0 1) (= ~c_last_read~0 ~p_last_write~0) (<= ~c_dr_pc~0 0)) [2021-12-14 14:52:33,332 INFO L854 garLoopResultBuilder]: At program point L158(lines 124 163) the Hoare annotation is: (let ((.cse4 (not (= ~c_dr_st~0 0))) (.cse0 (= ~q_req_up~0 1)) (.cse1 (not (= ~p_dw_st~0 0))) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse3 (<= 2 ~q_write_ev~0)) (.cse5 (= 1 ~c_dr_i~0)) (.cse6 (= ~q_free~0 0)) (.cse7 (<= 1 |ULTIMATE.start_eval_~tmp___1~0#1|)) (.cse8 (= ~p_dw_i~0 1)) (.cse9 (<= ~c_dr_pc~0 0))) (or (and .cse0 .cse1 .cse2 (< ~c_num_read~0 ~p_num_write~0) .cse3 (<= ~c_dr_pc~0 1) .cse4 .cse5 .cse6 (= ~c_dr_pc~0 ~p_dw_pc~0) .cse7 (= ~q_read_ev~0 2) .cse8 (<= ~p_num_write~0 (+ ~c_num_read~0 1))) (and .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse1 (= ~c_num_read~0 0) .cse2 .cse3 .cse5 .cse6 .cse7 (<= ~p_num_write~0 1) (<= 1 ~q_read_ev~0) .cse8 .cse9 (<= 1 ~p_num_write~0)))) [2021-12-14 14:52:33,332 INFO L854 garLoopResultBuilder]: At program point L414-1(line 414) the Hoare annotation is: (and (= ~p_num_write~0 0) (= ~c_num_read~0 0) (= ~p_last_write~0 ~q_buf_0~0) (= ~q_write_ev~0 ~q_read_ev~0) (= ~q_free~0 1) (= 1 ~c_dr_i~0) (= ~c_dr_pc~0 ~p_dw_pc~0) (<= ~q_req_up~0 0) (= ~p_dw_st~0 0) (= ~q_read_ev~0 2) (= ~p_dw_i~0 1) (= ~c_last_read~0 ~p_last_write~0) (<= ~c_dr_pc~0 0)) [2021-12-14 14:52:33,332 INFO L854 garLoopResultBuilder]: At program point L340(line 340) the Hoare annotation is: (let ((.cse21 (= ~p_dw_st~0 0))) (let ((.cse16 (or (<= ~p_dw_pc~0 0) (< 1 ~p_dw_pc~0))) (.cse0 (= ~p_num_write~0 0)) (.cse12 (<= 1 ~c_dr_pc~0)) (.cse3 (= ~q_free~0 1)) (.cse15 (<= ~p_num_write~0 ~c_num_read~0)) (.cse9 (= ~c_last_read~0 ~p_last_write~0)) (.cse17 (< ~c_num_read~0 (+ ~p_num_write~0 1))) (.cse1 (= ~c_num_read~0 0)) (.cse7 (<= 1 |ULTIMATE.start_eval_~tmp___1~0#1|)) (.cse19 (<= 1 ~q_read_ev~0)) (.cse10 (<= ~c_dr_pc~0 0)) (.cse18 (= ~q_req_up~0 1)) (.cse23 (< ~c_num_read~0 ~p_num_write~0)) (.cse25 (<= ~p_num_write~0 (+ ~c_num_read~0 1))) (.cse11 (not .cse21)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse13 (<= 2 ~q_write_ev~0)) (.cse14 (<= ~c_dr_pc~0 1)) (.cse4 (not (= ~c_dr_st~0 0))) (.cse5 (= 1 ~c_dr_i~0)) (.cse24 (= ~q_free~0 0)) (.cse6 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse20 (<= ~q_req_up~0 0)) (.cse22 (= ~q_read_ev~0 2)) (.cse8 (= ~p_dw_i~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse2 .cse12 .cse3 .cse13 .cse14 .cse4 .cse5 .cse15 .cse16 .cse8 .cse9 .cse17) (and .cse18 .cse11 .cse2 .cse12 .cse3 .cse13 .cse14 .cse4 .cse5 .cse6 .cse15 .cse19 .cse8 .cse9 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse13 .cse5 .cse6 .cse20 .cse21 .cse22 .cse8 .cse9 .cse10) (and .cse11 .cse2 (not (= ~q_write_ev~0 0)) .cse23 .cse14 .cse4 .cse5 .cse24 .cse6 .cse20 .cse22 .cse8 .cse25) (and .cse2 .cse4 .cse5 .cse24 .cse8 .cse10) (and .cse11 .cse2 .cse12 .cse3 .cse13 .cse14 .cse4 .cse5 .cse6 .cse15 .cse20 .cse8 .cse9 .cse17) (and .cse11 .cse2 .cse23 .cse12 .cse13 .cse14 .cse5 .cse24 .cse6 .cse20 .cse22 .cse8 .cse25) (and .cse0 .cse11 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse16 .cse9) (and .cse0 .cse1 .cse2 .cse12 .cse3 .cse13 .cse14 .cse4 .cse5 .cse7 .cse20 .cse22 .cse8 .cse9) (and .cse2 .cse12 .cse3 .cse13 .cse14 .cse4 .cse5 .cse6 .cse15 .cse20 .cse22 .cse8 .cse9 .cse17) (and .cse18 .cse11 .cse1 .cse2 .cse13 .cse5 .cse24 .cse7 (<= ~p_num_write~0 1) .cse19 .cse8 .cse10 (<= 1 ~p_num_write~0)) (and .cse18 .cse11 .cse2 .cse23 .cse13 .cse14 .cse4 .cse5 .cse24 .cse6 .cse22 .cse8 .cse25) (and .cse11 .cse2 .cse13 .cse14 .cse4 .cse5 .cse24 .cse6 .cse20 .cse22 .cse8)))) [2021-12-14 14:52:33,332 INFO L854 garLoopResultBuilder]: At program point L208(line 208) the Hoare annotation is: false [2021-12-14 14:52:33,333 INFO L854 garLoopResultBuilder]: At program point L208-1(lines 168 216) the Hoare annotation is: (let ((.cse12 (= ~p_dw_st~0 0))) (let ((.cse2 (= ~c_num_read~0 0)) (.cse0 (= ~q_req_up~0 1)) (.cse1 (not .cse12)) (.cse3 (= ~p_last_write~0 ~q_buf_0~0)) (.cse11 (= ~q_free~0 1)) (.cse4 (<= 2 ~q_write_ev~0)) (.cse5 (not (= ~c_dr_st~0 0))) (.cse6 (= 1 ~c_dr_i~0)) (.cse7 (<= 1 |ULTIMATE.start_eval_~tmp___1~0#1|)) (.cse9 (= ~p_dw_i~0 1)) (.cse13 (= ~c_last_read~0 ~p_last_write~0)) (.cse10 (<= ~c_dr_pc~0 0)) (.cse8 (<= 1 ~q_read_ev~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= ~q_free~0 0) .cse7 (<= ~p_num_write~0 1) .cse8 .cse9 .cse10 (<= 1 ~p_num_write~0)) (and (= ~p_num_write~0 0) .cse2 .cse3 .cse11 .cse4 .cse5 .cse6 .cse7 (or (<= ~p_dw_pc~0 0) (< 1 ~p_dw_pc~0)) (<= ~q_req_up~0 0) .cse12 (= ~q_read_ev~0 2) .cse9 .cse13 .cse10) (and (let ((.cse14 (<= ~p_num_write~0 ~c_num_read~0)) (.cse15 (< ~c_num_read~0 (+ ~p_num_write~0 1)))) (or (and .cse0 .cse1 .cse3 .cse11 .cse4 (<= ~c_dr_pc~0 1) .cse5 .cse6 (= ~c_dr_pc~0 ~p_dw_pc~0) .cse7 .cse14 .cse9 .cse13 .cse15) (and .cse0 .cse1 .cse3 .cse11 .cse4 .cse5 .cse6 .cse7 .cse14 .cse9 .cse13 .cse10 .cse15))) .cse8)))) [2021-12-14 14:52:33,333 INFO L854 garLoopResultBuilder]: At program point L431(line 431) the Hoare annotation is: (let ((.cse2 (<= 1 ~c_dr_pc~0)) (.cse8 (<= ~p_num_write~0 ~c_num_read~0)) (.cse12 (< ~c_num_read~0 (+ ~p_num_write~0 1))) (.cse3 (= ~q_free~0 1)) (.cse9 (or (<= ~p_dw_pc~0 0) (< 1 ~p_dw_pc~0))) (.cse11 (= ~c_last_read~0 ~p_last_write~0)) (.cse0 (not (= ~p_dw_st~0 0))) (.cse1 (= ~p_last_write~0 ~q_buf_0~0)) (.cse4 (<= 2 ~q_write_ev~0)) (.cse5 (<= ~c_dr_pc~0 1)) (.cse6 (not (= ~c_dr_st~0 0))) (.cse7 (= 1 ~c_dr_i~0)) (.cse14 (= ~q_free~0 0)) (.cse15 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse13 (<= ~q_req_up~0 0)) (.cse16 (= ~q_read_ev~0 2)) (.cse10 (= ~p_dw_i~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse13 .cse10 .cse11 .cse12) (and .cse0 .cse1 (< ~c_num_read~0 ~p_num_write~0) .cse5 .cse6 .cse7 .cse14 .cse15 .cse13 .cse16 .cse10 (<= ~p_num_write~0 (+ ~c_num_read~0 1))) (and (= ~p_num_write~0 0) .cse0 (= ~c_num_read~0 0) .cse1 .cse3 .cse6 .cse7 .cse15 .cse9 .cse11) (and .cse0 .cse1 .cse6 .cse7 .cse14 .cse10 (<= ~c_dr_pc~0 0)) (and .cse0 .cse1 .cse4 .cse5 .cse6 .cse7 .cse14 .cse15 .cse13 .cse16 .cse10))) [2021-12-14 14:52:33,333 INFO L854 garLoopResultBuilder]: At program point L431-1(line 431) the Hoare annotation is: (let ((.cse2 (<= 1 ~c_dr_pc~0)) (.cse8 (<= ~p_num_write~0 ~c_num_read~0)) (.cse12 (< ~c_num_read~0 (+ ~p_num_write~0 1))) (.cse3 (= ~q_free~0 1)) (.cse9 (or (<= ~p_dw_pc~0 0) (< 1 ~p_dw_pc~0))) (.cse11 (= ~c_last_read~0 ~p_last_write~0)) (.cse0 (not (= ~p_dw_st~0 0))) (.cse1 (= ~p_last_write~0 ~q_buf_0~0)) (.cse4 (<= 2 ~q_write_ev~0)) (.cse5 (<= ~c_dr_pc~0 1)) (.cse6 (not (= ~c_dr_st~0 0))) (.cse7 (= 1 ~c_dr_i~0)) (.cse14 (= ~q_free~0 0)) (.cse15 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse13 (<= ~q_req_up~0 0)) (.cse16 (= ~q_read_ev~0 2)) (.cse10 (= ~p_dw_i~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse13 .cse10 .cse11 .cse12) (and .cse0 .cse1 (not (= ~q_write_ev~0 0)) (< ~c_num_read~0 ~p_num_write~0) .cse5 .cse6 .cse7 .cse14 .cse15 .cse13 .cse16 .cse10 (<= ~p_num_write~0 (+ ~c_num_read~0 1))) (and (= ~p_num_write~0 0) .cse0 (= ~c_num_read~0 0) .cse1 .cse3 .cse6 .cse7 .cse15 .cse9 .cse11) (and .cse0 .cse1 .cse6 .cse7 .cse14 .cse10 (<= ~c_dr_pc~0 0)) (and .cse0 .cse1 .cse4 .cse5 .cse6 .cse7 .cse14 .cse15 .cse13 .cse16 .cse10))) [2021-12-14 14:52:33,333 INFO L858 garLoopResultBuilder]: For program point L65(lines 65 74) no Hoare annotation was computed. [2021-12-14 14:52:33,333 INFO L858 garLoopResultBuilder]: For program point L65-2(lines 65 74) no Hoare annotation was computed. [2021-12-14 14:52:33,333 INFO L858 garLoopResultBuilder]: For program point is_do_write_p_triggeredFINAL(lines 61 79) no Hoare annotation was computed. [2021-12-14 14:52:33,333 INFO L858 garLoopResultBuilder]: For program point is_do_write_p_triggeredEXIT(lines 61 79) no Hoare annotation was computed. [2021-12-14 14:52:33,333 INFO L854 garLoopResultBuilder]: At program point L76(lines 64 78) the Hoare annotation is: (let ((.cse1 (not (= ~p_num_write~0 0))) (.cse4 (not (= ~c_num_read~0 0))) (.cse6 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse16 (not (= ~q_read_ev~0 2))) (.cse17 (not (< ~c_num_read~0 (+ ~p_num_write~0 1)))) (.cse18 (not (<= ~p_num_write~0 ~c_num_read~0))) (.cse12 (not (<= ~c_dr_pc~0 1))) (.cse13 (not (<= 2 ~q_write_ev~0))) (.cse19 (not (<= 1 ~c_dr_pc~0))) (.cse8 (not (= ~q_free~0 1))) (.cse15 (not (<= ~q_req_up~0 0))) (.cse9 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse0 (= ~c_dr_st~0 0)) (.cse20 (not (<= ~c_dr_pc~0 0))) (.cse2 (and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))) (.cse3 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse11 (not (= ~q_free~0 0))) (.cse5 (= ~p_dw_st~0 0)) (.cse7 (and (not (<= ~p_dw_pc~0 0)) (not (< 1 ~p_dw_pc~0)))) (.cse14 (not (= ~p_dw_i~0 1))) (.cse10 (not (= 1 ~c_dr_i~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse0 .cse2 .cse3 .cse11 .cse12 .cse5 .cse6 .cse13 .cse14 .cse15 .cse16 .cse10) (or .cse0 .cse17 .cse2 .cse3 .cse18 .cse12 .cse5 .cse7 .cse13 .cse19 .cse14 .cse8 .cse9 .cse10) (or .cse0 .cse20 .cse2 .cse3 .cse11 .cse5 .cse14 .cse16 .cse10) (or .cse20 (not .cse5) (not (= ~q_write_ev~0 ~q_read_ev~0)) .cse1 .cse2 .cse3 .cse4 .cse6 .cse14 .cse8 .cse15 .cse16 .cse9 .cse10) (or .cse0 (not (<= ~p_num_write~0 (+ ~c_num_read~0 1))) .cse2 (not (< ~c_num_read~0 ~p_num_write~0)) .cse3 .cse11 .cse12 .cse5 .cse6 (= ~q_write_ev~0 0) .cse14 .cse15 .cse16 .cse10) (or .cse0 (= ~q_read_ev~0 1) .cse17 .cse2 .cse3 .cse18 .cse12 .cse5 .cse13 .cse19 .cse14 .cse8 .cse15 .cse9 .cse10) (or .cse0 .cse20 .cse2 .cse3 .cse11 .cse5 .cse7 .cse14 .cse10))) [2021-12-14 14:52:33,334 INFO L861 garLoopResultBuilder]: At program point is_do_write_p_triggeredENTRY(lines 61 79) the Hoare annotation is: true [2021-12-14 14:52:33,334 INFO L858 garLoopResultBuilder]: For program point L66(lines 66 71) no Hoare annotation was computed. [2021-12-14 14:52:33,334 INFO L858 garLoopResultBuilder]: For program point errorEXIT(lines 16 23) no Hoare annotation was computed. [2021-12-14 14:52:33,334 INFO L858 garLoopResultBuilder]: For program point errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 20) no Hoare annotation was computed. [2021-12-14 14:52:33,334 INFO L861 garLoopResultBuilder]: At program point errorENTRY(lines 16 23) the Hoare annotation is: true [2021-12-14 14:52:33,334 INFO L858 garLoopResultBuilder]: For program point errorFINAL(lines 16 23) no Hoare annotation was computed. [2021-12-14 14:52:33,337 INFO L732 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 14:52:33,339 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-14 14:52:33,378 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.12 02:52:33 BoogieIcfgContainer [2021-12-14 14:52:33,379 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-14 14:52:33,379 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-14 14:52:33,379 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-14 14:52:33,380 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-14 14:52:33,380 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 02:51:54" (3/4) ... [2021-12-14 14:52:33,382 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-12-14 14:52:33,386 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure activate_threads [2021-12-14 14:52:33,386 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure exists_runnable_thread [2021-12-14 14:52:33,386 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure is_do_read_c_triggered [2021-12-14 14:52:33,386 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure fire_delta_events [2021-12-14 14:52:33,387 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure update_channels [2021-12-14 14:52:33,387 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure reset_delta_events [2021-12-14 14:52:33,387 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure is_do_write_p_triggered [2021-12-14 14:52:33,387 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure error [2021-12-14 14:52:33,392 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2021-12-14 14:52:33,392 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2021-12-14 14:52:33,392 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2021-12-14 14:52:33,393 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-12-14 14:52:33,411 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((c_dr_st == 0 || !(c_num_read < p_num_write + 1)) || !(p_last_write == q_buf_0)) || !(p_num_write <= c_num_read)) || !(c_dr_pc <= 1)) || !(\old(q_req_up) <= 0)) || p_dw_st == 0) || !(c_dr_pc == p_dw_pc)) || !(2 <= \old(q_write_ev))) || !(1 <= c_dr_pc)) || !(p_dw_i == 1)) || !(q_free == 1)) || !(c_last_read == p_last_write)) || !(1 == c_dr_i)) && ((((((((((((((c_dr_st == 0 || (q_req_up <= 0 && q_read_ev == 2)) || !(\old(q_req_up) == 1)) || !(p_num_write <= c_num_read + 1)) || !(c_num_read < p_num_write)) || !(p_last_write == q_buf_0)) || !(q_free == 0)) || !(c_dr_pc <= 1)) || p_dw_st == 0) || !(c_dr_pc == p_dw_pc)) || !(2 <= \old(q_write_ev))) || !(\old(q_read_ev) == 2)) || !(1 <= c_dr_pc)) || !(p_dw_i == 1)) || !(1 == c_dr_i))) && (((((((c_dr_st == 0 || !(c_dr_pc <= 0)) || !(p_last_write == q_buf_0)) || !(q_free == 0)) || p_dw_st == 0) || \old(q_read_ev) == q_read_ev) || !(p_dw_i == 1)) || !(1 == c_dr_i))) && ((((((((((((((c_dr_st == 0 || !(1 <= \old(q_read_ev))) || !(\old(q_req_up) == 1)) || !(c_num_read < p_num_write + 1)) || !(p_last_write == q_buf_0)) || !(p_num_write <= c_num_read)) || !(c_dr_pc <= 1)) || p_dw_st == 0) || !(2 <= \old(q_write_ev))) || (q_req_up <= 0 && q_write_ev == \old(q_write_ev))) || !(1 <= c_dr_pc)) || !(p_dw_i == 1)) || !(q_free == 1)) || !(c_last_read == p_last_write)) || !(1 == c_dr_i))) && (((((((((((((c_dr_st == 0 || !(p_num_write <= c_num_read + 1)) || !(c_num_read < p_num_write)) || !(p_last_write == q_buf_0)) || !(q_free == 0)) || !(c_dr_pc <= 1)) || !(\old(q_req_up) <= 0)) || p_dw_st == 0) || !(c_dr_pc == p_dw_pc)) || !(\old(q_read_ev) == 2)) || !(1 <= c_dr_pc)) || !(p_dw_i == 1)) || \old(q_write_ev) == 0) || !(1 == c_dr_i))) && ((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || !(\old(q_read_ev) == \old(q_write_ev))) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(\old(q_req_up) <= 0)) || !(c_dr_pc == p_dw_pc)) || !(\old(q_read_ev) == 2)) || !(p_dw_i == 1)) || !(q_free == 1)) || !(c_last_read == p_last_write)) || !(1 == c_dr_i))) && (((((((((((((c_dr_st == 0 || !(c_num_read < p_num_write + 1)) || !(p_last_write == q_buf_0)) || !(p_num_write <= c_num_read)) || !(c_dr_pc <= 1)) || q_write_ev == \old(q_write_ev)) || p_dw_st == 0) || !(2 <= \old(q_write_ev))) || (!(p_dw_pc <= 0) && !(1 < p_dw_pc))) || !(1 <= c_dr_pc)) || !(p_dw_i == 1)) || !(q_free == 1)) || !(c_last_read == p_last_write)) || !(1 == c_dr_i))) && (((((((((((c_dr_st == 0 || !(p_last_write == q_buf_0)) || !(q_free == 0)) || !(c_dr_pc <= 1)) || !(\old(q_req_up) <= 0)) || p_dw_st == 0) || !(c_dr_pc == p_dw_pc)) || !(2 <= \old(q_write_ev))) || !(\old(q_read_ev) == 2)) || !(1 <= c_dr_pc)) || !(p_dw_i == 1)) || !(1 == c_dr_i)) [2021-12-14 14:52:33,450 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-14 14:52:33,451 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-14 14:52:33,452 INFO L158 Benchmark]: Toolchain (without parser) took 39349.11ms. Allocated memory was 96.5MB in the beginning and 2.1GB in the end (delta: 2.0GB). Free memory was 62.8MB in the beginning and 758.3MB in the end (delta: -695.5MB). Peak memory consumption was 1.3GB. Max. memory is 16.1GB. [2021-12-14 14:52:33,452 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 96.5MB. Free memory was 55.6MB in the beginning and 55.5MB in the end (delta: 45.6kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-14 14:52:33,452 INFO L158 Benchmark]: CACSL2BoogieTranslator took 263.64ms. Allocated memory was 96.5MB in the beginning and 121.6MB in the end (delta: 25.2MB). Free memory was 62.5MB in the beginning and 94.3MB in the end (delta: -31.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-14 14:52:33,453 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.86ms. Allocated memory is still 121.6MB. Free memory was 94.3MB in the beginning and 92.8MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-14 14:52:33,453 INFO L158 Benchmark]: Boogie Preprocessor took 25.33ms. Allocated memory is still 121.6MB. Free memory was 92.8MB in the beginning and 91.4MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-14 14:52:33,453 INFO L158 Benchmark]: RCFGBuilder took 413.96ms. Allocated memory is still 121.6MB. Free memory was 91.4MB in the beginning and 76.0MB in the end (delta: 15.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2021-12-14 14:52:33,453 INFO L158 Benchmark]: TraceAbstraction took 38531.07ms. Allocated memory was 121.6MB in the beginning and 2.1GB in the end (delta: 2.0GB). Free memory was 76.0MB in the beginning and 768.8MB in the end (delta: -692.7MB). Peak memory consumption was 1.3GB. Max. memory is 16.1GB. [2021-12-14 14:52:33,453 INFO L158 Benchmark]: Witness Printer took 71.51ms. Allocated memory is still 2.1GB. Free memory was 768.8MB in the beginning and 758.3MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-12-14 14:52:33,459 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 96.5MB. Free memory was 55.6MB in the beginning and 55.5MB in the end (delta: 45.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 263.64ms. Allocated memory was 96.5MB in the beginning and 121.6MB in the end (delta: 25.2MB). Free memory was 62.5MB in the beginning and 94.3MB in the end (delta: -31.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.86ms. Allocated memory is still 121.6MB. Free memory was 94.3MB in the beginning and 92.8MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 25.33ms. Allocated memory is still 121.6MB. Free memory was 92.8MB in the beginning and 91.4MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 413.96ms. Allocated memory is still 121.6MB. Free memory was 91.4MB in the beginning and 76.0MB in the end (delta: 15.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 38531.07ms. Allocated memory was 121.6MB in the beginning and 2.1GB in the end (delta: 2.0GB). Free memory was 76.0MB in the beginning and 768.8MB in the end (delta: -692.7MB). Peak memory consumption was 1.3GB. Max. memory is 16.1GB. * Witness Printer took 71.51ms. Allocated memory is still 2.1GB. Free memory was 768.8MB in the beginning and 758.3MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 20]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 103 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 38.4s, OverallIterations: 21, TraceHistogramMax: 7, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 10.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 18.8s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 9056 SdHoareTripleChecker+Valid, 5.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 8862 mSDsluCounter, 9908 SdHoareTripleChecker+Invalid, 4.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6569 mSDsCounter, 2652 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7525 IncrementalHoareTripleChecker+Invalid, 10177 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2652 mSolverCounterUnsat, 3339 mSDtfsCounter, 7525 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2315 GetRequests, 1984 SyntacticMatches, 7 SemanticMatches, 324 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1213 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=13027occurred in iteration=13, InterpolantAutomatonStates: 288, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.2s AutomataMinimizationTime, 21 MinimizatonAttempts, 8264 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 41 LocationsWithAnnotation, 11931 PreInvPairs, 12450 NumberOfFragments, 9591 HoareAnnotationTreeSize, 11931 FomulaSimplifications, 1396 FormulaSimplificationTreeSizeReduction, 3.5s HoareSimplificationTime, 41 FomulaSimplificationsInter, 506370 FormulaSimplificationTreeSizeReductionInter, 15.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.2s InterpolantComputationTime, 3134 NumberOfCodeBlocks, 3134 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 3590 ConstructedInterpolants, 0 QuantifiedInterpolants, 7202 SizeOfPredicates, 4 NumberOfNonLiveVariables, 3063 ConjunctsInSsa, 40 ConjunctsInUnsatCore, 30 InterpolantComputations, 18 PerfectInterpolantSequences, 1916/1975 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 168]: Loop Invariant Derived loop invariant: ((((((((((((((q_req_up == 1 && !(p_dw_st == 0)) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= q_write_ev) && !(c_dr_st == 0)) && 1 == c_dr_i) && q_free == 0) && 1 <= tmp___1) && p_num_write <= 1) && 1 <= q_read_ev) && p_dw_i == 1) && c_dr_pc <= 0) && 1 <= p_num_write) || ((((((((((((((p_num_write == 0 && c_num_read == 0) && p_last_write == q_buf_0) && q_free == 1) && 2 <= q_write_ev) && !(c_dr_st == 0)) && 1 == c_dr_i) && 1 <= tmp___1) && (p_dw_pc <= 0 || 1 < p_dw_pc)) && q_req_up <= 0) && p_dw_st == 0) && q_read_ev == 2) && p_dw_i == 1) && c_last_read == p_last_write) && c_dr_pc <= 0)) || (((((((((((((((q_req_up == 1 && !(p_dw_st == 0)) && p_last_write == q_buf_0) && q_free == 1) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && 1 == c_dr_i) && c_dr_pc == p_dw_pc) && 1 <= tmp___1) && p_num_write <= c_num_read) && p_dw_i == 1) && c_last_read == p_last_write) && c_num_read < p_num_write + 1) || ((((((((((((q_req_up == 1 && !(p_dw_st == 0)) && p_last_write == q_buf_0) && q_free == 1) && 2 <= q_write_ev) && !(c_dr_st == 0)) && 1 == c_dr_i) && 1 <= tmp___1) && p_num_write <= c_num_read) && p_dw_i == 1) && c_last_read == p_last_write) && c_dr_pc <= 0) && c_num_read < p_num_write + 1)) && 1 <= q_read_ev) - InvariantResult [Line: 386]: Loop Invariant Derived loop invariant: ((((((((((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && 1 <= c_dr_pc) && q_free == 1) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && 1 == c_dr_i) && p_num_write <= c_num_read) && (p_dw_pc <= 0 || 1 < p_dw_pc)) && p_dw_i == 1) && c_last_read == p_last_write) && c_num_read < p_num_write + 1) || ((((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && 1 <= c_dr_pc) && q_free == 1) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && 1 == c_dr_i) && p_num_write <= c_num_read) && q_req_up <= 0) && p_dw_i == 1) && c_last_read == p_last_write) && c_num_read < p_num_write + 1)) || ((((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && c_num_read < p_num_write) && c_dr_pc <= 1) && !(c_dr_st == 0)) && 1 == c_dr_i) && q_free == 0) && c_dr_pc == p_dw_pc) && q_req_up <= 0) && q_read_ev == 2) && p_dw_i == 1) && p_num_write <= c_num_read + 1)) || (((((p_last_write == q_buf_0 && !(c_dr_st == 0)) && 1 == c_dr_i) && q_free == 0) && p_dw_i == 1) && c_dr_pc <= 0)) || ((((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && c_num_read < p_num_write) && 1 <= c_dr_pc) && 2 <= q_write_ev) && c_dr_pc <= 1) && 1 == c_dr_i) && q_free == 0) && c_dr_pc == p_dw_pc) && q_req_up <= 0) && q_read_ev == 2) && p_dw_i == 1) && p_num_write <= c_num_read + 1)) || (((((((((p_num_write == 0 && !(p_dw_st == 0)) && c_num_read == 0) && p_last_write == q_buf_0) && q_free == 1) && !(c_dr_st == 0)) && 1 == c_dr_i) && c_dr_pc == p_dw_pc) && (p_dw_pc <= 0 || 1 < p_dw_pc)) && c_last_read == p_last_write)) || (((((((((((((p_last_write == q_buf_0 && 1 <= c_dr_pc) && q_free == 1) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && 1 == c_dr_i) && c_dr_pc == p_dw_pc) && p_num_write <= c_num_read) && q_req_up <= 0) && q_read_ev == 2) && p_dw_i == 1) && c_last_read == p_last_write) && c_num_read < p_num_write + 1)) || ((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && 1 == c_dr_i) && q_free == 0) && c_dr_pc == p_dw_pc) && q_req_up <= 0) && q_read_ev == 2) && p_dw_i == 1) - InvariantResult [Line: 332]: Loop Invariant Derived loop invariant: (((((((((((((((((((q_req_up == 1 && !(p_dw_st == 0)) && p_last_write == q_buf_0) && 1 <= c_dr_pc) && q_free == 1) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && 1 == c_dr_i) && p_num_write <= c_num_read) && 1 <= q_read_ev) && p_dw_i == 1) && c_last_read == p_last_write) && c_num_read < p_num_write + 1) || ((((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && 1 <= c_dr_pc) && q_free == 1) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && 1 == c_dr_i) && p_num_write <= c_num_read) && (p_dw_pc <= 0 || 1 < p_dw_pc)) && p_dw_i == 1) && c_last_read == p_last_write) && c_num_read < p_num_write + 1)) || ((((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && 1 <= c_dr_pc) && q_free == 1) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && 1 == c_dr_i) && p_num_write <= c_num_read) && q_req_up <= 0) && p_dw_i == 1) && c_last_read == p_last_write) && c_num_read < p_num_write + 1)) || ((((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && c_num_read < p_num_write) && c_dr_pc <= 1) && !(c_dr_st == 0)) && 1 == c_dr_i) && q_free == 0) && c_dr_pc == p_dw_pc) && q_req_up <= 0) && q_read_ev == 2) && p_dw_i == 1) && p_num_write <= c_num_read + 1)) || (((((((((p_num_write == 0 && !(p_dw_st == 0)) && c_num_read == 0) && p_last_write == q_buf_0) && q_free == 1) && !(c_dr_st == 0)) && 1 == c_dr_i) && c_dr_pc == p_dw_pc) && (p_dw_pc <= 0 || 1 < p_dw_pc)) && c_last_read == p_last_write)) || ((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && !(c_dr_st == 0)) && 1 == c_dr_i) && q_free == 0) && p_dw_i == 1) && c_dr_pc <= 0)) || ((((((((((((q_req_up == 1 && !(p_dw_st == 0)) && p_last_write == q_buf_0) && c_num_read < p_num_write) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && 1 == c_dr_i) && q_free == 0) && c_dr_pc == p_dw_pc) && q_read_ev == 2) && p_dw_i == 1) && p_num_write <= c_num_read + 1)) || ((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && 1 == c_dr_i) && q_free == 0) && c_dr_pc == p_dw_pc) && q_req_up <= 0) && q_read_ev == 2) && p_dw_i == 1) - InvariantResult [Line: 465]: Loop Invariant Derived loop invariant: 1 == c_dr_i - InvariantResult [Line: 165]: Loop Invariant Derived loop invariant: (((((((((((((((p_num_write == 0 && c_num_read == 0) && p_last_write == q_buf_0) && 1 <= c_dr_pc) && q_free == 1) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && 1 == c_dr_i) && 1 <= tmp___1) && (p_dw_pc <= 0 || 1 < p_dw_pc)) && q_req_up <= 0) && p_dw_st == 0) && q_read_ev == 2) && p_dw_i == 1) && c_last_read == p_last_write) || ((((((((((((((q_req_up == 1 && !(p_dw_st == 0)) && p_last_write == q_buf_0) && 1 <= c_dr_pc) && q_free == 1) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && 1 == c_dr_i) && 1 <= tmp___1) && p_num_write <= c_num_read) && 1 <= q_read_ev) && p_dw_i == 1) && c_last_read == p_last_write) && c_num_read < p_num_write + 1) - InvariantResult [Line: 168]: Loop Invariant Derived loop invariant: (((((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && c_num_read < p_num_write) && 1 <= c_dr_pc) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && 1 == c_dr_i) && q_free == 0) && c_dr_pc == p_dw_pc) && 1 <= tmp___1) && q_req_up <= 0) && 1 <= q_read_ev) && p_dw_i == 1) && p_num_write <= c_num_read + 1 - InvariantResult [Line: 390]: Loop Invariant Derived loop invariant: ((((((((((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && 1 <= c_dr_pc) && q_free == 1) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && 1 == c_dr_i) && p_num_write <= c_num_read) && (p_dw_pc <= 0 || 1 < p_dw_pc)) && p_dw_i == 1) && c_last_read == p_last_write) && c_num_read < p_num_write + 1) || ((((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && 1 <= c_dr_pc) && q_free == 1) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && 1 == c_dr_i) && p_num_write <= c_num_read) && q_req_up <= 0) && p_dw_i == 1) && c_last_read == p_last_write) && c_num_read < p_num_write + 1)) || ((((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && c_num_read < p_num_write) && c_dr_pc <= 1) && !(c_dr_st == 0)) && 1 == c_dr_i) && q_free == 0) && c_dr_pc == p_dw_pc) && q_req_up <= 0) && q_read_ev == 2) && p_dw_i == 1) && p_num_write <= c_num_read + 1)) || (((((p_last_write == q_buf_0 && !(c_dr_st == 0)) && 1 == c_dr_i) && q_free == 0) && p_dw_i == 1) && c_dr_pc <= 0)) || ((((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && c_num_read < p_num_write) && 1 <= c_dr_pc) && 2 <= q_write_ev) && c_dr_pc <= 1) && 1 == c_dr_i) && q_free == 0) && c_dr_pc == p_dw_pc) && q_req_up <= 0) && q_read_ev == 2) && p_dw_i == 1) && p_num_write <= c_num_read + 1)) || (((((((((p_num_write == 0 && !(p_dw_st == 0)) && c_num_read == 0) && p_last_write == q_buf_0) && q_free == 1) && !(c_dr_st == 0)) && 1 == c_dr_i) && c_dr_pc == p_dw_pc) && (p_dw_pc <= 0 || 1 < p_dw_pc)) && c_last_read == p_last_write)) || (((((((((((((p_last_write == q_buf_0 && 1 <= c_dr_pc) && q_free == 1) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && 1 == c_dr_i) && c_dr_pc == p_dw_pc) && p_num_write <= c_num_read) && q_req_up <= 0) && q_read_ev == 2) && p_dw_i == 1) && c_last_read == p_last_write) && c_num_read < p_num_write + 1)) || ((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && 1 == c_dr_i) && q_free == 0) && c_dr_pc == p_dw_pc) && q_req_up <= 0) && q_read_ev == 2) && p_dw_i == 1) - InvariantResult [Line: 127]: Loop Invariant Derived loop invariant: (((((((((((((p_num_write == 0 && !(p_dw_st == 0)) && c_num_read == 0) && p_last_write == q_buf_0) && q_free == 1) && !(c_dr_st == 0)) && 1 == c_dr_i) && 1 <= tmp___1) && p_dw_i == 1) && c_dr_pc <= 0) || (((((((((((p_num_write == 0 && !(p_dw_st == 0)) && c_num_read == 0) && p_last_write == q_buf_0) && q_free == 1) && 2 <= q_write_ev) && 1 == c_dr_i) && 1 <= tmp___1) && q_req_up <= 0) && 1 <= q_read_ev) && p_dw_i == 1) && c_dr_pc <= 0)) || (((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && !(c_dr_st == 0)) && 1 == c_dr_i) && q_free == 0) && 1 <= tmp___1) && p_dw_i == 1) && c_dr_pc <= 0)) || (((((((((((((p_num_write == 0 && !(p_dw_st == 0)) && c_num_read == 0) && p_last_write == q_buf_0) && 1 <= c_dr_pc) && q_free == 1) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && 1 == c_dr_i) && 1 <= tmp___1) && q_req_up <= 0) && q_read_ev == 2) && p_dw_i == 1)) || (((((((((((((q_req_up == 1 && !(p_dw_st == 0)) && p_last_write == q_buf_0) && c_num_read < p_num_write) && 1 <= c_dr_pc) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && 1 == c_dr_i) && q_free == 0) && 1 <= tmp___1) && q_read_ev == 2) && p_dw_i == 1) && p_num_write <= c_num_read + 1)) || ((((((((((((q_req_up == 1 && !(p_dw_st == 0)) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= q_write_ev) && 1 == c_dr_i) && q_free == 0) && 1 <= tmp___1) && p_num_write <= 1) && 1 <= q_read_ev) && p_dw_i == 1) && c_dr_pc <= 0) && 1 <= p_num_write) - InvariantResult [Line: 83]: Loop Invariant Derived loop invariant: ((((((((((((((((((((c_dr_st == 0 || !(q_read_ev == 1)) || !(c_num_read < p_num_write + 1)) || !(p_last_write == q_buf_0)) || !(p_num_write <= c_num_read)) || !(c_dr_pc <= 1)) || !(c_dr_pc == p_dw_pc)) || (__retres1 <= 0 && 0 <= __retres1)) || !(2 <= q_write_ev)) || !(1 <= c_dr_pc)) || !(p_dw_i == 1)) || !(q_free == 1)) || !(q_req_up <= 0)) || !(c_last_read == p_last_write)) || !(1 == c_dr_i)) && ((((((((((((((c_dr_st == 0 || !(p_num_write <= c_num_read + 1)) || 0 < q_write_ev) || !(c_num_read < p_num_write)) || !(p_last_write == q_buf_0)) || !(q_free == 0)) || !(c_dr_pc <= 1)) || p_dw_st == 0) || !(c_dr_pc == p_dw_pc)) || q_write_ev == 0) || (__retres1 <= 0 && 0 <= __retres1)) || !(p_dw_i == 1)) || !(q_req_up <= 0)) || !(q_read_ev == 2)) || !(1 == c_dr_i))) && (((((((((((c_dr_st == 0 || !(p_last_write == q_buf_0)) || !(q_free == 0)) || !(c_dr_pc <= 1)) || p_dw_st == 0) || !(c_dr_pc == p_dw_pc)) || (__retres1 <= 0 && 0 <= __retres1)) || !(2 <= q_write_ev)) || !(p_dw_i == 1)) || !(q_req_up <= 0)) || !(q_read_ev == 2)) || !(1 == c_dr_i))) && ((((((c_dr_st == 0 || !(c_dr_pc <= 0)) || !(p_last_write == q_buf_0)) || !(q_free == 0)) || (__retres1 <= 0 && 0 <= __retres1)) || !(p_dw_i == 1)) || !(1 == c_dr_i))) && (((((((((((((c_dr_st == 0 || !(c_num_read < p_num_write + 1)) || !(p_last_write == q_buf_0)) || !(p_num_write <= c_num_read)) || !(c_dr_pc <= 1)) || p_dw_st == 0) || (!(p_dw_pc <= 0) && !(1 < p_dw_pc))) || (__retres1 <= 0 && 0 <= __retres1)) || !(2 <= q_write_ev)) || !(1 <= c_dr_pc)) || !(p_dw_i == 1)) || !(q_free == 1)) || !(c_last_read == p_last_write)) || !(1 == c_dr_i))) && ((((((((((c_dr_st == 0 || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || p_dw_st == 0) || !(c_dr_pc == p_dw_pc)) || (!(p_dw_pc <= 0) && !(1 < p_dw_pc))) || (__retres1 <= 0 && 0 <= __retres1)) || !(q_free == 1)) || !(c_last_read == p_last_write)) || !(1 == c_dr_i))) && (((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(c_dr_pc == p_dw_pc)) || (__retres1 <= 0 && 0 <= __retres1)) || !(p_dw_i == 1)) || !(q_free == 1)) || !(q_req_up <= 0)) || !(q_read_ev == 2)) || !(c_last_read == p_last_write)) || !(1 == c_dr_i))) && ((((((((((((((c_dr_st == 0 || !(c_num_read < p_num_write + 1)) || !(p_last_write == q_buf_0)) || !(p_num_write <= c_num_read)) || !(c_dr_pc <= 1)) || p_dw_st == 0) || !(c_dr_pc == p_dw_pc)) || (__retres1 <= 0 && 0 <= __retres1)) || !(2 <= q_write_ev)) || !(1 <= c_dr_pc)) || !(p_dw_i == 1)) || !(q_free == 1)) || !(q_req_up <= 0)) || !(c_last_read == p_last_write)) || !(1 == c_dr_i)) - InvariantResult [Line: 31]: Loop Invariant Derived loop invariant: (((((((((((((((((((c_dr_st == 0 || !(c_num_read < p_num_write + 1)) || !(p_last_write == q_buf_0)) || !(p_num_write <= c_num_read)) || !(c_dr_pc <= 1)) || !(\old(q_req_up) <= 0)) || p_dw_st == 0) || !(c_dr_pc == p_dw_pc)) || !(2 <= \old(q_write_ev))) || !(1 <= c_dr_pc)) || !(p_dw_i == 1)) || !(q_free == 1)) || !(c_last_read == p_last_write)) || !(1 == c_dr_i)) && ((((((((((((((c_dr_st == 0 || (q_req_up <= 0 && q_read_ev == 2)) || !(\old(q_req_up) == 1)) || !(p_num_write <= c_num_read + 1)) || !(c_num_read < p_num_write)) || !(p_last_write == q_buf_0)) || !(q_free == 0)) || !(c_dr_pc <= 1)) || p_dw_st == 0) || !(c_dr_pc == p_dw_pc)) || !(2 <= \old(q_write_ev))) || !(\old(q_read_ev) == 2)) || !(1 <= c_dr_pc)) || !(p_dw_i == 1)) || !(1 == c_dr_i))) && (((((((c_dr_st == 0 || !(c_dr_pc <= 0)) || !(p_last_write == q_buf_0)) || !(q_free == 0)) || p_dw_st == 0) || \old(q_read_ev) == q_read_ev) || !(p_dw_i == 1)) || !(1 == c_dr_i))) && ((((((((((((((c_dr_st == 0 || !(1 <= \old(q_read_ev))) || !(\old(q_req_up) == 1)) || !(c_num_read < p_num_write + 1)) || !(p_last_write == q_buf_0)) || !(p_num_write <= c_num_read)) || !(c_dr_pc <= 1)) || p_dw_st == 0) || !(2 <= \old(q_write_ev))) || (q_req_up <= 0 && q_write_ev == \old(q_write_ev))) || !(1 <= c_dr_pc)) || !(p_dw_i == 1)) || !(q_free == 1)) || !(c_last_read == p_last_write)) || !(1 == c_dr_i))) && (((((((((((((c_dr_st == 0 || !(p_num_write <= c_num_read + 1)) || !(c_num_read < p_num_write)) || !(p_last_write == q_buf_0)) || !(q_free == 0)) || !(c_dr_pc <= 1)) || !(\old(q_req_up) <= 0)) || p_dw_st == 0) || !(c_dr_pc == p_dw_pc)) || !(\old(q_read_ev) == 2)) || !(1 <= c_dr_pc)) || !(p_dw_i == 1)) || \old(q_write_ev) == 0) || !(1 == c_dr_i))) && ((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || !(\old(q_read_ev) == \old(q_write_ev))) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(\old(q_req_up) <= 0)) || !(c_dr_pc == p_dw_pc)) || !(\old(q_read_ev) == 2)) || !(p_dw_i == 1)) || !(q_free == 1)) || !(c_last_read == p_last_write)) || !(1 == c_dr_i))) && (((((((((((((c_dr_st == 0 || !(c_num_read < p_num_write + 1)) || !(p_last_write == q_buf_0)) || !(p_num_write <= c_num_read)) || !(c_dr_pc <= 1)) || q_write_ev == \old(q_write_ev)) || p_dw_st == 0) || !(2 <= \old(q_write_ev))) || (!(p_dw_pc <= 0) && !(1 < p_dw_pc))) || !(1 <= c_dr_pc)) || !(p_dw_i == 1)) || !(q_free == 1)) || !(c_last_read == p_last_write)) || !(1 == c_dr_i))) && (((((((((((c_dr_st == 0 || !(p_last_write == q_buf_0)) || !(q_free == 0)) || !(c_dr_pc <= 1)) || !(\old(q_req_up) <= 0)) || p_dw_st == 0) || !(c_dr_pc == p_dw_pc)) || !(2 <= \old(q_write_ev))) || !(\old(q_read_ev) == 2)) || !(1 <= c_dr_pc)) || !(p_dw_i == 1)) || !(1 == c_dr_i)) - InvariantResult [Line: 416]: Loop Invariant Derived loop invariant: (((((((((((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && 1 <= c_dr_pc) && q_free == 1) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && 1 == c_dr_i) && p_num_write <= c_num_read) && (p_dw_pc <= 0 || 1 < p_dw_pc)) && p_dw_i == 1) && c_last_read == p_last_write) && c_num_read < p_num_write + 1) || ((((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && 1 <= c_dr_pc) && q_free == 1) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && 1 == c_dr_i) && p_num_write <= c_num_read) && q_req_up <= 0) && p_dw_i == 1) && c_last_read == p_last_write) && c_num_read < p_num_write + 1)) || ((((((((((((p_num_write == 0 && c_num_read == 0) && p_last_write == q_buf_0) && q_free == 1) && 2 <= q_write_ev) && 1 == c_dr_i) && c_dr_pc == p_dw_pc) && q_req_up <= 0) && p_dw_st == 0) && q_read_ev == 2) && p_dw_i == 1) && c_last_read == p_last_write) && c_dr_pc <= 0)) || ((((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && c_num_read < p_num_write) && c_dr_pc <= 1) && !(c_dr_st == 0)) && 1 == c_dr_i) && q_free == 0) && c_dr_pc == p_dw_pc) && q_req_up <= 0) && q_read_ev == 2) && p_dw_i == 1) && p_num_write <= c_num_read + 1)) || (((((p_last_write == q_buf_0 && !(c_dr_st == 0)) && 1 == c_dr_i) && q_free == 0) && p_dw_i == 1) && c_dr_pc <= 0)) || ((((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && c_num_read < p_num_write) && 1 <= c_dr_pc) && 2 <= q_write_ev) && c_dr_pc <= 1) && 1 == c_dr_i) && q_free == 0) && c_dr_pc == p_dw_pc) && q_req_up <= 0) && q_read_ev == 2) && p_dw_i == 1) && p_num_write <= c_num_read + 1)) || (((((((((p_num_write == 0 && !(p_dw_st == 0)) && c_num_read == 0) && p_last_write == q_buf_0) && q_free == 1) && !(c_dr_st == 0)) && 1 == c_dr_i) && c_dr_pc == p_dw_pc) && (p_dw_pc <= 0 || 1 < p_dw_pc)) && c_last_read == p_last_write)) || (((((((((((((p_last_write == q_buf_0 && 1 <= c_dr_pc) && q_free == 1) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && 1 == c_dr_i) && c_dr_pc == p_dw_pc) && p_num_write <= c_num_read) && q_req_up <= 0) && q_read_ev == 2) && p_dw_i == 1) && c_last_read == p_last_write) && c_num_read < p_num_write + 1)) || ((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && 1 == c_dr_i) && q_free == 0) && c_dr_pc == p_dw_pc) && q_req_up <= 0) && q_read_ev == 2) && p_dw_i == 1) - InvariantResult [Line: 405]: Loop Invariant Derived loop invariant: 1 == c_dr_i - InvariantResult [Line: 64]: Loop Invariant Derived loop invariant: ((((((((((((((((c_dr_st == 0 || !(p_num_write == 0)) || (__retres1 <= 0 && 0 <= __retres1)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || p_dw_st == 0) || !(c_dr_pc == p_dw_pc)) || (!(p_dw_pc <= 0) && !(1 < p_dw_pc))) || !(q_free == 1)) || !(c_last_read == p_last_write)) || !(1 == c_dr_i)) && (((((((((((c_dr_st == 0 || (__retres1 <= 0 && 0 <= __retres1)) || !(p_last_write == q_buf_0)) || !(q_free == 0)) || !(c_dr_pc <= 1)) || p_dw_st == 0) || !(c_dr_pc == p_dw_pc)) || !(2 <= q_write_ev)) || !(p_dw_i == 1)) || !(q_req_up <= 0)) || !(q_read_ev == 2)) || !(1 == c_dr_i))) && (((((((((((((c_dr_st == 0 || !(c_num_read < p_num_write + 1)) || (__retres1 <= 0 && 0 <= __retres1)) || !(p_last_write == q_buf_0)) || !(p_num_write <= c_num_read)) || !(c_dr_pc <= 1)) || p_dw_st == 0) || (!(p_dw_pc <= 0) && !(1 < p_dw_pc))) || !(2 <= q_write_ev)) || !(1 <= c_dr_pc)) || !(p_dw_i == 1)) || !(q_free == 1)) || !(c_last_read == p_last_write)) || !(1 == c_dr_i))) && ((((((((c_dr_st == 0 || !(c_dr_pc <= 0)) || (__retres1 <= 0 && 0 <= __retres1)) || !(p_last_write == q_buf_0)) || !(q_free == 0)) || p_dw_st == 0) || !(p_dw_i == 1)) || !(q_read_ev == 2)) || !(1 == c_dr_i))) && (((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || (__retres1 <= 0 && 0 <= __retres1)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(c_dr_pc == p_dw_pc)) || !(p_dw_i == 1)) || !(q_free == 1)) || !(q_req_up <= 0)) || !(q_read_ev == 2)) || !(c_last_read == p_last_write)) || !(1 == c_dr_i))) && (((((((((((((c_dr_st == 0 || !(p_num_write <= c_num_read + 1)) || (__retres1 <= 0 && 0 <= __retres1)) || !(c_num_read < p_num_write)) || !(p_last_write == q_buf_0)) || !(q_free == 0)) || !(c_dr_pc <= 1)) || p_dw_st == 0) || !(c_dr_pc == p_dw_pc)) || q_write_ev == 0) || !(p_dw_i == 1)) || !(q_req_up <= 0)) || !(q_read_ev == 2)) || !(1 == c_dr_i))) && ((((((((((((((c_dr_st == 0 || q_read_ev == 1) || !(c_num_read < p_num_write + 1)) || (__retres1 <= 0 && 0 <= __retres1)) || !(p_last_write == q_buf_0)) || !(p_num_write <= c_num_read)) || !(c_dr_pc <= 1)) || p_dw_st == 0) || !(2 <= q_write_ev)) || !(1 <= c_dr_pc)) || !(p_dw_i == 1)) || !(q_free == 1)) || !(q_req_up <= 0)) || !(c_last_read == p_last_write)) || !(1 == c_dr_i))) && ((((((((c_dr_st == 0 || !(c_dr_pc <= 0)) || (__retres1 <= 0 && 0 <= __retres1)) || !(p_last_write == q_buf_0)) || !(q_free == 0)) || p_dw_st == 0) || (!(p_dw_pc <= 0) && !(1 < p_dw_pc))) || !(p_dw_i == 1)) || !(1 == c_dr_i)) - InvariantResult [Line: 254]: Loop Invariant Derived loop invariant: ((((((((((((((((((1 <= __retres1 || !(c_dr_pc <= 0)) || !(q_req_up == 1)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || p_dw_st == 0) || !(2 <= q_write_ev)) || !(p_dw_i == 1)) || !(1 <= p_num_write)) || !(1 <= q_read_ev)) || (!(c_dr_st == 0) && q_read_ev == 2)) || !(p_num_write <= 1)) || !(1 == c_dr_i)) && (((((((1 <= __retres1 || c_dr_st == 0) || !(c_dr_pc <= 0)) || !(p_dw_st == 0)) || !(p_last_write == q_buf_0)) || !(q_free == 0)) || !(p_dw_i == 1)) || !(1 == c_dr_i))) && (((((((((((((((1 <= __retres1 || c_dr_st == 0) || !(p_dw_st == 0)) || !(c_num_read < p_num_write + 1)) || !(p_last_write == q_buf_0)) || !(p_num_write <= c_num_read)) || !(c_dr_pc <= 1)) || !(c_dr_pc == p_dw_pc)) || !(2 <= q_write_ev)) || !(1 <= c_dr_pc)) || !(p_dw_i == 1)) || !(q_free == 1)) || !(q_req_up <= 0)) || !(q_read_ev == 2)) || !(c_last_read == p_last_write)) || !(1 == c_dr_i))) && (((((((((((((1 <= __retres1 || !(c_dr_pc <= 0)) || !(p_dw_st == 0)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(c_dr_pc == p_dw_pc)) || !(2 <= q_write_ev)) || !(p_dw_i == 1)) || !(q_free == 1)) || !(q_req_up <= 0)) || !(q_read_ev == 2)) || !(c_last_read == p_last_write)) || !(1 == c_dr_i))) && (((((((((((1 <= __retres1 || c_dr_st == 0) || !(c_dr_pc <= 0)) || !(p_dw_st == 0)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(c_dr_pc == p_dw_pc)) || !(p_dw_i == 1)) || !(q_free == 1)) || !(c_last_read == p_last_write)) || !(1 == c_dr_i))) && ((((((((((((((1 <= __retres1 || c_dr_st == 0) || !(p_dw_st == 0)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(c_dr_pc <= 1)) || !(2 <= q_write_ev)) || !(1 <= c_dr_pc)) || !(p_dw_i == 1)) || !(q_free == 1)) || !(q_req_up <= 0)) || !(q_read_ev == 2)) || !(c_last_read == p_last_write)) || !(1 == c_dr_i))) && ((((((((((((((1 <= __retres1 || !(p_num_write <= c_num_read + 1)) || !(c_dr_st == 0)) || !(c_num_read < p_num_write)) || !(p_last_write == q_buf_0)) || !(q_free == 0)) || !(c_dr_pc <= 1)) || p_dw_st == 0) || !(c_dr_pc == p_dw_pc)) || !(2 <= q_write_ev)) || !(1 <= c_dr_pc)) || !(p_dw_i == 1)) || !(q_req_up <= 0)) || !(q_read_ev == 2)) || !(1 == c_dr_i)) - InvariantResult [Line: 339]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((p_num_write == 0 && c_num_read == 0) && p_last_write == q_buf_0) && q_free == 1) && !(c_dr_st == 0)) && 1 == c_dr_i) && c_dr_pc == p_dw_pc) && 1 <= tmp___1) && p_dw_i == 1) && c_last_read == p_last_write) && c_dr_pc <= 0) || ((((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && 1 <= c_dr_pc) && q_free == 1) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && 1 == c_dr_i) && p_num_write <= c_num_read) && (p_dw_pc <= 0 || 1 < p_dw_pc)) && p_dw_i == 1) && c_last_read == p_last_write) && c_num_read < p_num_write + 1)) || ((((((((((((((q_req_up == 1 && !(p_dw_st == 0)) && p_last_write == q_buf_0) && 1 <= c_dr_pc) && q_free == 1) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && 1 == c_dr_i) && c_dr_pc == p_dw_pc) && p_num_write <= c_num_read) && 1 <= q_read_ev) && p_dw_i == 1) && c_last_read == p_last_write) && c_num_read < p_num_write + 1)) || ((((((((((((p_num_write == 0 && c_num_read == 0) && p_last_write == q_buf_0) && q_free == 1) && 2 <= q_write_ev) && 1 == c_dr_i) && c_dr_pc == p_dw_pc) && q_req_up <= 0) && p_dw_st == 0) && q_read_ev == 2) && p_dw_i == 1) && c_last_read == p_last_write) && c_dr_pc <= 0)) || ((((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && c_num_read < p_num_write) && c_dr_pc <= 1) && !(c_dr_st == 0)) && 1 == c_dr_i) && q_free == 0) && c_dr_pc == p_dw_pc) && q_req_up <= 0) && q_read_ev == 2) && p_dw_i == 1) && p_num_write <= c_num_read + 1)) || (((((p_last_write == q_buf_0 && !(c_dr_st == 0)) && 1 == c_dr_i) && q_free == 0) && p_dw_i == 1) && c_dr_pc <= 0)) || (((((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && 1 <= c_dr_pc) && q_free == 1) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && 1 == c_dr_i) && c_dr_pc == p_dw_pc) && p_num_write <= c_num_read) && q_req_up <= 0) && p_dw_i == 1) && c_last_read == p_last_write) && c_num_read < p_num_write + 1)) || ((((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && c_num_read < p_num_write) && 1 <= c_dr_pc) && 2 <= q_write_ev) && c_dr_pc <= 1) && 1 == c_dr_i) && q_free == 0) && c_dr_pc == p_dw_pc) && q_req_up <= 0) && q_read_ev == 2) && p_dw_i == 1) && p_num_write <= c_num_read + 1)) || (((((((((p_num_write == 0 && !(p_dw_st == 0)) && c_num_read == 0) && p_last_write == q_buf_0) && q_free == 1) && !(c_dr_st == 0)) && 1 == c_dr_i) && c_dr_pc == p_dw_pc) && (p_dw_pc <= 0 || 1 < p_dw_pc)) && c_last_read == p_last_write)) || (((((((((((((p_num_write == 0 && c_num_read == 0) && p_last_write == q_buf_0) && 1 <= c_dr_pc) && q_free == 1) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && 1 == c_dr_i) && 1 <= tmp___1) && q_req_up <= 0) && q_read_ev == 2) && p_dw_i == 1) && c_last_read == p_last_write)) || (((((((((((((p_last_write == q_buf_0 && 1 <= c_dr_pc) && q_free == 1) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && 1 == c_dr_i) && c_dr_pc == p_dw_pc) && p_num_write <= c_num_read) && q_req_up <= 0) && q_read_ev == 2) && p_dw_i == 1) && c_last_read == p_last_write) && c_num_read < p_num_write + 1)) || ((((((((((((q_req_up == 1 && !(p_dw_st == 0)) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= q_write_ev) && 1 == c_dr_i) && q_free == 0) && 1 <= tmp___1) && p_num_write <= 1) && 1 <= q_read_ev) && p_dw_i == 1) && c_dr_pc <= 0) && 1 <= p_num_write)) || ((((((((((((q_req_up == 1 && !(p_dw_st == 0)) && p_last_write == q_buf_0) && c_num_read < p_num_write) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && 1 == c_dr_i) && q_free == 0) && c_dr_pc == p_dw_pc) && q_read_ev == 2) && p_dw_i == 1) && p_num_write <= c_num_read + 1)) || ((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && 1 == c_dr_i) && q_free == 0) && c_dr_pc == p_dw_pc) && q_req_up <= 0) && q_read_ev == 2) && p_dw_i == 1) - InvariantResult [Line: 127]: Loop Invariant Derived loop invariant: ((((((((((((p_num_write == 0 && !(p_dw_st == 0)) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= q_write_ev) && 1 == c_dr_i) && 1 <= tmp___1) && q_req_up <= 0) && 1 <= q_read_ev) && p_dw_i == 1) && c_dr_pc <= 0) || ((((((((p_num_write == 0 && !(p_dw_st == 0)) && c_num_read == 0) && p_last_write == q_buf_0) && !(c_dr_st == 0)) && 1 == c_dr_i) && 1 <= tmp___1) && p_dw_i == 1) && c_dr_pc <= 0)) || (((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && !(c_dr_st == 0)) && 1 == c_dr_i) && q_free == 0) && 1 <= tmp___1) && p_dw_i == 1) && c_dr_pc <= 0)) || (((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && 1 <= c_dr_pc) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && 1 == c_dr_i) && 1 <= tmp___1) && p_num_write <= c_num_read) && q_read_ev == 2) && p_dw_i == 1) && c_num_read < p_num_write + 1) - InvariantResult [Line: 448]: Loop Invariant Derived loop invariant: (((((((((((p_num_write == 0 && c_num_read == 0) && p_last_write == q_buf_0) && q_write_ev == q_read_ev) && q_free == 1) && 1 == c_dr_i) && c_dr_pc == p_dw_pc) && q_req_up <= 0) && p_dw_st == 0) && q_read_ev == 2) && p_dw_i == 1) && c_last_read == p_last_write) && c_dr_pc <= 0 - InvariantResult [Line: 233]: Loop Invariant Derived loop invariant: (((((((((((p_num_write == 0 && c_num_read == 0) && p_last_write == q_buf_0) && q_write_ev == q_read_ev) && q_free == 1) && 1 == c_dr_i) && c_dr_pc == p_dw_pc) && q_req_up <= 0) && p_dw_st == 0) && q_read_ev == 2) && p_dw_i == 1) && c_last_read == p_last_write) && c_dr_pc <= 0 - InvariantResult [Line: 124]: Loop Invariant Derived loop invariant: ((((((((((((((q_req_up == 1 && !(p_dw_st == 0)) && p_last_write == q_buf_0) && c_num_read < p_num_write) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && 1 == c_dr_i) && q_free == 0) && c_dr_pc == p_dw_pc) && 1 <= tmp___1) && q_read_ev == 2) && p_dw_i == 1) && p_num_write <= c_num_read + 1) || (((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && !(c_dr_st == 0)) && 1 == c_dr_i) && q_free == 0) && 1 <= tmp___1) && p_dw_i == 1) && c_dr_pc <= 0)) || ((((((((((((q_req_up == 1 && !(p_dw_st == 0)) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= q_write_ev) && 1 == c_dr_i) && q_free == 0) && 1 <= tmp___1) && p_num_write <= 1) && 1 <= q_read_ev) && p_dw_i == 1) && c_dr_pc <= 0) && 1 <= p_num_write) RESULT: Ultimate proved your program to be correct! [2021-12-14 14:52:33,543 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE