./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.06.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 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_2.cil-1+token_ring.06.cil-1.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 2299ca1c26d35c3e5f6d860495fd40e041317a8644bf02bee237b59c63427ec2 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 06:04:12,773 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 06:04:12,833 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 06:04:12,837 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 06:04:12,837 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 06:04:12,852 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 06:04:12,853 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 06:04:12,853 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 06:04:12,853 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 06:04:12,853 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 06:04:12,853 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 06:04:12,853 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 06:04:12,854 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 06:04:12,854 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 06:04:12,854 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 06:04:12,854 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 06:04:12,854 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 06:04:12,854 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 06:04:12,854 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 06:04:12,854 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 06:04:12,854 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 06:04:12,854 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 06:04:12,855 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 06:04:12,855 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 06:04:12,855 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 06:04:12,855 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 06:04:12,855 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 06:04:12,855 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 06:04:12,855 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 06:04:12,855 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 06:04:12,855 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 06:04:12,855 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 06:04:12,855 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 06:04:12,856 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 06:04:12,856 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 06:04:12,856 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 06:04:12,856 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 06:04:12,856 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 06:04:12,856 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 06:04:12,856 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 06:04:12,856 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 06:04:12,856 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 06:04:12,856 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 06:04:12,856 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 06:04:12,856 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 06:04:12,856 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 06:04:12,857 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 06:04:12,857 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 06:04:12,857 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 -> 2299ca1c26d35c3e5f6d860495fd40e041317a8644bf02bee237b59c63427ec2 [2025-01-09 06:04:13,188 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 06:04:13,197 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 06:04:13,201 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 06:04:13,202 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 06:04:13,202 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 06:04:13,203 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.06.cil-1.c [2025-01-09 06:04:14,404 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/aceb15aea/7cf1148bc3c54de394844f88175f0786/FLAGd3de1e482 [2025-01-09 06:04:14,717 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 06:04:14,718 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.06.cil-1.c [2025-01-09 06:04:14,730 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/aceb15aea/7cf1148bc3c54de394844f88175f0786/FLAGd3de1e482 [2025-01-09 06:04:14,968 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/aceb15aea/7cf1148bc3c54de394844f88175f0786 [2025-01-09 06:04:14,970 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 06:04:14,972 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 06:04:14,973 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 06:04:14,974 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 06:04:14,978 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 06:04:14,978 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 06:04:14" (1/1) ... [2025-01-09 06:04:14,980 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1fcae284 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:04:14, skipping insertion in model container [2025-01-09 06:04:14,980 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 06:04:14" (1/1) ... [2025-01-09 06:04:15,015 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 06:04:15,131 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_2.cil-1+token_ring.06.cil-1.c[914,927] [2025-01-09 06:04:15,187 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_2.cil-1+token_ring.06.cil-1.c[7115,7128] [2025-01-09 06:04:15,263 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 06:04:15,278 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 06:04:15,299 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_2.cil-1+token_ring.06.cil-1.c[914,927] [2025-01-09 06:04:15,333 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_2.cil-1+token_ring.06.cil-1.c[7115,7128] [2025-01-09 06:04:15,377 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 06:04:15,399 INFO L204 MainTranslator]: Completed translation [2025-01-09 06:04:15,400 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:04:15 WrapperNode [2025-01-09 06:04:15,401 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 06:04:15,402 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 06:04:15,402 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 06:04:15,402 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 06:04:15,408 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:04:15" (1/1) ... [2025-01-09 06:04:15,422 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:04:15" (1/1) ... [2025-01-09 06:04:15,458 INFO L138 Inliner]: procedures = 65, calls = 76, calls flagged for inlining = 33, calls inlined = 33, statements flattened = 675 [2025-01-09 06:04:15,459 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 06:04:15,462 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 06:04:15,462 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 06:04:15,463 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 06:04:15,471 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:04:15" (1/1) ... [2025-01-09 06:04:15,472 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:04:15" (1/1) ... [2025-01-09 06:04:15,475 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:04:15" (1/1) ... [2025-01-09 06:04:15,498 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]. [2025-01-09 06:04:15,499 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:04:15" (1/1) ... [2025-01-09 06:04:15,499 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:04:15" (1/1) ... [2025-01-09 06:04:15,507 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:04:15" (1/1) ... [2025-01-09 06:04:15,508 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:04:15" (1/1) ... [2025-01-09 06:04:15,516 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:04:15" (1/1) ... [2025-01-09 06:04:15,518 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:04:15" (1/1) ... [2025-01-09 06:04:15,520 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:04:15" (1/1) ... [2025-01-09 06:04:15,523 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 06:04:15,524 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 06:04:15,524 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 06:04:15,525 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 06:04:15,526 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:04:15" (1/1) ... [2025-01-09 06:04:15,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 06:04:15,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 06:04:15,572 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) [2025-01-09 06:04:15,580 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 [2025-01-09 06:04:15,603 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 06:04:15,603 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-01-09 06:04:15,603 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-01-09 06:04:15,603 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2025-01-09 06:04:15,603 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2025-01-09 06:04:15,603 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2025-01-09 06:04:15,603 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2025-01-09 06:04:15,603 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2025-01-09 06:04:15,604 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2025-01-09 06:04:15,604 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2025-01-09 06:04:15,604 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2025-01-09 06:04:15,604 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2025-01-09 06:04:15,604 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2025-01-09 06:04:15,604 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2025-01-09 06:04:15,604 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2025-01-09 06:04:15,605 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2025-01-09 06:04:15,605 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2025-01-09 06:04:15,605 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2025-01-09 06:04:15,605 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2025-01-09 06:04:15,605 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2025-01-09 06:04:15,605 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2025-01-09 06:04:15,605 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2025-01-09 06:04:15,605 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2025-01-09 06:04:15,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 06:04:15,605 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2025-01-09 06:04:15,605 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2025-01-09 06:04:15,605 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2025-01-09 06:04:15,605 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2025-01-09 06:04:15,605 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 06:04:15,605 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 06:04:15,605 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2025-01-09 06:04:15,605 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2025-01-09 06:04:15,605 INFO L130 BoogieDeclarations]: Found specification of procedure error2 [2025-01-09 06:04:15,605 INFO L138 BoogieDeclarations]: Found implementation of procedure error2 [2025-01-09 06:04:15,705 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 06:04:15,706 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 06:04:16,273 INFO L? ?]: Removed 95 outVars from TransFormulas that were not future-live. [2025-01-09 06:04:16,277 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 06:04:16,294 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 06:04:16,294 INFO L312 CfgBuilder]: Removed 13 assume(true) statements. [2025-01-09 06:04:16,295 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 06:04:16 BoogieIcfgContainer [2025-01-09 06:04:16,295 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 06:04:16,297 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 06:04:16,297 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 06:04:16,300 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 06:04:16,300 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 06:04:14" (1/3) ... [2025-01-09 06:04:16,301 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@697ebd11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 06:04:16, skipping insertion in model container [2025-01-09 06:04:16,301 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:04:15" (2/3) ... [2025-01-09 06:04:16,301 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@697ebd11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 06:04:16, skipping insertion in model container [2025-01-09 06:04:16,301 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 06:04:16" (3/3) ... [2025-01-09 06:04:16,302 INFO L128 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-1+token_ring.06.cil-1.c [2025-01-09 06:04:16,313 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 06:04:16,316 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pc_sfifo_2.cil-1+token_ring.06.cil-1.c that has 16 procedures, 335 locations, 1 initial locations, 13 loop locations, and 2 error locations. [2025-01-09 06:04:16,360 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 06:04:16,370 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;@665d31cb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 06:04:16,371 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-01-09 06:04:16,375 INFO L276 IsEmpty]: Start isEmpty. Operand has 335 states, 283 states have (on average 1.568904593639576) internal successors, (444), 289 states have internal predecessors, (444), 36 states have call successors, (36), 15 states have call predecessors, (36), 15 states have return successors, (36), 34 states have call predecessors, (36), 36 states have call successors, (36) [2025-01-09 06:04:16,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-01-09 06:04:16,383 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:04:16,384 INFO L218 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] [2025-01-09 06:04:16,384 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:04:16,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:04:16,389 INFO L85 PathProgramCache]: Analyzing trace with hash 1235220035, now seen corresponding path program 1 times [2025-01-09 06:04:16,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:04:16,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16950595] [2025-01-09 06:04:16,398 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:04:16,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:04:16,493 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-01-09 06:04:16,526 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-01-09 06:04:16,530 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:04:16,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:04:16,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:04:16,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:04:16,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16950595] [2025-01-09 06:04:16,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16950595] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:04:16,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:04:16,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 06:04:16,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404404140] [2025-01-09 06:04:16,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:04:16,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 06:04:16,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:04:16,891 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 06:04:16,892 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 06:04:16,895 INFO L87 Difference]: Start difference. First operand has 335 states, 283 states have (on average 1.568904593639576) internal successors, (444), 289 states have internal predecessors, (444), 36 states have call successors, (36), 15 states have call predecessors, (36), 15 states have return successors, (36), 34 states have call predecessors, (36), 36 states have call successors, (36) Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-01-09 06:04:17,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:04:17,522 INFO L93 Difference]: Finished difference Result 746 states and 1148 transitions. [2025-01-09 06:04:17,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 06:04:17,524 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 3 states have call successors, (8), 3 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 62 [2025-01-09 06:04:17,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:04:17,532 INFO L225 Difference]: With dead ends: 746 [2025-01-09 06:04:17,532 INFO L226 Difference]: Without dead ends: 423 [2025-01-09 06:04:17,536 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:04:17,537 INFO L435 NwaCegarLoop]: 310 mSDtfsCounter, 357 mSDsluCounter, 768 mSDsCounter, 0 mSdLazyCounter, 716 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 364 SdHoareTripleChecker+Valid, 1078 SdHoareTripleChecker+Invalid, 771 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 716 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 06:04:17,538 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [364 Valid, 1078 Invalid, 771 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 716 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 06:04:17,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2025-01-09 06:04:17,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 416. [2025-01-09 06:04:17,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 416 states, 345 states have (on average 1.5072463768115942) internal successors, (520), 352 states have internal predecessors, (520), 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) [2025-01-09 06:04:17,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 615 transitions. [2025-01-09 06:04:17,610 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 615 transitions. Word has length 62 [2025-01-09 06:04:17,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:04:17,611 INFO L471 AbstractCegarLoop]: Abstraction has 416 states and 615 transitions. [2025-01-09 06:04:17,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-01-09 06:04:17,611 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 615 transitions. [2025-01-09 06:04:17,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-01-09 06:04:17,613 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:04:17,613 INFO L218 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] [2025-01-09 06:04:17,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 06:04:17,614 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:04:17,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:04:17,615 INFO L85 PathProgramCache]: Analyzing trace with hash 953381316, now seen corresponding path program 1 times [2025-01-09 06:04:17,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:04:17,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245487726] [2025-01-09 06:04:17,615 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:04:17,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:04:17,625 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-01-09 06:04:17,630 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-01-09 06:04:17,631 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:04:17,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:04:17,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:04:17,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:04:17,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245487726] [2025-01-09 06:04:17,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245487726] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:04:17,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:04:17,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:04:17,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290179628] [2025-01-09 06:04:17,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:04:17,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:04:17,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:04:17,775 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:04:17,775 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:04:17,775 INFO L87 Difference]: Start difference. First operand 416 states and 615 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-01-09 06:04:18,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:04:18,372 INFO L93 Difference]: Finished difference Result 721 states and 1034 transitions. [2025-01-09 06:04:18,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 06:04:18,372 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 3 states have call successors, (8), 3 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 62 [2025-01-09 06:04:18,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:04:18,376 INFO L225 Difference]: With dead ends: 721 [2025-01-09 06:04:18,379 INFO L226 Difference]: Without dead ends: 552 [2025-01-09 06:04:18,380 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 06:04:18,381 INFO L435 NwaCegarLoop]: 292 mSDtfsCounter, 732 mSDsluCounter, 811 mSDsCounter, 0 mSdLazyCounter, 903 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 760 SdHoareTripleChecker+Valid, 1103 SdHoareTripleChecker+Invalid, 971 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 903 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 06:04:18,381 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [760 Valid, 1103 Invalid, 971 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 903 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 06:04:18,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2025-01-09 06:04:18,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 508. [2025-01-09 06:04:18,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 508 states, 417 states have (on average 1.486810551558753) internal successors, (620), 426 states have internal predecessors, (620), 58 states have call successors, (58), 29 states have call predecessors, (58), 31 states have return successors, (67), 56 states have call predecessors, (67), 54 states have call successors, (67) [2025-01-09 06:04:18,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 745 transitions. [2025-01-09 06:04:18,420 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 745 transitions. Word has length 62 [2025-01-09 06:04:18,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:04:18,420 INFO L471 AbstractCegarLoop]: Abstraction has 508 states and 745 transitions. [2025-01-09 06:04:18,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-01-09 06:04:18,421 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 745 transitions. [2025-01-09 06:04:18,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-01-09 06:04:18,422 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:04:18,423 INFO L218 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] [2025-01-09 06:04:18,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 06:04:18,423 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:04:18,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:04:18,423 INFO L85 PathProgramCache]: Analyzing trace with hash -1402423934, now seen corresponding path program 1 times [2025-01-09 06:04:18,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:04:18,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695784940] [2025-01-09 06:04:18,424 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:04:18,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:04:18,431 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-01-09 06:04:18,436 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-01-09 06:04:18,436 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:04:18,436 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:04:18,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:04:18,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:04:18,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695784940] [2025-01-09 06:04:18,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695784940] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:04:18,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:04:18,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:04:18,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317900282] [2025-01-09 06:04:18,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:04:18,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:04:18,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:04:18,499 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:04:18,500 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:04:18,500 INFO L87 Difference]: Start difference. First operand 508 states and 745 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 4 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2025-01-09 06:04:19,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:04:19,077 INFO L93 Difference]: Finished difference Result 2419 states and 3427 transitions. [2025-01-09 06:04:19,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 06:04:19,078 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 4 states have call successors, (8), 2 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 62 [2025-01-09 06:04:19,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:04:19,093 INFO L225 Difference]: With dead ends: 2419 [2025-01-09 06:04:19,097 INFO L226 Difference]: Without dead ends: 2164 [2025-01-09 06:04:19,100 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-01-09 06:04:19,104 INFO L435 NwaCegarLoop]: 694 mSDtfsCounter, 1510 mSDsluCounter, 1327 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 282 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1516 SdHoareTripleChecker+Valid, 2021 SdHoareTripleChecker+Invalid, 661 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 282 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 06:04:19,104 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1516 Valid, 2021 Invalid, 661 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [282 Valid, 379 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 06:04:19,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2164 states. [2025-01-09 06:04:19,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2164 to 2034. [2025-01-09 06:04:19,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2034 states, 1606 states have (on average 1.3816936488169365) internal successors, (2219), 1643 states have internal predecessors, (2219), 223 states have call successors, (223), 173 states have call predecessors, (223), 203 states have return successors, (333), 221 states have call predecessors, (333), 219 states have call successors, (333) [2025-01-09 06:04:19,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2034 states to 2034 states and 2775 transitions. [2025-01-09 06:04:19,255 INFO L78 Accepts]: Start accepts. Automaton has 2034 states and 2775 transitions. Word has length 62 [2025-01-09 06:04:19,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:04:19,256 INFO L471 AbstractCegarLoop]: Abstraction has 2034 states and 2775 transitions. [2025-01-09 06:04:19,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 4 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2025-01-09 06:04:19,256 INFO L276 IsEmpty]: Start isEmpty. Operand 2034 states and 2775 transitions. [2025-01-09 06:04:19,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-01-09 06:04:19,258 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:04:19,258 INFO L218 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] [2025-01-09 06:04:19,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 06:04:19,258 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:04:19,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:04:19,259 INFO L85 PathProgramCache]: Analyzing trace with hash -483449311, now seen corresponding path program 1 times [2025-01-09 06:04:19,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:04:19,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034550081] [2025-01-09 06:04:19,259 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:04:19,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:04:19,272 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-01-09 06:04:19,277 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-01-09 06:04:19,277 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:04:19,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:04:19,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:04:19,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:04:19,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034550081] [2025-01-09 06:04:19,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034550081] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:04:19,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:04:19,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:04:19,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161074811] [2025-01-09 06:04:19,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:04:19,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:04:19,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:04:19,352 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:04:19,352 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:04:19,353 INFO L87 Difference]: Start difference. First operand 2034 states and 2775 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2025-01-09 06:04:19,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:04:19,481 INFO L93 Difference]: Finished difference Result 3860 states and 5268 transitions. [2025-01-09 06:04:19,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 06:04:19,482 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (8), 2 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 62 [2025-01-09 06:04:19,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:04:19,492 INFO L225 Difference]: With dead ends: 3860 [2025-01-09 06:04:19,493 INFO L226 Difference]: Without dead ends: 2079 [2025-01-09 06:04:19,497 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:04:19,498 INFO L435 NwaCegarLoop]: 484 mSDtfsCounter, 0 mSDsluCounter, 1931 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2415 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 06:04:19,498 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2415 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 06:04:19,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2079 states. [2025-01-09 06:04:19,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2079 to 2079. [2025-01-09 06:04:19,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2079 states, 1642 states have (on average 1.364190012180268) internal successors, (2240), 1679 states have internal predecessors, (2240), 223 states have call successors, (223), 173 states have call predecessors, (223), 212 states have return successors, (351), 230 states have call predecessors, (351), 219 states have call successors, (351) [2025-01-09 06:04:19,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2079 states to 2079 states and 2814 transitions. [2025-01-09 06:04:19,649 INFO L78 Accepts]: Start accepts. Automaton has 2079 states and 2814 transitions. Word has length 62 [2025-01-09 06:04:19,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:04:19,650 INFO L471 AbstractCegarLoop]: Abstraction has 2079 states and 2814 transitions. [2025-01-09 06:04:19,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2025-01-09 06:04:19,650 INFO L276 IsEmpty]: Start isEmpty. Operand 2079 states and 2814 transitions. [2025-01-09 06:04:19,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-01-09 06:04:19,651 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:04:19,651 INFO L218 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] [2025-01-09 06:04:19,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 06:04:19,651 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:04:19,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:04:19,652 INFO L85 PathProgramCache]: Analyzing trace with hash -421409697, now seen corresponding path program 1 times [2025-01-09 06:04:19,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:04:19,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165302596] [2025-01-09 06:04:19,652 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:04:19,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:04:19,660 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-01-09 06:04:19,665 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-01-09 06:04:19,665 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:04:19,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:04:19,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:04:19,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:04:19,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165302596] [2025-01-09 06:04:19,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165302596] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:04:19,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:04:19,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 06:04:19,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956243428] [2025-01-09 06:04:19,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:04:19,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 06:04:19,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:04:19,720 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 06:04:19,720 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 06:04:19,720 INFO L87 Difference]: Start difference. First operand 2079 states and 2814 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 4 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-01-09 06:04:20,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:04:20,192 INFO L93 Difference]: Finished difference Result 5764 states and 7791 transitions. [2025-01-09 06:04:20,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 06:04:20,192 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 4 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 62 [2025-01-09 06:04:20,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:04:20,211 INFO L225 Difference]: With dead ends: 5764 [2025-01-09 06:04:20,212 INFO L226 Difference]: Without dead ends: 3941 [2025-01-09 06:04:20,217 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 06:04:20,217 INFO L435 NwaCegarLoop]: 264 mSDtfsCounter, 671 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 696 SdHoareTripleChecker+Valid, 540 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 06:04:20,218 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [696 Valid, 540 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 06:04:20,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3941 states. [2025-01-09 06:04:20,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3941 to 3937. [2025-01-09 06:04:20,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3937 states, 3051 states have (on average 1.314978695509669) internal successors, (4012), 3135 states have internal predecessors, (4012), 442 states have call successors, (442), 338 states have call predecessors, (442), 442 states have return successors, (829), 470 states have call predecessors, (829), 438 states have call successors, (829) [2025-01-09 06:04:20,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3937 states to 3937 states and 5283 transitions. [2025-01-09 06:04:20,455 INFO L78 Accepts]: Start accepts. Automaton has 3937 states and 5283 transitions. Word has length 62 [2025-01-09 06:04:20,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:04:20,456 INFO L471 AbstractCegarLoop]: Abstraction has 3937 states and 5283 transitions. [2025-01-09 06:04:20,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 4 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-01-09 06:04:20,456 INFO L276 IsEmpty]: Start isEmpty. Operand 3937 states and 5283 transitions. [2025-01-09 06:04:20,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-01-09 06:04:20,458 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:04:20,458 INFO L218 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] [2025-01-09 06:04:20,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 06:04:20,459 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:04:20,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:04:20,459 INFO L85 PathProgramCache]: Analyzing trace with hash -1942722159, now seen corresponding path program 1 times [2025-01-09 06:04:20,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:04:20,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337349646] [2025-01-09 06:04:20,459 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:04:20,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:04:20,466 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-01-09 06:04:20,471 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-01-09 06:04:20,471 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:04:20,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:04:20,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:04:20,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:04:20,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337349646] [2025-01-09 06:04:20,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337349646] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:04:20,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:04:20,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 06:04:20,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079216991] [2025-01-09 06:04:20,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:04:20,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 06:04:20,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:04:20,503 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 06:04:20,504 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 06:04:20,504 INFO L87 Difference]: Start difference. First operand 3937 states and 5283 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-01-09 06:04:20,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:04:20,780 INFO L93 Difference]: Finished difference Result 9973 states and 13430 transitions. [2025-01-09 06:04:20,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 06:04:20,781 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 63 [2025-01-09 06:04:20,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:04:20,815 INFO L225 Difference]: With dead ends: 9973 [2025-01-09 06:04:20,815 INFO L226 Difference]: Without dead ends: 6271 [2025-01-09 06:04:20,828 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 06:04:20,829 INFO L435 NwaCegarLoop]: 497 mSDtfsCounter, 102 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 949 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 06:04:20,829 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 949 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 06:04:20,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6271 states. [2025-01-09 06:04:21,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6271 to 6117. [2025-01-09 06:04:21,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6117 states, 4687 states have (on average 1.3027522935779816) internal successors, (6106), 4792 states have internal predecessors, (6106), 712 states have call successors, (712), 568 states have call predecessors, (712), 716 states have return successors, (1328), 763 states have call predecessors, (1328), 708 states have call successors, (1328) [2025-01-09 06:04:21,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6117 states to 6117 states and 8146 transitions. [2025-01-09 06:04:21,232 INFO L78 Accepts]: Start accepts. Automaton has 6117 states and 8146 transitions. Word has length 63 [2025-01-09 06:04:21,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:04:21,233 INFO L471 AbstractCegarLoop]: Abstraction has 6117 states and 8146 transitions. [2025-01-09 06:04:21,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-01-09 06:04:21,233 INFO L276 IsEmpty]: Start isEmpty. Operand 6117 states and 8146 transitions. [2025-01-09 06:04:21,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-01-09 06:04:21,235 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:04:21,235 INFO L218 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] [2025-01-09 06:04:21,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 06:04:21,235 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:04:21,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:04:21,236 INFO L85 PathProgramCache]: Analyzing trace with hash -306468885, now seen corresponding path program 1 times [2025-01-09 06:04:21,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:04:21,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110161549] [2025-01-09 06:04:21,236 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:04:21,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:04:21,246 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-01-09 06:04:21,258 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-01-09 06:04:21,258 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:04:21,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:04:21,339 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:04:21,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:04:21,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110161549] [2025-01-09 06:04:21,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110161549] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:04:21,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:04:21,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 06:04:21,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177176671] [2025-01-09 06:04:21,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:04:21,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 06:04:21,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:04:21,340 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 06:04:21,340 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 06:04:21,340 INFO L87 Difference]: Start difference. First operand 6117 states and 8146 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-01-09 06:04:21,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:04:21,806 INFO L93 Difference]: Finished difference Result 7278 states and 9608 transitions. [2025-01-09 06:04:21,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 06:04:21,807 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 68 [2025-01-09 06:04:21,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:04:21,844 INFO L225 Difference]: With dead ends: 7278 [2025-01-09 06:04:21,844 INFO L226 Difference]: Without dead ends: 7275 [2025-01-09 06:04:21,849 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 06:04:21,850 INFO L435 NwaCegarLoop]: 496 mSDtfsCounter, 902 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 902 SdHoareTripleChecker+Valid, 582 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 06:04:21,850 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [902 Valid, 582 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 06:04:21,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7275 states. [2025-01-09 06:04:22,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7275 to 7176. [2025-01-09 06:04:22,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7176 states, 5481 states have (on average 1.2935595694216384) internal successors, (7090), 5599 states have internal predecessors, (7090), 843 states have call successors, (843), 682 states have call predecessors, (843), 850 states have return successors, (1547), 901 states have call predecessors, (1547), 840 states have call successors, (1547) [2025-01-09 06:04:22,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7176 states to 7176 states and 9480 transitions. [2025-01-09 06:04:22,302 INFO L78 Accepts]: Start accepts. Automaton has 7176 states and 9480 transitions. Word has length 68 [2025-01-09 06:04:22,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:04:22,303 INFO L471 AbstractCegarLoop]: Abstraction has 7176 states and 9480 transitions. [2025-01-09 06:04:22,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-01-09 06:04:22,303 INFO L276 IsEmpty]: Start isEmpty. Operand 7176 states and 9480 transitions. [2025-01-09 06:04:22,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-01-09 06:04:22,306 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:04:22,306 INFO L218 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] [2025-01-09 06:04:22,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 06:04:22,307 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:04:22,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:04:22,307 INFO L85 PathProgramCache]: Analyzing trace with hash -911577036, now seen corresponding path program 1 times [2025-01-09 06:04:22,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:04:22,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624258069] [2025-01-09 06:04:22,308 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:04:22,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:04:22,315 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-09 06:04:22,322 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 06:04:22,322 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:04:22,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:04:22,419 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:04:22,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:04:22,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624258069] [2025-01-09 06:04:22,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624258069] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 06:04:22,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [941184877] [2025-01-09 06:04:22,420 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:04:22,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 06:04:22,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 06:04:22,422 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) [2025-01-09 06:04:22,424 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 [2025-01-09 06:04:22,473 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-09 06:04:22,503 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 06:04:22,503 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:04:22,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:04:22,507 INFO L256 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-09 06:04:22,512 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 06:04:22,700 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:04:22,700 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 06:04:22,768 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:04:22,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [941184877] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 06:04:22,769 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 06:04:22,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 4] total 7 [2025-01-09 06:04:22,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942090340] [2025-01-09 06:04:22,769 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 06:04:22,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 06:04:22,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:04:22,770 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 06:04:22,770 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-09 06:04:22,770 INFO L87 Difference]: Start difference. First operand 7176 states and 9480 transitions. Second operand has 7 states, 7 states have (on average 15.142857142857142) internal successors, (106), 7 states have internal predecessors, (106), 4 states have call successors, (20), 3 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2025-01-09 06:04:23,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:04:23,971 INFO L93 Difference]: Finished difference Result 15159 states and 19847 transitions. [2025-01-09 06:04:23,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 06:04:23,972 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.142857142857142) internal successors, (106), 7 states have internal predecessors, (106), 4 states have call successors, (20), 3 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) Word has length 69 [2025-01-09 06:04:23,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:04:24,046 INFO L225 Difference]: With dead ends: 15159 [2025-01-09 06:04:24,046 INFO L226 Difference]: Without dead ends: 15156 [2025-01-09 06:04:24,057 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-09 06:04:24,057 INFO L435 NwaCegarLoop]: 669 mSDtfsCounter, 859 mSDsluCounter, 1328 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 859 SdHoareTripleChecker+Valid, 1997 SdHoareTripleChecker+Invalid, 289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 06:04:24,058 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [859 Valid, 1997 Invalid, 289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 06:04:24,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15156 states. [2025-01-09 06:04:24,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15156 to 13799. [2025-01-09 06:04:24,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13799 states, 10533 states have (on average 1.2876673312446596) internal successors, (13563), 10756 states have internal predecessors, (13563), 1603 states have call successors, (1603), 1312 states have call predecessors, (1603), 1661 states have return successors, (2981), 1737 states have call predecessors, (2981), 1600 states have call successors, (2981) [2025-01-09 06:04:24,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13799 states to 13799 states and 18147 transitions. [2025-01-09 06:04:24,779 INFO L78 Accepts]: Start accepts. Automaton has 13799 states and 18147 transitions. Word has length 69 [2025-01-09 06:04:24,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:04:24,779 INFO L471 AbstractCegarLoop]: Abstraction has 13799 states and 18147 transitions. [2025-01-09 06:04:24,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.142857142857142) internal successors, (106), 7 states have internal predecessors, (106), 4 states have call successors, (20), 3 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2025-01-09 06:04:24,780 INFO L276 IsEmpty]: Start isEmpty. Operand 13799 states and 18147 transitions. [2025-01-09 06:04:24,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-01-09 06:04:24,782 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:04:24,782 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 06:04:24,790 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 06:04:24,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 06:04:24,987 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:04:24,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:04:24,988 INFO L85 PathProgramCache]: Analyzing trace with hash 34703026, now seen corresponding path program 2 times [2025-01-09 06:04:24,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:04:24,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416390245] [2025-01-09 06:04:24,988 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 06:04:24,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:04:24,997 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 71 statements into 2 equivalence classes. [2025-01-09 06:04:25,001 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 71 of 71 statements. [2025-01-09 06:04:25,002 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 06:04:25,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:04:25,032 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:04:25,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:04:25,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416390245] [2025-01-09 06:04:25,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416390245] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:04:25,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:04:25,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 06:04:25,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461160317] [2025-01-09 06:04:25,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:04:25,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 06:04:25,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:04:25,033 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 06:04:25,033 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 06:04:25,033 INFO L87 Difference]: Start difference. First operand 13799 states and 18147 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-01-09 06:04:25,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:04:25,502 INFO L93 Difference]: Finished difference Result 20715 states and 27305 transitions. [2025-01-09 06:04:25,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 06:04:25,503 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 71 [2025-01-09 06:04:25,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:04:25,540 INFO L225 Difference]: With dead ends: 20715 [2025-01-09 06:04:25,541 INFO L226 Difference]: Without dead ends: 8041 [2025-01-09 06:04:25,570 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 06:04:25,572 INFO L435 NwaCegarLoop]: 561 mSDtfsCounter, 456 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 456 SdHoareTripleChecker+Valid, 674 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 06:04:25,573 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [456 Valid, 674 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 06:04:25,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8041 states. [2025-01-09 06:04:25,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8041 to 7943. [2025-01-09 06:04:25,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7943 states, 6085 states have (on average 1.2645850451930978) internal successors, (7695), 6210 states have internal predecessors, (7695), 915 states have call successors, (915), 740 states have call predecessors, (915), 941 states have return successors, (1604), 999 states have call predecessors, (1604), 912 states have call successors, (1604) [2025-01-09 06:04:25,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7943 states to 7943 states and 10214 transitions. [2025-01-09 06:04:25,941 INFO L78 Accepts]: Start accepts. Automaton has 7943 states and 10214 transitions. Word has length 71 [2025-01-09 06:04:25,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:04:25,942 INFO L471 AbstractCegarLoop]: Abstraction has 7943 states and 10214 transitions. [2025-01-09 06:04:25,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-01-09 06:04:25,943 INFO L276 IsEmpty]: Start isEmpty. Operand 7943 states and 10214 transitions. [2025-01-09 06:04:25,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-01-09 06:04:25,947 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:04:25,947 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 06:04:25,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 06:04:25,947 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:04:25,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:04:25,947 INFO L85 PathProgramCache]: Analyzing trace with hash -1888520113, now seen corresponding path program 1 times [2025-01-09 06:04:25,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:04:25,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624007107] [2025-01-09 06:04:25,948 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:04:25,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:04:25,955 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-01-09 06:04:26,038 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-01-09 06:04:26,038 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:04:26,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:04:26,138 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-09 06:04:26,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:04:26,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624007107] [2025-01-09 06:04:26,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624007107] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:04:26,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:04:26,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:04:26,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992191766] [2025-01-09 06:04:26,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:04:26,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:04:26,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:04:26,139 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:04:26,139 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:04:26,139 INFO L87 Difference]: Start difference. First operand 7943 states and 10214 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 4 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-01-09 06:04:28,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:04:28,000 INFO L93 Difference]: Finished difference Result 23825 states and 30725 transitions. [2025-01-09 06:04:28,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 06:04:28,001 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 4 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 80 [2025-01-09 06:04:28,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:04:28,063 INFO L225 Difference]: With dead ends: 23825 [2025-01-09 06:04:28,063 INFO L226 Difference]: Without dead ends: 16141 [2025-01-09 06:04:28,082 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2025-01-09 06:04:28,082 INFO L435 NwaCegarLoop]: 337 mSDtfsCounter, 645 mSDsluCounter, 1100 mSDsCounter, 0 mSdLazyCounter, 1091 mSolverCounterSat, 125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 658 SdHoareTripleChecker+Valid, 1437 SdHoareTripleChecker+Invalid, 1216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 1091 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 06:04:28,083 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [658 Valid, 1437 Invalid, 1216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 1091 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 06:04:28,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16141 states. [2025-01-09 06:04:28,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16141 to 15176. [2025-01-09 06:04:28,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15176 states, 11514 states have (on average 1.2352787910369984) internal successors, (14223), 11768 states have internal predecessors, (14223), 1782 states have call successors, (1782), 1446 states have call predecessors, (1782), 1878 states have return successors, (3442), 1974 states have call predecessors, (3442), 1779 states have call successors, (3442) [2025-01-09 06:04:28,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15176 states to 15176 states and 19447 transitions. [2025-01-09 06:04:28,863 INFO L78 Accepts]: Start accepts. Automaton has 15176 states and 19447 transitions. Word has length 80 [2025-01-09 06:04:28,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:04:28,863 INFO L471 AbstractCegarLoop]: Abstraction has 15176 states and 19447 transitions. [2025-01-09 06:04:28,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 4 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-01-09 06:04:28,863 INFO L276 IsEmpty]: Start isEmpty. Operand 15176 states and 19447 transitions. [2025-01-09 06:04:28,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-01-09 06:04:28,869 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:04:28,869 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:04:28,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 06:04:28,869 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:04:28,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:04:28,870 INFO L85 PathProgramCache]: Analyzing trace with hash 1224045647, now seen corresponding path program 1 times [2025-01-09 06:04:28,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:04:28,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760214977] [2025-01-09 06:04:28,870 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:04:28,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:04:28,876 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-01-09 06:04:28,880 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-01-09 06:04:28,880 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:04:28,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:04:28,958 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 06:04:28,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:04:28,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760214977] [2025-01-09 06:04:28,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760214977] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:04:28,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:04:28,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 06:04:28,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734754670] [2025-01-09 06:04:28,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:04:28,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 06:04:28,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:04:28,959 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 06:04:28,959 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 06:04:28,960 INFO L87 Difference]: Start difference. First operand 15176 states and 19447 transitions. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 4 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-01-09 06:04:30,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:04:30,366 INFO L93 Difference]: Finished difference Result 30178 states and 38568 transitions. [2025-01-09 06:04:30,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-09 06:04:30,367 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 4 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 86 [2025-01-09 06:04:30,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:04:30,423 INFO L225 Difference]: With dead ends: 30178 [2025-01-09 06:04:30,424 INFO L226 Difference]: Without dead ends: 16147 [2025-01-09 06:04:30,456 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=257, Unknown=0, NotChecked=0, Total=342 [2025-01-09 06:04:30,457 INFO L435 NwaCegarLoop]: 347 mSDtfsCounter, 1316 mSDsluCounter, 1157 mSDsCounter, 0 mSdLazyCounter, 1234 mSolverCounterSat, 256 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1349 SdHoareTripleChecker+Valid, 1504 SdHoareTripleChecker+Invalid, 1490 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 256 IncrementalHoareTripleChecker+Valid, 1234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 06:04:30,457 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1349 Valid, 1504 Invalid, 1490 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [256 Valid, 1234 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 06:04:30,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16147 states. [2025-01-09 06:04:31,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16147 to 15176. [2025-01-09 06:04:31,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15176 states, 11514 states have (on average 1.2170401250651381) internal successors, (14013), 11768 states have internal predecessors, (14013), 1782 states have call successors, (1782), 1446 states have call predecessors, (1782), 1878 states have return successors, (3235), 1974 states have call predecessors, (3235), 1779 states have call successors, (3235) [2025-01-09 06:04:31,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15176 states to 15176 states and 19030 transitions. [2025-01-09 06:04:31,550 INFO L78 Accepts]: Start accepts. Automaton has 15176 states and 19030 transitions. Word has length 86 [2025-01-09 06:04:31,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:04:31,550 INFO L471 AbstractCegarLoop]: Abstraction has 15176 states and 19030 transitions. [2025-01-09 06:04:31,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 4 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-01-09 06:04:31,551 INFO L276 IsEmpty]: Start isEmpty. Operand 15176 states and 19030 transitions. [2025-01-09 06:04:31,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-01-09 06:04:31,561 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:04:31,561 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:04:31,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 06:04:31,562 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:04:31,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:04:31,563 INFO L85 PathProgramCache]: Analyzing trace with hash -1378719703, now seen corresponding path program 1 times [2025-01-09 06:04:31,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:04:31,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846254609] [2025-01-09 06:04:31,563 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:04:31,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:04:31,575 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-01-09 06:04:31,579 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-01-09 06:04:31,579 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:04:31,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:04:31,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:04:31,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:04:31,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846254609] [2025-01-09 06:04:31,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846254609] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:04:31,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:04:31,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 06:04:31,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821245110] [2025-01-09 06:04:31,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:04:31,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 06:04:31,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:04:31,615 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 06:04:31,615 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 06:04:31,615 INFO L87 Difference]: Start difference. First operand 15176 states and 19030 transitions. Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 06:04:32,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:04:32,749 INFO L93 Difference]: Finished difference Result 15400 states and 19377 transitions. [2025-01-09 06:04:32,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 06:04:32,750 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 111 [2025-01-09 06:04:32,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:04:32,798 INFO L225 Difference]: With dead ends: 15400 [2025-01-09 06:04:32,799 INFO L226 Difference]: Without dead ends: 15176 [2025-01-09 06:04:32,803 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 06:04:32,803 INFO L435 NwaCegarLoop]: 483 mSDtfsCounter, 351 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 351 SdHoareTripleChecker+Valid, 609 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 06:04:32,804 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [351 Valid, 609 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 06:04:32,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15176 states. [2025-01-09 06:04:33,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15176 to 15176. [2025-01-09 06:04:33,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15176 states, 11514 states have (on average 1.216953274274796) internal successors, (14012), 11768 states have internal predecessors, (14012), 1782 states have call successors, (1782), 1446 states have call predecessors, (1782), 1878 states have return successors, (3235), 1974 states have call predecessors, (3235), 1779 states have call successors, (3235) [2025-01-09 06:04:33,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15176 states to 15176 states and 19029 transitions. [2025-01-09 06:04:33,921 INFO L78 Accepts]: Start accepts. Automaton has 15176 states and 19029 transitions. Word has length 111 [2025-01-09 06:04:33,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:04:33,921 INFO L471 AbstractCegarLoop]: Abstraction has 15176 states and 19029 transitions. [2025-01-09 06:04:33,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 06:04:33,921 INFO L276 IsEmpty]: Start isEmpty. Operand 15176 states and 19029 transitions. [2025-01-09 06:04:33,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-01-09 06:04:33,938 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:04:33,938 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:04:33,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 06:04:33,938 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:04:33,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:04:33,939 INFO L85 PathProgramCache]: Analyzing trace with hash -71577305, now seen corresponding path program 1 times [2025-01-09 06:04:33,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:04:33,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577490803] [2025-01-09 06:04:33,939 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:04:33,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:04:33,946 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-01-09 06:04:33,949 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-01-09 06:04:33,949 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:04:33,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:04:34,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:04:34,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:04:34,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577490803] [2025-01-09 06:04:34,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577490803] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:04:34,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:04:34,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:04:34,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440404385] [2025-01-09 06:04:34,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:04:34,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:04:34,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:04:34,065 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:04:34,065 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:04:34,066 INFO L87 Difference]: Start difference. First operand 15176 states and 19029 transitions. Second operand has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 5 states have internal predecessors, (100), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 06:04:35,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:04:35,279 INFO L93 Difference]: Finished difference Result 15652 states and 19786 transitions. [2025-01-09 06:04:35,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 06:04:35,280 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 5 states have internal predecessors, (100), 2 states have call successors, (6), 3 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 111 [2025-01-09 06:04:35,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:04:35,344 INFO L225 Difference]: With dead ends: 15652 [2025-01-09 06:04:35,345 INFO L226 Difference]: Without dead ends: 15434 [2025-01-09 06:04:35,355 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 06:04:35,356 INFO L435 NwaCegarLoop]: 531 mSDtfsCounter, 812 mSDsluCounter, 1635 mSDsCounter, 0 mSdLazyCounter, 947 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 836 SdHoareTripleChecker+Valid, 2166 SdHoareTripleChecker+Invalid, 997 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 947 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 06:04:35,356 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [836 Valid, 2166 Invalid, 997 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 947 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 06:04:35,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15434 states. [2025-01-09 06:04:36,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15434 to 15402. [2025-01-09 06:04:36,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15402 states, 11715 states have (on average 1.223303457106274) internal successors, (14331), 11971 states have internal predecessors, (14331), 1799 states have call successors, (1799), 1452 states have call predecessors, (1799), 1886 states have return successors, (3259), 1992 states have call predecessors, (3259), 1796 states have call successors, (3259) [2025-01-09 06:04:36,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15402 states to 15402 states and 19389 transitions. [2025-01-09 06:04:36,799 INFO L78 Accepts]: Start accepts. Automaton has 15402 states and 19389 transitions. Word has length 111 [2025-01-09 06:04:36,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:04:36,800 INFO L471 AbstractCegarLoop]: Abstraction has 15402 states and 19389 transitions. [2025-01-09 06:04:36,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 5 states have internal predecessors, (100), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 06:04:36,800 INFO L276 IsEmpty]: Start isEmpty. Operand 15402 states and 19389 transitions. [2025-01-09 06:04:36,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-01-09 06:04:36,812 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:04:36,813 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:04:36,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 06:04:36,813 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:04:36,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:04:36,814 INFO L85 PathProgramCache]: Analyzing trace with hash -955086295, now seen corresponding path program 1 times [2025-01-09 06:04:36,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:04:36,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405963734] [2025-01-09 06:04:36,815 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:04:36,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:04:36,823 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-01-09 06:04:36,827 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-01-09 06:04:36,828 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:04:36,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:04:36,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:04:36,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:04:36,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405963734] [2025-01-09 06:04:36,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405963734] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:04:36,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:04:36,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:04:36,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933501674] [2025-01-09 06:04:36,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:04:36,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:04:36,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:04:36,934 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:04:36,934 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:04:36,935 INFO L87 Difference]: Start difference. First operand 15402 states and 19389 transitions. Second operand has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 5 states have internal predecessors, (100), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 06:04:38,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:04:38,444 INFO L93 Difference]: Finished difference Result 16329 states and 20865 transitions. [2025-01-09 06:04:38,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 06:04:38,445 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 5 states have internal predecessors, (100), 2 states have call successors, (6), 3 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 111 [2025-01-09 06:04:38,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:04:38,507 INFO L225 Difference]: With dead ends: 16329 [2025-01-09 06:04:38,507 INFO L226 Difference]: Without dead ends: 15887 [2025-01-09 06:04:38,519 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 06:04:38,520 INFO L435 NwaCegarLoop]: 494 mSDtfsCounter, 808 mSDsluCounter, 1556 mSDsCounter, 0 mSdLazyCounter, 900 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 832 SdHoareTripleChecker+Valid, 2050 SdHoareTripleChecker+Invalid, 953 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 900 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 06:04:38,520 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [832 Valid, 2050 Invalid, 953 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 900 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 06:04:38,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15887 states. [2025-01-09 06:04:40,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15887 to 15844. [2025-01-09 06:04:40,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15844 states, 12111 states have (on average 1.2349104120221286) internal successors, (14956), 12371 states have internal predecessors, (14956), 1829 states have call successors, (1829), 1464 states have call predecessors, (1829), 1902 states have return successors, (3305), 2024 states have call predecessors, (3305), 1826 states have call successors, (3305) [2025-01-09 06:04:40,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15844 states to 15844 states and 20090 transitions. [2025-01-09 06:04:40,074 INFO L78 Accepts]: Start accepts. Automaton has 15844 states and 20090 transitions. Word has length 111 [2025-01-09 06:04:40,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:04:40,074 INFO L471 AbstractCegarLoop]: Abstraction has 15844 states and 20090 transitions. [2025-01-09 06:04:40,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 5 states have internal predecessors, (100), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 06:04:40,075 INFO L276 IsEmpty]: Start isEmpty. Operand 15844 states and 20090 transitions. [2025-01-09 06:04:40,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-01-09 06:04:40,082 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:04:40,083 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:04:40,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 06:04:40,083 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:04:40,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:04:40,083 INFO L85 PathProgramCache]: Analyzing trace with hash -983586585, now seen corresponding path program 1 times [2025-01-09 06:04:40,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:04:40,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787170701] [2025-01-09 06:04:40,084 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:04:40,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:04:40,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-01-09 06:04:40,093 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-01-09 06:04:40,093 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:04:40,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:04:40,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:04:40,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:04:40,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787170701] [2025-01-09 06:04:40,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787170701] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:04:40,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:04:40,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:04:40,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103041611] [2025-01-09 06:04:40,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:04:40,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:04:40,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:04:40,165 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:04:40,165 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:04:40,165 INFO L87 Difference]: Start difference. First operand 15844 states and 20090 transitions. Second operand has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 5 states have internal predecessors, (100), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 06:04:41,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:04:41,681 INFO L93 Difference]: Finished difference Result 17744 states and 23152 transitions. [2025-01-09 06:04:41,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 06:04:41,681 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 5 states have internal predecessors, (100), 2 states have call successors, (6), 3 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 111 [2025-01-09 06:04:41,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:04:41,752 INFO L225 Difference]: With dead ends: 17744 [2025-01-09 06:04:41,753 INFO L226 Difference]: Without dead ends: 16860 [2025-01-09 06:04:41,763 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 06:04:41,764 INFO L435 NwaCegarLoop]: 495 mSDtfsCounter, 803 mSDsluCounter, 1550 mSDsCounter, 0 mSdLazyCounter, 906 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 827 SdHoareTripleChecker+Valid, 2045 SdHoareTripleChecker+Invalid, 959 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 906 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 06:04:41,764 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [827 Valid, 2045 Invalid, 959 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 906 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 06:04:41,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16860 states. [2025-01-09 06:04:43,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16860 to 16796. [2025-01-09 06:04:43,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16796 states, 12965 states have (on average 1.2589278827612804) internal successors, (16322), 13239 states have internal predecessors, (16322), 1889 states have call successors, (1889), 1488 states have call predecessors, (1889), 1940 states have return successors, (3421), 2088 states have call predecessors, (3421), 1886 states have call successors, (3421) [2025-01-09 06:04:43,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16796 states to 16796 states and 21632 transitions. [2025-01-09 06:04:43,113 INFO L78 Accepts]: Start accepts. Automaton has 16796 states and 21632 transitions. Word has length 111 [2025-01-09 06:04:43,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:04:43,113 INFO L471 AbstractCegarLoop]: Abstraction has 16796 states and 21632 transitions. [2025-01-09 06:04:43,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 5 states have internal predecessors, (100), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 06:04:43,114 INFO L276 IsEmpty]: Start isEmpty. Operand 16796 states and 21632 transitions. [2025-01-09 06:04:43,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-01-09 06:04:43,127 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:04:43,127 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:04:43,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 06:04:43,127 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:04:43,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:04:43,128 INFO L85 PathProgramCache]: Analyzing trace with hash 1370798697, now seen corresponding path program 1 times [2025-01-09 06:04:43,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:04:43,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180690181] [2025-01-09 06:04:43,128 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:04:43,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:04:43,141 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-01-09 06:04:43,144 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-01-09 06:04:43,145 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:04:43,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:04:43,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:04:43,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:04:43,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180690181] [2025-01-09 06:04:43,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180690181] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:04:43,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:04:43,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:04:43,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093328161] [2025-01-09 06:04:43,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:04:43,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:04:43,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:04:43,253 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:04:43,253 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:04:43,253 INFO L87 Difference]: Start difference. First operand 16796 states and 21632 transitions. Second operand has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 5 states have internal predecessors, (100), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 06:04:45,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:04:45,352 INFO L93 Difference]: Finished difference Result 20827 states and 28274 transitions. [2025-01-09 06:04:45,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 06:04:45,352 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 5 states have internal predecessors, (100), 2 states have call successors, (6), 3 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 111 [2025-01-09 06:04:45,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:04:45,440 INFO L225 Difference]: With dead ends: 20827 [2025-01-09 06:04:45,441 INFO L226 Difference]: Without dead ends: 18991 [2025-01-09 06:04:45,455 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 06:04:45,455 INFO L435 NwaCegarLoop]: 491 mSDtfsCounter, 798 mSDsluCounter, 1533 mSDsCounter, 0 mSdLazyCounter, 903 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 822 SdHoareTripleChecker+Valid, 2024 SdHoareTripleChecker+Invalid, 956 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 903 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 06:04:45,456 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [822 Valid, 2024 Invalid, 956 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 903 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 06:04:45,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18991 states. [2025-01-09 06:04:46,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18991 to 18888. [2025-01-09 06:04:46,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18888 states, 14843 states have (on average 1.3051269958903187) internal successors, (19372), 15163 states have internal predecessors, (19372), 2009 states have call successors, (2009), 1536 states have call predecessors, (2009), 2034 states have return successors, (3749), 2216 states have call predecessors, (3749), 2006 states have call successors, (3749) [2025-01-09 06:04:46,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18888 states to 18888 states and 25130 transitions. [2025-01-09 06:04:46,605 INFO L78 Accepts]: Start accepts. Automaton has 18888 states and 25130 transitions. Word has length 111 [2025-01-09 06:04:46,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:04:46,605 INFO L471 AbstractCegarLoop]: Abstraction has 18888 states and 25130 transitions. [2025-01-09 06:04:46,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 5 states have internal predecessors, (100), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 06:04:46,606 INFO L276 IsEmpty]: Start isEmpty. Operand 18888 states and 25130 transitions. [2025-01-09 06:04:46,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-01-09 06:04:46,617 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:04:46,618 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:04:46,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 06:04:46,618 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:04:46,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:04:46,619 INFO L85 PathProgramCache]: Analyzing trace with hash -1047105369, now seen corresponding path program 1 times [2025-01-09 06:04:46,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:04:46,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186049235] [2025-01-09 06:04:46,619 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:04:46,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:04:46,626 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-01-09 06:04:46,628 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-01-09 06:04:46,628 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:04:46,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:04:46,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:04:46,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:04:46,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186049235] [2025-01-09 06:04:46,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186049235] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:04:46,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:04:46,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:04:46,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16197683] [2025-01-09 06:04:46,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:04:46,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:04:46,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:04:46,736 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:04:46,736 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:04:46,736 INFO L87 Difference]: Start difference. First operand 18888 states and 25130 transitions. Second operand has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 5 states have internal predecessors, (100), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 06:04:48,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:04:48,646 INFO L93 Difference]: Finished difference Result 27686 states and 40156 transitions. [2025-01-09 06:04:48,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 06:04:48,646 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 5 states have internal predecessors, (100), 2 states have call successors, (6), 3 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 111 [2025-01-09 06:04:48,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:04:48,813 INFO L225 Difference]: With dead ends: 27686 [2025-01-09 06:04:48,813 INFO L226 Difference]: Without dead ends: 23758 [2025-01-09 06:04:48,850 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 06:04:48,851 INFO L435 NwaCegarLoop]: 489 mSDtfsCounter, 793 mSDsluCounter, 1521 mSDsCounter, 0 mSdLazyCounter, 903 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 817 SdHoareTripleChecker+Valid, 2010 SdHoareTripleChecker+Invalid, 956 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 903 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 06:04:48,854 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [817 Valid, 2010 Invalid, 956 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 903 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 06:04:48,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23758 states. [2025-01-09 06:04:50,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23758 to 23584. [2025-01-09 06:04:50,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23584 states, 19057 states have (on average 1.3814346434381066) internal successors, (26326), 19523 states have internal predecessors, (26326), 2249 states have call successors, (2249), 1632 states have call predecessors, (2249), 2276 states have return successors, (4789), 2472 states have call predecessors, (4789), 2246 states have call successors, (4789) [2025-01-09 06:04:50,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23584 states to 23584 states and 33364 transitions. [2025-01-09 06:04:50,556 INFO L78 Accepts]: Start accepts. Automaton has 23584 states and 33364 transitions. Word has length 111 [2025-01-09 06:04:50,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:04:50,557 INFO L471 AbstractCegarLoop]: Abstraction has 23584 states and 33364 transitions. [2025-01-09 06:04:50,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 5 states have internal predecessors, (100), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 06:04:50,557 INFO L276 IsEmpty]: Start isEmpty. Operand 23584 states and 33364 transitions. [2025-01-09 06:04:50,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-01-09 06:04:50,569 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:04:50,569 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:04:50,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 06:04:50,569 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:04:50,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:04:50,570 INFO L85 PathProgramCache]: Analyzing trace with hash -1817838935, now seen corresponding path program 1 times [2025-01-09 06:04:50,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:04:50,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710359146] [2025-01-09 06:04:50,570 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:04:50,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:04:50,576 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-01-09 06:04:50,578 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-01-09 06:04:50,578 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:04:50,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:04:50,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:04:50,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:04:50,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710359146] [2025-01-09 06:04:50,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710359146] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:04:50,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:04:50,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:04:50,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444303874] [2025-01-09 06:04:50,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:04:50,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:04:50,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:04:50,643 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:04:50,643 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:04:50,644 INFO L87 Difference]: Start difference. First operand 23584 states and 33364 transitions. Second operand has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 5 states have internal predecessors, (100), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 06:04:52,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:04:52,762 INFO L93 Difference]: Finished difference Result 43277 states and 68914 transitions. [2025-01-09 06:04:52,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 06:04:52,763 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 5 states have internal predecessors, (100), 2 states have call successors, (6), 3 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 111 [2025-01-09 06:04:52,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:04:52,891 INFO L225 Difference]: With dead ends: 43277 [2025-01-09 06:04:52,891 INFO L226 Difference]: Without dead ends: 34653 [2025-01-09 06:04:52,924 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 06:04:52,924 INFO L435 NwaCegarLoop]: 488 mSDtfsCounter, 788 mSDsluCounter, 1513 mSDsCounter, 0 mSdLazyCounter, 903 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 812 SdHoareTripleChecker+Valid, 2001 SdHoareTripleChecker+Invalid, 956 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 903 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 06:04:52,926 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [812 Valid, 2001 Invalid, 956 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 903 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 06:04:52,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34653 states. [2025-01-09 06:04:54,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34653 to 34352. [2025-01-09 06:04:54,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34352 states, 28699 states have (on average 1.4803303250984354) internal successors, (42484), 29619 states have internal predecessors, (42484), 2729 states have call successors, (2729), 1824 states have call predecessors, (2729), 2922 states have return successors, (8405), 2984 states have call predecessors, (8405), 2726 states have call successors, (8405) [2025-01-09 06:04:54,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34352 states to 34352 states and 53618 transitions. [2025-01-09 06:04:54,989 INFO L78 Accepts]: Start accepts. Automaton has 34352 states and 53618 transitions. Word has length 111 [2025-01-09 06:04:54,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:04:54,990 INFO L471 AbstractCegarLoop]: Abstraction has 34352 states and 53618 transitions. [2025-01-09 06:04:54,990 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 5 states have internal predecessors, (100), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 06:04:54,990 INFO L276 IsEmpty]: Start isEmpty. Operand 34352 states and 53618 transitions. [2025-01-09 06:04:55,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-01-09 06:04:55,015 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:04:55,015 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:04:55,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 06:04:55,015 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:04:55,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:04:55,016 INFO L85 PathProgramCache]: Analyzing trace with hash 1482434663, now seen corresponding path program 1 times [2025-01-09 06:04:55,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:04:55,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964296583] [2025-01-09 06:04:55,017 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:04:55,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:04:55,024 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-01-09 06:04:55,027 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-01-09 06:04:55,027 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:04:55,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:04:55,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:04:55,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:04:55,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964296583] [2025-01-09 06:04:55,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964296583] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:04:55,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:04:55,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:04:55,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504487032] [2025-01-09 06:04:55,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:04:55,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:04:55,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:04:55,100 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:04:55,100 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:04:55,100 INFO L87 Difference]: Start difference. First operand 34352 states and 53618 transitions. Second operand has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 5 states have internal predecessors, (100), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 06:04:58,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:04:58,656 INFO L93 Difference]: Finished difference Result 82456 states and 146641 transitions. [2025-01-09 06:04:58,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 06:04:58,656 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 5 states have internal predecessors, (100), 2 states have call successors, (6), 3 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 111 [2025-01-09 06:04:58,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:04:58,920 INFO L225 Difference]: With dead ends: 82456 [2025-01-09 06:04:58,920 INFO L226 Difference]: Without dead ends: 63064 [2025-01-09 06:04:59,001 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 06:04:59,002 INFO L435 NwaCegarLoop]: 470 mSDtfsCounter, 846 mSDsluCounter, 1445 mSDsCounter, 0 mSdLazyCounter, 1072 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 869 SdHoareTripleChecker+Valid, 1915 SdHoareTripleChecker+Invalid, 1127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 1072 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 06:04:59,002 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [869 Valid, 1915 Invalid, 1127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 1072 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 06:04:59,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63064 states.