./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/systemc/pc_sfifo_3.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8393723b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fa2a8d4-bb81-42c0-8b16-81e7ff79702a/bin/uautomizer-TMbwUNV5ro/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fa2a8d4-bb81-42c0-8b16-81e7ff79702a/bin/uautomizer-TMbwUNV5ro/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fa2a8d4-bb81-42c0-8b16-81e7ff79702a/bin/uautomizer-TMbwUNV5ro/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fa2a8d4-bb81-42c0-8b16-81e7ff79702a/bin/uautomizer-TMbwUNV5ro/config/AutomizerReach.xml -i ../../sv-benchmarks/c/systemc/pc_sfifo_3.cil.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fa2a8d4-bb81-42c0-8b16-81e7ff79702a/bin/uautomizer-TMbwUNV5ro/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fa2a8d4-bb81-42c0-8b16-81e7ff79702a/bin/uautomizer-TMbwUNV5ro --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 677126e8d6773c92cc337bfe0a3ec155f49f784424155f33a8c9c24ee0a42113 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-8393723 [2022-11-18 20:53:03,619 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-18 20:53:03,621 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-18 20:53:03,650 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-18 20:53:03,657 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-18 20:53:03,660 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-18 20:53:03,663 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-18 20:53:03,665 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-18 20:53:03,666 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-18 20:53:03,667 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-18 20:53:03,668 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-18 20:53:03,669 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-18 20:53:03,669 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-18 20:53:03,670 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-18 20:53:03,671 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-18 20:53:03,672 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-18 20:53:03,673 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-18 20:53:03,674 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-18 20:53:03,676 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-18 20:53:03,677 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-18 20:53:03,679 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-18 20:53:03,680 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-18 20:53:03,681 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-18 20:53:03,682 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-18 20:53:03,686 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-18 20:53:03,686 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-18 20:53:03,686 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-18 20:53:03,687 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-18 20:53:03,688 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-18 20:53:03,689 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-18 20:53:03,689 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-18 20:53:03,690 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-18 20:53:03,691 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-18 20:53:03,692 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-18 20:53:03,693 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-18 20:53:03,694 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-18 20:53:03,694 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-18 20:53:03,695 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-18 20:53:03,695 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-18 20:53:03,696 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-18 20:53:03,697 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-18 20:53:03,698 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fa2a8d4-bb81-42c0-8b16-81e7ff79702a/bin/uautomizer-TMbwUNV5ro/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-18 20:53:03,734 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-18 20:53:03,737 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-18 20:53:03,739 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-18 20:53:03,739 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-18 20:53:03,740 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-18 20:53:03,741 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-18 20:53:03,741 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-18 20:53:03,743 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-18 20:53:03,743 INFO L138 SettingsManager]: * Use SBE=true [2022-11-18 20:53:03,743 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-18 20:53:03,744 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-18 20:53:03,745 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-18 20:53:03,745 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-18 20:53:03,745 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-18 20:53:03,745 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-18 20:53:03,746 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-18 20:53:03,746 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-18 20:53:03,746 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-18 20:53:03,746 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-18 20:53:03,747 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-18 20:53:03,747 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-18 20:53:03,747 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-18 20:53:03,747 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-18 20:53:03,748 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-18 20:53:03,748 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 20:53:03,748 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-18 20:53:03,750 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-18 20:53:03,750 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-18 20:53:03,750 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-18 20:53:03,750 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-18 20:53:03,751 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-18 20:53:03,751 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-18 20:53:03,751 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-18 20:53:03,751 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fa2a8d4-bb81-42c0-8b16-81e7ff79702a/bin/uautomizer-TMbwUNV5ro/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fa2a8d4-bb81-42c0-8b16-81e7ff79702a/bin/uautomizer-TMbwUNV5ro 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 -> 677126e8d6773c92cc337bfe0a3ec155f49f784424155f33a8c9c24ee0a42113 [2022-11-18 20:53:04,043 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-18 20:53:04,063 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-18 20:53:04,065 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-18 20:53:04,066 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-18 20:53:04,082 INFO L275 PluginConnector]: CDTParser initialized [2022-11-18 20:53:04,083 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fa2a8d4-bb81-42c0-8b16-81e7ff79702a/bin/uautomizer-TMbwUNV5ro/../../sv-benchmarks/c/systemc/pc_sfifo_3.cil.c [2022-11-18 20:53:04,158 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fa2a8d4-bb81-42c0-8b16-81e7ff79702a/bin/uautomizer-TMbwUNV5ro/data/01681649d/9ef801177c964c10b3a3ec7ef4e62a48/FLAGa39453fd9 [2022-11-18 20:53:04,625 INFO L306 CDTParser]: Found 1 translation units. [2022-11-18 20:53:04,626 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fa2a8d4-bb81-42c0-8b16-81e7ff79702a/sv-benchmarks/c/systemc/pc_sfifo_3.cil.c [2022-11-18 20:53:04,634 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fa2a8d4-bb81-42c0-8b16-81e7ff79702a/bin/uautomizer-TMbwUNV5ro/data/01681649d/9ef801177c964c10b3a3ec7ef4e62a48/FLAGa39453fd9 [2022-11-18 20:53:05,011 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fa2a8d4-bb81-42c0-8b16-81e7ff79702a/bin/uautomizer-TMbwUNV5ro/data/01681649d/9ef801177c964c10b3a3ec7ef4e62a48 [2022-11-18 20:53:05,013 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-18 20:53:05,015 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-18 20:53:05,016 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-18 20:53:05,018 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-18 20:53:05,022 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-18 20:53:05,023 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:53:05" (1/1) ... [2022-11-18 20:53:05,024 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@164bc4b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:53:05, skipping insertion in model container [2022-11-18 20:53:05,025 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:53:05" (1/1) ... [2022-11-18 20:53:05,033 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-18 20:53:05,076 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-18 20:53:05,237 WARN L234 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fa2a8d4-bb81-42c0-8b16-81e7ff79702a/sv-benchmarks/c/systemc/pc_sfifo_3.cil.c[640,653] [2022-11-18 20:53:05,290 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 20:53:05,300 INFO L203 MainTranslator]: Completed pre-run [2022-11-18 20:53:05,312 WARN L234 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fa2a8d4-bb81-42c0-8b16-81e7ff79702a/sv-benchmarks/c/systemc/pc_sfifo_3.cil.c[640,653] [2022-11-18 20:53:05,350 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 20:53:05,365 INFO L208 MainTranslator]: Completed translation [2022-11-18 20:53:05,366 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:53:05 WrapperNode [2022-11-18 20:53:05,366 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-18 20:53:05,367 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-18 20:53:05,367 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-18 20:53:05,367 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-18 20:53:05,375 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:53:05" (1/1) ... [2022-11-18 20:53:05,383 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:53:05" (1/1) ... [2022-11-18 20:53:05,408 INFO L138 Inliner]: procedures = 31, calls = 35, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 225 [2022-11-18 20:53:05,408 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-18 20:53:05,409 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-18 20:53:05,409 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-18 20:53:05,409 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-18 20:53:05,418 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:53:05" (1/1) ... [2022-11-18 20:53:05,419 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:53:05" (1/1) ... [2022-11-18 20:53:05,421 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:53:05" (1/1) ... [2022-11-18 20:53:05,422 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:53:05" (1/1) ... [2022-11-18 20:53:05,428 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:53:05" (1/1) ... [2022-11-18 20:53:05,435 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:53:05" (1/1) ... [2022-11-18 20:53:05,437 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:53:05" (1/1) ... [2022-11-18 20:53:05,438 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:53:05" (1/1) ... [2022-11-18 20:53:05,441 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-18 20:53:05,442 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-18 20:53:05,442 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-18 20:53:05,442 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-18 20:53:05,443 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:53:05" (1/1) ... [2022-11-18 20:53:05,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 20:53:05,475 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fa2a8d4-bb81-42c0-8b16-81e7ff79702a/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:53:05,509 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fa2a8d4-bb81-42c0-8b16-81e7ff79702a/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-18 20:53:05,543 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fa2a8d4-bb81-42c0-8b16-81e7ff79702a/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-18 20:53:05,571 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-18 20:53:05,572 INFO L130 BoogieDeclarations]: Found specification of procedure error [2022-11-18 20:53:05,572 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2022-11-18 20:53:05,572 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2022-11-18 20:53:05,572 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2022-11-18 20:53:05,572 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2022-11-18 20:53:05,573 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2022-11-18 20:53:05,573 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2022-11-18 20:53:05,574 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2022-11-18 20:53:05,574 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2022-11-18 20:53:05,575 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2022-11-18 20:53:05,575 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2022-11-18 20:53:05,575 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2022-11-18 20:53:05,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-18 20:53:05,576 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2022-11-18 20:53:05,576 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2022-11-18 20:53:05,576 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-18 20:53:05,576 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-18 20:53:05,576 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2022-11-18 20:53:05,577 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2022-11-18 20:53:05,675 INFO L235 CfgBuilder]: Building ICFG [2022-11-18 20:53:05,677 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-18 20:53:06,120 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##54: assume !(1 == ~q_free~0); [2022-11-18 20:53:06,120 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##53: assume 1 == ~q_free~0;~c_dr_st~0 := 2;~c_dr_pc~0 := 2;~a_t~0 := do_read_c_~a~0#1; [2022-11-18 20:53:06,140 INFO L276 CfgBuilder]: Performing block encoding [2022-11-18 20:53:06,150 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-18 20:53:06,151 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2022-11-18 20:53:06,153 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:53:06 BoogieIcfgContainer [2022-11-18 20:53:06,155 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-18 20:53:06,157 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-18 20:53:06,160 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-18 20:53:06,164 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-18 20:53:06,164 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 08:53:05" (1/3) ... [2022-11-18 20:53:06,165 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e703ba3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 08:53:06, skipping insertion in model container [2022-11-18 20:53:06,165 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:53:05" (2/3) ... [2022-11-18 20:53:06,165 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e703ba3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 08:53:06, skipping insertion in model container [2022-11-18 20:53:06,166 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:53:06" (3/3) ... [2022-11-18 20:53:06,167 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_3.cil.c [2022-11-18 20:53:06,186 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-18 20:53:06,186 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-18 20:53:06,241 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-18 20:53:06,248 INFO L357 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@71fa5c00, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-18 20:53:06,248 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-18 20:53:06,252 INFO L276 IsEmpty]: Start isEmpty. Operand has 119 states, 93 states have (on average 1.5268817204301075) internal successors, (142), 97 states have internal predecessors, (142), 16 states have call successors, (16), 8 states have call predecessors, (16), 8 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-11-18 20:53:06,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-11-18 20:53:06,264 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:53:06,265 INFO L195 NwaCegarLoop]: 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] [2022-11-18 20:53:06,265 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:53:06,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:53:06,270 INFO L85 PathProgramCache]: Analyzing trace with hash 1330697302, now seen corresponding path program 1 times [2022-11-18 20:53:06,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:53:06,277 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98944051] [2022-11-18 20:53:06,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:53:06,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:53:06,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:53:06,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 20:53:06,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:53:06,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-18 20:53:06,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:53:06,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-18 20:53:06,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:53:06,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:53:06,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:53:06,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-18 20:53:06,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:53:06,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-18 20:53:06,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:53:06,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-11-18 20:53:06,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:53:06,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:53:06,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:53:06,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98944051] [2022-11-18 20:53:06,896 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98944051] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:53:06,896 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:53:06,896 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-18 20:53:06,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519927911] [2022-11-18 20:53:06,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:53:06,903 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-18 20:53:06,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:53:06,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-18 20:53:06,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-18 20:53:06,933 INFO L87 Difference]: Start difference. First operand has 119 states, 93 states have (on average 1.5268817204301075) internal successors, (142), 97 states have internal predecessors, (142), 16 states have call successors, (16), 8 states have call predecessors, (16), 8 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) 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) [2022-11-18 20:53:07,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:53:07,814 INFO L93 Difference]: Finished difference Result 382 states and 574 transitions. [2022-11-18 20:53:07,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-18 20:53:07,817 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 [2022-11-18 20:53:07,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:53:07,828 INFO L225 Difference]: With dead ends: 382 [2022-11-18 20:53:07,829 INFO L226 Difference]: Without dead ends: 264 [2022-11-18 20:53:07,833 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2022-11-18 20:53:07,836 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 379 mSDsluCounter, 431 mSDsCounter, 0 mSdLazyCounter, 592 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 386 SdHoareTripleChecker+Valid, 544 SdHoareTripleChecker+Invalid, 673 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 592 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-18 20:53:07,837 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [386 Valid, 544 Invalid, 673 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 592 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-18 20:53:07,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2022-11-18 20:53:07,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 225. [2022-11-18 20:53:07,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 179 states have (on average 1.4245810055865922) internal successors, (255), 183 states have internal predecessors, (255), 29 states have call successors, (29), 15 states have call predecessors, (29), 16 states have return successors, (32), 28 states have call predecessors, (32), 27 states have call successors, (32) [2022-11-18 20:53:07,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 316 transitions. [2022-11-18 20:53:07,914 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 316 transitions. Word has length 64 [2022-11-18 20:53:07,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:53:07,915 INFO L495 AbstractCegarLoop]: Abstraction has 225 states and 316 transitions. [2022-11-18 20:53:07,915 INFO L496 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) [2022-11-18 20:53:07,916 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 316 transitions. [2022-11-18 20:53:07,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-11-18 20:53:07,919 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:53:07,919 INFO L195 NwaCegarLoop]: 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] [2022-11-18 20:53:07,920 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-18 20:53:07,920 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:53:07,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:53:07,921 INFO L85 PathProgramCache]: Analyzing trace with hash -1285381354, now seen corresponding path program 1 times [2022-11-18 20:53:07,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:53:07,922 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103680179] [2022-11-18 20:53:07,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:53:07,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:53:07,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:53:08,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 20:53:08,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:53:08,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-18 20:53:08,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:53:08,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-18 20:53:08,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:53:08,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:53:08,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:53:08,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-18 20:53:08,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:53:08,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-18 20:53:08,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:53:08,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-11-18 20:53:08,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:53:08,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:53:08,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:53:08,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103680179] [2022-11-18 20:53:08,258 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103680179] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:53:08,258 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:53:08,258 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-18 20:53:08,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360841857] [2022-11-18 20:53:08,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:53:08,260 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-18 20:53:08,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:53:08,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-18 20:53:08,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-18 20:53:08,261 INFO L87 Difference]: Start difference. First operand 225 states and 316 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) [2022-11-18 20:53:09,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:53:09,201 INFO L93 Difference]: Finished difference Result 622 states and 882 transitions. [2022-11-18 20:53:09,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-18 20:53:09,202 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 [2022-11-18 20:53:09,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:53:09,206 INFO L225 Difference]: With dead ends: 622 [2022-11-18 20:53:09,206 INFO L226 Difference]: Without dead ends: 413 [2022-11-18 20:53:09,207 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2022-11-18 20:53:09,209 INFO L413 NwaCegarLoop]: 182 mSDtfsCounter, 457 mSDsluCounter, 568 mSDsCounter, 0 mSdLazyCounter, 778 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 466 SdHoareTripleChecker+Valid, 750 SdHoareTripleChecker+Invalid, 880 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 778 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-18 20:53:09,209 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [466 Valid, 750 Invalid, 880 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 778 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-18 20:53:09,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2022-11-18 20:53:09,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 337. [2022-11-18 20:53:09,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 269 states have (on average 1.41635687732342) internal successors, (381), 275 states have internal predecessors, (381), 42 states have call successors, (42), 22 states have call predecessors, (42), 25 states have return successors, (53), 42 states have call predecessors, (53), 40 states have call successors, (53) [2022-11-18 20:53:09,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 476 transitions. [2022-11-18 20:53:09,282 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 476 transitions. Word has length 64 [2022-11-18 20:53:09,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:53:09,284 INFO L495 AbstractCegarLoop]: Abstraction has 337 states and 476 transitions. [2022-11-18 20:53:09,284 INFO L496 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) [2022-11-18 20:53:09,284 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 476 transitions. [2022-11-18 20:53:09,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-11-18 20:53:09,291 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:53:09,292 INFO L195 NwaCegarLoop]: 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] [2022-11-18 20:53:09,292 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-18 20:53:09,292 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:53:09,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:53:09,293 INFO L85 PathProgramCache]: Analyzing trace with hash 980999832, now seen corresponding path program 1 times [2022-11-18 20:53:09,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:53:09,293 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174247551] [2022-11-18 20:53:09,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:53:09,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:53:09,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:53:09,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 20:53:09,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:53:09,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-18 20:53:09,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:53:09,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-18 20:53:09,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:53:09,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:53:09,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:53:09,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-18 20:53:09,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:53:09,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-18 20:53:09,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:53:09,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-11-18 20:53:09,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:53:09,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:53:09,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:53:09,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174247551] [2022-11-18 20:53:09,588 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174247551] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:53:09,588 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:53:09,588 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-18 20:53:09,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139388853] [2022-11-18 20:53:09,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:53:09,589 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-18 20:53:09,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:53:09,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-18 20:53:09,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-11-18 20:53:09,592 INFO L87 Difference]: Start difference. First operand 337 states and 476 transitions. Second operand has 10 states, 10 states have (on average 4.9) internal successors, (49), 7 states have internal predecessors, (49), 5 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) [2022-11-18 20:53:11,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:53:11,401 INFO L93 Difference]: Finished difference Result 1883 states and 2674 transitions. [2022-11-18 20:53:11,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-11-18 20:53:11,402 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.9) internal successors, (49), 7 states have internal predecessors, (49), 5 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) Word has length 64 [2022-11-18 20:53:11,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:53:11,410 INFO L225 Difference]: With dead ends: 1883 [2022-11-18 20:53:11,410 INFO L226 Difference]: Without dead ends: 1550 [2022-11-18 20:53:11,413 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 337 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=257, Invalid=1075, Unknown=0, NotChecked=0, Total=1332 [2022-11-18 20:53:11,414 INFO L413 NwaCegarLoop]: 217 mSDtfsCounter, 1663 mSDsluCounter, 832 mSDsCounter, 0 mSdLazyCounter, 1463 mSolverCounterSat, 445 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1681 SdHoareTripleChecker+Valid, 1049 SdHoareTripleChecker+Invalid, 1908 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 445 IncrementalHoareTripleChecker+Valid, 1463 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-18 20:53:11,415 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1681 Valid, 1049 Invalid, 1908 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [445 Valid, 1463 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-11-18 20:53:11,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1550 states. [2022-11-18 20:53:11,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1550 to 1390. [2022-11-18 20:53:11,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1390 states, 1117 states have (on average 1.3652641002685766) internal successors, (1525), 1138 states have internal predecessors, (1525), 152 states have call successors, (152), 105 states have call predecessors, (152), 120 states have return successors, (186), 148 states have call predecessors, (186), 150 states have call successors, (186) [2022-11-18 20:53:11,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1390 states to 1390 states and 1863 transitions. [2022-11-18 20:53:11,578 INFO L78 Accepts]: Start accepts. Automaton has 1390 states and 1863 transitions. Word has length 64 [2022-11-18 20:53:11,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:53:11,578 INFO L495 AbstractCegarLoop]: Abstraction has 1390 states and 1863 transitions. [2022-11-18 20:53:11,578 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.9) internal successors, (49), 7 states have internal predecessors, (49), 5 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) [2022-11-18 20:53:11,578 INFO L276 IsEmpty]: Start isEmpty. Operand 1390 states and 1863 transitions. [2022-11-18 20:53:11,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-11-18 20:53:11,583 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:53:11,583 INFO L195 NwaCegarLoop]: 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] [2022-11-18 20:53:11,583 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-18 20:53:11,584 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:53:11,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:53:11,584 INFO L85 PathProgramCache]: Analyzing trace with hash 779831852, now seen corresponding path program 1 times [2022-11-18 20:53:11,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:53:11,586 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104405327] [2022-11-18 20:53:11,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:53:11,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:53:11,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:53:11,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 20:53:11,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:53:11,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-18 20:53:11,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:53:11,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-18 20:53:11,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:53:11,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:53:11,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:53:11,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-18 20:53:11,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:53:11,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-11-18 20:53:11,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:53:11,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-18 20:53:11,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:53:11,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:53:11,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:53:11,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104405327] [2022-11-18 20:53:11,782 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104405327] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:53:11,797 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:53:11,797 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-18 20:53:11,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457684526] [2022-11-18 20:53:11,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:53:11,798 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-18 20:53:11,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:53:11,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-18 20:53:11,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-11-18 20:53:11,800 INFO L87 Difference]: Start difference. First operand 1390 states and 1863 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 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) [2022-11-18 20:53:12,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:53:12,393 INFO L93 Difference]: Finished difference Result 2918 states and 3942 transitions. [2022-11-18 20:53:12,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-18 20:53:12,394 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 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 65 [2022-11-18 20:53:12,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:53:12,401 INFO L225 Difference]: With dead ends: 2918 [2022-11-18 20:53:12,401 INFO L226 Difference]: Without dead ends: 1538 [2022-11-18 20:53:12,404 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-11-18 20:53:12,406 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 137 mSDsluCounter, 519 mSDsCounter, 0 mSdLazyCounter, 524 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 619 SdHoareTripleChecker+Invalid, 564 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 524 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-18 20:53:12,406 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 619 Invalid, 564 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 524 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-18 20:53:12,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1538 states. [2022-11-18 20:53:12,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1538 to 1430. [2022-11-18 20:53:12,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1430 states, 1149 states have (on average 1.349869451697128) internal successors, (1551), 1170 states have internal predecessors, (1551), 152 states have call successors, (152), 105 states have call predecessors, (152), 128 states have return successors, (194), 156 states have call predecessors, (194), 150 states have call successors, (194) [2022-11-18 20:53:12,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1430 states to 1430 states and 1897 transitions. [2022-11-18 20:53:12,558 INFO L78 Accepts]: Start accepts. Automaton has 1430 states and 1897 transitions. Word has length 65 [2022-11-18 20:53:12,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:53:12,559 INFO L495 AbstractCegarLoop]: Abstraction has 1430 states and 1897 transitions. [2022-11-18 20:53:12,559 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 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) [2022-11-18 20:53:12,559 INFO L276 IsEmpty]: Start isEmpty. Operand 1430 states and 1897 transitions. [2022-11-18 20:53:12,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-11-18 20:53:12,560 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:53:12,561 INFO L195 NwaCegarLoop]: 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] [2022-11-18 20:53:12,561 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-18 20:53:12,561 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:53:12,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:53:12,562 INFO L85 PathProgramCache]: Analyzing trace with hash -249527446, now seen corresponding path program 1 times [2022-11-18 20:53:12,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:53:12,562 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334175282] [2022-11-18 20:53:12,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:53:12,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:53:12,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:53:12,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 20:53:12,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:53:12,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-18 20:53:12,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:53:12,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-18 20:53:12,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:53:12,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:53:12,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:53:12,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-18 20:53:12,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:53:12,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-11-18 20:53:12,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:53:12,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-18 20:53:12,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:53:12,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:53:12,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:53:12,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334175282] [2022-11-18 20:53:12,716 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334175282] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:53:12,716 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:53:12,716 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-18 20:53:12,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446987871] [2022-11-18 20:53:12,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:53:12,717 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-18 20:53:12,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:53:12,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-18 20:53:12,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-11-18 20:53:12,718 INFO L87 Difference]: Start difference. First operand 1430 states and 1897 transitions. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 7 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-11-18 20:53:14,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:53:14,603 INFO L93 Difference]: Finished difference Result 5002 states and 6771 transitions. [2022-11-18 20:53:14,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-11-18 20:53:14,604 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 7 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 65 [2022-11-18 20:53:14,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:53:14,612 INFO L225 Difference]: With dead ends: 5002 [2022-11-18 20:53:14,612 INFO L226 Difference]: Without dead ends: 1821 [2022-11-18 20:53:14,619 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 340 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=257, Invalid=1075, Unknown=0, NotChecked=0, Total=1332 [2022-11-18 20:53:14,620 INFO L413 NwaCegarLoop]: 217 mSDtfsCounter, 1565 mSDsluCounter, 1014 mSDsCounter, 0 mSdLazyCounter, 1490 mSolverCounterSat, 398 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1583 SdHoareTripleChecker+Valid, 1231 SdHoareTripleChecker+Invalid, 1888 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 398 IncrementalHoareTripleChecker+Valid, 1490 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-11-18 20:53:14,620 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1583 Valid, 1231 Invalid, 1888 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [398 Valid, 1490 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-11-18 20:53:14,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1821 states. [2022-11-18 20:53:14,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1821 to 1641. [2022-11-18 20:53:14,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1641 states, 1288 states have (on average 1.3020186335403727) internal successors, (1677), 1311 states have internal predecessors, (1677), 192 states have call successors, (192), 133 states have call predecessors, (192), 160 states have return successors, (240), 198 states have call predecessors, (240), 190 states have call successors, (240) [2022-11-18 20:53:14,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1641 states to 1641 states and 2109 transitions. [2022-11-18 20:53:14,770 INFO L78 Accepts]: Start accepts. Automaton has 1641 states and 2109 transitions. Word has length 65 [2022-11-18 20:53:14,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:53:14,771 INFO L495 AbstractCegarLoop]: Abstraction has 1641 states and 2109 transitions. [2022-11-18 20:53:14,771 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 7 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-11-18 20:53:14,771 INFO L276 IsEmpty]: Start isEmpty. Operand 1641 states and 2109 transitions. [2022-11-18 20:53:14,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-11-18 20:53:14,773 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:53:14,773 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-18 20:53:14,774 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-18 20:53:14,774 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:53:14,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:53:14,774 INFO L85 PathProgramCache]: Analyzing trace with hash -31264562, now seen corresponding path program 1 times [2022-11-18 20:53:14,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:53:14,775 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485554199] [2022-11-18 20:53:14,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:53:14,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:53:14,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:53:14,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 20:53:14,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:53:14,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-18 20:53:14,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:53:14,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-18 20:53:14,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:53:14,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:53:14,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:53:14,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-18 20:53:14,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:53:14,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-11-18 20:53:14,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:53:14,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-11-18 20:53:14,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:53:14,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-18 20:53:14,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:53:14,929 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-18 20:53:14,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:53:14,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485554199] [2022-11-18 20:53:14,929 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485554199] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:53:14,930 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:53:14,930 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-18 20:53:14,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005315282] [2022-11-18 20:53:14,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:53:14,931 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-18 20:53:14,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:53:14,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-18 20:53:14,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-11-18 20:53:14,932 INFO L87 Difference]: Start difference. First operand 1641 states and 2109 transitions. Second operand has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 5 states have internal predecessors, (61), 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) [2022-11-18 20:53:15,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:53:15,558 INFO L93 Difference]: Finished difference Result 3466 states and 4511 transitions. [2022-11-18 20:53:15,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-18 20:53:15,559 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 5 states have internal predecessors, (61), 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 90 [2022-11-18 20:53:15,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:53:15,568 INFO L225 Difference]: With dead ends: 3466 [2022-11-18 20:53:15,568 INFO L226 Difference]: Without dead ends: 1835 [2022-11-18 20:53:15,573 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2022-11-18 20:53:15,574 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 192 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 463 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 512 SdHoareTripleChecker+Invalid, 523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 463 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-18 20:53:15,574 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 512 Invalid, 523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 463 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-18 20:53:15,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1835 states. [2022-11-18 20:53:15,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1835 to 1701. [2022-11-18 20:53:15,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1701 states, 1336 states have (on average 1.2866766467065869) internal successors, (1719), 1359 states have internal predecessors, (1719), 192 states have call successors, (192), 133 states have call predecessors, (192), 172 states have return successors, (252), 210 states have call predecessors, (252), 190 states have call successors, (252) [2022-11-18 20:53:15,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1701 states to 1701 states and 2163 transitions. [2022-11-18 20:53:15,711 INFO L78 Accepts]: Start accepts. Automaton has 1701 states and 2163 transitions. Word has length 90 [2022-11-18 20:53:15,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:53:15,712 INFO L495 AbstractCegarLoop]: Abstraction has 1701 states and 2163 transitions. [2022-11-18 20:53:15,712 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 5 states have internal predecessors, (61), 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) [2022-11-18 20:53:15,712 INFO L276 IsEmpty]: Start isEmpty. Operand 1701 states and 2163 transitions. [2022-11-18 20:53:15,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-11-18 20:53:15,714 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:53:15,714 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-18 20:53:15,715 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-18 20:53:15,715 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:53:15,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:53:15,715 INFO L85 PathProgramCache]: Analyzing trace with hash 412636112, now seen corresponding path program 1 times [2022-11-18 20:53:15,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:53:15,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95792994] [2022-11-18 20:53:15,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:53:15,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:53:15,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:53:15,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 20:53:15,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:53:15,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-18 20:53:15,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:53:15,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-18 20:53:15,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:53:15,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:53:15,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:53:15,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-18 20:53:15,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:53:15,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-11-18 20:53:15,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:53:15,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-11-18 20:53:15,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:53:15,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-18 20:53:15,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:53:15,894 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-18 20:53:15,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:53:15,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95792994] [2022-11-18 20:53:15,894 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95792994] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:53:15,894 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:53:15,895 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-18 20:53:15,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264224008] [2022-11-18 20:53:15,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:53:15,895 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-18 20:53:15,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:53:15,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-18 20:53:15,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-18 20:53:15,896 INFO L87 Difference]: Start difference. First operand 1701 states and 2163 transitions. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 6 states have internal predecessors, (61), 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) [2022-11-18 20:53:16,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:53:16,733 INFO L93 Difference]: Finished difference Result 3228 states and 4127 transitions. [2022-11-18 20:53:16,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-18 20:53:16,733 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 6 states have internal predecessors, (61), 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 90 [2022-11-18 20:53:16,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:53:16,742 INFO L225 Difference]: With dead ends: 3228 [2022-11-18 20:53:16,742 INFO L226 Difference]: Without dead ends: 1775 [2022-11-18 20:53:16,746 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=277, Unknown=0, NotChecked=0, Total=380 [2022-11-18 20:53:16,747 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 370 mSDsluCounter, 453 mSDsCounter, 0 mSdLazyCounter, 690 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 378 SdHoareTripleChecker+Valid, 570 SdHoareTripleChecker+Invalid, 784 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 690 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-18 20:53:16,748 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [378 Valid, 570 Invalid, 784 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 690 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-18 20:53:16,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1775 states. [2022-11-18 20:53:16,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1775 to 1480. [2022-11-18 20:53:16,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1480 states, 1168 states have (on average 1.2851027397260273) internal successors, (1501), 1186 states have internal predecessors, (1501), 164 states have call successors, (164), 114 states have call predecessors, (164), 147 states have return successors, (212), 180 states have call predecessors, (212), 162 states have call successors, (212) [2022-11-18 20:53:16,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1480 states to 1480 states and 1877 transitions. [2022-11-18 20:53:16,863 INFO L78 Accepts]: Start accepts. Automaton has 1480 states and 1877 transitions. Word has length 90 [2022-11-18 20:53:16,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:53:16,864 INFO L495 AbstractCegarLoop]: Abstraction has 1480 states and 1877 transitions. [2022-11-18 20:53:16,864 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 6 states have internal predecessors, (61), 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) [2022-11-18 20:53:16,864 INFO L276 IsEmpty]: Start isEmpty. Operand 1480 states and 1877 transitions. [2022-11-18 20:53:16,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-11-18 20:53:16,865 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:53:16,866 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-18 20:53:16,866 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-18 20:53:16,866 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:53:16,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:53:16,867 INFO L85 PathProgramCache]: Analyzing trace with hash -1943169138, now seen corresponding path program 1 times [2022-11-18 20:53:16,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:53:16,867 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474032859] [2022-11-18 20:53:16,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:53:16,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:53:16,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:53:16,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 20:53:16,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:53:16,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-18 20:53:16,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:53:16,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-18 20:53:16,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:53:17,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:53:17,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:53:17,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-18 20:53:17,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:53:17,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-11-18 20:53:17,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:53:17,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-11-18 20:53:17,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:53:17,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-18 20:53:17,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:53:17,022 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-18 20:53:17,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:53:17,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474032859] [2022-11-18 20:53:17,023 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474032859] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:53:17,023 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:53:17,023 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-18 20:53:17,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661819684] [2022-11-18 20:53:17,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:53:17,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 20:53:17,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:53:17,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 20:53:17,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-18 20:53:17,026 INFO L87 Difference]: Start difference. First operand 1480 states and 1877 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 4 states have internal predecessors, (69), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-11-18 20:53:17,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:53:17,776 INFO L93 Difference]: Finished difference Result 4632 states and 5989 transitions. [2022-11-18 20:53:17,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-18 20:53:17,777 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 4 states have internal predecessors, (69), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 90 [2022-11-18 20:53:17,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:53:17,794 INFO L225 Difference]: With dead ends: 4632 [2022-11-18 20:53:17,794 INFO L226 Difference]: Without dead ends: 3163 [2022-11-18 20:53:17,799 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2022-11-18 20:53:17,800 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 371 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 386 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 380 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 488 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-18 20:53:17,803 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [380 Valid, 448 Invalid, 488 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 386 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-18 20:53:17,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3163 states. [2022-11-18 20:53:18,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3163 to 2949. [2022-11-18 20:53:18,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2949 states, 2317 states have (on average 1.2641346568839016) internal successors, (2929), 2364 states have internal predecessors, (2929), 325 states have call successors, (325), 227 states have call predecessors, (325), 306 states have return successors, (495), 359 states have call predecessors, (495), 323 states have call successors, (495) [2022-11-18 20:53:18,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2949 states to 2949 states and 3749 transitions. [2022-11-18 20:53:18,064 INFO L78 Accepts]: Start accepts. Automaton has 2949 states and 3749 transitions. Word has length 90 [2022-11-18 20:53:18,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:53:18,065 INFO L495 AbstractCegarLoop]: Abstraction has 2949 states and 3749 transitions. [2022-11-18 20:53:18,065 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 4 states have internal predecessors, (69), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-11-18 20:53:18,065 INFO L276 IsEmpty]: Start isEmpty. Operand 2949 states and 3749 transitions. [2022-11-18 20:53:18,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-11-18 20:53:18,067 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:53:18,067 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-18 20:53:18,068 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-18 20:53:18,068 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:53:18,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:53:18,068 INFO L85 PathProgramCache]: Analyzing trace with hash 1293960080, now seen corresponding path program 1 times [2022-11-18 20:53:18,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:53:18,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469275041] [2022-11-18 20:53:18,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:53:18,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:53:18,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:53:18,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 20:53:18,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:53:18,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-18 20:53:18,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:53:18,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-18 20:53:18,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:53:18,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:53:18,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:53:18,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-18 20:53:18,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:53:18,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-11-18 20:53:18,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:53:18,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-11-18 20:53:18,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:53:18,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-18 20:53:18,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:53:18,149 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-18 20:53:18,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:53:18,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469275041] [2022-11-18 20:53:18,150 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469275041] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:53:18,150 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:53:18,150 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-18 20:53:18,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982648367] [2022-11-18 20:53:18,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:53:18,152 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 20:53:18,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:53:18,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 20:53:18,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-18 20:53:18,153 INFO L87 Difference]: Start difference. First operand 2949 states and 3749 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 3 states have internal predecessors, (61), 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) [2022-11-18 20:53:18,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:53:18,483 INFO L93 Difference]: Finished difference Result 4533 states and 5733 transitions. [2022-11-18 20:53:18,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-18 20:53:18,484 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), 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 90 [2022-11-18 20:53:18,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:53:18,491 INFO L225 Difference]: With dead ends: 4533 [2022-11-18 20:53:18,491 INFO L226 Difference]: Without dead ends: 1595 [2022-11-18 20:53:18,497 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-11-18 20:53:18,500 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 294 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 309 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-18 20:53:18,500 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [309 Valid, 195 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-18 20:53:18,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1595 states. [2022-11-18 20:53:18,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1595 to 1480. [2022-11-18 20:53:18,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1480 states, 1168 states have (on average 1.2534246575342465) internal successors, (1464), 1186 states have internal predecessors, (1464), 164 states have call successors, (164), 114 states have call predecessors, (164), 147 states have return successors, (212), 180 states have call predecessors, (212), 162 states have call successors, (212) [2022-11-18 20:53:18,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1480 states to 1480 states and 1840 transitions. [2022-11-18 20:53:18,674 INFO L78 Accepts]: Start accepts. Automaton has 1480 states and 1840 transitions. Word has length 90 [2022-11-18 20:53:18,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:53:18,674 INFO L495 AbstractCegarLoop]: Abstraction has 1480 states and 1840 transitions. [2022-11-18 20:53:18,674 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 3 states have internal predecessors, (61), 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) [2022-11-18 20:53:18,675 INFO L276 IsEmpty]: Start isEmpty. Operand 1480 states and 1840 transitions. [2022-11-18 20:53:18,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-11-18 20:53:18,676 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:53:18,677 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-18 20:53:18,677 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-18 20:53:18,677 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:53:18,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:53:18,678 INFO L85 PathProgramCache]: Analyzing trace with hash 1668589887, now seen corresponding path program 1 times [2022-11-18 20:53:18,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:53:18,678 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439240260] [2022-11-18 20:53:18,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:53:18,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:53:18,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:53:18,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 20:53:18,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:53:18,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-18 20:53:18,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:53:18,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-18 20:53:18,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:53:18,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:53:18,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:53:18,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-18 20:53:18,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:53:18,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-11-18 20:53:18,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:53:18,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-11-18 20:53:18,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:53:18,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-18 20:53:18,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:53:18,850 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-18 20:53:18,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:53:18,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439240260] [2022-11-18 20:53:18,850 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439240260] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:53:18,850 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:53:18,851 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-18 20:53:18,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268661267] [2022-11-18 20:53:18,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:53:18,851 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-18 20:53:18,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:53:18,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-18 20:53:18,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-11-18 20:53:18,852 INFO L87 Difference]: Start difference. First operand 1480 states and 1840 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) [2022-11-18 20:53:20,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:53:20,189 INFO L93 Difference]: Finished difference Result 3898 states and 4923 transitions. [2022-11-18 20:53:20,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-18 20:53:20,189 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 91 [2022-11-18 20:53:20,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:53:20,200 INFO L225 Difference]: With dead ends: 3898 [2022-11-18 20:53:20,200 INFO L226 Difference]: Without dead ends: 2278 [2022-11-18 20:53:20,205 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=210, Invalid=720, Unknown=0, NotChecked=0, Total=930 [2022-11-18 20:53:20,205 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 1335 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 797 mSolverCounterSat, 441 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1353 SdHoareTripleChecker+Valid, 510 SdHoareTripleChecker+Invalid, 1238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 441 IncrementalHoareTripleChecker+Valid, 797 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-18 20:53:20,206 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1353 Valid, 510 Invalid, 1238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [441 Valid, 797 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-18 20:53:20,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2278 states. [2022-11-18 20:53:20,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2278 to 2101. [2022-11-18 20:53:20,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2101 states, 1635 states have (on average 1.2269113149847095) internal successors, (2006), 1661 states have internal predecessors, (2006), 241 states have call successors, (241), 162 states have call predecessors, (241), 224 states have return successors, (343), 278 states have call predecessors, (343), 239 states have call successors, (343) [2022-11-18 20:53:20,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2101 states to 2101 states and 2590 transitions. [2022-11-18 20:53:20,460 INFO L78 Accepts]: Start accepts. Automaton has 2101 states and 2590 transitions. Word has length 91 [2022-11-18 20:53:20,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:53:20,461 INFO L495 AbstractCegarLoop]: Abstraction has 2101 states and 2590 transitions. [2022-11-18 20:53:20,461 INFO L496 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) [2022-11-18 20:53:20,461 INFO L276 IsEmpty]: Start isEmpty. Operand 2101 states and 2590 transitions. [2022-11-18 20:53:20,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2022-11-18 20:53:20,463 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:53:20,464 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 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, 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] [2022-11-18 20:53:20,464 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-18 20:53:20,464 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:53:20,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:53:20,465 INFO L85 PathProgramCache]: Analyzing trace with hash -633049043, now seen corresponding path program 1 times [2022-11-18 20:53:20,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:53:20,465 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585249484] [2022-11-18 20:53:20,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:53:20,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:53:20,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:53:20,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 20:53:20,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:53:20,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-18 20:53:20,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:53:20,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-18 20:53:20,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:53:20,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:53:20,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:53:20,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-18 20:53:20,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:53:20,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-11-18 20:53:20,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:53:20,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-11-18 20:53:20,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:53:20,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-18 20:53:20,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:53:20,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-11-18 20:53:20,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:53:20,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-11-18 20:53:20,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:53:20,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-11-18 20:53:20,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:53:20,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:53:20,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:53:20,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-18 20:53:20,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:53:20,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-11-18 20:53:20,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:53:20,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-11-18 20:53:20,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:53:20,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-11-18 20:53:20,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:53:20,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-11-18 20:53:20,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:53:20,669 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 23 proven. 9 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2022-11-18 20:53:20,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:53:20,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585249484] [2022-11-18 20:53:20,670 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585249484] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:53:20,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [543474599] [2022-11-18 20:53:20,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:53:20,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:53:20,671 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fa2a8d4-bb81-42c0-8b16-81e7ff79702a/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:53:20,675 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fa2a8d4-bb81-42c0-8b16-81e7ff79702a/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:53:20,681 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fa2a8d4-bb81-42c0-8b16-81e7ff79702a/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-18 20:53:20,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:53:20,819 INFO L263 TraceCheckSpWp]: Trace formula consists of 496 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-18 20:53:20,828 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:53:21,044 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-11-18 20:53:21,045 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:53:21,045 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [543474599] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:53:21,045 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-18 20:53:21,046 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2022-11-18 20:53:21,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504049782] [2022-11-18 20:53:21,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:53:21,047 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:53:21,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:53:21,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:53:21,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-11-18 20:53:21,048 INFO L87 Difference]: Start difference. First operand 2101 states and 2590 transitions. Second operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-11-18 20:53:21,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:53:21,346 INFO L93 Difference]: Finished difference Result 6027 states and 7419 transitions. [2022-11-18 20:53:21,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:53:21,347 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 162 [2022-11-18 20:53:21,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:53:21,366 INFO L225 Difference]: With dead ends: 6027 [2022-11-18 20:53:21,366 INFO L226 Difference]: Without dead ends: 4013 [2022-11-18 20:53:21,373 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 193 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-11-18 20:53:21,373 INFO L413 NwaCegarLoop]: 157 mSDtfsCounter, 61 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-18 20:53:21,374 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 281 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 20:53:21,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4013 states. [2022-11-18 20:53:21,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4013 to 3971. [2022-11-18 20:53:21,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3971 states, 3092 states have (on average 1.2160413971539457) internal successors, (3760), 3141 states have internal predecessors, (3760), 448 states have call successors, (448), 323 states have call predecessors, (448), 430 states have return successors, (611), 507 states have call predecessors, (611), 446 states have call successors, (611) [2022-11-18 20:53:21,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3971 states to 3971 states and 4819 transitions. [2022-11-18 20:53:21,768 INFO L78 Accepts]: Start accepts. Automaton has 3971 states and 4819 transitions. Word has length 162 [2022-11-18 20:53:21,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:53:21,769 INFO L495 AbstractCegarLoop]: Abstraction has 3971 states and 4819 transitions. [2022-11-18 20:53:21,769 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-11-18 20:53:21,770 INFO L276 IsEmpty]: Start isEmpty. Operand 3971 states and 4819 transitions. [2022-11-18 20:53:21,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2022-11-18 20:53:21,774 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:53:21,774 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:53:21,792 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fa2a8d4-bb81-42c0-8b16-81e7ff79702a/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-18 20:53:21,980 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fa2a8d4-bb81-42c0-8b16-81e7ff79702a/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:53:21,981 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:53:21,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:53:21,982 INFO L85 PathProgramCache]: Analyzing trace with hash 1912569076, now seen corresponding path program 1 times [2022-11-18 20:53:21,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:53:21,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7962588] [2022-11-18 20:53:21,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:53:21,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:53:21,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:53:22,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 20:53:22,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:53:22,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-18 20:53:22,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:53:22,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-18 20:53:22,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:53:22,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:53:22,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:53:22,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-18 20:53:22,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:53:22,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-11-18 20:53:22,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:53:22,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-11-18 20:53:22,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:53:22,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-18 20:53:22,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:53:22,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-11-18 20:53:22,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:53:22,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-11-18 20:53:22,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:53:22,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-11-18 20:53:22,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:53:22,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:53:22,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:53:22,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-18 20:53:22,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:53:22,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-11-18 20:53:22,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:53:22,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-11-18 20:53:22,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:53:22,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-11-18 20:53:22,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:53:22,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:53:22,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:53:22,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-18 20:53:22,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:53:22,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-11-18 20:53:22,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:53:22,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2022-11-18 20:53:22,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:53:22,246 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 23 proven. 9 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2022-11-18 20:53:22,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:53:22,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7962588] [2022-11-18 20:53:22,246 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7962588] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:53:22,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1327340101] [2022-11-18 20:53:22,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:53:22,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:53:22,247 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fa2a8d4-bb81-42c0-8b16-81e7ff79702a/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:53:22,251 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fa2a8d4-bb81-42c0-8b16-81e7ff79702a/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:53:22,283 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fa2a8d4-bb81-42c0-8b16-81e7ff79702a/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-18 20:53:22,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:53:22,392 INFO L263 TraceCheckSpWp]: Trace formula consists of 568 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-18 20:53:22,397 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:53:22,644 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2022-11-18 20:53:22,645 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:53:22,645 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1327340101] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:53:22,645 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-18 20:53:22,645 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2022-11-18 20:53:22,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294412233] [2022-11-18 20:53:22,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:53:22,646 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:53:22,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:53:22,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:53:22,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-11-18 20:53:22,647 INFO L87 Difference]: Start difference. First operand 3971 states and 4819 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-11-18 20:53:23,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:53:23,308 INFO L93 Difference]: Finished difference Result 11891 states and 14427 transitions. [2022-11-18 20:53:23,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:53:23,352 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 194 [2022-11-18 20:53:23,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:53:23,386 INFO L225 Difference]: With dead ends: 11891 [2022-11-18 20:53:23,386 INFO L226 Difference]: Without dead ends: 7931 [2022-11-18 20:53:23,395 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 231 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-11-18 20:53:23,396 INFO L413 NwaCegarLoop]: 154 mSDtfsCounter, 52 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-18 20:53:23,397 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 281 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 20:53:23,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7931 states. [2022-11-18 20:53:24,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7931 to 7921. [2022-11-18 20:53:24,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7921 states, 6170 states have (on average 1.2092382495948135) internal successors, (7461), 6266 states have internal predecessors, (7461), 890 states have call successors, (890), 645 states have call predecessors, (890), 860 states have return successors, (1218), 1010 states have call predecessors, (1218), 888 states have call successors, (1218) [2022-11-18 20:53:24,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7921 states to 7921 states and 9569 transitions. [2022-11-18 20:53:24,107 INFO L78 Accepts]: Start accepts. Automaton has 7921 states and 9569 transitions. Word has length 194 [2022-11-18 20:53:24,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:53:24,107 INFO L495 AbstractCegarLoop]: Abstraction has 7921 states and 9569 transitions. [2022-11-18 20:53:24,109 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-11-18 20:53:24,109 INFO L276 IsEmpty]: Start isEmpty. Operand 7921 states and 9569 transitions. [2022-11-18 20:53:24,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2022-11-18 20:53:24,114 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:53:24,114 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:53:24,130 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fa2a8d4-bb81-42c0-8b16-81e7ff79702a/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-18 20:53:24,320 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fa2a8d4-bb81-42c0-8b16-81e7ff79702a/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-18 20:53:24,321 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:53:24,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:53:24,321 INFO L85 PathProgramCache]: Analyzing trace with hash 1015175798, now seen corresponding path program 1 times [2022-11-18 20:53:24,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:53:24,322 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323347085] [2022-11-18 20:53:24,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:53:24,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:53:24,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:53:24,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 20:53:24,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:53:24,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-18 20:53:24,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:53:24,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-18 20:53:24,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:53:24,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:53:24,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:53:24,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-18 20:53:24,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:53:24,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-11-18 20:53:24,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:53:24,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-11-18 20:53:24,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:53:24,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-18 20:53:24,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:53:24,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-11-18 20:53:24,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:53:24,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-11-18 20:53:24,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:53:24,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-11-18 20:53:24,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:53:24,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:53:24,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:53:24,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-18 20:53:24,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:53:24,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-11-18 20:53:24,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:53:24,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-11-18 20:53:24,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:53:24,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-11-18 20:53:24,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:53:24,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:53:24,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:53:24,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-18 20:53:24,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:53:24,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-11-18 20:53:24,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:53:24,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2022-11-18 20:53:24,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:53:24,591 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 23 proven. 9 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2022-11-18 20:53:24,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:53:24,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323347085] [2022-11-18 20:53:24,591 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323347085] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:53:24,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1220111964] [2022-11-18 20:53:24,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:53:24,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:53:24,592 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fa2a8d4-bb81-42c0-8b16-81e7ff79702a/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:53:24,595 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fa2a8d4-bb81-42c0-8b16-81e7ff79702a/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:53:24,619 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fa2a8d4-bb81-42c0-8b16-81e7ff79702a/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-18 20:53:24,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:53:24,724 INFO L263 TraceCheckSpWp]: Trace formula consists of 565 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-18 20:53:24,728 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:53:25,036 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2022-11-18 20:53:25,037 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:53:25,037 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1220111964] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:53:25,037 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-18 20:53:25,038 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2022-11-18 20:53:25,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378370547] [2022-11-18 20:53:25,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:53:25,041 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:53:25,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:53:25,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:53:25,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-11-18 20:53:25,042 INFO L87 Difference]: Start difference. First operand 7921 states and 9569 transitions. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2022-11-18 20:53:25,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:53:25,755 INFO L93 Difference]: Finished difference Result 14427 states and 17761 transitions. [2022-11-18 20:53:25,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:53:25,755 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 194 [2022-11-18 20:53:25,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:53:25,759 INFO L225 Difference]: With dead ends: 14427 [2022-11-18 20:53:25,759 INFO L226 Difference]: Without dead ends: 0 [2022-11-18 20:53:25,792 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 231 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-11-18 20:53:25,793 INFO L413 NwaCegarLoop]: 129 mSDtfsCounter, 25 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-18 20:53:25,794 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 129 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 20:53:25,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-18 20:53:25,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-18 20:53:25,795 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) [2022-11-18 20:53:25,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-18 20:53:25,797 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 194 [2022-11-18 20:53:25,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:53:25,797 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-18 20:53:25,797 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2022-11-18 20:53:25,798 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-18 20:53:25,798 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-18 20:53:25,801 INFO L805 garLoopResultBuilder]: Registering result SAFE for location errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-18 20:53:25,812 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fa2a8d4-bb81-42c0-8b16-81e7ff79702a/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-18 20:53:26,007 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fa2a8d4-bb81-42c0-8b16-81e7ff79702a/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-18 20:53:26,009 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-18 20:54:16,530 INFO L895 garLoopResultBuilder]: At program point L385(line 385) the Hoare annotation is: (let ((.cse0 (and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|)))) (and (or (not (<= ~c_dr_pc~0 0)) (not (= |old(~c_dr_st~0)| 0)) .cse0 (not (= 1 ~c_dr_i~0))) (or .cse0 (not (= ~c_dr_pc~0 1))))) [2022-11-18 20:54:16,531 INFO L895 garLoopResultBuilder]: At program point L387-2(lines 387 391) the Hoare annotation is: (let ((.cse2 (= ~c_dr_st~0 |old(~c_dr_st~0)|)) (.cse9 (= ~p_dw_st~0 0)) (.cse6 (not (<= ~c_dr_pc~0 0))) (.cse7 (not (= |old(~c_dr_st~0)| 0))) (.cse0 (= |old(~p_dw_st~0)| ~p_dw_st~0)) (.cse1 (< 0 (+ activate_threads_~tmp~1 1))) (.cse3 (<= activate_threads_~tmp~1 0)) (.cse4 (= ~p_dw_pc~0 1)) (.cse5 (not (= ~q_read_ev~0 2))) (.cse10 (not (= 1 ~c_dr_i~0)))) (and (or (and .cse0 .cse1 .cse2 .cse3) .cse4 (not (= ~c_dr_pc~0 1)) .cse5) (let ((.cse8 (= ~c_dr_st~0 0))) (or .cse6 .cse7 (and .cse0 .cse8 .cse2) (and .cse8 .cse2 .cse9) .cse10)) (or .cse6 (not .cse9) .cse7 (= |old(~p_dw_st~0)| 0) (not (<= 2 ~fast_clk_edge~0)) (not .cse4) .cse10) (or .cse6 .cse7 (and .cse0 .cse1 .cse3) .cse4 .cse5 .cse10))) [2022-11-18 20:54:16,531 INFO L899 garLoopResultBuilder]: For program point L385-1(line 385) no Hoare annotation was computed. [2022-11-18 20:54:16,532 INFO L895 garLoopResultBuilder]: At program point activate_threadsENTRY(lines 379 403) the Hoare annotation is: (let ((.cse0 (and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|)))) (and (or (not (<= ~c_dr_pc~0 0)) (not (= |old(~c_dr_st~0)| 0)) .cse0 (not (= 1 ~c_dr_i~0))) (or .cse0 (not (= ~c_dr_pc~0 1))))) [2022-11-18 20:54:16,532 INFO L899 garLoopResultBuilder]: For program point L395(lines 395 399) no Hoare annotation was computed. [2022-11-18 20:54:16,532 INFO L899 garLoopResultBuilder]: For program point activate_threadsEXIT(lines 379 403) no Hoare annotation was computed. [2022-11-18 20:54:16,532 INFO L899 garLoopResultBuilder]: For program point L393(line 393) no Hoare annotation was computed. [2022-11-18 20:54:16,532 INFO L899 garLoopResultBuilder]: For program point L395-2(lines 379 403) no Hoare annotation was computed. [2022-11-18 20:54:16,532 INFO L899 garLoopResultBuilder]: For program point L387(lines 387 391) no Hoare annotation was computed. [2022-11-18 20:54:16,533 INFO L899 garLoopResultBuilder]: For program point exists_runnable_threadEXIT(lines 287 306) no Hoare annotation was computed. [2022-11-18 20:54:16,533 INFO L902 garLoopResultBuilder]: At program point exists_runnable_threadENTRY(lines 287 306) the Hoare annotation is: true [2022-11-18 20:54:16,533 INFO L902 garLoopResultBuilder]: At program point L303(lines 290 305) the Hoare annotation is: true [2022-11-18 20:54:16,533 INFO L899 garLoopResultBuilder]: For program point L295(lines 295 300) no Hoare annotation was computed. [2022-11-18 20:54:16,533 INFO L899 garLoopResultBuilder]: For program point L291(lines 291 301) no Hoare annotation was computed. [2022-11-18 20:54:16,534 INFO L899 garLoopResultBuilder]: For program point exists_runnable_threadFINAL(lines 287 306) no Hoare annotation was computed. [2022-11-18 20:54:16,534 INFO L899 garLoopResultBuilder]: For program point L96(lines 96 101) no Hoare annotation was computed. [2022-11-18 20:54:16,534 INFO L899 garLoopResultBuilder]: For program point L95(lines 95 104) no Hoare annotation was computed. [2022-11-18 20:54:16,534 INFO L899 garLoopResultBuilder]: For program point L95-2(lines 94 118) no Hoare annotation was computed. [2022-11-18 20:54:16,534 INFO L902 garLoopResultBuilder]: At program point is_do_read_c_triggeredENTRY(lines 91 119) the Hoare annotation is: true [2022-11-18 20:54:16,535 INFO L895 garLoopResultBuilder]: At program point L116(lines 94 118) the Hoare annotation is: (or (not (<= ~c_dr_pc~0 0)) (not (= ~c_dr_st~0 0)) (and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1)) (not (= 1 ~c_dr_i~0))) [2022-11-18 20:54:16,535 INFO L899 garLoopResultBuilder]: For program point is_do_read_c_triggeredFINAL(lines 91 119) no Hoare annotation was computed. [2022-11-18 20:54:16,535 INFO L899 garLoopResultBuilder]: For program point L106(lines 106 111) no Hoare annotation was computed. [2022-11-18 20:54:16,535 INFO L899 garLoopResultBuilder]: For program point L105-1(lines 105 114) no Hoare annotation was computed. [2022-11-18 20:54:16,535 INFO L899 garLoopResultBuilder]: For program point is_do_read_c_triggeredEXIT(lines 91 119) no Hoare annotation was computed. [2022-11-18 20:54:16,536 INFO L895 garLoopResultBuilder]: At program point fire_delta_eventsENTRY(lines 307 324) the Hoare annotation is: (let ((.cse0 (and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0)))) (and (or .cse0 (not (= ~c_dr_pc~0 1))) (or (not (<= ~c_dr_pc~0 0)) (not (= ~c_dr_st~0 0)) .cse0 (not (= 1 ~c_dr_i~0))))) [2022-11-18 20:54:16,536 INFO L899 garLoopResultBuilder]: For program point L316-1(lines 307 324) no Hoare annotation was computed. [2022-11-18 20:54:16,536 INFO L899 garLoopResultBuilder]: For program point L311-1(lines 310 323) no Hoare annotation was computed. [2022-11-18 20:54:16,536 INFO L899 garLoopResultBuilder]: For program point fire_delta_eventsEXIT(lines 307 324) no Hoare annotation was computed. [2022-11-18 20:54:16,536 INFO L899 garLoopResultBuilder]: For program point L258-1(lines 254 268) no Hoare annotation was computed. [2022-11-18 20:54:16,537 INFO L895 garLoopResultBuilder]: At program point L49(lines 32 51) the Hoare annotation is: (let ((.cse1 (not (= ~c_dr_pc~0 1))) (.cse0 (= ~q_req_up~0 0)) (.cse3 (not (<= ~c_dr_pc~0 0))) (.cse4 (not (= ~c_dr_st~0 0))) (.cse2 (not (= |old(~q_req_up~0)| 0))) (.cse5 (not (= 1 ~c_dr_i~0)))) (and (or .cse0 .cse1) (or .cse1 .cse2) (or .cse3 .cse4 .cse0 .cse5) (or .cse3 .cse4 .cse2 .cse5))) [2022-11-18 20:54:16,537 INFO L895 garLoopResultBuilder]: At program point update_channelsENTRY(lines 254 268) the Hoare annotation is: (let ((.cse0 (and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|)))) (and (or .cse0 (not (= ~c_dr_pc~0 1))) (or (not (<= ~c_dr_pc~0 0)) .cse0 (not (= ~c_dr_st~0 0)) (not (= 1 ~c_dr_i~0))))) [2022-11-18 20:54:16,537 INFO L899 garLoopResultBuilder]: For program point update_channelsEXIT(lines 254 268) no Hoare annotation was computed. [2022-11-18 20:54:16,537 INFO L899 garLoopResultBuilder]: For program point L41-1(lines 41 45) no Hoare annotation was computed. [2022-11-18 20:54:16,537 INFO L899 garLoopResultBuilder]: For program point L36(lines 36 40) no Hoare annotation was computed. [2022-11-18 20:54:16,538 INFO L899 garLoopResultBuilder]: For program point L36-2(lines 35 50) no Hoare annotation was computed. [2022-11-18 20:54:16,538 INFO L899 garLoopResultBuilder]: For program point reset_delta_eventsEXIT(lines 325 342) no Hoare annotation was computed. [2022-11-18 20:54:16,538 INFO L899 garLoopResultBuilder]: For program point L334-1(lines 325 342) no Hoare annotation was computed. [2022-11-18 20:54:16,538 INFO L899 garLoopResultBuilder]: For program point L329-1(lines 328 341) no Hoare annotation was computed. [2022-11-18 20:54:16,538 INFO L895 garLoopResultBuilder]: At program point reset_delta_eventsENTRY(lines 325 342) the Hoare annotation is: (let ((.cse0 (and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0)))) (and (or .cse0 (not (= ~c_dr_pc~0 1))) (or (not (<= ~c_dr_pc~0 0)) (not (= ~c_dr_st~0 0)) .cse0 (not (= 1 ~c_dr_i~0))))) [2022-11-18 20:54:16,539 INFO L899 garLoopResultBuilder]: For program point L514-1(line 514) no Hoare annotation was computed. [2022-11-18 20:54:16,539 INFO L899 garLoopResultBuilder]: For program point L415(lines 415 419) no Hoare annotation was computed. [2022-11-18 20:54:16,539 INFO L899 garLoopResultBuilder]: For program point L415-1(lines 410 450) no Hoare annotation was computed. [2022-11-18 20:54:16,539 INFO L899 garLoopResultBuilder]: For program point L349(lines 349 356) no Hoare annotation was computed. [2022-11-18 20:54:16,539 INFO L895 garLoopResultBuilder]: At program point L349-2(lines 345 360) the Hoare annotation is: (or (and (= ~c_dr_st~0 0) (= 1 ~c_dr_i~0) (<= ~c_dr_pc~0 0)) (= ~c_dr_pc~0 1)) [2022-11-18 20:54:16,539 INFO L899 garLoopResultBuilder]: For program point L465(lines 465 470) no Hoare annotation was computed. [2022-11-18 20:54:16,540 INFO L899 garLoopResultBuilder]: For program point L234(lines 234 246) no Hoare annotation was computed. [2022-11-18 20:54:16,540 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-18 20:54:16,540 INFO L899 garLoopResultBuilder]: For program point L218-1(lines 218 228) no Hoare annotation was computed. [2022-11-18 20:54:16,540 INFO L899 garLoopResultBuilder]: For program point L152(lines 152 160) no Hoare annotation was computed. [2022-11-18 20:54:16,540 INFO L895 garLoopResultBuilder]: At program point L499(line 499) the Hoare annotation is: (or (and (= ~c_dr_st~0 0) (= 1 ~c_dr_i~0) (<= ~c_dr_pc~0 0)) (= ~c_dr_pc~0 1)) [2022-11-18 20:54:16,541 INFO L899 garLoopResultBuilder]: For program point L499-1(line 499) no Hoare annotation was computed. [2022-11-18 20:54:16,541 INFO L899 garLoopResultBuilder]: For program point L235(lines 235 241) no Hoare annotation was computed. [2022-11-18 20:54:16,541 INFO L899 garLoopResultBuilder]: For program point L202(lines 202 206) no Hoare annotation was computed. [2022-11-18 20:54:16,541 INFO L895 garLoopResultBuilder]: At program point L153(lines 148 192) the Hoare annotation is: (let ((.cse0 (= ~p_dw_pc~0 1))) (or (and (= ~c_dr_st~0 0) (not (= ~p_dw_st~0 0)) (= 1 ~c_dr_i~0) .cse0 (<= ~c_dr_pc~0 0)) (and (= ~c_dr_pc~0 1) .cse0))) [2022-11-18 20:54:16,541 INFO L895 garLoopResultBuilder]: At program point L203(lines 198 252) the Hoare annotation is: false [2022-11-18 20:54:16,542 INFO L895 garLoopResultBuilder]: At program point L484(line 484) the Hoare annotation is: (and (= ~c_dr_st~0 0) (= ~q_write_ev~0 ~q_read_ev~0) (= 1 ~c_dr_i~0) (= ~q_req_up~0 0) (= ~p_dw_st~0 0) (<= 2 ~slow_clk_edge~0) (= ~q_read_ev~0 2) (<= 2 ~fast_clk_edge~0) (= ~q_req_up~0 ~p_dw_pc~0) (= ~c_dr_pc~0 ~q_req_up~0)) [2022-11-18 20:54:16,542 INFO L899 garLoopResultBuilder]: For program point L484-1(line 484) no Hoare annotation was computed. [2022-11-18 20:54:16,542 INFO L895 garLoopResultBuilder]: At program point L451(lines 404 456) the Hoare annotation is: (or (and (= ~c_dr_st~0 0) (= 1 ~c_dr_i~0) (<= ~c_dr_pc~0 0)) (= ~c_dr_pc~0 1)) [2022-11-18 20:54:16,542 INFO L895 garLoopResultBuilder]: At program point L435(lines 410 450) the Hoare annotation is: (or (and (= ~c_dr_st~0 0) (= 1 ~c_dr_i~0) (<= ~c_dr_pc~0 0)) (= ~c_dr_pc~0 1)) [2022-11-18 20:54:16,542 INFO L895 garLoopResultBuilder]: At program point L171(lines 148 192) the Hoare annotation is: (or (and (= ~c_dr_st~0 0) (not (= ~p_dw_st~0 0)) (= 1 ~c_dr_i~0) (<= ~c_dr_pc~0 0)) (= ~c_dr_pc~0 1)) [2022-11-18 20:54:16,543 INFO L895 garLoopResultBuilder]: At program point L551(lines 535 553) the Hoare annotation is: (and (= ~c_dr_st~0 0) (= ~q_write_ev~0 ~q_read_ev~0) (= 1 ~c_dr_i~0) (= ~q_req_up~0 0) (= ~p_dw_st~0 0) (<= 2 ~slow_clk_edge~0) (= ~q_read_ev~0 2) (<= 2 ~fast_clk_edge~0) (= ~q_req_up~0 ~p_dw_pc~0) (= ~c_dr_pc~0 ~q_req_up~0)) [2022-11-18 20:54:16,543 INFO L895 garLoopResultBuilder]: At program point L188(lines 145 193) the Hoare annotation is: (or (and (= ~c_dr_st~0 0) (not (= ~p_dw_st~0 0)) (= 1 ~c_dr_i~0) (<= ~c_dr_pc~0 0)) (= ~c_dr_pc~0 1)) [2022-11-18 20:54:16,543 INFO L899 garLoopResultBuilder]: For program point L155(lines 155 159) no Hoare annotation was computed. [2022-11-18 20:54:16,543 INFO L895 garLoopResultBuilder]: At program point L370-1(lines 361 378) the Hoare annotation is: (or (and (= ~c_dr_st~0 0) (= 1 ~c_dr_i~0) (<= ~c_dr_pc~0 0)) (= ~c_dr_pc~0 1)) [2022-11-18 20:54:16,544 INFO L895 garLoopResultBuilder]: At program point L486(line 486) the Hoare annotation is: (let ((.cse0 (= ~c_dr_st~0 0)) (.cse1 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse2 (= 1 ~c_dr_i~0)) (.cse3 (= ~q_req_up~0 0)) (.cse4 (= ~q_read_ev~0 2)) (.cse5 (= ~q_req_up~0 ~p_dw_pc~0)) (.cse6 (= ~c_dr_pc~0 ~q_req_up~0))) (or (and .cse0 (not (= ~p_dw_st~0 0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse3 (<= 2 ~slow_clk_edge~0) .cse4 (<= 2 ~fast_clk_edge~0) .cse5 .cse6))) [2022-11-18 20:54:16,544 INFO L895 garLoopResultBuilder]: At program point L486-1(line 486) the Hoare annotation is: (let ((.cse0 (= ~c_dr_st~0 0)) (.cse1 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse2 (= 1 ~c_dr_i~0)) (.cse3 (= ~q_req_up~0 0)) (.cse4 (= ~q_read_ev~0 2)) (.cse5 (= ~q_req_up~0 ~p_dw_pc~0)) (.cse6 (= ~c_dr_pc~0 ~q_req_up~0))) (or (and .cse0 (not (= ~p_dw_st~0 0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse3 (<= 2 ~slow_clk_edge~0) .cse4 (<= 2 ~fast_clk_edge~0) .cse5 .cse6))) [2022-11-18 20:54:16,544 INFO L899 garLoopResultBuilder]: For program point L420(lines 410 450) no Hoare annotation was computed. [2022-11-18 20:54:16,544 INFO L895 garLoopResultBuilder]: At program point L503(line 503) the Hoare annotation is: (or (and (= ~c_dr_st~0 0) (= 1 ~c_dr_i~0) (<= ~c_dr_pc~0 0)) (= ~c_dr_pc~0 1)) [2022-11-18 20:54:16,544 INFO L895 garLoopResultBuilder]: At program point L503-1(line 503) the Hoare annotation is: (or (and (= ~c_dr_st~0 0) (= 1 ~c_dr_i~0) (<= ~c_dr_pc~0 0)) (= ~c_dr_pc~0 1)) [2022-11-18 20:54:16,545 INFO L895 garLoopResultBuilder]: At program point L239(line 239) the Hoare annotation is: false [2022-11-18 20:54:16,553 INFO L895 garLoopResultBuilder]: At program point L487(line 487) the Hoare annotation is: (let ((.cse0 (= ~c_dr_st~0 0)) (.cse1 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse2 (= 1 ~c_dr_i~0)) (.cse3 (= ~q_req_up~0 0)) (.cse4 (= ~q_read_ev~0 2)) (.cse5 (= ~q_req_up~0 ~p_dw_pc~0)) (.cse6 (= ~c_dr_pc~0 ~q_req_up~0))) (or (and .cse0 (not (= ~p_dw_st~0 0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse3 (<= 2 ~slow_clk_edge~0) .cse4 (<= 2 ~fast_clk_edge~0) .cse5 .cse6))) [2022-11-18 20:54:16,553 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-18 20:54:16,553 INFO L895 garLoopResultBuilder]: At program point L504(line 504) the Hoare annotation is: (or (and (= ~c_dr_st~0 0) (= 1 ~c_dr_i~0) (<= ~c_dr_pc~0 0)) (= ~c_dr_pc~0 1)) [2022-11-18 20:54:16,554 INFO L899 garLoopResultBuilder]: For program point L273(lines 273 277) no Hoare annotation was computed. [2022-11-18 20:54:16,554 INFO L899 garLoopResultBuilder]: For program point L273-2(lines 272 285) no Hoare annotation was computed. [2022-11-18 20:54:16,554 INFO L895 garLoopResultBuilder]: At program point L505(line 505) the Hoare annotation is: (or (and (= ~c_dr_st~0 0) (= 1 ~c_dr_i~0) (<= ~c_dr_pc~0 0)) (= ~c_dr_pc~0 1)) [2022-11-18 20:54:16,555 INFO L895 garLoopResultBuilder]: At program point L472(lines 461 474) the Hoare annotation is: (or (and (= ~c_dr_st~0 0) (= 1 ~c_dr_i~0) (<= ~c_dr_pc~0 0)) (= ~c_dr_pc~0 1)) [2022-11-18 20:54:16,555 INFO L899 garLoopResultBuilder]: For program point L439(lines 439 446) no Hoare annotation was computed. [2022-11-18 20:54:16,555 INFO L895 garLoopResultBuilder]: At program point L473(lines 457 475) the Hoare annotation is: (or (and (= ~c_dr_st~0 0) (= 1 ~c_dr_i~0) (<= ~c_dr_pc~0 0)) (= ~c_dr_pc~0 1)) [2022-11-18 20:54:16,555 INFO L899 garLoopResultBuilder]: For program point L523(lines 523 527) no Hoare annotation was computed. [2022-11-18 20:54:16,556 INFO L899 garLoopResultBuilder]: For program point L424(lines 424 431) no Hoare annotation was computed. [2022-11-18 20:54:16,557 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-11-18 20:54:16,557 INFO L895 garLoopResultBuilder]: At program point L491-1(lines 488 528) the Hoare annotation is: (or (and (= ~c_dr_st~0 0) (= 1 ~c_dr_i~0) (<= ~c_dr_pc~0 0)) (= ~c_dr_pc~0 1)) [2022-11-18 20:54:16,557 INFO L899 garLoopResultBuilder]: For program point L508(line 508) no Hoare annotation was computed. [2022-11-18 20:54:16,558 INFO L895 garLoopResultBuilder]: At program point L244(line 244) the Hoare annotation is: false [2022-11-18 20:54:16,558 INFO L899 garLoopResultBuilder]: For program point L211(line 211) no Hoare annotation was computed. [2022-11-18 20:54:16,558 INFO L902 garLoopResultBuilder]: At program point L244-1(lines 198 252) the Hoare annotation is: true [2022-11-18 20:54:16,558 INFO L899 garLoopResultBuilder]: For program point L492(line 492) no Hoare annotation was computed. [2022-11-18 20:54:16,559 INFO L895 garLoopResultBuilder]: At program point L278-1(lines 269 286) the Hoare annotation is: (let ((.cse0 (= ~c_dr_st~0 0)) (.cse1 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse2 (= 1 ~c_dr_i~0)) (.cse3 (= ~q_req_up~0 0)) (.cse4 (= ~q_read_ev~0 2)) (.cse5 (= ~q_req_up~0 ~p_dw_pc~0)) (.cse6 (= ~c_dr_pc~0 ~q_req_up~0))) (or (and .cse0 (not (= ~p_dw_st~0 0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse3 (<= 2 ~slow_clk_edge~0) .cse4 (<= 2 ~fast_clk_edge~0) .cse5 .cse6))) [2022-11-18 20:54:16,559 INFO L899 garLoopResultBuilder]: For program point L510(lines 510 519) no Hoare annotation was computed. [2022-11-18 20:54:16,559 INFO L899 garLoopResultBuilder]: For program point L510-2(lines 510 519) no Hoare annotation was computed. [2022-11-18 20:54:16,559 INFO L895 garLoopResultBuilder]: At program point L411(line 411) the Hoare annotation is: (or (and (= ~c_dr_st~0 0) (= 1 ~c_dr_i~0) (<= ~c_dr_pc~0 0)) (= ~c_dr_pc~0 1)) [2022-11-18 20:54:16,559 INFO L895 garLoopResultBuilder]: At program point L164-1(lines 148 192) the Hoare annotation is: (let ((.cse6 (= ~p_dw_pc~0 1))) (let ((.cse1 (= ~c_dr_st~0 0)) (.cse2 (not (= ~p_dw_st~0 0))) (.cse3 (= 1 ~c_dr_i~0)) (.cse0 (not .cse6)) (.cse4 (<= ~c_dr_pc~0 0)) (.cse5 (= ~q_req_up~0 ~p_dw_pc~0))) (or (and (= ~c_dr_pc~0 1) .cse0) (and .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse1 .cse2 .cse3 .cse0 .cse4) (and .cse6 .cse5 (= ~c_dr_pc~0 ~q_req_up~0))))) [2022-11-18 20:54:16,560 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-11-18 20:54:16,560 INFO L899 garLoopResultBuilder]: For program point L165(line 165) no Hoare annotation was computed. [2022-11-18 20:54:16,560 INFO L899 garLoopResultBuilder]: For program point L413(line 413) no Hoare annotation was computed. [2022-11-18 20:54:16,560 INFO L895 garLoopResultBuilder]: At program point L248(lines 195 253) the Hoare annotation is: (= ~c_dr_pc~0 1) [2022-11-18 20:54:16,560 INFO L899 garLoopResultBuilder]: For program point L149(lines 149 161) no Hoare annotation was computed. [2022-11-18 20:54:16,561 INFO L902 garLoopResultBuilder]: At program point L529(lines 476 534) the Hoare annotation is: true [2022-11-18 20:54:16,561 INFO L895 garLoopResultBuilder]: At program point L463(line 463) the Hoare annotation is: (or (and (= ~c_dr_st~0 0) (= 1 ~c_dr_i~0) (<= ~c_dr_pc~0 0)) (= ~c_dr_pc~0 1)) [2022-11-18 20:54:16,561 INFO L899 garLoopResultBuilder]: For program point L463-1(line 463) no Hoare annotation was computed. [2022-11-18 20:54:16,561 INFO L899 garLoopResultBuilder]: For program point L199(lines 199 207) no Hoare annotation was computed. [2022-11-18 20:54:16,561 INFO L902 garLoopResultBuilder]: At program point L563(lines 554 565) the Hoare annotation is: true [2022-11-18 20:54:16,561 INFO L899 garLoopResultBuilder]: For program point L365(lines 365 369) no Hoare annotation was computed. [2022-11-18 20:54:16,562 INFO L899 garLoopResultBuilder]: For program point L365-2(lines 364 377) no Hoare annotation was computed. [2022-11-18 20:54:16,562 INFO L895 garLoopResultBuilder]: At program point L514(line 514) the Hoare annotation is: (or (and (= ~c_dr_st~0 0) (= 1 ~c_dr_i~0) (<= ~c_dr_pc~0 0)) (= ~c_dr_pc~0 1)) [2022-11-18 20:54:16,562 INFO L899 garLoopResultBuilder]: For program point L66-2(lines 65 89) no Hoare annotation was computed. [2022-11-18 20:54:16,562 INFO L895 garLoopResultBuilder]: At program point L87(lines 65 89) the Hoare annotation is: (let ((.cse2 (not (= ~q_read_ev~0 2))) (.cse3 (not (<= ~c_dr_pc~0 0))) (.cse4 (not (= ~c_dr_st~0 0))) (.cse0 (and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))) (.cse1 (= ~p_dw_pc~0 1)) (.cse5 (not (= 1 ~c_dr_i~0)))) (and (or .cse0 .cse1 (not (= ~c_dr_pc~0 1)) .cse2) (or .cse3 .cse4 .cse0 .cse1 .cse2 .cse5) (or .cse3 (not (<= 2 ~fast_clk_edge~0)) .cse4 .cse0 (not .cse1) .cse5))) [2022-11-18 20:54:16,562 INFO L899 garLoopResultBuilder]: For program point is_do_write_p_triggeredFINAL(lines 62 90) no Hoare annotation was computed. [2022-11-18 20:54:16,563 INFO L899 garLoopResultBuilder]: For program point is_do_write_p_triggeredEXIT(lines 62 90) no Hoare annotation was computed. [2022-11-18 20:54:16,563 INFO L899 garLoopResultBuilder]: For program point L77(lines 77 82) no Hoare annotation was computed. [2022-11-18 20:54:16,563 INFO L899 garLoopResultBuilder]: For program point L76-1(lines 76 85) no Hoare annotation was computed. [2022-11-18 20:54:16,564 INFO L902 garLoopResultBuilder]: At program point is_do_write_p_triggeredENTRY(lines 62 90) the Hoare annotation is: true [2022-11-18 20:54:16,564 INFO L899 garLoopResultBuilder]: For program point L67(lines 67 72) no Hoare annotation was computed. [2022-11-18 20:54:16,564 INFO L899 garLoopResultBuilder]: For program point L66(lines 66 75) no Hoare annotation was computed. [2022-11-18 20:54:16,564 INFO L899 garLoopResultBuilder]: For program point errorEXIT(lines 15 22) no Hoare annotation was computed. [2022-11-18 20:54:16,564 INFO L899 garLoopResultBuilder]: For program point errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2022-11-18 20:54:16,565 INFO L902 garLoopResultBuilder]: At program point errorENTRY(lines 15 22) the Hoare annotation is: true [2022-11-18 20:54:16,565 INFO L899 garLoopResultBuilder]: For program point errorFINAL(lines 15 22) no Hoare annotation was computed. [2022-11-18 20:54:16,568 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:54:16,571 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-18 20:54:16,609 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 08:54:16 BoogieIcfgContainer [2022-11-18 20:54:16,620 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-18 20:54:16,621 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-18 20:54:16,624 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-18 20:54:16,625 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-18 20:54:16,625 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:53:06" (3/4) ... [2022-11-18 20:54:16,628 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-18 20:54:16,635 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure activate_threads [2022-11-18 20:54:16,635 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure exists_runnable_thread [2022-11-18 20:54:16,635 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure is_do_read_c_triggered [2022-11-18 20:54:16,635 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure fire_delta_events [2022-11-18 20:54:16,635 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure update_channels [2022-11-18 20:54:16,636 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure reset_delta_events [2022-11-18 20:54:16,636 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure is_do_write_p_triggered [2022-11-18 20:54:16,636 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure error [2022-11-18 20:54:16,654 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2022-11-18 20:54:16,655 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-11-18 20:54:16,655 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-11-18 20:54:16,656 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-18 20:54:16,685 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((q_req_up == 0 || !(c_dr_pc == 1)) && (!(c_dr_pc == 1) || !(\old(q_req_up) == 0))) && (((!(c_dr_pc <= 0) || !(c_dr_st == 0)) || q_req_up == 0) || !(1 == c_dr_i))) && (((!(c_dr_pc <= 0) || !(c_dr_st == 0)) || !(\old(q_req_up) == 0)) || !(1 == c_dr_i)) [2022-11-18 20:54:16,743 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fa2a8d4-bb81-42c0-8b16-81e7ff79702a/bin/uautomizer-TMbwUNV5ro/witness.graphml [2022-11-18 20:54:16,744 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-18 20:54:16,744 INFO L158 Benchmark]: Toolchain (without parser) took 71729.95ms. Allocated memory was 98.6MB in the beginning and 1.5GB in the end (delta: 1.4GB). Free memory was 61.5MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 230.6MB. Max. memory is 16.1GB. [2022-11-18 20:54:16,745 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 98.6MB. Free memory is still 78.6MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-18 20:54:16,746 INFO L158 Benchmark]: CACSL2BoogieTranslator took 350.39ms. Allocated memory was 98.6MB in the beginning and 127.9MB in the end (delta: 29.4MB). Free memory was 61.3MB in the beginning and 99.4MB in the end (delta: -38.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-11-18 20:54:16,747 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.45ms. Allocated memory is still 127.9MB. Free memory was 99.4MB in the beginning and 97.3MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-18 20:54:16,747 INFO L158 Benchmark]: Boogie Preprocessor took 32.02ms. Allocated memory is still 127.9MB. Free memory was 97.3MB in the beginning and 95.2MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-18 20:54:16,747 INFO L158 Benchmark]: RCFGBuilder took 713.25ms. Allocated memory is still 127.9MB. Free memory was 95.2MB in the beginning and 76.9MB in the end (delta: 18.4MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-11-18 20:54:16,748 INFO L158 Benchmark]: TraceAbstraction took 70463.54ms. Allocated memory was 127.9MB in the beginning and 1.5GB in the end (delta: 1.4GB). Free memory was 75.9MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 927.5MB. Max. memory is 16.1GB. [2022-11-18 20:54:16,749 INFO L158 Benchmark]: Witness Printer took 122.97ms. Allocated memory is still 1.5GB. Free memory was 1.3GB in the beginning and 1.3GB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-11-18 20:54:16,757 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.28ms. Allocated memory is still 98.6MB. Free memory is still 78.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 350.39ms. Allocated memory was 98.6MB in the beginning and 127.9MB in the end (delta: 29.4MB). Free memory was 61.3MB in the beginning and 99.4MB in the end (delta: -38.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.45ms. Allocated memory is still 127.9MB. Free memory was 99.4MB in the beginning and 97.3MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 32.02ms. Allocated memory is still 127.9MB. Free memory was 97.3MB in the beginning and 95.2MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 713.25ms. Allocated memory is still 127.9MB. Free memory was 95.2MB in the beginning and 76.9MB in the end (delta: 18.4MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 70463.54ms. Allocated memory was 127.9MB in the beginning and 1.5GB in the end (delta: 1.4GB). Free memory was 75.9MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 927.5MB. Max. memory is 16.1GB. * Witness Printer took 122.97ms. Allocated memory is still 1.5GB. Free memory was 1.3GB in the beginning and 1.3GB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. 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: 19]: 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, 119 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 70.3s, OverallIterations: 13, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 12.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 50.5s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 7006 SdHoareTripleChecker+Valid, 6.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6901 mSDsluCounter, 7119 SdHoareTripleChecker+Invalid, 5.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5299 mSDsCounter, 1831 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7333 IncrementalHoareTripleChecker+Invalid, 9164 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1831 mSolverCounterUnsat, 1820 mSDtfsCounter, 7333 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1096 GetRequests, 870 SyntacticMatches, 0 SemanticMatches, 226 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1170 ImplicationChecksByTransitivity, 2.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=7921occurred in iteration=12, InterpolantAutomatonStates: 186, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.6s AutomataMinimizationTime, 13 MinimizatonAttempts, 1550 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 46 LocationsWithAnnotation, 7671 PreInvPairs, 10405 NumberOfFragments, 1065 HoareAnnotationTreeSize, 7671 FomulaSimplifications, 10320 FormulaSimplificationTreeSizeReduction, 32.8s HoareSimplificationTime, 46 FomulaSimplificationsInter, 785301 FormulaSimplificationTreeSizeReductionInter, 17.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 1873 NumberOfCodeBlocks, 1873 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 1857 ConstructedInterpolants, 0 QuantifiedInterpolants, 3640 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1629 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 16 InterpolantComputations, 13 PerfectInterpolantSequences, 862/889 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: 461]: Loop Invariant Derived loop invariant: ((c_dr_st == 0 && 1 == c_dr_i) && c_dr_pc <= 0) || c_dr_pc == 1 - InvariantResult [Line: 476]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 457]: Loop Invariant Derived loop invariant: ((c_dr_st == 0 && 1 == c_dr_i) && c_dr_pc <= 0) || c_dr_pc == 1 - InvariantResult [Line: 290]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 65]: Loop Invariant Derived loop invariant: (((((__retres1 <= 0 && 0 <= __retres1) || p_dw_pc == 1) || !(c_dr_pc == 1)) || !(q_read_ev == 2)) && (((((!(c_dr_pc <= 0) || !(c_dr_st == 0)) || (__retres1 <= 0 && 0 <= __retres1)) || p_dw_pc == 1) || !(q_read_ev == 2)) || !(1 == c_dr_i))) && (((((!(c_dr_pc <= 0) || !(2 <= fast_clk_edge)) || !(c_dr_st == 0)) || (__retres1 <= 0 && 0 <= __retres1)) || !(p_dw_pc == 1)) || !(1 == c_dr_i)) - InvariantResult [Line: 148]: Loop Invariant Derived loop invariant: ((((c_dr_st == 0 && !(p_dw_st == 0)) && 1 == c_dr_i) && p_dw_pc == 1) && c_dr_pc <= 0) || (c_dr_pc == 1 && p_dw_pc == 1) - InvariantResult [Line: 361]: Loop Invariant Derived loop invariant: ((c_dr_st == 0 && 1 == c_dr_i) && c_dr_pc <= 0) || c_dr_pc == 1 - InvariantResult [Line: 148]: Loop Invariant Derived loop invariant: (((c_dr_st == 0 && !(p_dw_st == 0)) && 1 == c_dr_i) && c_dr_pc <= 0) || c_dr_pc == 1 - InvariantResult [Line: 488]: Loop Invariant Derived loop invariant: ((c_dr_st == 0 && 1 == c_dr_i) && c_dr_pc <= 0) || c_dr_pc == 1 - InvariantResult [Line: 94]: Loop Invariant Derived loop invariant: ((!(c_dr_pc <= 0) || !(c_dr_st == 0)) || (__retres1 <= 0 && 0 <= __retres1)) || !(1 == c_dr_i) - InvariantResult [Line: 198]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 198]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 410]: Loop Invariant Derived loop invariant: ((c_dr_st == 0 && 1 == c_dr_i) && c_dr_pc <= 0) || c_dr_pc == 1 - InvariantResult [Line: 148]: Loop Invariant Derived loop invariant: (((c_dr_pc == 1 && !(p_dw_pc == 1)) || ((((c_dr_st == 0 && !(p_dw_st == 0)) && 1 == c_dr_i) && c_dr_pc <= 0) && q_req_up == p_dw_pc)) || ((((c_dr_st == 0 && !(p_dw_st == 0)) && 1 == c_dr_i) && !(p_dw_pc == 1)) && c_dr_pc <= 0)) || ((p_dw_pc == 1 && q_req_up == p_dw_pc) && c_dr_pc == q_req_up) - InvariantResult [Line: 269]: Loop Invariant Derived loop invariant: (((((((c_dr_st == 0 && !(p_dw_st == 0)) && q_write_ev == q_read_ev) && 1 == c_dr_i) && q_req_up == 0) && q_read_ev == 2) && q_req_up == p_dw_pc) && c_dr_pc == q_req_up) || ((((((((c_dr_st == 0 && q_write_ev == q_read_ev) && 1 == c_dr_i) && q_req_up == 0) && 2 <= slow_clk_edge) && q_read_ev == 2) && 2 <= fast_clk_edge) && q_req_up == p_dw_pc) && c_dr_pc == q_req_up) - InvariantResult [Line: 32]: Loop Invariant Derived loop invariant: (((q_req_up == 0 || !(c_dr_pc == 1)) && (!(c_dr_pc == 1) || !(\old(q_req_up) == 0))) && (((!(c_dr_pc <= 0) || !(c_dr_st == 0)) || q_req_up == 0) || !(1 == c_dr_i))) && (((!(c_dr_pc <= 0) || !(c_dr_st == 0)) || !(\old(q_req_up) == 0)) || !(1 == c_dr_i)) - InvariantResult [Line: 554]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 535]: Loop Invariant Derived loop invariant: ((((((((c_dr_st == 0 && q_write_ev == q_read_ev) && 1 == c_dr_i) && q_req_up == 0) && p_dw_st == 0) && 2 <= slow_clk_edge) && q_read_ev == 2) && 2 <= fast_clk_edge) && q_req_up == p_dw_pc) && c_dr_pc == q_req_up - InvariantResult [Line: 195]: Loop Invariant Derived loop invariant: c_dr_pc == 1 - InvariantResult [Line: 345]: Loop Invariant Derived loop invariant: ((c_dr_st == 0 && 1 == c_dr_i) && c_dr_pc <= 0) || c_dr_pc == 1 - InvariantResult [Line: 404]: Loop Invariant Derived loop invariant: ((c_dr_st == 0 && 1 == c_dr_i) && c_dr_pc <= 0) || c_dr_pc == 1 - InvariantResult [Line: 145]: Loop Invariant Derived loop invariant: (((c_dr_st == 0 && !(p_dw_st == 0)) && 1 == c_dr_i) && c_dr_pc <= 0) || c_dr_pc == 1 RESULT: Ultimate proved your program to be correct! [2022-11-18 20:54:16,815 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fa2a8d4-bb81-42c0-8b16-81e7ff79702a/bin/uautomizer-TMbwUNV5ro/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