./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.02.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/root/.sdkman/candidates/java/21.0.5-tem/bin/java', '-Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config', '-Xmx15G', '-Xms4m', '-jar', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar', '-data', '@noDefault', '-ultimatedata', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data', '-tc', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml', '-i', '../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.02.cil-2.c', '-s', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf', '--cacsl2boogietranslator.entry.function', 'main', '--witnessprinter.witness.directory', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux', '--witnessprinter.witness.filename', 'witness', '--witnessprinter.write.witness.besides.input.file', 'false', '--witnessprinter.graph.data.specification', 'CHECK( init(main()), LTL(G ! call(reach_error())) )\n\n', '--witnessprinter.graph.data.producer', 'Automizer', '--witnessprinter.graph.data.architecture', '32bit', '--witnessprinter.graph.data.programhash', 'd9dd329404607c04c3b8409033c911abc5eb1af40daa0f8673d76c8f1e85e1ae'] Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.02.cil-2.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --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 d9dd329404607c04c3b8409033c911abc5eb1af40daa0f8673d76c8f1e85e1ae --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 01:47:40,331 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 01:47:40,439 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-07 01:47:40,444 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 01:47:40,445 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 01:47:40,476 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 01:47:40,477 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 01:47:40,477 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 01:47:40,478 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 01:47:40,478 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 01:47:40,478 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 01:47:40,478 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 01:47:40,479 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 01:47:40,479 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 01:47:40,480 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 01:47:40,480 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 01:47:40,480 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 01:47:40,480 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 01:47:40,480 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 01:47:40,480 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 01:47:40,480 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 01:47:40,480 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 01:47:40,481 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 01:47:40,481 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 01:47:40,481 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 01:47:40,481 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 01:47:40,481 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 01:47:40,481 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 01:47:40,482 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 01:47:40,482 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 01:47:40,482 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 01:47:40,482 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 01:47:40,482 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 01:47:40,482 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 01:47:40,482 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 01:47:40,483 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 01:47:40,483 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 01:47:40,483 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 01:47:40,483 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 01:47:40,483 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 01:47:40,483 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 01:47:40,484 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 01:47:40,484 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> d9dd329404607c04c3b8409033c911abc5eb1af40daa0f8673d76c8f1e85e1ae [2024-11-07 01:47:40,768 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 01:47:40,775 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 01:47:40,776 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 01:47:40,777 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 01:47:40,777 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 01:47:40,779 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.02.cil-2.c [2024-11-07 01:47:42,055 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 01:47:42,328 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 01:47:42,329 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.02.cil-2.c [2024-11-07 01:47:42,344 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/01533bc17/e4003e4959c54175b94092b47d4db430/FLAG7e22a174f [2024-11-07 01:47:42,369 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/01533bc17/e4003e4959c54175b94092b47d4db430 [2024-11-07 01:47:42,372 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 01:47:42,374 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 01:47:42,375 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 01:47:42,376 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 01:47:42,380 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 01:47:42,381 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:47:42" (1/1) ... [2024-11-07 01:47:42,382 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5000fff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:47:42, skipping insertion in model container [2024-11-07 01:47:42,382 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:47:42" (1/1) ... [2024-11-07 01:47:42,424 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 01:47:42,566 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.02.cil-2.c[911,924] [2024-11-07 01:47:42,640 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.02.cil-2.c[8416,8429] [2024-11-07 01:47:42,687 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 01:47:42,698 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 01:47:42,708 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.02.cil-2.c[911,924] [2024-11-07 01:47:42,740 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.02.cil-2.c[8416,8429] [2024-11-07 01:47:42,763 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 01:47:42,785 INFO L204 MainTranslator]: Completed translation [2024-11-07 01:47:42,786 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:47:42 WrapperNode [2024-11-07 01:47:42,787 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 01:47:42,788 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 01:47:42,788 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 01:47:42,788 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 01:47:42,795 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:47:42" (1/1) ... [2024-11-07 01:47:42,808 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:47:42" (1/1) ... [2024-11-07 01:47:42,846 INFO L138 Inliner]: procedures = 59, calls = 68, calls flagged for inlining = 27, calls inlined = 27, statements flattened = 512 [2024-11-07 01:47:42,850 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 01:47:42,851 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 01:47:42,851 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 01:47:42,851 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 01:47:42,861 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:47:42" (1/1) ... [2024-11-07 01:47:42,862 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:47:42" (1/1) ... [2024-11-07 01:47:42,865 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:47:42" (1/1) ... [2024-11-07 01:47:42,878 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-07 01:47:42,878 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:47:42" (1/1) ... [2024-11-07 01:47:42,878 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:47:42" (1/1) ... [2024-11-07 01:47:42,885 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:47:42" (1/1) ... [2024-11-07 01:47:42,892 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:47:42" (1/1) ... [2024-11-07 01:47:42,901 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:47:42" (1/1) ... [2024-11-07 01:47:42,903 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:47:42" (1/1) ... [2024-11-07 01:47:42,910 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 01:47:42,910 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 01:47:42,910 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 01:47:42,910 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 01:47:42,912 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:47:42" (1/1) ... [2024-11-07 01:47:42,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 01:47:42,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 01:47:42,955 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-07 01:47:42,959 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-07 01:47:42,980 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 01:47:42,980 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-11-07 01:47:42,980 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-11-07 01:47:42,980 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2024-11-07 01:47:42,980 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2024-11-07 01:47:42,980 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2024-11-07 01:47:42,980 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2024-11-07 01:47:42,981 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2024-11-07 01:47:42,981 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2024-11-07 01:47:42,981 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2024-11-07 01:47:42,981 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2024-11-07 01:47:42,982 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2024-11-07 01:47:42,982 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2024-11-07 01:47:42,982 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2024-11-07 01:47:42,982 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2024-11-07 01:47:42,982 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2024-11-07 01:47:42,982 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2024-11-07 01:47:42,983 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2024-11-07 01:47:42,983 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2024-11-07 01:47:42,983 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2024-11-07 01:47:42,983 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2024-11-07 01:47:42,983 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2024-11-07 01:47:42,983 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2024-11-07 01:47:42,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 01:47:42,984 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2024-11-07 01:47:42,984 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2024-11-07 01:47:42,984 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2024-11-07 01:47:42,985 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2024-11-07 01:47:42,985 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 01:47:42,985 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 01:47:42,985 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2024-11-07 01:47:42,985 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2024-11-07 01:47:42,985 INFO L130 BoogieDeclarations]: Found specification of procedure error2 [2024-11-07 01:47:42,985 INFO L138 BoogieDeclarations]: Found implementation of procedure error2 [2024-11-07 01:47:43,091 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 01:47:43,093 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 01:47:43,578 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##56: assume !(1 == ~q_free~0); [2024-11-07 01:47:43,579 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##55: assume 1 == ~q_free~0;~c_dr_st~0 := 2;~c_dr_pc~0 := 2;~a_t~0 := do_read_c_~a~0#1; [2024-11-07 01:47:43,662 INFO L? ?]: Removed 74 outVars from TransFormulas that were not future-live. [2024-11-07 01:47:43,663 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 01:47:43,685 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 01:47:43,685 INFO L316 CfgBuilder]: Removed 9 assume(true) statements. [2024-11-07 01:47:43,686 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:47:43 BoogieIcfgContainer [2024-11-07 01:47:43,686 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 01:47:43,688 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 01:47:43,688 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 01:47:43,692 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 01:47:43,692 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 01:47:42" (1/3) ... [2024-11-07 01:47:43,693 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@97fa4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:47:43, skipping insertion in model container [2024-11-07 01:47:43,693 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:47:42" (2/3) ... [2024-11-07 01:47:43,693 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@97fa4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:47:43, skipping insertion in model container [2024-11-07 01:47:43,693 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:47:43" (3/3) ... [2024-11-07 01:47:43,694 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_3.cil+token_ring.02.cil-2.c [2024-11-07 01:47:43,705 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 01:47:43,705 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-07 01:47:43,753 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 01:47:43,762 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@55310504, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 01:47:43,762 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-07 01:47:43,767 INFO L276 IsEmpty]: Start isEmpty. Operand has 260 states, 208 states have (on average 1.5576923076923077) internal successors, (324), 216 states have internal predecessors, (324), 34 states have call successors, (34), 15 states have call predecessors, (34), 15 states have return successors, (34), 32 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-07 01:47:43,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-07 01:47:43,775 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:47:43,775 INFO L215 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] [2024-11-07 01:47:43,776 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:47:43,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:47:43,780 INFO L85 PathProgramCache]: Analyzing trace with hash -1504426887, now seen corresponding path program 1 times [2024-11-07 01:47:43,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:47:43,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930930403] [2024-11-07 01:47:43,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:47:43,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:47:43,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:44,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:47:44,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:44,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-07 01:47:44,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:44,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 01:47:44,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:44,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 01:47:44,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:44,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 01:47:44,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:44,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 01:47:44,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:44,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 01:47:44,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:44,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:47:44,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:47:44,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930930403] [2024-11-07 01:47:44,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930930403] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:47:44,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:47:44,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 01:47:44,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862489917] [2024-11-07 01:47:44,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:47:44,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 01:47:44,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:47:44,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 01:47:44,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-07 01:47:44,351 INFO L87 Difference]: Start difference. First operand has 260 states, 208 states have (on average 1.5576923076923077) internal successors, (324), 216 states have internal predecessors, (324), 34 states have call successors, (34), 15 states have call predecessors, (34), 15 states have return successors, (34), 32 states have call predecessors, (34), 34 states have call successors, (34) Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 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) [2024-11-07 01:47:45,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:47:45,450 INFO L93 Difference]: Finished difference Result 652 states and 991 transitions. [2024-11-07 01:47:45,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 01:47:45,452 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 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 65 [2024-11-07 01:47:45,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:47:45,462 INFO L225 Difference]: With dead ends: 652 [2024-11-07 01:47:45,464 INFO L226 Difference]: Without dead ends: 400 [2024-11-07 01:47:45,470 INFO L431 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 [2024-11-07 01:47:45,473 INFO L432 NwaCegarLoop]: 264 mSDtfsCounter, 527 mSDsluCounter, 977 mSDsCounter, 0 mSdLazyCounter, 779 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 534 SdHoareTripleChecker+Valid, 1241 SdHoareTripleChecker+Invalid, 891 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 779 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-07 01:47:45,474 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [534 Valid, 1241 Invalid, 891 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 779 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-07 01:47:45,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2024-11-07 01:47:45,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 361. [2024-11-07 01:47:45,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 290 states have (on average 1.4517241379310344) internal successors, (421), 297 states have internal predecessors, (421), 47 states have call successors, (47), 22 states have call predecessors, (47), 22 states have return successors, (48), 44 states have call predecessors, (48), 43 states have call successors, (48) [2024-11-07 01:47:45,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 516 transitions. [2024-11-07 01:47:45,576 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 516 transitions. Word has length 65 [2024-11-07 01:47:45,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:47:45,577 INFO L471 AbstractCegarLoop]: Abstraction has 361 states and 516 transitions. [2024-11-07 01:47:45,577 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 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) [2024-11-07 01:47:45,577 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 516 transitions. [2024-11-07 01:47:45,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-07 01:47:45,581 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:47:45,581 INFO L215 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] [2024-11-07 01:47:45,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 01:47:45,581 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:47:45,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:47:45,582 INFO L85 PathProgramCache]: Analyzing trace with hash 33913143, now seen corresponding path program 1 times [2024-11-07 01:47:45,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:47:45,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307305283] [2024-11-07 01:47:45,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:47:45,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:47:45,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:45,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:47:45,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:45,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-07 01:47:45,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:45,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 01:47:45,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:45,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 01:47:45,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:45,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 01:47:45,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:45,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 01:47:45,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:45,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 01:47:45,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:45,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:47:45,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:47:45,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307305283] [2024-11-07 01:47:45,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307305283] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:47:45,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:47:45,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:47:45,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565661139] [2024-11-07 01:47:45,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:47:45,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:47:45,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:47:45,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:47:45,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:47:45,771 INFO L87 Difference]: Start difference. First operand 361 states and 516 transitions. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-07 01:47:46,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:47:46,587 INFO L93 Difference]: Finished difference Result 829 states and 1168 transitions. [2024-11-07 01:47:46,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 01:47:46,588 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) Word has length 65 [2024-11-07 01:47:46,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:47:46,592 INFO L225 Difference]: With dead ends: 829 [2024-11-07 01:47:46,596 INFO L226 Difference]: Without dead ends: 620 [2024-11-07 01:47:46,598 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2024-11-07 01:47:46,600 INFO L432 NwaCegarLoop]: 295 mSDtfsCounter, 956 mSDsluCounter, 601 mSDsCounter, 0 mSdLazyCounter, 702 mSolverCounterSat, 165 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 992 SdHoareTripleChecker+Valid, 896 SdHoareTripleChecker+Invalid, 867 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 165 IncrementalHoareTripleChecker+Valid, 702 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-07 01:47:46,602 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [992 Valid, 896 Invalid, 867 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [165 Valid, 702 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-07 01:47:46,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2024-11-07 01:47:46,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 546. [2024-11-07 01:47:46,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 546 states, 439 states have (on average 1.4236902050113895) internal successors, (625), 448 states have internal predecessors, (625), 67 states have call successors, (67), 36 states have call predecessors, (67), 38 states have return successors, (71), 64 states have call predecessors, (71), 63 states have call successors, (71) [2024-11-07 01:47:46,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 546 states and 763 transitions. [2024-11-07 01:47:46,680 INFO L78 Accepts]: Start accepts. Automaton has 546 states and 763 transitions. Word has length 65 [2024-11-07 01:47:46,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:47:46,682 INFO L471 AbstractCegarLoop]: Abstraction has 546 states and 763 transitions. [2024-11-07 01:47:46,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-07 01:47:46,682 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 763 transitions. [2024-11-07 01:47:46,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-07 01:47:46,685 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:47:46,685 INFO L215 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, 1] [2024-11-07 01:47:46,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 01:47:46,687 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:47:46,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:47:46,687 INFO L85 PathProgramCache]: Analyzing trace with hash -1774921652, now seen corresponding path program 1 times [2024-11-07 01:47:46,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:47:46,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48896825] [2024-11-07 01:47:46,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:47:46,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:47:46,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:46,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:47:46,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:46,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-07 01:47:46,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:46,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 01:47:46,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:46,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 01:47:46,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:46,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 01:47:46,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:46,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-07 01:47:46,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:46,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 01:47:46,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:46,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:47:46,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:47:46,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48896825] [2024-11-07 01:47:46,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48896825] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:47:46,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:47:46,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 01:47:46,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037354247] [2024-11-07 01:47:46,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:47:46,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 01:47:46,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:47:46,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 01:47:46,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-07 01:47:46,921 INFO L87 Difference]: Start difference. First operand 546 states and 763 transitions. Second operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 5 states have internal predecessors, (51), 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) [2024-11-07 01:47:47,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:47:47,691 INFO L93 Difference]: Finished difference Result 1010 states and 1404 transitions. [2024-11-07 01:47:47,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 01:47:47,692 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 5 states have internal predecessors, (51), 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 66 [2024-11-07 01:47:47,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:47:47,700 INFO L225 Difference]: With dead ends: 1010 [2024-11-07 01:47:47,702 INFO L226 Difference]: Without dead ends: 616 [2024-11-07 01:47:47,704 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2024-11-07 01:47:47,704 INFO L432 NwaCegarLoop]: 229 mSDtfsCounter, 394 mSDsluCounter, 1104 mSDsCounter, 0 mSdLazyCounter, 931 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 395 SdHoareTripleChecker+Valid, 1333 SdHoareTripleChecker+Invalid, 1044 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 931 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-07 01:47:47,705 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [395 Valid, 1333 Invalid, 1044 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 931 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-07 01:47:47,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2024-11-07 01:47:47,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 556. [2024-11-07 01:47:47,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 556 states, 447 states have (on average 1.4116331096196868) internal successors, (631), 456 states have internal predecessors, (631), 67 states have call successors, (67), 36 states have call predecessors, (67), 40 states have return successors, (73), 66 states have call predecessors, (73), 63 states have call successors, (73) [2024-11-07 01:47:47,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 771 transitions. [2024-11-07 01:47:47,765 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 771 transitions. Word has length 66 [2024-11-07 01:47:47,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:47:47,765 INFO L471 AbstractCegarLoop]: Abstraction has 556 states and 771 transitions. [2024-11-07 01:47:47,765 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 5 states have internal predecessors, (51), 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) [2024-11-07 01:47:47,766 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 771 transitions. [2024-11-07 01:47:47,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-07 01:47:47,767 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:47:47,767 INFO L215 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, 1] [2024-11-07 01:47:47,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 01:47:47,768 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:47:47,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:47:47,768 INFO L85 PathProgramCache]: Analyzing trace with hash 1490686346, now seen corresponding path program 1 times [2024-11-07 01:47:47,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:47:47,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171951677] [2024-11-07 01:47:47,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:47:47,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:47:47,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:47,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:47:47,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:47,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-07 01:47:47,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:47,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 01:47:47,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:47,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 01:47:47,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:47,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 01:47:47,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:47,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-07 01:47:47,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:47,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 01:47:47,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:47,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:47:47,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:47:47,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171951677] [2024-11-07 01:47:47,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171951677] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:47:47,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:47:47,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 01:47:47,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433316906] [2024-11-07 01:47:47,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:47:47,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 01:47:47,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:47:47,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 01:47:47,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-07 01:47:47,959 INFO L87 Difference]: Start difference. First operand 556 states and 771 transitions. Second operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 6 states have internal predecessors, (51), 4 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-07 01:47:49,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:47:49,777 INFO L93 Difference]: Finished difference Result 2096 states and 2935 transitions. [2024-11-07 01:47:49,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-11-07 01:47:49,778 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 6 states have internal predecessors, (51), 4 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 66 [2024-11-07 01:47:49,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:47:49,787 INFO L225 Difference]: With dead ends: 2096 [2024-11-07 01:47:49,788 INFO L226 Difference]: Without dead ends: 834 [2024-11-07 01:47:49,792 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 292 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=235, Invalid=887, Unknown=0, NotChecked=0, Total=1122 [2024-11-07 01:47:49,793 INFO L432 NwaCegarLoop]: 386 mSDtfsCounter, 1661 mSDsluCounter, 1079 mSDsCounter, 0 mSdLazyCounter, 1500 mSolverCounterSat, 393 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1683 SdHoareTripleChecker+Valid, 1465 SdHoareTripleChecker+Invalid, 1893 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 393 IncrementalHoareTripleChecker+Valid, 1500 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-07 01:47:49,793 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1683 Valid, 1465 Invalid, 1893 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [393 Valid, 1500 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-07 01:47:49,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 834 states. [2024-11-07 01:47:49,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 834 to 696. [2024-11-07 01:47:49,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 696 states, 550 states have (on average 1.3763636363636365) internal successors, (757), 561 states have internal predecessors, (757), 87 states have call successors, (87), 50 states have call predecessors, (87), 57 states have return successors, (104), 87 states have call predecessors, (104), 83 states have call successors, (104) [2024-11-07 01:47:49,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 696 states to 696 states and 948 transitions. [2024-11-07 01:47:49,868 INFO L78 Accepts]: Start accepts. Automaton has 696 states and 948 transitions. Word has length 66 [2024-11-07 01:47:49,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:47:49,868 INFO L471 AbstractCegarLoop]: Abstraction has 696 states and 948 transitions. [2024-11-07 01:47:49,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 6 states have internal predecessors, (51), 4 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-07 01:47:49,868 INFO L276 IsEmpty]: Start isEmpty. Operand 696 states and 948 transitions. [2024-11-07 01:47:49,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-07 01:47:49,871 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:47:49,871 INFO L215 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, 1, 1] [2024-11-07 01:47:49,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 01:47:49,871 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:47:49,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:47:49,872 INFO L85 PathProgramCache]: Analyzing trace with hash -1441856857, now seen corresponding path program 1 times [2024-11-07 01:47:49,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:47:49,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715124297] [2024-11-07 01:47:49,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:47:49,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:47:49,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:49,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:47:49,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:49,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-07 01:47:49,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:49,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 01:47:50,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:50,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 01:47:50,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:50,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 01:47:50,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:50,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 01:47:50,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:50,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 01:47:50,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:50,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:47:50,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:47:50,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715124297] [2024-11-07 01:47:50,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715124297] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:47:50,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:47:50,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 01:47:50,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63495746] [2024-11-07 01:47:50,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:47:50,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 01:47:50,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:47:50,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 01:47:50,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-07 01:47:50,037 INFO L87 Difference]: Start difference. First operand 696 states and 948 transitions. Second operand has 9 states, 8 states have (on average 6.5) internal successors, (52), 5 states have internal predecessors, (52), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-07 01:47:50,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:47:50,911 INFO L93 Difference]: Finished difference Result 1615 states and 2202 transitions. [2024-11-07 01:47:50,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-07 01:47:50,912 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.5) internal successors, (52), 5 states have internal predecessors, (52), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) Word has length 67 [2024-11-07 01:47:50,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:47:50,914 INFO L225 Difference]: With dead ends: 1615 [2024-11-07 01:47:50,915 INFO L226 Difference]: Without dead ends: 138 [2024-11-07 01:47:50,918 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2024-11-07 01:47:50,919 INFO L432 NwaCegarLoop]: 233 mSDtfsCounter, 773 mSDsluCounter, 822 mSDsCounter, 0 mSdLazyCounter, 767 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 811 SdHoareTripleChecker+Valid, 1055 SdHoareTripleChecker+Invalid, 887 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 767 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-07 01:47:50,919 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [811 Valid, 1055 Invalid, 887 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 767 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-07 01:47:50,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2024-11-07 01:47:50,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2024-11-07 01:47:50,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 113 states have (on average 1.4778761061946903) internal successors, (167), 115 states have internal predecessors, (167), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-07 01:47:50,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 201 transitions. [2024-11-07 01:47:50,928 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 201 transitions. Word has length 67 [2024-11-07 01:47:50,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:47:50,928 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 201 transitions. [2024-11-07 01:47:50,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.5) internal successors, (52), 5 states have internal predecessors, (52), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-07 01:47:50,929 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 201 transitions. [2024-11-07 01:47:50,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-07 01:47:50,929 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:47:50,930 INFO L215 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, 1, 1, 1, 1] [2024-11-07 01:47:50,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 01:47:50,930 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:47:50,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:47:50,930 INFO L85 PathProgramCache]: Analyzing trace with hash -166345420, now seen corresponding path program 1 times [2024-11-07 01:47:50,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:47:50,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502028467] [2024-11-07 01:47:50,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:47:50,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:47:50,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:50,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:47:50,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:51,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-07 01:47:51,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:51,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 01:47:51,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:51,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-07 01:47:51,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:51,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 01:47:51,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:51,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:47:51,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:47:51,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502028467] [2024-11-07 01:47:51,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502028467] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:47:51,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:47:51,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 01:47:51,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582647380] [2024-11-07 01:47:51,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:47:51,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 01:47:51,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:47:51,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 01:47:51,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 01:47:51,067 INFO L87 Difference]: Start difference. First operand 138 states and 201 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:47:51,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:47:51,672 INFO L93 Difference]: Finished difference Result 454 states and 678 transitions. [2024-11-07 01:47:51,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 01:47:51,672 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 69 [2024-11-07 01:47:51,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:47:51,676 INFO L225 Difference]: With dead ends: 454 [2024-11-07 01:47:51,676 INFO L226 Difference]: Without dead ends: 327 [2024-11-07 01:47:51,677 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-07 01:47:51,679 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 431 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 591 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 440 SdHoareTripleChecker+Valid, 498 SdHoareTripleChecker+Invalid, 667 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 591 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 01:47:51,679 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [440 Valid, 498 Invalid, 667 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 591 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 01:47:51,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2024-11-07 01:47:51,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 262. [2024-11-07 01:47:51,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 219 states have (on average 1.4885844748858448) internal successors, (326), 222 states have internal predecessors, (326), 29 states have call successors, (29), 13 states have call predecessors, (29), 13 states have return successors, (30), 27 states have call predecessors, (30), 27 states have call successors, (30) [2024-11-07 01:47:51,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 385 transitions. [2024-11-07 01:47:51,702 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 385 transitions. Word has length 69 [2024-11-07 01:47:51,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:47:51,703 INFO L471 AbstractCegarLoop]: Abstraction has 262 states and 385 transitions. [2024-11-07 01:47:51,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:47:51,703 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 385 transitions. [2024-11-07 01:47:51,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-07 01:47:51,703 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:47:51,703 INFO L215 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, 1, 1, 1, 1] [2024-11-07 01:47:51,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 01:47:51,704 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:47:51,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:47:51,704 INFO L85 PathProgramCache]: Analyzing trace with hash -63631056, now seen corresponding path program 1 times [2024-11-07 01:47:51,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:47:51,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061427902] [2024-11-07 01:47:51,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:47:51,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:47:51,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:51,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:47:51,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:51,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-07 01:47:51,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:51,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 01:47:51,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:51,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-07 01:47:51,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:51,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 01:47:51,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:51,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:47:51,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:47:51,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061427902] [2024-11-07 01:47:51,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061427902] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:47:51,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:47:51,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:47:51,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107442217] [2024-11-07 01:47:51,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:47:51,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:47:51,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:47:51,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:47:51,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:47:51,855 INFO L87 Difference]: Start difference. First operand 262 states and 385 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:47:52,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:47:52,760 INFO L93 Difference]: Finished difference Result 733 states and 1088 transitions. [2024-11-07 01:47:52,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 01:47:52,761 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 69 [2024-11-07 01:47:52,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:47:52,764 INFO L225 Difference]: With dead ends: 733 [2024-11-07 01:47:52,764 INFO L226 Difference]: Without dead ends: 482 [2024-11-07 01:47:52,765 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-07 01:47:52,765 INFO L432 NwaCegarLoop]: 221 mSDtfsCounter, 432 mSDsluCounter, 709 mSDsCounter, 0 mSdLazyCounter, 969 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 441 SdHoareTripleChecker+Valid, 930 SdHoareTripleChecker+Invalid, 1014 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 969 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-07 01:47:52,766 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [441 Valid, 930 Invalid, 1014 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 969 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-07 01:47:52,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2024-11-07 01:47:52,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 379. [2024-11-07 01:47:52,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 379 states, 318 states have (on average 1.4811320754716981) internal successors, (471), 322 states have internal predecessors, (471), 40 states have call successors, (40), 19 states have call predecessors, (40), 20 states have return successors, (43), 39 states have call predecessors, (43), 38 states have call successors, (43) [2024-11-07 01:47:52,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 554 transitions. [2024-11-07 01:47:52,798 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 554 transitions. Word has length 69 [2024-11-07 01:47:52,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:47:52,798 INFO L471 AbstractCegarLoop]: Abstraction has 379 states and 554 transitions. [2024-11-07 01:47:52,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:47:52,798 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 554 transitions. [2024-11-07 01:47:52,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-07 01:47:52,800 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:47:52,800 INFO L215 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, 1, 1, 1, 1] [2024-11-07 01:47:52,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 01:47:52,802 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:47:52,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:47:52,802 INFO L85 PathProgramCache]: Analyzing trace with hash 1323154354, now seen corresponding path program 1 times [2024-11-07 01:47:52,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:47:52,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566589758] [2024-11-07 01:47:52,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:47:52,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:47:52,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:52,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:47:52,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:52,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-07 01:47:52,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:52,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 01:47:52,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:52,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-07 01:47:52,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:52,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 01:47:52,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:52,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:47:52,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:47:52,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566589758] [2024-11-07 01:47:52,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [566589758] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:47:52,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:47:52,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:47:52,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928850643] [2024-11-07 01:47:52,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:47:52,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:47:52,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:47:52,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:47:52,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:47:52,914 INFO L87 Difference]: Start difference. First operand 379 states and 554 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:47:53,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:47:53,372 INFO L93 Difference]: Finished difference Result 846 states and 1257 transitions. [2024-11-07 01:47:53,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 01:47:53,373 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 69 [2024-11-07 01:47:53,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:47:53,379 INFO L225 Difference]: With dead ends: 846 [2024-11-07 01:47:53,380 INFO L226 Difference]: Without dead ends: 478 [2024-11-07 01:47:53,381 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-11-07 01:47:53,381 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 344 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 458 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 354 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 458 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 01:47:53,382 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [354 Valid, 457 Invalid, 510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 458 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 01:47:53,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2024-11-07 01:47:53,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 379. [2024-11-07 01:47:53,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 379 states, 318 states have (on average 1.471698113207547) internal successors, (468), 322 states have internal predecessors, (468), 40 states have call successors, (40), 19 states have call predecessors, (40), 20 states have return successors, (43), 39 states have call predecessors, (43), 38 states have call successors, (43) [2024-11-07 01:47:53,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 551 transitions. [2024-11-07 01:47:53,416 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 551 transitions. Word has length 69 [2024-11-07 01:47:53,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:47:53,417 INFO L471 AbstractCegarLoop]: Abstraction has 379 states and 551 transitions. [2024-11-07 01:47:53,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:47:53,417 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 551 transitions. [2024-11-07 01:47:53,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-07 01:47:53,418 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:47:53,418 INFO L215 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, 1, 1, 1, 1] [2024-11-07 01:47:53,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 01:47:53,418 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:47:53,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:47:53,419 INFO L85 PathProgramCache]: Analyzing trace with hash 1767055028, now seen corresponding path program 1 times [2024-11-07 01:47:53,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:47:53,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548192537] [2024-11-07 01:47:53,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:47:53,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:47:53,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:53,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:47:53,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:53,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-07 01:47:53,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:53,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 01:47:53,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:53,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-07 01:47:53,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:53,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 01:47:53,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:53,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:47:53,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:47:53,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548192537] [2024-11-07 01:47:53,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548192537] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:47:53,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:47:53,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:47:53,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213384320] [2024-11-07 01:47:53,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:47:53,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:47:53,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:47:53,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:47:53,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:47:53,549 INFO L87 Difference]: Start difference. First operand 379 states and 551 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:47:54,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:47:54,476 INFO L93 Difference]: Finished difference Result 1188 states and 1741 transitions. [2024-11-07 01:47:54,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-07 01:47:54,477 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 69 [2024-11-07 01:47:54,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:47:54,482 INFO L225 Difference]: With dead ends: 1188 [2024-11-07 01:47:54,482 INFO L226 Difference]: Without dead ends: 820 [2024-11-07 01:47:54,483 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-11-07 01:47:54,485 INFO L432 NwaCegarLoop]: 216 mSDtfsCounter, 475 mSDsluCounter, 698 mSDsCounter, 0 mSdLazyCounter, 915 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 487 SdHoareTripleChecker+Valid, 914 SdHoareTripleChecker+Invalid, 965 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 915 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-07 01:47:54,485 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [487 Valid, 914 Invalid, 965 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 915 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-07 01:47:54,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 820 states. [2024-11-07 01:47:54,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 820 to 594. [2024-11-07 01:47:54,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 594 states, 499 states have (on average 1.4569138276553106) internal successors, (727), 505 states have internal predecessors, (727), 60 states have call successors, (60), 31 states have call predecessors, (60), 34 states have return successors, (71), 61 states have call predecessors, (71), 58 states have call successors, (71) [2024-11-07 01:47:54,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 594 states and 858 transitions. [2024-11-07 01:47:54,538 INFO L78 Accepts]: Start accepts. Automaton has 594 states and 858 transitions. Word has length 69 [2024-11-07 01:47:54,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:47:54,538 INFO L471 AbstractCegarLoop]: Abstraction has 594 states and 858 transitions. [2024-11-07 01:47:54,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:47:54,538 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 858 transitions. [2024-11-07 01:47:54,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-07 01:47:54,539 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:47:54,539 INFO L215 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, 1, 1, 1, 1] [2024-11-07 01:47:54,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-07 01:47:54,540 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:47:54,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:47:54,540 INFO L85 PathProgramCache]: Analyzing trace with hash -989572238, now seen corresponding path program 1 times [2024-11-07 01:47:54,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:47:54,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824662527] [2024-11-07 01:47:54,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:47:54,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:47:54,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:54,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:47:54,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:54,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-07 01:47:54,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:54,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 01:47:54,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:54,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-07 01:47:54,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:54,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 01:47:54,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:54,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:47:54,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:47:54,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824662527] [2024-11-07 01:47:54,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824662527] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:47:54,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:47:54,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:47:54,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292011025] [2024-11-07 01:47:54,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:47:54,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:47:54,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:47:54,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:47:54,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:47:54,677 INFO L87 Difference]: Start difference. First operand 594 states and 858 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:47:55,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:47:55,591 INFO L93 Difference]: Finished difference Result 1909 states and 2766 transitions. [2024-11-07 01:47:55,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-07 01:47:55,592 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 69 [2024-11-07 01:47:55,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:47:55,599 INFO L225 Difference]: With dead ends: 1909 [2024-11-07 01:47:55,599 INFO L226 Difference]: Without dead ends: 1326 [2024-11-07 01:47:55,601 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-11-07 01:47:55,601 INFO L432 NwaCegarLoop]: 217 mSDtfsCounter, 418 mSDsluCounter, 701 mSDsCounter, 0 mSdLazyCounter, 977 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 426 SdHoareTripleChecker+Valid, 918 SdHoareTripleChecker+Invalid, 1027 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 977 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-07 01:47:55,602 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [426 Valid, 918 Invalid, 1027 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 977 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-07 01:47:55,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1326 states. [2024-11-07 01:47:55,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1326 to 1037. [2024-11-07 01:47:55,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1037 states, 876 states have (on average 1.4531963470319635) internal successors, (1273), 886 states have internal predecessors, (1273), 98 states have call successors, (98), 55 states have call predecessors, (98), 62 states have return successors, (131), 103 states have call predecessors, (131), 96 states have call successors, (131) [2024-11-07 01:47:55,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1037 states to 1037 states and 1502 transitions. [2024-11-07 01:47:55,691 INFO L78 Accepts]: Start accepts. Automaton has 1037 states and 1502 transitions. Word has length 69 [2024-11-07 01:47:55,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:47:55,691 INFO L471 AbstractCegarLoop]: Abstraction has 1037 states and 1502 transitions. [2024-11-07 01:47:55,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:47:55,692 INFO L276 IsEmpty]: Start isEmpty. Operand 1037 states and 1502 transitions. [2024-11-07 01:47:55,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-07 01:47:55,696 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:47:55,696 INFO L215 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, 1, 1, 1, 1] [2024-11-07 01:47:55,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-07 01:47:55,696 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:47:55,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:47:55,697 INFO L85 PathProgramCache]: Analyzing trace with hash 1276808948, now seen corresponding path program 1 times [2024-11-07 01:47:55,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:47:55,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861662884] [2024-11-07 01:47:55,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:47:55,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:47:55,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:55,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:47:55,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:55,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-07 01:47:55,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:55,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 01:47:55,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:55,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-07 01:47:55,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:55,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 01:47:55,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:55,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:47:55,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:47:55,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861662884] [2024-11-07 01:47:55,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861662884] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:47:55,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:47:55,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:47:55,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015253082] [2024-11-07 01:47:55,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:47:55,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:47:55,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:47:55,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:47:55,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:47:55,814 INFO L87 Difference]: Start difference. First operand 1037 states and 1502 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:47:56,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:47:56,340 INFO L93 Difference]: Finished difference Result 2294 states and 3361 transitions. [2024-11-07 01:47:56,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 01:47:56,341 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 69 [2024-11-07 01:47:56,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:47:56,348 INFO L225 Difference]: With dead ends: 2294 [2024-11-07 01:47:56,349 INFO L226 Difference]: Without dead ends: 1269 [2024-11-07 01:47:56,352 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-07 01:47:56,353 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 148 mSDsluCounter, 502 mSDsCounter, 0 mSdLazyCounter, 583 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 640 SdHoareTripleChecker+Invalid, 619 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 01:47:56,353 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 640 Invalid, 619 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 583 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 01:47:56,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1269 states. [2024-11-07 01:47:56,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1269 to 1064. [2024-11-07 01:47:56,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1064 states, 903 states have (on average 1.4396456256921373) internal successors, (1300), 913 states have internal predecessors, (1300), 98 states have call successors, (98), 55 states have call predecessors, (98), 62 states have return successors, (131), 103 states have call predecessors, (131), 96 states have call successors, (131) [2024-11-07 01:47:56,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1064 states to 1064 states and 1529 transitions. [2024-11-07 01:47:56,462 INFO L78 Accepts]: Start accepts. Automaton has 1064 states and 1529 transitions. Word has length 69 [2024-11-07 01:47:56,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:47:56,462 INFO L471 AbstractCegarLoop]: Abstraction has 1064 states and 1529 transitions. [2024-11-07 01:47:56,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:47:56,462 INFO L276 IsEmpty]: Start isEmpty. Operand 1064 states and 1529 transitions. [2024-11-07 01:47:56,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-07 01:47:56,464 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:47:56,464 INFO L215 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, 1, 1, 1, 1] [2024-11-07 01:47:56,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-07 01:47:56,464 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:47:56,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:47:56,465 INFO L85 PathProgramCache]: Analyzing trace with hash 1524955442, now seen corresponding path program 1 times [2024-11-07 01:47:56,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:47:56,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810612085] [2024-11-07 01:47:56,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:47:56,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:47:56,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:56,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:47:56,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:56,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-07 01:47:56,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:56,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 01:47:56,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:56,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-07 01:47:56,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:56,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 01:47:56,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:56,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:47:56,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:47:56,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810612085] [2024-11-07 01:47:56,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810612085] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:47:56,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:47:56,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 01:47:56,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315532998] [2024-11-07 01:47:56,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:47:56,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 01:47:56,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:47:56,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 01:47:56,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 01:47:56,544 INFO L87 Difference]: Start difference. First operand 1064 states and 1529 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:47:57,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:47:57,319 INFO L93 Difference]: Finished difference Result 3535 states and 5103 transitions. [2024-11-07 01:47:57,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 01:47:57,320 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 69 [2024-11-07 01:47:57,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:47:57,332 INFO L225 Difference]: With dead ends: 3535 [2024-11-07 01:47:57,332 INFO L226 Difference]: Without dead ends: 2483 [2024-11-07 01:47:57,336 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2024-11-07 01:47:57,337 INFO L432 NwaCegarLoop]: 241 mSDtfsCounter, 613 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 729 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 637 SdHoareTripleChecker+Valid, 689 SdHoareTripleChecker+Invalid, 803 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 729 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 01:47:57,337 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [637 Valid, 689 Invalid, 803 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 729 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 01:47:57,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2483 states. [2024-11-07 01:47:57,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2483 to 2060. [2024-11-07 01:47:57,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2060 states, 1750 states have (on average 1.4314285714285715) internal successors, (2505), 1768 states have internal predecessors, (2505), 185 states have call successors, (185), 109 states have call predecessors, (185), 124 states have return successors, (246), 190 states have call predecessors, (246), 183 states have call successors, (246) [2024-11-07 01:47:57,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2060 states to 2060 states and 2936 transitions. [2024-11-07 01:47:57,501 INFO L78 Accepts]: Start accepts. Automaton has 2060 states and 2936 transitions. Word has length 69 [2024-11-07 01:47:57,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:47:57,502 INFO L471 AbstractCegarLoop]: Abstraction has 2060 states and 2936 transitions. [2024-11-07 01:47:57,502 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:47:57,502 INFO L276 IsEmpty]: Start isEmpty. Operand 2060 states and 2936 transitions. [2024-11-07 01:47:57,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-07 01:47:57,503 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:47:57,503 INFO L215 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, 1, 1, 1, 1] [2024-11-07 01:47:57,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-07 01:47:57,504 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:47:57,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:47:57,504 INFO L85 PathProgramCache]: Analyzing trace with hash 1924946641, now seen corresponding path program 1 times [2024-11-07 01:47:57,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:47:57,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971832090] [2024-11-07 01:47:57,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:47:57,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:47:57,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:57,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:47:57,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:57,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-07 01:47:57,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:57,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 01:47:57,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:57,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-07 01:47:57,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:57,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 01:47:57,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:57,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:47:57,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:47:57,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971832090] [2024-11-07 01:47:57,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971832090] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:47:57,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:47:57,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:47:57,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462873523] [2024-11-07 01:47:57,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:47:57,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:47:57,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:47:57,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:47:57,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:47:57,623 INFO L87 Difference]: Start difference. First operand 2060 states and 2936 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:47:58,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:47:58,289 INFO L93 Difference]: Finished difference Result 4563 states and 6563 transitions. [2024-11-07 01:47:58,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-07 01:47:58,289 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 69 [2024-11-07 01:47:58,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:47:58,304 INFO L225 Difference]: With dead ends: 4563 [2024-11-07 01:47:58,304 INFO L226 Difference]: Without dead ends: 2515 [2024-11-07 01:47:58,310 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2024-11-07 01:47:58,311 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 161 mSDsluCounter, 502 mSDsCounter, 0 mSdLazyCounter, 542 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 640 SdHoareTripleChecker+Invalid, 578 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 542 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 01:47:58,311 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 640 Invalid, 578 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 542 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 01:47:58,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2515 states. [2024-11-07 01:47:58,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2515 to 2087. [2024-11-07 01:47:58,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2087 states, 1777 states have (on average 1.4198086662915026) internal successors, (2523), 1795 states have internal predecessors, (2523), 185 states have call successors, (185), 109 states have call predecessors, (185), 124 states have return successors, (246), 190 states have call predecessors, (246), 183 states have call successors, (246) [2024-11-07 01:47:58,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2087 states to 2087 states and 2954 transitions. [2024-11-07 01:47:58,494 INFO L78 Accepts]: Start accepts. Automaton has 2087 states and 2954 transitions. Word has length 69 [2024-11-07 01:47:58,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:47:58,494 INFO L471 AbstractCegarLoop]: Abstraction has 2087 states and 2954 transitions. [2024-11-07 01:47:58,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:47:58,494 INFO L276 IsEmpty]: Start isEmpty. Operand 2087 states and 2954 transitions. [2024-11-07 01:47:58,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-07 01:47:58,496 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:47:58,496 INFO L215 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, 1, 1, 1, 1] [2024-11-07 01:47:58,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-07 01:47:58,496 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:47:58,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:47:58,497 INFO L85 PathProgramCache]: Analyzing trace with hash 1530579855, now seen corresponding path program 1 times [2024-11-07 01:47:58,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:47:58,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318937560] [2024-11-07 01:47:58,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:47:58,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:47:58,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:58,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:47:58,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:58,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-07 01:47:58,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:58,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 01:47:58,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:58,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-07 01:47:58,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:58,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 01:47:58,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:58,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:47:58,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:47:58,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318937560] [2024-11-07 01:47:58,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318937560] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:47:58,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:47:58,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:47:58,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470503651] [2024-11-07 01:47:58,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:47:58,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:47:58,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:47:58,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:47:58,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:47:58,591 INFO L87 Difference]: Start difference. First operand 2087 states and 2954 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:47:59,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:47:59,180 INFO L93 Difference]: Finished difference Result 4698 states and 6689 transitions. [2024-11-07 01:47:59,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-07 01:47:59,184 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 69 [2024-11-07 01:47:59,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:47:59,196 INFO L225 Difference]: With dead ends: 4698 [2024-11-07 01:47:59,196 INFO L226 Difference]: Without dead ends: 2623 [2024-11-07 01:47:59,200 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2024-11-07 01:47:59,200 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 163 mSDsluCounter, 502 mSDsCounter, 0 mSdLazyCounter, 505 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 635 SdHoareTripleChecker+Invalid, 542 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 505 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 01:47:59,201 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 635 Invalid, 542 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 505 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 01:47:59,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2623 states. [2024-11-07 01:47:59,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2623 to 2141. [2024-11-07 01:47:59,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2141 states, 1831 states have (on average 1.4074276351720372) internal successors, (2577), 1849 states have internal predecessors, (2577), 185 states have call successors, (185), 109 states have call predecessors, (185), 124 states have return successors, (246), 190 states have call predecessors, (246), 183 states have call successors, (246) [2024-11-07 01:47:59,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2141 states to 2141 states and 3008 transitions. [2024-11-07 01:47:59,372 INFO L78 Accepts]: Start accepts. Automaton has 2141 states and 3008 transitions. Word has length 69 [2024-11-07 01:47:59,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:47:59,372 INFO L471 AbstractCegarLoop]: Abstraction has 2141 states and 3008 transitions. [2024-11-07 01:47:59,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:47:59,373 INFO L276 IsEmpty]: Start isEmpty. Operand 2141 states and 3008 transitions. [2024-11-07 01:47:59,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-07 01:47:59,374 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:47:59,374 INFO L215 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, 1, 1, 1, 1] [2024-11-07 01:47:59,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-07 01:47:59,374 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:47:59,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:47:59,375 INFO L85 PathProgramCache]: Analyzing trace with hash 1553212109, now seen corresponding path program 1 times [2024-11-07 01:47:59,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:47:59,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066826723] [2024-11-07 01:47:59,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:47:59,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:47:59,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:59,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:47:59,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:59,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-07 01:47:59,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:59,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 01:47:59,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:59,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-07 01:47:59,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:59,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 01:47:59,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:59,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:47:59,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:47:59,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066826723] [2024-11-07 01:47:59,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066826723] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:47:59,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:47:59,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 01:47:59,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619853563] [2024-11-07 01:47:59,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:47:59,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 01:47:59,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:47:59,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 01:47:59,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-07 01:47:59,515 INFO L87 Difference]: Start difference. First operand 2141 states and 3008 transitions. Second operand has 8 states, 8 states have (on average 7.25) internal successors, (58), 6 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:48:00,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:48:00,362 INFO L93 Difference]: Finished difference Result 3067 states and 4305 transitions. [2024-11-07 01:48:00,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-07 01:48:00,363 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 6 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 69 [2024-11-07 01:48:00,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:48:00,370 INFO L225 Difference]: With dead ends: 3067 [2024-11-07 01:48:00,370 INFO L226 Difference]: Without dead ends: 1847 [2024-11-07 01:48:00,373 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=96, Invalid=246, Unknown=0, NotChecked=0, Total=342 [2024-11-07 01:48:00,373 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 545 mSDsluCounter, 566 mSDsCounter, 0 mSdLazyCounter, 685 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 556 SdHoareTripleChecker+Valid, 691 SdHoareTripleChecker+Invalid, 760 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 685 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 01:48:00,374 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [556 Valid, 691 Invalid, 760 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 685 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 01:48:00,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1847 states. [2024-11-07 01:48:00,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1847 to 1431. [2024-11-07 01:48:00,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1431 states, 1222 states have (on average 1.3968903436988542) internal successors, (1707), 1232 states have internal predecessors, (1707), 128 states have call successors, (128), 73 states have call predecessors, (128), 80 states have return successors, (147), 129 states have call predecessors, (147), 126 states have call successors, (147) [2024-11-07 01:48:00,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1431 states to 1431 states and 1982 transitions. [2024-11-07 01:48:00,543 INFO L78 Accepts]: Start accepts. Automaton has 1431 states and 1982 transitions. Word has length 69 [2024-11-07 01:48:00,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:48:00,543 INFO L471 AbstractCegarLoop]: Abstraction has 1431 states and 1982 transitions. [2024-11-07 01:48:00,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 6 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:48:00,543 INFO L276 IsEmpty]: Start isEmpty. Operand 1431 states and 1982 transitions. [2024-11-07 01:48:00,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-07 01:48:00,544 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:48:00,544 INFO L215 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, 1, 1, 1, 1] [2024-11-07 01:48:00,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-07 01:48:00,545 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:48:00,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:48:00,545 INFO L85 PathProgramCache]: Analyzing trace with hash 1693760719, now seen corresponding path program 1 times [2024-11-07 01:48:00,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:48:00,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331535655] [2024-11-07 01:48:00,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:48:00,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:48:00,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:00,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:48:00,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:00,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-07 01:48:00,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:00,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 01:48:00,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:00,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-07 01:48:00,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:00,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 01:48:00,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:00,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:48:00,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:48:00,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331535655] [2024-11-07 01:48:00,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331535655] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:48:00,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:48:00,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 01:48:00,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635063105] [2024-11-07 01:48:00,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:48:00,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 01:48:00,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:48:00,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 01:48:00,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-07 01:48:00,697 INFO L87 Difference]: Start difference. First operand 1431 states and 1982 transitions. Second operand has 8 states, 8 states have (on average 7.25) internal successors, (58), 6 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:48:01,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:48:01,586 INFO L93 Difference]: Finished difference Result 4389 states and 6072 transitions. [2024-11-07 01:48:01,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-07 01:48:01,587 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 6 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 69 [2024-11-07 01:48:01,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:48:01,603 INFO L225 Difference]: With dead ends: 4389 [2024-11-07 01:48:01,603 INFO L226 Difference]: Without dead ends: 2971 [2024-11-07 01:48:01,607 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=96, Invalid=246, Unknown=0, NotChecked=0, Total=342 [2024-11-07 01:48:01,608 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 550 mSDsluCounter, 568 mSDsCounter, 0 mSdLazyCounter, 693 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 561 SdHoareTripleChecker+Valid, 696 SdHoareTripleChecker+Invalid, 769 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 693 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 01:48:01,609 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [561 Valid, 696 Invalid, 769 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 693 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 01:48:01,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2971 states. [2024-11-07 01:48:01,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2971 to 2347. [2024-11-07 01:48:01,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2347 states, 1996 states have (on average 1.3802605210420842) internal successors, (2755), 2020 states have internal predecessors, (2755), 208 states have call successors, (208), 121 states have call predecessors, (208), 142 states have return successors, (263), 213 states have call predecessors, (263), 206 states have call successors, (263) [2024-11-07 01:48:01,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2347 states to 2347 states and 3226 transitions. [2024-11-07 01:48:01,816 INFO L78 Accepts]: Start accepts. Automaton has 2347 states and 3226 transitions. Word has length 69 [2024-11-07 01:48:01,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:48:01,817 INFO L471 AbstractCegarLoop]: Abstraction has 2347 states and 3226 transitions. [2024-11-07 01:48:01,817 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 6 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:48:01,817 INFO L276 IsEmpty]: Start isEmpty. Operand 2347 states and 3226 transitions. [2024-11-07 01:48:01,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-07 01:48:01,819 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:48:01,819 INFO L215 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, 1, 1, 1, 1] [2024-11-07 01:48:01,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-07 01:48:01,819 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:48:01,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:48:01,820 INFO L85 PathProgramCache]: Analyzing trace with hash 1559747213, now seen corresponding path program 1 times [2024-11-07 01:48:01,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:48:01,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323987779] [2024-11-07 01:48:01,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:48:01,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:48:01,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:01,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:48:01,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:01,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-07 01:48:01,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:01,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 01:48:01,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:01,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-07 01:48:01,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:01,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 01:48:01,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:01,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:48:01,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:48:01,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323987779] [2024-11-07 01:48:01,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323987779] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:48:01,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:48:01,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 01:48:01,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172477758] [2024-11-07 01:48:01,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:48:01,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 01:48:01,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:48:01,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 01:48:01,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-07 01:48:01,956 INFO L87 Difference]: Start difference. First operand 2347 states and 3226 transitions. Second operand has 8 states, 8 states have (on average 7.25) internal successors, (58), 6 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:48:02,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:48:02,827 INFO L93 Difference]: Finished difference Result 4675 states and 6444 transitions. [2024-11-07 01:48:02,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-07 01:48:02,828 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 6 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 69 [2024-11-07 01:48:02,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:48:02,843 INFO L225 Difference]: With dead ends: 4675 [2024-11-07 01:48:02,844 INFO L226 Difference]: Without dead ends: 3191 [2024-11-07 01:48:02,847 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2024-11-07 01:48:02,848 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 730 mSDsluCounter, 476 mSDsCounter, 0 mSdLazyCounter, 669 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 739 SdHoareTripleChecker+Valid, 602 SdHoareTripleChecker+Invalid, 770 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 669 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 01:48:02,848 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [739 Valid, 602 Invalid, 770 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 669 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 01:48:02,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3191 states. [2024-11-07 01:48:02,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3191 to 2329. [2024-11-07 01:48:02,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2329 states, 1982 states have (on average 1.3718466195761856) internal successors, (2719), 2002 states have internal predecessors, (2719), 208 states have call successors, (208), 121 states have call predecessors, (208), 138 states have return successors, (243), 209 states have call predecessors, (243), 206 states have call successors, (243) [2024-11-07 01:48:03,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2329 states to 2329 states and 3170 transitions. [2024-11-07 01:48:03,006 INFO L78 Accepts]: Start accepts. Automaton has 2329 states and 3170 transitions. Word has length 69 [2024-11-07 01:48:03,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:48:03,006 INFO L471 AbstractCegarLoop]: Abstraction has 2329 states and 3170 transitions. [2024-11-07 01:48:03,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 6 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:48:03,007 INFO L276 IsEmpty]: Start isEmpty. Operand 2329 states and 3170 transitions. [2024-11-07 01:48:03,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-07 01:48:03,008 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:48:03,008 INFO L215 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, 1, 1, 1, 1] [2024-11-07 01:48:03,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-07 01:48:03,008 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:48:03,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:48:03,009 INFO L85 PathProgramCache]: Analyzing trace with hash 1778601931, now seen corresponding path program 1 times [2024-11-07 01:48:03,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:48:03,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098786025] [2024-11-07 01:48:03,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:48:03,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:48:03,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:03,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:48:03,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:03,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-07 01:48:03,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:03,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 01:48:03,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:03,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-07 01:48:03,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:03,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 01:48:03,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:03,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:48:03,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:48:03,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098786025] [2024-11-07 01:48:03,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098786025] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:48:03,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:48:03,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 01:48:03,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816654090] [2024-11-07 01:48:03,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:48:03,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 01:48:03,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:48:03,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 01:48:03,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-07 01:48:03,131 INFO L87 Difference]: Start difference. First operand 2329 states and 3170 transitions. Second operand has 8 states, 8 states have (on average 7.25) internal successors, (58), 6 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:48:03,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:48:03,964 INFO L93 Difference]: Finished difference Result 3973 states and 5388 transitions. [2024-11-07 01:48:03,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-07 01:48:03,964 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 6 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 69 [2024-11-07 01:48:03,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:48:03,974 INFO L225 Difference]: With dead ends: 3973 [2024-11-07 01:48:03,974 INFO L226 Difference]: Without dead ends: 2531 [2024-11-07 01:48:03,978 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2024-11-07 01:48:03,978 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 696 mSDsluCounter, 476 mSDsCounter, 0 mSdLazyCounter, 638 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 705 SdHoareTripleChecker+Valid, 604 SdHoareTripleChecker+Invalid, 747 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 638 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 01:48:03,978 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [705 Valid, 604 Invalid, 747 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 638 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 01:48:03,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2531 states. [2024-11-07 01:48:04,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2531 to 1867. [2024-11-07 01:48:04,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1867 states, 1592 states have (on average 1.3662060301507537) internal successors, (2175), 1602 states have internal predecessors, (2175), 170 states have call successors, (170), 97 states have call predecessors, (170), 104 states have return successors, (183), 169 states have call predecessors, (183), 168 states have call successors, (183) [2024-11-07 01:48:04,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1867 states to 1867 states and 2528 transitions. [2024-11-07 01:48:04,141 INFO L78 Accepts]: Start accepts. Automaton has 1867 states and 2528 transitions. Word has length 69 [2024-11-07 01:48:04,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:48:04,141 INFO L471 AbstractCegarLoop]: Abstraction has 1867 states and 2528 transitions. [2024-11-07 01:48:04,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 6 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:48:04,142 INFO L276 IsEmpty]: Start isEmpty. Operand 1867 states and 2528 transitions. [2024-11-07 01:48:04,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-07 01:48:04,143 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:48:04,143 INFO L215 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, 1, 1, 1, 1] [2024-11-07 01:48:04,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-07 01:48:04,143 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:48:04,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:48:04,143 INFO L85 PathProgramCache]: Analyzing trace with hash -2093663539, now seen corresponding path program 1 times [2024-11-07 01:48:04,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:48:04,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395025392] [2024-11-07 01:48:04,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:48:04,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:48:04,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:04,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:48:04,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:04,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-07 01:48:04,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:04,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 01:48:04,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:04,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-07 01:48:04,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:04,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 01:48:04,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:04,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:48:04,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:48:04,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395025392] [2024-11-07 01:48:04,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395025392] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:48:04,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:48:04,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 01:48:04,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583011142] [2024-11-07 01:48:04,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:48:04,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 01:48:04,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:48:04,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 01:48:04,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 01:48:04,214 INFO L87 Difference]: Start difference. First operand 1867 states and 2528 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 3 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-07 01:48:04,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:48:04,780 INFO L93 Difference]: Finished difference Result 4934 states and 6715 transitions. [2024-11-07 01:48:04,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 01:48:04,782 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 3 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 69 [2024-11-07 01:48:04,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:48:04,794 INFO L225 Difference]: With dead ends: 4934 [2024-11-07 01:48:04,795 INFO L226 Difference]: Without dead ends: 3071 [2024-11-07 01:48:04,799 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-07 01:48:04,800 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 474 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 299 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 488 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 01:48:04,800 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [488 Valid, 381 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 299 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 01:48:04,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3071 states. [2024-11-07 01:48:04,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3071 to 2499. [2024-11-07 01:48:04,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2499 states, 2130 states have (on average 1.3483568075117371) internal successors, (2872), 2152 states have internal predecessors, (2872), 226 states have call successors, (226), 133 states have call predecessors, (226), 142 states have return successors, (241), 215 states have call predecessors, (241), 224 states have call successors, (241) [2024-11-07 01:48:05,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2499 states to 2499 states and 3339 transitions. [2024-11-07 01:48:05,007 INFO L78 Accepts]: Start accepts. Automaton has 2499 states and 3339 transitions. Word has length 69 [2024-11-07 01:48:05,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:48:05,007 INFO L471 AbstractCegarLoop]: Abstraction has 2499 states and 3339 transitions. [2024-11-07 01:48:05,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 3 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-07 01:48:05,007 INFO L276 IsEmpty]: Start isEmpty. Operand 2499 states and 3339 transitions. [2024-11-07 01:48:05,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-07 01:48:05,010 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:48:05,010 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:48:05,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-07 01:48:05,010 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:48:05,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:48:05,011 INFO L85 PathProgramCache]: Analyzing trace with hash 1517981594, now seen corresponding path program 1 times [2024-11-07 01:48:05,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:48:05,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143890838] [2024-11-07 01:48:05,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:48:05,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:48:05,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:05,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:48:05,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:05,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-07 01:48:05,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:05,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 01:48:05,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:05,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-07 01:48:05,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:05,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 01:48:05,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:05,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-07 01:48:05,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:05,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-07 01:48:05,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:05,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-07 01:48:05,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:05,214 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-07 01:48:05,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:48:05,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143890838] [2024-11-07 01:48:05,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143890838] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:48:05,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:48:05,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:48:05,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043158214] [2024-11-07 01:48:05,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:48:05,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:48:05,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:48:05,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:48:05,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:48:05,216 INFO L87 Difference]: Start difference. First operand 2499 states and 3339 transitions. Second operand has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 5 states have internal predecessors, (72), 4 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-07 01:48:06,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:48:06,067 INFO L93 Difference]: Finished difference Result 8498 states and 11479 transitions. [2024-11-07 01:48:06,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 01:48:06,067 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 5 states have internal predecessors, (72), 4 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 112 [2024-11-07 01:48:06,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:48:06,092 INFO L225 Difference]: With dead ends: 8498 [2024-11-07 01:48:06,092 INFO L226 Difference]: Without dead ends: 6014 [2024-11-07 01:48:06,098 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2024-11-07 01:48:06,099 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 580 mSDsluCounter, 430 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 588 SdHoareTripleChecker+Valid, 583 SdHoareTripleChecker+Invalid, 506 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 01:48:06,099 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [588 Valid, 583 Invalid, 506 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 394 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 01:48:06,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6014 states. [2024-11-07 01:48:06,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6014 to 5062. [2024-11-07 01:48:06,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5062 states, 4304 states have (on average 1.3322490706319703) internal successors, (5734), 4363 states have internal predecessors, (5734), 441 states have call successors, (441), 265 states have call predecessors, (441), 316 states have return successors, (595), 437 states have call predecessors, (595), 439 states have call successors, (595) [2024-11-07 01:48:06,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5062 states to 5062 states and 6770 transitions. [2024-11-07 01:48:06,573 INFO L78 Accepts]: Start accepts. Automaton has 5062 states and 6770 transitions. Word has length 112 [2024-11-07 01:48:06,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:48:06,574 INFO L471 AbstractCegarLoop]: Abstraction has 5062 states and 6770 transitions. [2024-11-07 01:48:06,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 5 states have internal predecessors, (72), 4 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-07 01:48:06,574 INFO L276 IsEmpty]: Start isEmpty. Operand 5062 states and 6770 transitions. [2024-11-07 01:48:06,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-07 01:48:06,579 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:48:06,579 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:48:06,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-07 01:48:06,579 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:48:06,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:48:06,581 INFO L85 PathProgramCache]: Analyzing trace with hash -515412452, now seen corresponding path program 1 times [2024-11-07 01:48:06,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:48:06,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69249215] [2024-11-07 01:48:06,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:48:06,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:48:06,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:06,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:48:06,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:06,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-07 01:48:06,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:06,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 01:48:06,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:06,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-07 01:48:06,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:06,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 01:48:06,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:06,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-07 01:48:06,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:06,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-07 01:48:06,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:06,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-07 01:48:06,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:06,648 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-11-07 01:48:06,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:48:06,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69249215] [2024-11-07 01:48:06,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69249215] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:48:06,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:48:06,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 01:48:06,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331100520] [2024-11-07 01:48:06,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:48:06,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 01:48:06,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:48:06,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 01:48:06,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 01:48:06,650 INFO L87 Difference]: Start difference. First operand 5062 states and 6770 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 3 states have internal predecessors, (67), 3 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-07 01:48:07,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:48:07,357 INFO L93 Difference]: Finished difference Result 10042 states and 13426 transitions. [2024-11-07 01:48:07,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 01:48:07,358 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 3 states have internal predecessors, (67), 3 states have call successors, (8), 4 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 112 [2024-11-07 01:48:07,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:48:07,372 INFO L225 Difference]: With dead ends: 10042 [2024-11-07 01:48:07,372 INFO L226 Difference]: Without dead ends: 4995 [2024-11-07 01:48:07,377 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-07 01:48:07,378 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 382 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 403 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 01:48:07,378 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [403 Valid, 287 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 01:48:07,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4995 states. [2024-11-07 01:48:07,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4995 to 4149. [2024-11-07 01:48:07,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4149 states, 3536 states have (on average 1.3289027149321266) internal successors, (4699), 3586 states have internal predecessors, (4699), 352 states have call successors, (352), 213 states have call predecessors, (352), 260 states have return successors, (475), 351 states have call predecessors, (475), 350 states have call successors, (475) [2024-11-07 01:48:07,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4149 states to 4149 states and 5526 transitions. [2024-11-07 01:48:07,661 INFO L78 Accepts]: Start accepts. Automaton has 4149 states and 5526 transitions. Word has length 112 [2024-11-07 01:48:07,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:48:07,662 INFO L471 AbstractCegarLoop]: Abstraction has 4149 states and 5526 transitions. [2024-11-07 01:48:07,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 3 states have internal predecessors, (67), 3 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-07 01:48:07,662 INFO L276 IsEmpty]: Start isEmpty. Operand 4149 states and 5526 transitions. [2024-11-07 01:48:07,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-07 01:48:07,666 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:48:07,666 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:48:07,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-07 01:48:07,666 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:48:07,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:48:07,667 INFO L85 PathProgramCache]: Analyzing trace with hash -1689860065, now seen corresponding path program 1 times [2024-11-07 01:48:07,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:48:07,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133016988] [2024-11-07 01:48:07,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:48:07,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:48:07,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:07,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:48:07,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:07,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-07 01:48:07,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:07,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 01:48:07,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:07,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-07 01:48:07,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:07,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 01:48:07,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:07,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-07 01:48:07,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:07,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-07 01:48:07,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:07,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 01:48:07,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:07,839 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-07 01:48:07,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:48:07,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133016988] [2024-11-07 01:48:07,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133016988] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:48:07,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:48:07,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:48:07,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982155495] [2024-11-07 01:48:07,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:48:07,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:48:07,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:48:07,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:48:07,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:48:07,842 INFO L87 Difference]: Start difference. First operand 4149 states and 5526 transitions. Second operand has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 5 states have internal predecessors, (74), 4 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-07 01:48:09,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:48:09,251 INFO L93 Difference]: Finished difference Result 13991 states and 18692 transitions. [2024-11-07 01:48:09,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 01:48:09,252 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 5 states have internal predecessors, (74), 4 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 114 [2024-11-07 01:48:09,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:48:09,289 INFO L225 Difference]: With dead ends: 13991 [2024-11-07 01:48:09,290 INFO L226 Difference]: Without dead ends: 9857 [2024-11-07 01:48:09,301 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2024-11-07 01:48:09,303 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 791 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 168 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 799 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 168 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 01:48:09,303 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [799 Valid, 421 Invalid, 510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [168 Valid, 342 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 01:48:09,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9857 states. [2024-11-07 01:48:09,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9857 to 8177. [2024-11-07 01:48:09,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8177 states, 6901 states have (on average 1.316475873061875) internal successors, (9085), 7058 states have internal predecessors, (9085), 661 states have call successors, (661), 417 states have call predecessors, (661), 614 states have return successors, (1135), 705 states have call predecessors, (1135), 659 states have call successors, (1135) [2024-11-07 01:48:09,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8177 states to 8177 states and 10881 transitions. [2024-11-07 01:48:09,959 INFO L78 Accepts]: Start accepts. Automaton has 8177 states and 10881 transitions. Word has length 114 [2024-11-07 01:48:09,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:48:09,960 INFO L471 AbstractCegarLoop]: Abstraction has 8177 states and 10881 transitions. [2024-11-07 01:48:09,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 5 states have internal predecessors, (74), 4 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-07 01:48:09,960 INFO L276 IsEmpty]: Start isEmpty. Operand 8177 states and 10881 transitions. [2024-11-07 01:48:09,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-07 01:48:09,966 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:48:09,966 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:48:09,966 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-07 01:48:09,966 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:48:09,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:48:09,967 INFO L85 PathProgramCache]: Analyzing trace with hash -300566051, now seen corresponding path program 1 times [2024-11-07 01:48:09,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:48:09,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673390989] [2024-11-07 01:48:09,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:48:09,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:48:09,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:09,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:48:09,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:09,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-07 01:48:10,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:10,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 01:48:10,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:10,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-07 01:48:10,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:10,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 01:48:10,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:10,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-07 01:48:10,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:10,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-07 01:48:10,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:10,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 01:48:10,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:10,023 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-11-07 01:48:10,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:48:10,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673390989] [2024-11-07 01:48:10,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673390989] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:48:10,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:48:10,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 01:48:10,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057784843] [2024-11-07 01:48:10,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:48:10,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 01:48:10,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:48:10,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 01:48:10,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 01:48:10,024 INFO L87 Difference]: Start difference. First operand 8177 states and 10881 transitions. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-07 01:48:11,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:48:11,085 INFO L93 Difference]: Finished difference Result 17955 states and 23908 transitions. [2024-11-07 01:48:11,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 01:48:11,085 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (8), 4 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 114 [2024-11-07 01:48:11,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:48:11,127 INFO L225 Difference]: With dead ends: 17955 [2024-11-07 01:48:11,127 INFO L226 Difference]: Without dead ends: 9791 [2024-11-07 01:48:11,144 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-07 01:48:11,145 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 380 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 401 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 01:48:11,145 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [401 Valid, 285 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 01:48:11,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9791 states. [2024-11-07 01:48:12,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9791 to 8171. [2024-11-07 01:48:12,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8171 states, 6900 states have (on average 1.316376811594203) internal successors, (9083), 7056 states have internal predecessors, (9083), 656 states have call successors, (656), 417 states have call predecessors, (656), 614 states have return successors, (1127), 699 states have call predecessors, (1127), 654 states have call successors, (1127) [2024-11-07 01:48:12,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8171 states to 8171 states and 10866 transitions. [2024-11-07 01:48:12,084 INFO L78 Accepts]: Start accepts. Automaton has 8171 states and 10866 transitions. Word has length 114 [2024-11-07 01:48:12,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:48:12,085 INFO L471 AbstractCegarLoop]: Abstraction has 8171 states and 10866 transitions. [2024-11-07 01:48:12,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-07 01:48:12,085 INFO L276 IsEmpty]: Start isEmpty. Operand 8171 states and 10866 transitions. [2024-11-07 01:48:12,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-07 01:48:12,091 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:48:12,091 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:48:12,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-07 01:48:12,092 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:48:12,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:48:12,092 INFO L85 PathProgramCache]: Analyzing trace with hash 1793795290, now seen corresponding path program 1 times [2024-11-07 01:48:12,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:48:12,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708964207] [2024-11-07 01:48:12,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:48:12,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:48:12,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:12,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:48:12,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:12,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-07 01:48:12,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:12,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 01:48:12,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:12,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-07 01:48:12,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:12,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 01:48:12,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:12,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-07 01:48:12,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:12,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-07 01:48:12,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:12,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-07 01:48:12,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:12,200 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-07 01:48:12,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:48:12,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708964207] [2024-11-07 01:48:12,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708964207] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:48:12,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:48:12,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:48:12,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252296061] [2024-11-07 01:48:12,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:48:12,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:48:12,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:48:12,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:48:12,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:48:12,202 INFO L87 Difference]: Start difference. First operand 8171 states and 10866 transitions. Second operand has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 5 states have internal predecessors, (79), 5 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-07 01:48:14,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:48:14,607 INFO L93 Difference]: Finished difference Result 25543 states and 34550 transitions. [2024-11-07 01:48:14,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-07 01:48:14,608 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 5 states have internal predecessors, (79), 5 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) Word has length 116 [2024-11-07 01:48:14,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:48:14,659 INFO L225 Difference]: With dead ends: 25543 [2024-11-07 01:48:14,659 INFO L226 Difference]: Without dead ends: 14179 [2024-11-07 01:48:14,681 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=101, Invalid=319, Unknown=0, NotChecked=0, Total=420 [2024-11-07 01:48:14,681 INFO L432 NwaCegarLoop]: 193 mSDtfsCounter, 1494 mSDsluCounter, 574 mSDsCounter, 0 mSdLazyCounter, 860 mSolverCounterSat, 310 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1508 SdHoareTripleChecker+Valid, 767 SdHoareTripleChecker+Invalid, 1170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 310 IncrementalHoareTripleChecker+Valid, 860 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-07 01:48:14,681 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1508 Valid, 767 Invalid, 1170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [310 Valid, 860 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-07 01:48:14,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14179 states. [2024-11-07 01:48:15,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14179 to 12655. [2024-11-07 01:48:15,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12655 states, 10750 states have (on average 1.291720930232558) internal successors, (13886), 11000 states have internal predecessors, (13886), 938 states have call successors, (938), 617 states have call predecessors, (938), 966 states have return successors, (1813), 1039 states have call predecessors, (1813), 936 states have call successors, (1813) [2024-11-07 01:48:15,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12655 states to 12655 states and 16637 transitions. [2024-11-07 01:48:15,704 INFO L78 Accepts]: Start accepts. Automaton has 12655 states and 16637 transitions. Word has length 116 [2024-11-07 01:48:15,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:48:15,705 INFO L471 AbstractCegarLoop]: Abstraction has 12655 states and 16637 transitions. [2024-11-07 01:48:15,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 5 states have internal predecessors, (79), 5 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-07 01:48:15,705 INFO L276 IsEmpty]: Start isEmpty. Operand 12655 states and 16637 transitions. [2024-11-07 01:48:15,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-07 01:48:15,715 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:48:15,715 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:48:15,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-07 01:48:15,715 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:48:15,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:48:15,716 INFO L85 PathProgramCache]: Analyzing trace with hash 1100137730, now seen corresponding path program 1 times [2024-11-07 01:48:15,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:48:15,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908133231] [2024-11-07 01:48:15,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:48:15,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:48:15,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:15,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:48:15,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:15,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-07 01:48:15,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:15,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 01:48:15,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:15,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-07 01:48:15,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:15,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 01:48:15,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:15,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-07 01:48:15,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:15,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-07 01:48:15,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:15,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-07 01:48:15,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:15,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-07 01:48:15,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:15,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-07 01:48:15,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:15,795 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2024-11-07 01:48:15,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:48:15,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908133231] [2024-11-07 01:48:15,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908133231] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:48:15,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:48:15,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 01:48:15,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456185177] [2024-11-07 01:48:15,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:48:15,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 01:48:15,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:48:15,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 01:48:15,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 01:48:15,797 INFO L87 Difference]: Start difference. First operand 12655 states and 16637 transitions. Second operand has 5 states, 5 states have (on average 17.2) internal successors, (86), 3 states have internal predecessors, (86), 3 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-11-07 01:48:18,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:48:18,161 INFO L93 Difference]: Finished difference Result 34013 states and 44874 transitions. [2024-11-07 01:48:18,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 01:48:18,162 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 3 states have internal predecessors, (86), 3 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 147 [2024-11-07 01:48:18,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:48:18,250 INFO L225 Difference]: With dead ends: 34013 [2024-11-07 01:48:18,251 INFO L226 Difference]: Without dead ends: 21371 [2024-11-07 01:48:18,281 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-07 01:48:18,281 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 492 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 503 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 01:48:18,283 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [503 Valid, 374 Invalid, 348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 01:48:18,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21371 states. [2024-11-07 01:48:19,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21371 to 18219. [2024-11-07 01:48:19,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18219 states, 15505 states have (on average 1.2799742018703644) internal successors, (19846), 15835 states have internal predecessors, (19846), 1367 states have call successors, (1367), 913 states have call predecessors, (1367), 1346 states have return successors, (2431), 1472 states have call predecessors, (2431), 1365 states have call successors, (2431) [2024-11-07 01:48:19,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18219 states to 18219 states and 23644 transitions. [2024-11-07 01:48:19,692 INFO L78 Accepts]: Start accepts. Automaton has 18219 states and 23644 transitions. Word has length 147 [2024-11-07 01:48:19,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:48:19,692 INFO L471 AbstractCegarLoop]: Abstraction has 18219 states and 23644 transitions. [2024-11-07 01:48:19,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 3 states have internal predecessors, (86), 3 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-11-07 01:48:19,693 INFO L276 IsEmpty]: Start isEmpty. Operand 18219 states and 23644 transitions. [2024-11-07 01:48:19,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-07 01:48:19,709 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:48:19,710 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 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] [2024-11-07 01:48:19,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-07 01:48:19,710 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:48:19,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:48:19,710 INFO L85 PathProgramCache]: Analyzing trace with hash -629341951, now seen corresponding path program 1 times [2024-11-07 01:48:19,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:48:19,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820776011] [2024-11-07 01:48:19,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:48:19,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:48:19,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:19,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:48:19,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:19,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-07 01:48:19,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:19,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 01:48:19,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:19,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-07 01:48:19,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:19,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 01:48:19,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:19,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-07 01:48:19,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:19,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-07 01:48:19,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:19,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 01:48:19,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:19,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-07 01:48:19,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:19,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-07 01:48:19,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:19,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-07 01:48:19,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:19,819 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 27 proven. 3 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2024-11-07 01:48:19,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:48:19,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820776011] [2024-11-07 01:48:19,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820776011] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 01:48:19,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [360872416] [2024-11-07 01:48:19,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:48:19,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 01:48:19,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 01:48:19,823 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 01:48:19,824 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-07 01:48:19,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:19,963 INFO L255 TraceCheckSpWp]: Trace formula consists of 541 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-07 01:48:19,974 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 01:48:20,056 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-11-07 01:48:20,057 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 01:48:20,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [360872416] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:48:20,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 01:48:20,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2024-11-07 01:48:20,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233057578] [2024-11-07 01:48:20,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:48:20,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 01:48:20,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:48:20,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 01:48:20,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-07 01:48:20,058 INFO L87 Difference]: Start difference. First operand 18219 states and 23644 transitions. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2024-11-07 01:48:21,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:48:21,609 INFO L93 Difference]: Finished difference Result 37840 states and 49726 transitions. [2024-11-07 01:48:21,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 01:48:21,609 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 168 [2024-11-07 01:48:21,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:48:21,670 INFO L225 Difference]: With dead ends: 37840 [2024-11-07 01:48:21,671 INFO L226 Difference]: Without dead ends: 20155 [2024-11-07 01:48:21,708 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-07 01:48:21,709 INFO L432 NwaCegarLoop]: 199 mSDtfsCounter, 151 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 01:48:21,709 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 233 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 01:48:21,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20155 states. [2024-11-07 01:48:23,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20155 to 18831. [2024-11-07 01:48:23,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18831 states, 16079 states have (on average 1.2466571304185583) internal successors, (20045), 16377 states have internal predecessors, (20045), 1391 states have call successors, (1391), 985 states have call predecessors, (1391), 1360 states have return successors, (2071), 1470 states have call predecessors, (2071), 1389 states have call successors, (2071) [2024-11-07 01:48:23,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18831 states to 18831 states and 23507 transitions. [2024-11-07 01:48:23,616 INFO L78 Accepts]: Start accepts. Automaton has 18831 states and 23507 transitions. Word has length 168 [2024-11-07 01:48:23,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:48:23,616 INFO L471 AbstractCegarLoop]: Abstraction has 18831 states and 23507 transitions. [2024-11-07 01:48:23,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2024-11-07 01:48:23,616 INFO L276 IsEmpty]: Start isEmpty. Operand 18831 states and 23507 transitions. [2024-11-07 01:48:23,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-07 01:48:23,629 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:48:23,629 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-07 01:48:23,643 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-07 01:48:23,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2024-11-07 01:48:23,830 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:48:23,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:48:23,830 INFO L85 PathProgramCache]: Analyzing trace with hash 1864691460, now seen corresponding path program 1 times [2024-11-07 01:48:23,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:48:23,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499105540] [2024-11-07 01:48:23,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:48:23,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:48:23,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:23,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:48:23,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:23,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-07 01:48:23,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:23,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 01:48:23,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:24,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-07 01:48:24,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:24,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 01:48:24,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:24,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-07 01:48:24,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:24,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-07 01:48:24,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:24,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 01:48:24,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:24,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-07 01:48:24,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:24,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-07 01:48:24,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:24,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-07 01:48:24,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:24,026 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 27 proven. 3 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2024-11-07 01:48:24,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:48:24,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499105540] [2024-11-07 01:48:24,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499105540] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 01:48:24,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [141311706] [2024-11-07 01:48:24,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:48:24,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 01:48:24,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 01:48:24,029 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 01:48:24,030 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-07 01:48:24,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:24,161 INFO L255 TraceCheckSpWp]: Trace formula consists of 537 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-07 01:48:24,165 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 01:48:24,194 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-07 01:48:24,195 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 01:48:24,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [141311706] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:48:24,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 01:48:24,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2024-11-07 01:48:24,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042177286] [2024-11-07 01:48:24,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:48:24,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 01:48:24,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:48:24,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 01:48:24,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-07 01:48:24,200 INFO L87 Difference]: Start difference. First operand 18831 states and 23507 transitions. Second operand has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 3 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2024-11-07 01:48:25,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:48:25,249 INFO L93 Difference]: Finished difference Result 31927 states and 39840 transitions. [2024-11-07 01:48:25,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 01:48:25,249 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 3 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) Word has length 168 [2024-11-07 01:48:25,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:48:25,294 INFO L225 Difference]: With dead ends: 31927 [2024-11-07 01:48:25,294 INFO L226 Difference]: Without dead ends: 17557 [2024-11-07 01:48:25,323 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-07 01:48:25,324 INFO L432 NwaCegarLoop]: 342 mSDtfsCounter, 153 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 526 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 01:48:25,324 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 526 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 01:48:25,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17557 states. [2024-11-07 01:48:26,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17557 to 17541. [2024-11-07 01:48:26,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17541 states, 15088 states have (on average 1.242709437963945) internal successors, (18750), 15386 states have internal predecessors, (18750), 1192 states have call successors, (1192), 881 states have call predecessors, (1192), 1260 states have return successors, (1784), 1275 states have call predecessors, (1784), 1190 states have call successors, (1784) [2024-11-07 01:48:26,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17541 states to 17541 states and 21726 transitions. [2024-11-07 01:48:26,591 INFO L78 Accepts]: Start accepts. Automaton has 17541 states and 21726 transitions. Word has length 168 [2024-11-07 01:48:26,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:48:26,592 INFO L471 AbstractCegarLoop]: Abstraction has 17541 states and 21726 transitions. [2024-11-07 01:48:26,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 3 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2024-11-07 01:48:26,592 INFO L276 IsEmpty]: Start isEmpty. Operand 17541 states and 21726 transitions. [2024-11-07 01:48:26,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-07 01:48:26,598 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:48:26,598 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-07 01:48:26,610 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-07 01:48:26,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2024-11-07 01:48:26,799 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:48:26,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:48:26,799 INFO L85 PathProgramCache]: Analyzing trace with hash -614519117, now seen corresponding path program 1 times [2024-11-07 01:48:26,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:48:26,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521918297] [2024-11-07 01:48:26,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:48:26,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:48:26,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:26,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:48:26,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:26,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-07 01:48:26,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:26,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 01:48:26,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:26,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-07 01:48:26,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:26,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 01:48:26,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:26,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-07 01:48:26,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:26,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-07 01:48:26,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:26,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 01:48:26,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:26,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-07 01:48:26,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:26,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-07 01:48:26,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:26,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-07 01:48:26,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:26,905 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2024-11-07 01:48:26,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:48:26,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521918297] [2024-11-07 01:48:26,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521918297] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:48:26,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:48:26,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 01:48:26,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511859065] [2024-11-07 01:48:26,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:48:26,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 01:48:26,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:48:26,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 01:48:26,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 01:48:26,908 INFO L87 Difference]: Start difference. First operand 17541 states and 21726 transitions. Second operand has 6 states, 6 states have (on average 17.0) internal successors, (102), 4 states have internal predecessors, (102), 5 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) [2024-11-07 01:48:29,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:48:29,114 INFO L93 Difference]: Finished difference Result 33377 states and 41430 transitions. [2024-11-07 01:48:29,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-07 01:48:29,114 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.0) internal successors, (102), 4 states have internal predecessors, (102), 5 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) Word has length 168 [2024-11-07 01:48:29,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:48:29,181 INFO L225 Difference]: With dead ends: 33377 [2024-11-07 01:48:29,181 INFO L226 Difference]: Without dead ends: 21169 [2024-11-07 01:48:29,209 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2024-11-07 01:48:29,209 INFO L432 NwaCegarLoop]: 195 mSDtfsCounter, 861 mSDsluCounter, 522 mSDsCounter, 0 mSdLazyCounter, 638 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 878 SdHoareTripleChecker+Valid, 717 SdHoareTripleChecker+Invalid, 770 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 638 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-07 01:48:29,209 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [878 Valid, 717 Invalid, 770 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 638 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-07 01:48:29,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21169 states. [2024-11-07 01:48:30,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21169 to 17541. [2024-11-07 01:48:30,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17541 states, 15088 states have (on average 1.23966065747614) internal successors, (18704), 15386 states have internal predecessors, (18704), 1192 states have call successors, (1192), 881 states have call predecessors, (1192), 1260 states have return successors, (1766), 1275 states have call predecessors, (1766), 1190 states have call successors, (1766) [2024-11-07 01:48:30,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17541 states to 17541 states and 21662 transitions. [2024-11-07 01:48:30,543 INFO L78 Accepts]: Start accepts. Automaton has 17541 states and 21662 transitions. Word has length 168 [2024-11-07 01:48:30,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:48:30,544 INFO L471 AbstractCegarLoop]: Abstraction has 17541 states and 21662 transitions. [2024-11-07 01:48:30,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.0) internal successors, (102), 4 states have internal predecessors, (102), 5 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) [2024-11-07 01:48:30,544 INFO L276 IsEmpty]: Start isEmpty. Operand 17541 states and 21662 transitions. [2024-11-07 01:48:30,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-07 01:48:30,551 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:48:30,551 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-07 01:48:30,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-07 01:48:30,551 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:48:30,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:48:30,551 INFO L85 PathProgramCache]: Analyzing trace with hash 1488866448, now seen corresponding path program 1 times [2024-11-07 01:48:30,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:48:30,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289657226] [2024-11-07 01:48:30,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:48:30,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:48:30,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:30,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:48:30,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:30,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-07 01:48:30,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:30,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 01:48:30,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:30,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-07 01:48:30,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:30,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 01:48:30,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:30,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 01:48:30,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:30,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 01:48:30,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:30,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-07 01:48:30,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:30,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-07 01:48:30,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:30,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-07 01:48:30,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:30,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-07 01:48:30,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:30,666 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-11-07 01:48:30,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:48:30,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289657226] [2024-11-07 01:48:30,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289657226] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:48:30,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:48:30,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 01:48:30,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824889960] [2024-11-07 01:48:30,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:48:30,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 01:48:30,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:48:30,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 01:48:30,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 01:48:30,669 INFO L87 Difference]: Start difference. First operand 17541 states and 21662 transitions. Second operand has 6 states, 6 states have (on average 19.0) internal successors, (114), 4 states have internal predecessors, (114), 4 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2024-11-07 01:48:32,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:48:32,224 INFO L93 Difference]: Finished difference Result 34059 states and 42629 transitions. [2024-11-07 01:48:32,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 01:48:32,224 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 19.0) internal successors, (114), 4 states have internal predecessors, (114), 4 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) Word has length 169 [2024-11-07 01:48:32,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:48:32,270 INFO L225 Difference]: With dead ends: 34059 [2024-11-07 01:48:32,270 INFO L226 Difference]: Without dead ends: 16531 [2024-11-07 01:48:32,296 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2024-11-07 01:48:32,296 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 402 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 368 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 415 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 01:48:32,296 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [415 Valid, 349 Invalid, 423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 368 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 01:48:32,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16531 states. [2024-11-07 01:48:33,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16531 to 14846. [2024-11-07 01:48:33,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14846 states, 12749 states have (on average 1.2139775668679897) internal successors, (15477), 12982 states have internal predecessors, (15477), 1007 states have call successors, (1007), 775 states have call predecessors, (1007), 1089 states have return successors, (1391), 1090 states have call predecessors, (1391), 1005 states have call successors, (1391) [2024-11-07 01:48:33,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14846 states to 14846 states and 17875 transitions. [2024-11-07 01:48:33,912 INFO L78 Accepts]: Start accepts. Automaton has 14846 states and 17875 transitions. Word has length 169 [2024-11-07 01:48:33,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:48:33,912 INFO L471 AbstractCegarLoop]: Abstraction has 14846 states and 17875 transitions. [2024-11-07 01:48:33,912 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.0) internal successors, (114), 4 states have internal predecessors, (114), 4 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2024-11-07 01:48:33,913 INFO L276 IsEmpty]: Start isEmpty. Operand 14846 states and 17875 transitions. [2024-11-07 01:48:33,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-07 01:48:33,919 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:48:33,919 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-07 01:48:33,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-07 01:48:33,919 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:48:33,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:48:33,920 INFO L85 PathProgramCache]: Analyzing trace with hash -1637262977, now seen corresponding path program 1 times [2024-11-07 01:48:33,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:48:33,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350722239] [2024-11-07 01:48:33,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:48:33,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:48:33,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:34,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:48:34,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:34,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-07 01:48:34,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:34,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 01:48:34,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:34,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-07 01:48:34,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:34,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 01:48:34,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:34,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 01:48:34,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:34,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 01:48:34,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:34,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-07 01:48:34,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:34,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-07 01:48:34,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:34,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-07 01:48:34,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:34,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-07 01:48:34,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:34,078 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 29 proven. 7 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-11-07 01:48:34,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:48:34,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350722239] [2024-11-07 01:48:34,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350722239] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 01:48:34,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1093983478] [2024-11-07 01:48:34,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:48:34,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 01:48:34,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 01:48:34,081 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 01:48:34,083 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-07 01:48:34,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:34,197 INFO L255 TraceCheckSpWp]: Trace formula consists of 546 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-07 01:48:34,200 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 01:48:34,272 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-07 01:48:34,272 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 01:48:34,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1093983478] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:48:34,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 01:48:34,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 8 [2024-11-07 01:48:34,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694575277] [2024-11-07 01:48:34,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:48:34,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 01:48:34,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:48:34,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 01:48:34,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-07 01:48:34,274 INFO L87 Difference]: Start difference. First operand 14846 states and 17875 transitions. Second operand has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-11-07 01:48:35,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:48:35,121 INFO L93 Difference]: Finished difference Result 26854 states and 33018 transitions. [2024-11-07 01:48:35,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 01:48:35,121 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 169 [2024-11-07 01:48:35,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:48:35,166 INFO L225 Difference]: With dead ends: 26854 [2024-11-07 01:48:35,166 INFO L226 Difference]: Without dead ends: 13044 [2024-11-07 01:48:35,185 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-07 01:48:35,186 INFO L432 NwaCegarLoop]: 192 mSDtfsCounter, 139 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 01:48:35,186 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 235 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 01:48:35,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13044 states. [2024-11-07 01:48:36,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13044 to 12900. [2024-11-07 01:48:36,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12900 states, 11133 states have (on average 1.192490793137519) internal successors, (13276), 11262 states have internal predecessors, (13276), 901 states have call successors, (901), 713 states have call predecessors, (901), 865 states have return successors, (1210), 926 states have call predecessors, (1210), 899 states have call successors, (1210) [2024-11-07 01:48:36,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12900 states to 12900 states and 15387 transitions. [2024-11-07 01:48:36,130 INFO L78 Accepts]: Start accepts. Automaton has 12900 states and 15387 transitions. Word has length 169 [2024-11-07 01:48:36,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:48:36,131 INFO L471 AbstractCegarLoop]: Abstraction has 12900 states and 15387 transitions. [2024-11-07 01:48:36,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-11-07 01:48:36,131 INFO L276 IsEmpty]: Start isEmpty. Operand 12900 states and 15387 transitions. [2024-11-07 01:48:36,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2024-11-07 01:48:36,137 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:48:36,137 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:48:36,149 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-07 01:48:36,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 01:48:36,338 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:48:36,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:48:36,338 INFO L85 PathProgramCache]: Analyzing trace with hash -1533230843, now seen corresponding path program 1 times [2024-11-07 01:48:36,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:48:36,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137587314] [2024-11-07 01:48:36,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:48:36,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:48:36,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:36,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:48:36,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:36,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-07 01:48:36,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:36,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 01:48:36,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:36,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-07 01:48:36,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:36,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 01:48:36,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:36,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-07 01:48:36,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:36,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 01:48:36,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:36,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-07 01:48:36,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:36,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-07 01:48:36,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:36,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-07 01:48:36,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:36,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-07 01:48:36,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:36,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-07 01:48:36,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:36,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2024-11-07 01:48:36,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:36,443 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 40 proven. 15 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2024-11-07 01:48:36,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:48:36,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137587314] [2024-11-07 01:48:36,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137587314] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 01:48:36,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1980253418] [2024-11-07 01:48:36,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:48:36,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 01:48:36,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 01:48:36,446 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 01:48:36,447 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-07 01:48:36,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:36,575 INFO L255 TraceCheckSpWp]: Trace formula consists of 641 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-07 01:48:36,579 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 01:48:36,624 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 133 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-11-07 01:48:36,624 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 01:48:36,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1980253418] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:48:36,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 01:48:36,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 6 [2024-11-07 01:48:36,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884628578] [2024-11-07 01:48:36,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:48:36,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 01:48:36,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:48:36,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 01:48:36,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 01:48:36,627 INFO L87 Difference]: Start difference. First operand 12900 states and 15387 transitions. Second operand has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-07 01:48:37,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:48:37,522 INFO L93 Difference]: Finished difference Result 22895 states and 27781 transitions. [2024-11-07 01:48:37,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 01:48:37,522 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 204 [2024-11-07 01:48:37,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:48:37,557 INFO L225 Difference]: With dead ends: 22895 [2024-11-07 01:48:37,557 INFO L226 Difference]: Without dead ends: 12732 [2024-11-07 01:48:37,567 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 229 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 01:48:37,568 INFO L432 NwaCegarLoop]: 294 mSDtfsCounter, 139 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 01:48:37,568 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 447 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 01:48:37,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12732 states. [2024-11-07 01:48:38,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12732 to 12708. [2024-11-07 01:48:38,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12708 states, 10941 states have (on average 1.1715565304816744) internal successors, (12818), 11070 states have internal predecessors, (12818), 901 states have call successors, (901), 713 states have call predecessors, (901), 865 states have return successors, (1210), 926 states have call predecessors, (1210), 899 states have call successors, (1210) [2024-11-07 01:48:38,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12708 states to 12708 states and 14929 transitions. [2024-11-07 01:48:38,422 INFO L78 Accepts]: Start accepts. Automaton has 12708 states and 14929 transitions. Word has length 204 [2024-11-07 01:48:38,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:48:38,422 INFO L471 AbstractCegarLoop]: Abstraction has 12708 states and 14929 transitions. [2024-11-07 01:48:38,422 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-07 01:48:38,422 INFO L276 IsEmpty]: Start isEmpty. Operand 12708 states and 14929 transitions. [2024-11-07 01:48:38,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-11-07 01:48:38,429 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:48:38,429 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:48:38,442 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-07 01:48:38,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2024-11-07 01:48:38,630 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:48:38,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:48:38,630 INFO L85 PathProgramCache]: Analyzing trace with hash 1236898553, now seen corresponding path program 1 times [2024-11-07 01:48:38,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:48:38,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186196379] [2024-11-07 01:48:38,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:48:38,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:48:38,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:38,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:48:38,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:38,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-07 01:48:38,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:38,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 01:48:38,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:38,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-07 01:48:38,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:38,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 01:48:38,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:38,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-07 01:48:38,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:38,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 01:48:38,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:38,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-07 01:48:38,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:38,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-07 01:48:38,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:38,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-07 01:48:38,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:38,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-07 01:48:38,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:38,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-07 01:48:38,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:38,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2024-11-07 01:48:38,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:38,734 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 64 proven. 19 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2024-11-07 01:48:38,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:48:38,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186196379] [2024-11-07 01:48:38,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186196379] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 01:48:38,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1845379482] [2024-11-07 01:48:38,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:48:38,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 01:48:38,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 01:48:38,737 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 01:48:38,739 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-07 01:48:38,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:38,864 INFO L255 TraceCheckSpWp]: Trace formula consists of 645 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-07 01:48:38,867 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 01:48:38,884 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 123 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-11-07 01:48:38,884 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 01:48:38,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1845379482] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:48:38,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 01:48:38,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 6 [2024-11-07 01:48:38,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653488139] [2024-11-07 01:48:38,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:48:38,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 01:48:38,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:48:38,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 01:48:38,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 01:48:38,886 INFO L87 Difference]: Start difference. First operand 12708 states and 14929 transitions. Second operand has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 3 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-07 01:48:39,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:48:39,759 INFO L93 Difference]: Finished difference Result 22195 states and 26503 transitions. [2024-11-07 01:48:39,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 01:48:39,760 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 3 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 206 [2024-11-07 01:48:39,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:48:39,800 INFO L225 Difference]: With dead ends: 22195 [2024-11-07 01:48:39,800 INFO L226 Difference]: Without dead ends: 12224 [2024-11-07 01:48:39,813 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 231 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 01:48:39,813 INFO L432 NwaCegarLoop]: 282 mSDtfsCounter, 159 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 01:48:39,813 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 434 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 01:48:39,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12224 states. [2024-11-07 01:48:40,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12224 to 12212. [2024-11-07 01:48:40,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12212 states, 10501 states have (on average 1.1555089991429388) internal successors, (12134), 10614 states have internal predecessors, (12134), 877 states have call successors, (877), 689 states have call predecessors, (877), 833 states have return successors, (1178), 910 states have call predecessors, (1178), 875 states have call successors, (1178) [2024-11-07 01:48:40,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12212 states to 12212 states and 14189 transitions. [2024-11-07 01:48:40,642 INFO L78 Accepts]: Start accepts. Automaton has 12212 states and 14189 transitions. Word has length 206 [2024-11-07 01:48:40,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:48:40,643 INFO L471 AbstractCegarLoop]: Abstraction has 12212 states and 14189 transitions. [2024-11-07 01:48:40,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 3 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-07 01:48:40,643 INFO L276 IsEmpty]: Start isEmpty. Operand 12212 states and 14189 transitions. [2024-11-07 01:48:40,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2024-11-07 01:48:40,650 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:48:40,650 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:48:40,663 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-07 01:48:40,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 01:48:40,851 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:48:40,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:48:40,851 INFO L85 PathProgramCache]: Analyzing trace with hash 779520488, now seen corresponding path program 1 times [2024-11-07 01:48:40,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:48:40,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402593393] [2024-11-07 01:48:40,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:48:40,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:48:40,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:40,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:48:40,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:40,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-07 01:48:40,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:40,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 01:48:40,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:40,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-07 01:48:40,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:40,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 01:48:40,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:40,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-07 01:48:40,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:40,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 01:48:40,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:40,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-07 01:48:40,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:40,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-07 01:48:40,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:40,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-07 01:48:40,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:40,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-07 01:48:40,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:40,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-07 01:48:40,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:40,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2024-11-07 01:48:40,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:40,958 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 56 proven. 41 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2024-11-07 01:48:40,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:48:40,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402593393] [2024-11-07 01:48:40,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402593393] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 01:48:40,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [661963068] [2024-11-07 01:48:40,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:48:40,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 01:48:40,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 01:48:40,961 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 01:48:40,964 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-07 01:48:41,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:41,087 INFO L255 TraceCheckSpWp]: Trace formula consists of 647 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-07 01:48:41,091 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 01:48:41,161 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 150 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-11-07 01:48:41,161 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 01:48:41,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [661963068] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:48:41,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 01:48:41,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 6 [2024-11-07 01:48:41,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050723744] [2024-11-07 01:48:41,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:48:41,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 01:48:41,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:48:41,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 01:48:41,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 01:48:41,163 INFO L87 Difference]: Start difference. First operand 12212 states and 14189 transitions. Second operand has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2024-11-07 01:48:42,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:48:42,018 INFO L93 Difference]: Finished difference Result 21117 states and 24850 transitions. [2024-11-07 01:48:42,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 01:48:42,018 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 207 [2024-11-07 01:48:42,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:48:42,049 INFO L225 Difference]: With dead ends: 21117 [2024-11-07 01:48:42,049 INFO L226 Difference]: Without dead ends: 12236 [2024-11-07 01:48:42,058 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 233 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 01:48:42,058 INFO L432 NwaCegarLoop]: 275 mSDtfsCounter, 109 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 01:48:42,058 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 444 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 01:48:42,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12236 states. [2024-11-07 01:48:42,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12236 to 12208. [2024-11-07 01:48:42,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12208 states, 10497 states have (on average 1.1370867867009622) internal successors, (11936), 10610 states have internal predecessors, (11936), 877 states have call successors, (877), 689 states have call predecessors, (877), 833 states have return successors, (1178), 910 states have call predecessors, (1178), 875 states have call successors, (1178) [2024-11-07 01:48:42,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12208 states to 12208 states and 13991 transitions. [2024-11-07 01:48:42,876 INFO L78 Accepts]: Start accepts. Automaton has 12208 states and 13991 transitions. Word has length 207 [2024-11-07 01:48:42,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:48:42,877 INFO L471 AbstractCegarLoop]: Abstraction has 12208 states and 13991 transitions. [2024-11-07 01:48:42,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2024-11-07 01:48:42,877 INFO L276 IsEmpty]: Start isEmpty. Operand 12208 states and 13991 transitions. [2024-11-07 01:48:42,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-11-07 01:48:42,882 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:48:42,882 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:48:42,895 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-07 01:48:43,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2024-11-07 01:48:43,083 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:48:43,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:48:43,083 INFO L85 PathProgramCache]: Analyzing trace with hash -404906680, now seen corresponding path program 1 times [2024-11-07 01:48:43,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:48:43,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128114747] [2024-11-07 01:48:43,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:48:43,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:48:43,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:43,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:48:43,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:43,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-07 01:48:43,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:43,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 01:48:43,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:43,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-07 01:48:43,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:43,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 01:48:43,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:43,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-07 01:48:43,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:43,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 01:48:43,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:43,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-07 01:48:43,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:43,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-07 01:48:43,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:43,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-07 01:48:43,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:43,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-11-07 01:48:43,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:43,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-07 01:48:43,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:43,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-07 01:48:43,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:43,251 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2024-11-07 01:48:43,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:48:43,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128114747] [2024-11-07 01:48:43,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128114747] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:48:43,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:48:43,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:48:43,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54663190] [2024-11-07 01:48:43,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:48:43,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:48:43,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:48:43,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:48:43,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:48:43,254 INFO L87 Difference]: Start difference. First operand 12208 states and 13991 transitions. Second operand has 7 states, 7 states have (on average 16.857142857142858) internal successors, (118), 5 states have internal predecessors, (118), 6 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) [2024-11-07 01:48:46,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:48:46,427 INFO L93 Difference]: Finished difference Result 40475 states and 47272 transitions. [2024-11-07 01:48:46,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-07 01:48:46,427 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.857142857142858) internal successors, (118), 5 states have internal predecessors, (118), 6 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) Word has length 209 [2024-11-07 01:48:46,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:48:46,549 INFO L225 Difference]: With dead ends: 40475 [2024-11-07 01:48:46,549 INFO L226 Difference]: Without dead ends: 33335 [2024-11-07 01:48:46,573 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2024-11-07 01:48:46,574 INFO L432 NwaCegarLoop]: 289 mSDtfsCounter, 975 mSDsluCounter, 768 mSDsCounter, 0 mSdLazyCounter, 1132 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1010 SdHoareTripleChecker+Valid, 1057 SdHoareTripleChecker+Invalid, 1237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 1132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-07 01:48:46,574 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1010 Valid, 1057 Invalid, 1237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 1132 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-07 01:48:46,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33335 states. [2024-11-07 01:48:48,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33335 to 24053. [2024-11-07 01:48:48,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24053 states, 20643 states have (on average 1.1415007508598556) internal successors, (23564), 20906 states have internal predecessors, (23564), 1732 states have call successors, (1732), 1355 states have call predecessors, (1732), 1677 states have return successors, (2430), 1793 states have call predecessors, (2430), 1730 states have call successors, (2430) [2024-11-07 01:48:48,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24053 states to 24053 states and 27726 transitions. [2024-11-07 01:48:48,605 INFO L78 Accepts]: Start accepts. Automaton has 24053 states and 27726 transitions. Word has length 209 [2024-11-07 01:48:48,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:48:48,606 INFO L471 AbstractCegarLoop]: Abstraction has 24053 states and 27726 transitions. [2024-11-07 01:48:48,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.857142857142858) internal successors, (118), 5 states have internal predecessors, (118), 6 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) [2024-11-07 01:48:48,606 INFO L276 IsEmpty]: Start isEmpty. Operand 24053 states and 27726 transitions. [2024-11-07 01:48:48,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2024-11-07 01:48:48,612 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:48:48,612 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:48:48,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-11-07 01:48:48,612 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:48:48,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:48:48,613 INFO L85 PathProgramCache]: Analyzing trace with hash 1948098800, now seen corresponding path program 1 times [2024-11-07 01:48:48,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:48:48,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950823050] [2024-11-07 01:48:48,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:48:48,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:48:48,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:48,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:48:48,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:48,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-07 01:48:48,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:48,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 01:48:48,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:48,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-07 01:48:48,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:48,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 01:48:48,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:48,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-07 01:48:48,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:48,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 01:48:48,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:48,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-07 01:48:48,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:48,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-07 01:48:48,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:48,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-07 01:48:48,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:48,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-11-07 01:48:48,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:48,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-07 01:48:48,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:48,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-07 01:48:48,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:48,700 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2024-11-07 01:48:48,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:48:48,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950823050] [2024-11-07 01:48:48,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950823050] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:48:48,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:48:48,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 01:48:48,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472204539] [2024-11-07 01:48:48,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:48:48,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 01:48:48,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:48:48,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 01:48:48,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 01:48:48,703 INFO L87 Difference]: Start difference. First operand 24053 states and 27726 transitions. Second operand has 5 states, 5 states have (on average 20.8) internal successors, (104), 3 states have internal predecessors, (104), 3 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-07 01:48:51,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:48:51,089 INFO L93 Difference]: Finished difference Result 45184 states and 52467 transitions. [2024-11-07 01:48:51,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 01:48:51,089 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.8) internal successors, (104), 3 states have internal predecessors, (104), 3 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) Word has length 213 [2024-11-07 01:48:51,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:48:51,171 INFO L225 Difference]: With dead ends: 45184 [2024-11-07 01:48:51,171 INFO L226 Difference]: Without dead ends: 26477 [2024-11-07 01:48:51,197 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-07 01:48:51,197 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 154 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 01:48:51,197 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 362 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 274 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 01:48:51,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26477 states. [2024-11-07 01:48:53,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26477 to 24073. [2024-11-07 01:48:53,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24073 states, 20663 states have (on average 1.1413637903499008) internal successors, (23584), 20926 states have internal predecessors, (23584), 1732 states have call successors, (1732), 1355 states have call predecessors, (1732), 1677 states have return successors, (2430), 1793 states have call predecessors, (2430), 1730 states have call successors, (2430) [2024-11-07 01:48:53,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24073 states to 24073 states and 27746 transitions. [2024-11-07 01:48:53,157 INFO L78 Accepts]: Start accepts. Automaton has 24073 states and 27746 transitions. Word has length 213 [2024-11-07 01:48:53,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:48:53,158 INFO L471 AbstractCegarLoop]: Abstraction has 24073 states and 27746 transitions. [2024-11-07 01:48:53,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.8) internal successors, (104), 3 states have internal predecessors, (104), 3 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-07 01:48:53,158 INFO L276 IsEmpty]: Start isEmpty. Operand 24073 states and 27746 transitions. [2024-11-07 01:48:53,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2024-11-07 01:48:53,164 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:48:53,164 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:48:53,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-11-07 01:48:53,164 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:48:53,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:48:53,164 INFO L85 PathProgramCache]: Analyzing trace with hash 1490559973, now seen corresponding path program 1 times [2024-11-07 01:48:53,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:48:53,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983635964] [2024-11-07 01:48:53,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:48:53,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:48:53,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 01:48:53,177 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 01:48:53,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 01:48:53,304 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 01:48:53,304 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 01:48:53,305 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location error2Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2024-11-07 01:48:53,306 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location error1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-07 01:48:53,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-11-07 01:48:53,309 INFO L407 BasicCegarLoop]: Path program 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] [2024-11-07 01:48:53,512 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 01:48:53,515 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 01:48:53 BoogieIcfgContainer [2024-11-07 01:48:53,515 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 01:48:53,516 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 01:48:53,516 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 01:48:53,516 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 01:48:53,517 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:47:43" (3/4) ... [2024-11-07 01:48:53,517 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-07 01:48:53,696 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-07 01:48:53,696 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 01:48:53,697 INFO L158 Benchmark]: Toolchain (without parser) took 71323.62ms. Allocated memory was 117.4MB in the beginning and 4.6GB in the end (delta: 4.5GB). Free memory was 91.7MB in the beginning and 3.0GB in the end (delta: -2.9GB). Peak memory consumption was 1.6GB. Max. memory is 16.1GB. [2024-11-07 01:48:53,697 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 117.4MB. Free memory is still 81.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 01:48:53,699 INFO L158 Benchmark]: CACSL2BoogieTranslator took 412.00ms. Allocated memory is still 117.4MB. Free memory was 91.6MB in the beginning and 73.7MB in the end (delta: 17.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 01:48:53,699 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.44ms. Allocated memory is still 117.4MB. Free memory was 73.7MB in the beginning and 71.1MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 01:48:53,699 INFO L158 Benchmark]: Boogie Preprocessor took 58.86ms. Allocated memory is still 117.4MB. Free memory was 71.1MB in the beginning and 68.0MB in the end (delta: 3.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 01:48:53,699 INFO L158 Benchmark]: RCFGBuilder took 775.60ms. Allocated memory is still 117.4MB. Free memory was 68.0MB in the beginning and 78.6MB in the end (delta: -10.6MB). Peak memory consumption was 21.8MB. Max. memory is 16.1GB. [2024-11-07 01:48:53,699 INFO L158 Benchmark]: TraceAbstraction took 69827.58ms. Allocated memory was 117.4MB in the beginning and 4.6GB in the end (delta: 4.5GB). Free memory was 78.1MB in the beginning and 3.0GB in the end (delta: -2.9GB). Peak memory consumption was 1.6GB. Max. memory is 16.1GB. [2024-11-07 01:48:53,700 INFO L158 Benchmark]: Witness Printer took 180.55ms. Allocated memory is still 4.6GB. Free memory was 3.0GB in the beginning and 3.0GB in the end (delta: 37.7MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-11-07 01:48:53,701 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.26ms. Allocated memory is still 117.4MB. Free memory is still 81.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 412.00ms. Allocated memory is still 117.4MB. Free memory was 91.6MB in the beginning and 73.7MB in the end (delta: 17.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 62.44ms. Allocated memory is still 117.4MB. Free memory was 73.7MB in the beginning and 71.1MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 58.86ms. Allocated memory is still 117.4MB. Free memory was 71.1MB in the beginning and 68.0MB in the end (delta: 3.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 775.60ms. Allocated memory is still 117.4MB. Free memory was 68.0MB in the beginning and 78.6MB in the end (delta: -10.6MB). Peak memory consumption was 21.8MB. Max. memory is 16.1GB. * TraceAbstraction took 69827.58ms. Allocated memory was 117.4MB in the beginning and 4.6GB in the end (delta: 4.5GB). Free memory was 78.1MB in the beginning and 3.0GB in the end (delta: -2.9GB). Peak memory consumption was 1.6GB. Max. memory is 16.1GB. * Witness Printer took 180.55ms. Allocated memory is still 4.6GB. Free memory was 3.0GB in the beginning and 3.0GB in the end (delta: 37.7MB). Peak memory consumption was 33.6MB. 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 - CounterExampleResult [Line: 599]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L32] int fast_clk_edge ; [L33] int slow_clk_edge ; [L34] int q_buf_0 ; [L35] int q_free ; [L36] int q_read_ev ; [L37] int q_write_ev ; [L38] int q_req_up ; [L39] int q_ev ; [L60] int p_num_write ; [L61] int p_last_write ; [L62] int p_dw_st ; [L63] int p_dw_pc ; [L64] int p_dw_i ; [L65] int c_num_read ; [L66] int c_last_read ; [L67] int c_dr_st ; [L68] int c_dr_pc ; [L69] int c_dr_i ; [L202] static int a_t ; [L352] static int t = 0; [L603] int m_pc = 0; [L604] int t1_pc = 0; [L605] int t2_pc = 0; [L606] int m_st ; [L607] int t1_st ; [L608] int t2_st ; [L609] int m_i ; [L610] int t1_i ; [L611] int t2_i ; [L612] int M_E = 2; [L613] int T1_E = 2; [L614] int T2_E = 2; [L615] int E_M = 2; [L616] int E_1 = 2; [L617] int E_2 = 2; [L622] int token ; [L624] int local ; VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t=0, token=0] [L1202] COND FALSE !(__VERIFIER_nondet_int()) [L1205] CALL main2() [L1189] int __retres1 ; [L1193] CALL init_model2() [L1103] m_i = 1 [L1104] t1_i = 1 [L1105] t2_i = 1 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t=0, token=0] [L1193] RET init_model2() [L1194] CALL start_simulation2() [L1130] int kernel_st ; [L1131] int tmp ; [L1132] int tmp___0 ; [L1136] kernel_st = 0 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t=0, token=0] [L1137] FCALL update_channels2() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t=0, token=0] [L1138] CALL init_threads2() [L822] COND TRUE m_i == 1 [L823] m_st = 0 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t=0, token=0] [L827] COND TRUE t1_i == 1 [L828] t1_st = 0 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t=0, token=0] [L832] COND TRUE t2_i == 1 [L833] t2_st = 0 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t=0, token=0] [L1138] RET init_threads2() [L1139] CALL fire_delta_events2() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t=0, token=0] [L935] COND FALSE !(M_E == 0) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t=0, token=0] [L940] COND FALSE !(T1_E == 0) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t=0, token=0] [L945] COND FALSE !(T2_E == 0) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t=0, token=0] [L950] COND FALSE !(E_M == 0) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t=0, token=0] [L955] COND FALSE !(E_1 == 0) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t=0, token=0] [L960] COND FALSE !(E_2 == 0) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t=0, token=0] [L1139] RET fire_delta_events2() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t=0, token=0] [L1140] CALL activate_threads2() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t=0, token=0] [L1008] int tmp ; [L1009] int tmp___0 ; [L1010] int tmp___1 ; [L1014] CALL, EXPR is_master_triggered() [L754] int __retres1 ; VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t=0, token=0] [L757] COND FALSE !(m_pc == 1) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t=0, token=0] [L767] __retres1 = 0 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t=0, token=0] [L769] return (__retres1); VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \result=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t=0, token=0] [L1014] RET, EXPR is_master_triggered() [L1014] tmp = is_master_triggered() [L1016] COND FALSE !(\read(tmp)) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t=0, token=0] [L1022] CALL, EXPR is_transmit1_triggered() [L773] int __retres1 ; VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t=0, token=0] [L776] COND FALSE !(t1_pc == 1) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t=0, token=0] [L786] __retres1 = 0 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t=0, token=0] [L788] return (__retres1); VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \result=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t=0, token=0] [L1022] RET, EXPR is_transmit1_triggered() [L1022] tmp___0 = is_transmit1_triggered() [L1024] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t=0, token=0] [L1030] CALL, EXPR is_transmit2_triggered() [L792] int __retres1 ; VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t=0, token=0] [L795] COND FALSE !(t2_pc == 1) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t=0, token=0] [L805] __retres1 = 0 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t=0, token=0] [L807] return (__retres1); VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \result=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t=0, token=0] [L1030] RET, EXPR is_transmit2_triggered() [L1030] tmp___1 = is_transmit2_triggered() [L1032] COND FALSE !(\read(tmp___1)) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t=0, token=0] [L1140] RET activate_threads2() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t=0, token=0] [L1141] CALL reset_delta_events2() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t=0, token=0] [L973] COND FALSE !(M_E == 1) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t=0, token=0] [L978] COND FALSE !(T1_E == 1) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t=0, token=0] [L983] COND FALSE !(T2_E == 1) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t=0, token=0] [L988] COND FALSE !(E_M == 1) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t=0, token=0] [L993] COND FALSE !(E_1 == 1) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t=0, token=0] [L998] COND FALSE !(E_2 == 1) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t=0, token=0] [L1141] RET reset_delta_events2() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t=0, token=0] [L1144] COND TRUE 1 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t=0, token=0] [L1147] kernel_st = 1 [L1148] CALL eval2() [L868] int tmp ; VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t=0, token=0] [L872] COND TRUE 1 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t=0, token=0] [L875] CALL, EXPR exists_runnable_thread2() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t=0, token=0] [L842] int __retres1 ; VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t=0, token=0] [L845] COND TRUE m_st == 0 [L846] __retres1 = 1 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t=0, token=0] [L863] return (__retres1); VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \result=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t=0, token=0] [L875] RET, EXPR exists_runnable_thread2() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t=0, token=0] [L875] tmp = exists_runnable_thread2() [L877] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t=0, token=0] [L882] COND TRUE m_st == 0 [L883] int tmp_ndt_1; [L884] tmp_ndt_1 = __VERIFIER_nondet_int() [L885] COND FALSE !(\read(tmp_ndt_1)) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t=0, token=0] [L896] COND TRUE t1_st == 0 [L897] int tmp_ndt_2; [L898] tmp_ndt_2 = __VERIFIER_nondet_int() [L899] COND TRUE \read(tmp_ndt_2) [L901] t1_st = 1 [L902] CALL transmit1() [L685] COND TRUE t1_pc == 0 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=0, t1_st=1, t2_i=1, t2_pc=0, t2_st=0, t=0, token=0] [L696] COND TRUE 1 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=0, t1_st=1, t2_i=1, t2_pc=0, t2_st=0, t=0, token=0] [L698] t1_pc = 1 [L699] t1_st = 2 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=0, t2_st=0, t=0, token=0] [L902] RET transmit1() [L910] COND TRUE t2_st == 0 [L911] int tmp_ndt_3; [L912] tmp_ndt_3 = __VERIFIER_nondet_int() [L913] COND TRUE \read(tmp_ndt_3) [L915] t2_st = 1 [L916] CALL transmit2() [L721] COND TRUE t2_pc == 0 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=0, t2_st=1, t=0, token=0] [L732] COND TRUE 1 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=0, t2_st=1, t=0, token=0] [L734] t2_pc = 1 [L735] t2_st = 2 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, t=0, token=0] [L916] RET transmit2() [L872] COND TRUE 1 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, t=0, token=0] [L875] CALL, EXPR exists_runnable_thread2() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, t=0, token=0] [L842] int __retres1 ; VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, t=0, token=0] [L845] COND TRUE m_st == 0 [L846] __retres1 = 1 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, t=0, token=0] [L863] return (__retres1); VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \result=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, t=0, token=0] [L875] RET, EXPR exists_runnable_thread2() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, t=0, token=0] [L875] tmp = exists_runnable_thread2() [L877] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, t=0, token=0] [L882] COND TRUE m_st == 0 [L883] int tmp_ndt_1; [L884] tmp_ndt_1 = __VERIFIER_nondet_int() [L885] COND TRUE \read(tmp_ndt_1) [L887] m_st = 1 [L888] CALL master() [L627] int tmp_var = __VERIFIER_nondet_int(); [L629] COND TRUE m_pc == 0 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, t=0, tmp_var=0, token=0] [L640] COND TRUE 1 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, t=0, tmp_var=0, token=0] [L643] token = __VERIFIER_nondet_int() [L644] local = token [L645] E_1 = 1 VAL [E_1=1, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, t=0, tmp_var=0, token=0] [L646] CALL immediate_notify() VAL [E_1=1, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, t=0, token=0] [L1046] CALL activate_threads2() VAL [E_1=1, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, t=0, token=0] [L1008] int tmp ; [L1009] int tmp___0 ; [L1010] int tmp___1 ; [L1014] CALL, EXPR is_master_triggered() [L754] int __retres1 ; VAL [E_1=1, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, t=0, token=0] [L757] COND FALSE !(m_pc == 1) VAL [E_1=1, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, t=0, token=0] [L767] __retres1 = 0 VAL [E_1=1, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, t=0, token=0] [L769] return (__retres1); VAL [E_1=1, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \result=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, t=0, token=0] [L1014] RET, EXPR is_master_triggered() [L1014] tmp = is_master_triggered() [L1016] COND FALSE !(\read(tmp)) VAL [E_1=1, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, t=0, token=0] [L1022] CALL, EXPR is_transmit1_triggered() [L773] int __retres1 ; VAL [E_1=1, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, t=0, token=0] [L776] COND TRUE t1_pc == 1 VAL [E_1=1, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, t=0, token=0] [L777] COND TRUE E_1 == 1 [L778] __retres1 = 1 VAL [E_1=1, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, t=0, token=0] [L788] return (__retres1); VAL [E_1=1, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \result=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, t=0, token=0] [L1022] RET, EXPR is_transmit1_triggered() [L1022] tmp___0 = is_transmit1_triggered() [L1024] COND TRUE \read(tmp___0) [L1025] t1_st = 0 VAL [E_1=1, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=1, t2_st=2, t=0, token=0] [L1030] CALL, EXPR is_transmit2_triggered() [L792] int __retres1 ; VAL [E_1=1, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=1, t2_st=2, t=0, token=0] [L795] COND TRUE t2_pc == 1 VAL [E_1=1, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=1, t2_st=2, t=0, token=0] [L796] COND FALSE !(E_2 == 1) VAL [E_1=1, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=1, t2_st=2, t=0, token=0] [L805] __retres1 = 0 VAL [E_1=1, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=1, t2_st=2, t=0, token=0] [L807] return (__retres1); VAL [E_1=1, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \result=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=1, t2_st=2, t=0, token=0] [L1030] RET, EXPR is_transmit2_triggered() [L1030] tmp___1 = is_transmit2_triggered() [L1032] COND FALSE !(\read(tmp___1)) VAL [E_1=1, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=1, t2_st=2, t=0, token=0] [L1046] RET activate_threads2() VAL [E_1=1, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=1, t2_st=2, t=0, token=0] [L646] RET immediate_notify() VAL [E_1=1, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=1, t2_st=2, t=0, tmp_var=0, token=0] [L647] E_1 = 2 [L648] m_pc = 1 [L649] m_st = 2 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=1, t2_st=2, t=0, tmp_var=0, token=0] [L888] RET master() [L896] COND TRUE t1_st == 0 [L897] int tmp_ndt_2; [L898] tmp_ndt_2 = __VERIFIER_nondet_int() [L899] COND TRUE \read(tmp_ndt_2) [L901] t1_st = 1 [L902] CALL transmit1() [L685] COND FALSE !(t1_pc == 0) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2, t=0, token=0] [L688] COND TRUE t1_pc == 1 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2, t=0, token=0] [L704] token += 1 [L705] E_2 = 1 VAL [E_1=2, E_2=1, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2, t=0, token=1] [L706] CALL immediate_notify() VAL [E_1=2, E_2=1, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2, t=0, token=1] [L1046] CALL activate_threads2() VAL [E_1=2, E_2=1, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2, t=0, token=1] [L1008] int tmp ; [L1009] int tmp___0 ; [L1010] int tmp___1 ; [L1014] CALL, EXPR is_master_triggered() [L754] int __retres1 ; VAL [E_1=2, E_2=1, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2, t=0, token=1] [L757] COND TRUE m_pc == 1 VAL [E_1=2, E_2=1, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2, t=0, token=1] [L758] COND FALSE !(E_M == 1) VAL [E_1=2, E_2=1, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2, t=0, token=1] [L767] __retres1 = 0 VAL [E_1=2, E_2=1, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2, t=0, token=1] [L769] return (__retres1); VAL [E_1=2, E_2=1, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \result=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2, t=0, token=1] [L1014] RET, EXPR is_master_triggered() [L1014] tmp = is_master_triggered() [L1016] COND FALSE !(\read(tmp)) VAL [E_1=2, E_2=1, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2, t=0, token=1] [L1022] CALL, EXPR is_transmit1_triggered() [L773] int __retres1 ; VAL [E_1=2, E_2=1, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2, t=0, token=1] [L776] COND TRUE t1_pc == 1 VAL [E_1=2, E_2=1, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2, t=0, token=1] [L777] COND FALSE !(E_1 == 1) VAL [E_1=2, E_2=1, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2, t=0, token=1] [L786] __retres1 = 0 VAL [E_1=2, E_2=1, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2, t=0, token=1] [L788] return (__retres1); VAL [E_1=2, E_2=1, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \result=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2, t=0, token=1] [L1022] RET, EXPR is_transmit1_triggered() [L1022] tmp___0 = is_transmit1_triggered() [L1024] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_2=1, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2, t=0, token=1] [L1030] CALL, EXPR is_transmit2_triggered() [L792] int __retres1 ; VAL [E_1=2, E_2=1, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2, t=0, token=1] [L795] COND TRUE t2_pc == 1 VAL [E_1=2, E_2=1, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2, t=0, token=1] [L796] COND TRUE E_2 == 1 [L797] __retres1 = 1 VAL [E_1=2, E_2=1, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2, t=0, token=1] [L807] return (__retres1); VAL [E_1=2, E_2=1, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \result=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2, t=0, token=1] [L1030] RET, EXPR is_transmit2_triggered() [L1030] tmp___1 = is_transmit2_triggered() [L1032] COND TRUE \read(tmp___1) [L1033] t2_st = 0 VAL [E_1=2, E_2=1, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=0, t=0, token=1] [L1046] RET activate_threads2() VAL [E_1=2, E_2=1, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=0, t=0, token=1] [L706] RET immediate_notify() VAL [E_1=2, E_2=1, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=0, t=0, token=1] [L707] E_2 = 2 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=0, t=0, token=1] [L696] COND TRUE 1 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=0, t=0, token=1] [L698] t1_pc = 1 [L699] t1_st = 2 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=0, t=0, token=1] [L902] RET transmit1() [L910] COND TRUE t2_st == 0 [L911] int tmp_ndt_3; [L912] tmp_ndt_3 = __VERIFIER_nondet_int() [L913] COND TRUE \read(tmp_ndt_3) [L915] t2_st = 1 [L916] CALL transmit2() [L721] COND FALSE !(t2_pc == 0) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, t=0, token=1] [L724] COND TRUE t2_pc == 1 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, t=0, token=1] [L740] token += 1 [L741] E_M = 1 VAL [E_1=2, E_2=2, E_M=1, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, t=0, token=2] [L742] CALL immediate_notify() VAL [E_1=2, E_2=2, E_M=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, t=0, token=2] [L1046] CALL activate_threads2() VAL [E_1=2, E_2=2, E_M=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, t=0, token=2] [L1008] int tmp ; [L1009] int tmp___0 ; [L1010] int tmp___1 ; [L1014] CALL, EXPR is_master_triggered() [L754] int __retres1 ; VAL [E_1=2, E_2=2, E_M=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, t=0, token=2] [L757] COND TRUE m_pc == 1 VAL [E_1=2, E_2=2, E_M=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, t=0, token=2] [L758] COND TRUE E_M == 1 [L759] __retres1 = 1 VAL [E_1=2, E_2=2, E_M=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, t=0, token=2] [L769] return (__retres1); VAL [E_1=2, E_2=2, E_M=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \result=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, t=0, token=2] [L1014] RET, EXPR is_master_triggered() [L1014] tmp = is_master_triggered() [L1016] COND TRUE \read(tmp) [L1017] m_st = 0 VAL [E_1=2, E_2=2, E_M=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, t=0, token=2] [L1022] CALL, EXPR is_transmit1_triggered() [L773] int __retres1 ; VAL [E_1=2, E_2=2, E_M=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, t=0, token=2] [L776] COND TRUE t1_pc == 1 VAL [E_1=2, E_2=2, E_M=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, t=0, token=2] [L777] COND FALSE !(E_1 == 1) VAL [E_1=2, E_2=2, E_M=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, t=0, token=2] [L786] __retres1 = 0 VAL [E_1=2, E_2=2, E_M=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, t=0, token=2] [L788] return (__retres1); VAL [E_1=2, E_2=2, E_M=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \result=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, t=0, token=2] [L1022] RET, EXPR is_transmit1_triggered() [L1022] tmp___0 = is_transmit1_triggered() [L1024] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_2=2, E_M=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, t=0, token=2] [L1030] CALL, EXPR is_transmit2_triggered() [L792] int __retres1 ; VAL [E_1=2, E_2=2, E_M=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, t=0, token=2] [L795] COND TRUE t2_pc == 1 VAL [E_1=2, E_2=2, E_M=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, t=0, token=2] [L796] COND FALSE !(E_2 == 1) VAL [E_1=2, E_2=2, E_M=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, t=0, token=2] [L805] __retres1 = 0 VAL [E_1=2, E_2=2, E_M=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, t=0, token=2] [L807] return (__retres1); VAL [E_1=2, E_2=2, E_M=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \result=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, t=0, token=2] [L1030] RET, EXPR is_transmit2_triggered() [L1030] tmp___1 = is_transmit2_triggered() [L1032] COND FALSE !(\read(tmp___1)) VAL [E_1=2, E_2=2, E_M=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, t=0, token=2] [L1046] RET activate_threads2() VAL [E_1=2, E_2=2, E_M=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, t=0, token=2] [L742] RET immediate_notify() VAL [E_1=2, E_2=2, E_M=1, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, t=0, token=2] [L743] E_M = 2 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, t=0, token=2] [L732] COND TRUE 1 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, t=0, token=2] [L734] t2_pc = 1 [L735] t2_st = 2 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, t=0, token=2] [L916] RET transmit2() [L872] COND TRUE 1 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, t=0, token=2] [L875] CALL, EXPR exists_runnable_thread2() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, t=0, token=2] [L842] int __retres1 ; VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, t=0, token=2] [L845] COND TRUE m_st == 0 [L846] __retres1 = 1 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, t=0, token=2] [L863] return (__retres1); VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \result=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, t=0, token=2] [L875] RET, EXPR exists_runnable_thread2() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, t=0, token=2] [L875] tmp = exists_runnable_thread2() [L877] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, t=0, token=2] [L882] COND TRUE m_st == 0 [L883] int tmp_ndt_1; [L884] tmp_ndt_1 = __VERIFIER_nondet_int() [L885] COND TRUE \read(tmp_ndt_1) [L887] m_st = 1 [L888] CALL master() [L627] int tmp_var = __VERIFIER_nondet_int(); [L629] COND FALSE !(m_pc == 0) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, t=0, tmp_var=5, token=2] [L632] COND TRUE m_pc == 1 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, t=0, tmp_var=5, token=2] [L654] COND FALSE !(token != local + 2) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, t=0, tmp_var=5, token=2] [L659] COND TRUE tmp_var <= 5 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, t=0, tmp_var=5, token=2] [L660] COND TRUE tmp_var >= 5 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, t=0, tmp_var=5, token=2] [L665] COND TRUE tmp_var <= 5 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, t=0, tmp_var=5, token=2] [L666] COND TRUE tmp_var >= 5 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, t=0, tmp_var=5, token=2] [L667] COND TRUE tmp_var == 5 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, t=0, token=2] [L668] CALL error2() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, t=0, token=2] [L599] reach_error() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, t=0, token=2] - UnprovableResult [Line: 27]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 16 procedures, 260 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 69.6s, OverallIterations: 36, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.2s, AutomataDifference: 41.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 18230 SdHoareTripleChecker+Valid, 15.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 17852 mSDsluCounter, 22806 SdHoareTripleChecker+Invalid, 12.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 16036 mSDsCounter, 2868 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 18654 IncrementalHoareTripleChecker+Invalid, 21522 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2868 mSolverCounterUnsat, 6770 mSDtfsCounter, 18654 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2197 GetRequests, 1793 SyntacticMatches, 0 SemanticMatches, 404 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1110 ImplicationChecksByTransitivity, 4.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=24073occurred in iteration=35, InterpolantAutomatonStates: 382, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 20.2s AutomataMinimizationTime, 35 MinimizatonAttempts, 34090 StatesRemovedByMinimization, 34 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 4.7s InterpolantComputationTime, 5227 NumberOfCodeBlocks, 5227 NumberOfCodeBlocksAsserted, 42 NumberOfCheckSat, 4972 ConstructedInterpolants, 0 QuantifiedInterpolants, 9861 SizeOfPredicates, 0 NumberOfNonLiveVariables, 3557 ConjunctsInSsa, 16 ConjunctsInUnsatCore, 41 InterpolantComputations, 35 PerfectInterpolantSequences, 2348/2436 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 RESULT: Ultimate proved your program to be incorrect! [2024-11-07 01:48:53,737 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE