./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.05.cil-2.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_3.cil+token_ring.05.cil-2.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8067f6f3f9b2e7af84aa5945c9ed2ea4ff7d9ddfc1aa86a10fb4bb83ea8bdef8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 06:06:32,332 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 06:06:32,409 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:06:32,414 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 06:06:32,419 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 06:06:32,445 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 06:06:32,446 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 06:06:32,446 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 06:06:32,446 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 06:06:32,447 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 06:06:32,447 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 06:06:32,447 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 06:06:32,447 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 06:06:32,447 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 06:06:32,447 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 06:06:32,447 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 06:06:32,447 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 06:06:32,447 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 06:06:32,448 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 06:06:32,448 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 06:06:32,448 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 06:06:32,448 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 06:06:32,448 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 06:06:32,448 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 06:06:32,448 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 06:06:32,448 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 06:06:32,448 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 06:06:32,448 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 06:06:32,451 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 06:06:32,451 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 06:06:32,452 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 06:06:32,452 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 06:06:32,452 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 06:06:32,452 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 06:06:32,452 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 06:06:32,452 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 06:06:32,452 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 06:06:32,453 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 06:06:32,453 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 06:06:32,453 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 06:06:32,453 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 06:06:32,453 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 06:06:32,453 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 06:06:32,453 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 06:06:32,454 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 06:06:32,454 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 06:06:32,454 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 06:06:32,454 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 06:06:32,454 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 -> 8067f6f3f9b2e7af84aa5945c9ed2ea4ff7d9ddfc1aa86a10fb4bb83ea8bdef8 [2025-01-09 06:06:32,762 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 06:06:32,775 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 06:06:32,779 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 06:06:32,780 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 06:06:32,780 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 06:06:32,781 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.05.cil-2.c [2025-01-09 06:06:34,130 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cbe810f94/4d26e255ee5b40978cd23e922a63f441/FLAG31c21ba97 [2025-01-09 06:06:34,420 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 06:06:34,421 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.05.cil-2.c [2025-01-09 06:06:34,440 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cbe810f94/4d26e255ee5b40978cd23e922a63f441/FLAG31c21ba97 [2025-01-09 06:06:34,460 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cbe810f94/4d26e255ee5b40978cd23e922a63f441 [2025-01-09 06:06:34,462 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 06:06:34,463 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 06:06:34,464 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 06:06:34,464 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 06:06:34,468 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 06:06:34,468 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 06:06:34" (1/1) ... [2025-01-09 06:06:34,469 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3902378f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:06:34, skipping insertion in model container [2025-01-09 06:06:34,469 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 06:06:34" (1/1) ... [2025-01-09 06:06:34,514 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 06:06:34,661 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.05.cil-2.c[911,924] [2025-01-09 06:06:34,730 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.05.cil-2.c[8416,8429] [2025-01-09 06:06:34,792 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 06:06:34,807 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 06:06:34,816 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.05.cil-2.c[911,924] [2025-01-09 06:06:34,854 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.05.cil-2.c[8416,8429] [2025-01-09 06:06:34,895 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 06:06:34,915 INFO L204 MainTranslator]: Completed translation [2025-01-09 06:06:34,918 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:06:34 WrapperNode [2025-01-09 06:06:34,918 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 06:06:34,919 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 06:06:34,920 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 06:06:34,920 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 06:06:34,925 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:06:34" (1/1) ... [2025-01-09 06:06:34,938 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:06:34" (1/1) ... [2025-01-09 06:06:34,976 INFO L138 Inliner]: procedures = 65, calls = 77, calls flagged for inlining = 33, calls inlined = 33, statements flattened = 656 [2025-01-09 06:06:34,977 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 06:06:34,977 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 06:06:34,977 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 06:06:34,978 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 06:06:34,988 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:06:34" (1/1) ... [2025-01-09 06:06:34,988 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:06:34" (1/1) ... [2025-01-09 06:06:34,992 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:06:34" (1/1) ... [2025-01-09 06:06:35,011 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:06:35,011 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:06:34" (1/1) ... [2025-01-09 06:06:35,011 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:06:34" (1/1) ... [2025-01-09 06:06:35,023 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:06:34" (1/1) ... [2025-01-09 06:06:35,028 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:06:34" (1/1) ... [2025-01-09 06:06:35,042 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:06:34" (1/1) ... [2025-01-09 06:06:35,049 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:06:34" (1/1) ... [2025-01-09 06:06:35,055 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:06:34" (1/1) ... [2025-01-09 06:06:35,063 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 06:06:35,064 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 06:06:35,064 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 06:06:35,064 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 06:06:35,069 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:06:34" (1/1) ... [2025-01-09 06:06:35,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 06:06:35,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 06:06:35,114 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:06:35,116 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:06:35,136 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 06:06:35,136 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-01-09 06:06:35,136 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-01-09 06:06:35,136 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2025-01-09 06:06:35,136 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2025-01-09 06:06:35,136 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2025-01-09 06:06:35,136 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2025-01-09 06:06:35,136 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2025-01-09 06:06:35,136 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2025-01-09 06:06:35,136 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2025-01-09 06:06:35,136 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2025-01-09 06:06:35,136 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2025-01-09 06:06:35,136 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2025-01-09 06:06:35,136 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2025-01-09 06:06:35,137 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2025-01-09 06:06:35,137 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2025-01-09 06:06:35,137 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2025-01-09 06:06:35,137 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2025-01-09 06:06:35,137 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2025-01-09 06:06:35,137 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2025-01-09 06:06:35,137 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2025-01-09 06:06:35,137 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2025-01-09 06:06:35,137 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2025-01-09 06:06:35,137 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 06:06:35,137 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2025-01-09 06:06:35,137 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2025-01-09 06:06:35,137 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2025-01-09 06:06:35,138 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2025-01-09 06:06:35,138 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 06:06:35,138 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 06:06:35,138 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2025-01-09 06:06:35,138 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2025-01-09 06:06:35,138 INFO L130 BoogieDeclarations]: Found specification of procedure error2 [2025-01-09 06:06:35,138 INFO L138 BoogieDeclarations]: Found implementation of procedure error2 [2025-01-09 06:06:35,233 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 06:06:35,235 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 06:06:35,855 INFO L727 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##48: assume !(1 == ~q_free~0); [2025-01-09 06:06:35,856 INFO L727 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##47: assume 1 == ~q_free~0;~c_dr_st~0 := 2;~c_dr_pc~0 := 2;~a_t~0 := do_read_c_~a~0#1; [2025-01-09 06:06:36,002 INFO L? ?]: Removed 92 outVars from TransFormulas that were not future-live. [2025-01-09 06:06:36,003 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 06:06:36,025 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 06:06:36,025 INFO L312 CfgBuilder]: Removed 12 assume(true) statements. [2025-01-09 06:06:36,025 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 06:06:36 BoogieIcfgContainer [2025-01-09 06:06:36,026 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 06:06:36,027 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 06:06:36,028 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 06:06:36,033 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 06:06:36,033 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 06:06:34" (1/3) ... [2025-01-09 06:06:36,034 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f68b466 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 06:06:36, skipping insertion in model container [2025-01-09 06:06:36,034 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:06:34" (2/3) ... [2025-01-09 06:06:36,034 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f68b466 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 06:06:36, skipping insertion in model container [2025-01-09 06:06:36,034 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 06:06:36" (3/3) ... [2025-01-09 06:06:36,035 INFO L128 eAbstractionObserver]: Analyzing ICFG pc_sfifo_3.cil+token_ring.05.cil-2.c [2025-01-09 06:06:36,047 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 06:06:36,050 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pc_sfifo_3.cil+token_ring.05.cil-2.c that has 16 procedures, 326 locations, 1 initial locations, 12 loop locations, and 2 error locations. [2025-01-09 06:06:36,113 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 06:06:36,124 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;@6266edec, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 06:06:36,125 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-01-09 06:06:36,131 INFO L276 IsEmpty]: Start isEmpty. Operand has 326 states, 273 states have (on average 1.5604395604395604) internal successors, (426), 279 states have internal predecessors, (426), 37 states have call successors, (37), 15 states have call predecessors, (37), 15 states have return successors, (37), 35 states have call predecessors, (37), 37 states have call successors, (37) [2025-01-09 06:06:36,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-01-09 06:06:36,139 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:06:36,140 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:06:36,140 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:06:36,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:06:36,144 INFO L85 PathProgramCache]: Analyzing trace with hash 2017801829, now seen corresponding path program 1 times [2025-01-09 06:06:36,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:06:36,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829762477] [2025-01-09 06:06:36,150 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:06:36,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:06:36,228 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-01-09 06:06:36,264 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-01-09 06:06:36,265 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:06:36,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:06:36,619 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:06:36,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:06:36,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829762477] [2025-01-09 06:06:36,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829762477] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:06:36,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:06:36,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 06:06:36,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864670885] [2025-01-09 06:06:36,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:06:36,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 06:06:36,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:06:36,653 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 06:06:36,654 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 06:06:36,659 INFO L87 Difference]: Start difference. First operand has 326 states, 273 states have (on average 1.5604395604395604) internal successors, (426), 279 states have internal predecessors, (426), 37 states have call successors, (37), 15 states have call predecessors, (37), 15 states have return successors, (37), 35 states have call predecessors, (37), 37 states have call successors, (37) Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 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:06:37,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:06:37,532 INFO L93 Difference]: Finished difference Result 745 states and 1145 transitions. [2025-01-09 06:06:37,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 06:06:37,535 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 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 63 [2025-01-09 06:06:37,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:06:37,547 INFO L225 Difference]: With dead ends: 745 [2025-01-09 06:06:37,547 INFO L226 Difference]: Without dead ends: 430 [2025-01-09 06:06:37,552 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:06:37,558 INFO L435 NwaCegarLoop]: 305 mSDtfsCounter, 377 mSDsluCounter, 754 mSDsCounter, 0 mSdLazyCounter, 686 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 386 SdHoareTripleChecker+Valid, 1059 SdHoareTripleChecker+Invalid, 744 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 686 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 06:06:37,560 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [386 Valid, 1059 Invalid, 744 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 686 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 06:06:37,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2025-01-09 06:06:37,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 423. [2025-01-09 06:06:37,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 423 states, 349 states have (on average 1.504297994269341) internal successors, (525), 356 states have internal predecessors, (525), 50 states have call successors, (50), 22 states have call predecessors, (50), 22 states have return successors, (51), 47 states have call predecessors, (51), 46 states have call successors, (51) [2025-01-09 06:06:37,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 626 transitions. [2025-01-09 06:06:37,634 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 626 transitions. Word has length 63 [2025-01-09 06:06:37,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:06:37,635 INFO L471 AbstractCegarLoop]: Abstraction has 423 states and 626 transitions. [2025-01-09 06:06:37,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 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:06:37,635 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 626 transitions. [2025-01-09 06:06:37,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-01-09 06:06:37,638 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:06:37,638 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:06:37,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 06:06:37,639 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:06:37,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:06:37,639 INFO L85 PathProgramCache]: Analyzing trace with hash -268716763, now seen corresponding path program 1 times [2025-01-09 06:06:37,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:06:37,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043406312] [2025-01-09 06:06:37,640 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:06:37,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:06:37,655 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-01-09 06:06:37,666 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-01-09 06:06:37,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:06:37,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:06:37,865 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:06:37,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:06:37,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043406312] [2025-01-09 06:06:37,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043406312] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:06:37,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:06:37,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:06:37,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879398572] [2025-01-09 06:06:37,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:06:37,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:06:37,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:06:37,868 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:06:37,868 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:06:37,868 INFO L87 Difference]: Start difference. First operand 423 states and 626 transitions. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 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:06:38,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:06:38,748 INFO L93 Difference]: Finished difference Result 778 states and 1129 transitions. [2025-01-09 06:06:38,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 06:06:38,750 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 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 63 [2025-01-09 06:06:38,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:06:38,758 INFO L225 Difference]: With dead ends: 778 [2025-01-09 06:06:38,758 INFO L226 Difference]: Without dead ends: 577 [2025-01-09 06:06:38,759 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:06:38,760 INFO L435 NwaCegarLoop]: 350 mSDtfsCounter, 679 mSDsluCounter, 968 mSDsCounter, 0 mSdLazyCounter, 991 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 705 SdHoareTripleChecker+Valid, 1318 SdHoareTripleChecker+Invalid, 1052 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 991 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 06:06:38,760 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [705 Valid, 1318 Invalid, 1052 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 991 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 06:06:38,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2025-01-09 06:06:38,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 531. [2025-01-09 06:06:38,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 531 states, 435 states have (on average 1.4873563218390804) internal successors, (647), 444 states have internal predecessors, (647), 63 states have call successors, (63), 29 states have call predecessors, (63), 31 states have return successors, (72), 61 states have call predecessors, (72), 59 states have call successors, (72) [2025-01-09 06:06:38,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 531 states to 531 states and 782 transitions. [2025-01-09 06:06:38,823 INFO L78 Accepts]: Start accepts. Automaton has 531 states and 782 transitions. Word has length 63 [2025-01-09 06:06:38,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:06:38,824 INFO L471 AbstractCegarLoop]: Abstraction has 531 states and 782 transitions. [2025-01-09 06:06:38,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 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:06:38,824 INFO L276 IsEmpty]: Start isEmpty. Operand 531 states and 782 transitions. [2025-01-09 06:06:38,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-01-09 06:06:38,829 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:06:38,829 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:06:38,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 06:06:38,829 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:06:38,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:06:38,830 INFO L85 PathProgramCache]: Analyzing trace with hash -284235481, now seen corresponding path program 1 times [2025-01-09 06:06:38,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:06:38,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846998932] [2025-01-09 06:06:38,830 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:06:38,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:06:38,862 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-01-09 06:06:38,871 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-01-09 06:06:38,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:06:38,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:06:38,936 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:06:38,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:06:38,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846998932] [2025-01-09 06:06:38,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846998932] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:06:38,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:06:38,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 06:06:38,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135965270] [2025-01-09 06:06:38,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:06:38,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 06:06:38,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:06:38,939 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 06:06:38,939 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 06:06:38,939 INFO L87 Difference]: Start difference. First operand 531 states and 782 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2025-01-09 06:06:39,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:06:39,183 INFO L93 Difference]: Finished difference Result 1401 states and 2028 transitions. [2025-01-09 06:06:39,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 06:06:39,183 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) Word has length 63 [2025-01-09 06:06:39,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:06:39,193 INFO L225 Difference]: With dead ends: 1401 [2025-01-09 06:06:39,194 INFO L226 Difference]: Without dead ends: 1098 [2025-01-09 06:06:39,196 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 06:06:39,197 INFO L435 NwaCegarLoop]: 586 mSDtfsCounter, 564 mSDsluCounter, 518 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 564 SdHoareTripleChecker+Valid, 1104 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 06:06:39,198 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [564 Valid, 1104 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 06:06:39,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1098 states. [2025-01-09 06:06:39,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1098 to 1081. [2025-01-09 06:06:39,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1081 states, 875 states have (on average 1.4342857142857144) internal successors, (1255), 892 states have internal predecessors, (1255), 123 states have call successors, (123), 71 states have call predecessors, (123), 81 states have return successors, (157), 121 states have call predecessors, (157), 119 states have call successors, (157) [2025-01-09 06:06:39,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1081 states to 1081 states and 1535 transitions. [2025-01-09 06:06:39,311 INFO L78 Accepts]: Start accepts. Automaton has 1081 states and 1535 transitions. Word has length 63 [2025-01-09 06:06:39,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:06:39,312 INFO L471 AbstractCegarLoop]: Abstraction has 1081 states and 1535 transitions. [2025-01-09 06:06:39,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2025-01-09 06:06:39,312 INFO L276 IsEmpty]: Start isEmpty. Operand 1081 states and 1535 transitions. [2025-01-09 06:06:39,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-01-09 06:06:39,314 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:06:39,314 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] [2025-01-09 06:06:39,315 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 06:06:39,315 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:06:39,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:06:39,315 INFO L85 PathProgramCache]: Analyzing trace with hash -1008211028, now seen corresponding path program 1 times [2025-01-09 06:06:39,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:06:39,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495605720] [2025-01-09 06:06:39,318 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:06:39,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:06:39,328 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-01-09 06:06:39,336 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-01-09 06:06:39,340 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:06:39,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:06:39,432 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:06:39,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:06:39,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495605720] [2025-01-09 06:06:39,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495605720] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:06:39,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:06:39,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:06:39,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837121759] [2025-01-09 06:06:39,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:06:39,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:06:39,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:06:39,435 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:06:39,435 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:06:39,435 INFO L87 Difference]: Start difference. First operand 1081 states and 1535 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 5 states have internal predecessors, (49), 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:06:39,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:06:39,526 INFO L93 Difference]: Finished difference Result 1954 states and 2769 transitions. [2025-01-09 06:06:39,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 06:06:39,526 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 5 states have internal predecessors, (49), 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 64 [2025-01-09 06:06:39,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:06:39,535 INFO L225 Difference]: With dead ends: 1954 [2025-01-09 06:06:39,535 INFO L226 Difference]: Without dead ends: 1101 [2025-01-09 06:06:39,538 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:06:39,541 INFO L435 NwaCegarLoop]: 469 mSDtfsCounter, 0 mSDsluCounter, 1870 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2339 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 06:06:39,541 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2339 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 06:06:39,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1101 states. [2025-01-09 06:06:39,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1101 to 1101. [2025-01-09 06:06:39,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1101 states, 891 states have (on average 1.4208754208754208) internal successors, (1266), 908 states have internal predecessors, (1266), 123 states have call successors, (123), 71 states have call predecessors, (123), 85 states have return successors, (164), 125 states have call predecessors, (164), 119 states have call successors, (164) [2025-01-09 06:06:39,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1101 states to 1101 states and 1553 transitions. [2025-01-09 06:06:39,639 INFO L78 Accepts]: Start accepts. Automaton has 1101 states and 1553 transitions. Word has length 64 [2025-01-09 06:06:39,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:06:39,639 INFO L471 AbstractCegarLoop]: Abstraction has 1101 states and 1553 transitions. [2025-01-09 06:06:39,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 5 states have internal predecessors, (49), 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:06:39,639 INFO L276 IsEmpty]: Start isEmpty. Operand 1101 states and 1553 transitions. [2025-01-09 06:06:39,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-01-09 06:06:39,641 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:06:39,641 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] [2025-01-09 06:06:39,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 06:06:39,641 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:06:39,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:06:39,642 INFO L85 PathProgramCache]: Analyzing trace with hash -1402577814, now seen corresponding path program 1 times [2025-01-09 06:06:39,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:06:39,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035855256] [2025-01-09 06:06:39,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:06:39,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:06:39,652 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-01-09 06:06:39,661 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-01-09 06:06:39,662 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:06:39,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:06:39,744 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:06:39,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:06:39,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035855256] [2025-01-09 06:06:39,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035855256] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:06:39,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:06:39,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:06:39,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788278600] [2025-01-09 06:06:39,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:06:39,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:06:39,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:06:39,749 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:06:39,749 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:06:39,749 INFO L87 Difference]: Start difference. First operand 1101 states and 1553 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 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:06:40,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:06:40,446 INFO L93 Difference]: Finished difference Result 3563 states and 4990 transitions. [2025-01-09 06:06:40,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 06:06:40,450 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 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 64 [2025-01-09 06:06:40,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:06:40,460 INFO L225 Difference]: With dead ends: 3563 [2025-01-09 06:06:40,460 INFO L226 Difference]: Without dead ends: 1391 [2025-01-09 06:06:40,466 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-01-09 06:06:40,467 INFO L435 NwaCegarLoop]: 737 mSDtfsCounter, 1401 mSDsluCounter, 1380 mSDsCounter, 0 mSdLazyCounter, 463 mSolverCounterSat, 241 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1410 SdHoareTripleChecker+Valid, 2117 SdHoareTripleChecker+Invalid, 704 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 241 IncrementalHoareTripleChecker+Valid, 463 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 06:06:40,467 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1410 Valid, 2117 Invalid, 704 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [241 Valid, 463 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 06:06:40,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1391 states. [2025-01-09 06:06:40,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1391 to 1026. [2025-01-09 06:06:40,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1026 states, 816 states have (on average 1.3872549019607843) internal successors, (1132), 833 states have internal predecessors, (1132), 123 states have call successors, (123), 71 states have call predecessors, (123), 85 states have return successors, (152), 125 states have call predecessors, (152), 119 states have call successors, (152) [2025-01-09 06:06:40,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1026 states to 1026 states and 1407 transitions. [2025-01-09 06:06:40,548 INFO L78 Accepts]: Start accepts. Automaton has 1026 states and 1407 transitions. Word has length 64 [2025-01-09 06:06:40,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:06:40,549 INFO L471 AbstractCegarLoop]: Abstraction has 1026 states and 1407 transitions. [2025-01-09 06:06:40,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 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:06:40,549 INFO L276 IsEmpty]: Start isEmpty. Operand 1026 states and 1407 transitions. [2025-01-09 06:06:40,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-01-09 06:06:40,551 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:06:40,551 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] [2025-01-09 06:06:40,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 06:06:40,551 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:06:40,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:06:40,552 INFO L85 PathProgramCache]: Analyzing trace with hash 20469801, now seen corresponding path program 1 times [2025-01-09 06:06:40,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:06:40,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675517956] [2025-01-09 06:06:40,552 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:06:40,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:06:40,560 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-01-09 06:06:40,564 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-01-09 06:06:40,564 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:06:40,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:06:40,642 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:06:40,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:06:40,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675517956] [2025-01-09 06:06:40,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675517956] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:06:40,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:06:40,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:06:40,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072702295] [2025-01-09 06:06:40,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:06:40,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:06:40,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:06:40,644 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:06:40,644 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:06:40,644 INFO L87 Difference]: Start difference. First operand 1026 states and 1407 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 5 states have internal predecessors, (50), 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:06:40,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:06:40,737 INFO L93 Difference]: Finished difference Result 1869 states and 2534 transitions. [2025-01-09 06:06:40,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 06:06:40,738 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 5 states have internal predecessors, (50), 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 65 [2025-01-09 06:06:40,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:06:40,744 INFO L225 Difference]: With dead ends: 1869 [2025-01-09 06:06:40,745 INFO L226 Difference]: Without dead ends: 1071 [2025-01-09 06:06:40,747 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:06:40,748 INFO L435 NwaCegarLoop]: 461 mSDtfsCounter, 0 mSDsluCounter, 1839 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2300 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:06:40,748 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2300 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 06:06:40,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1071 states. [2025-01-09 06:06:40,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1071 to 1071. [2025-01-09 06:06:40,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1071 states, 852 states have (on average 1.3708920187793427) internal successors, (1168), 869 states have internal predecessors, (1168), 123 states have call successors, (123), 71 states have call predecessors, (123), 94 states have return successors, (161), 134 states have call predecessors, (161), 119 states have call successors, (161) [2025-01-09 06:06:40,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1071 states to 1071 states and 1452 transitions. [2025-01-09 06:06:40,819 INFO L78 Accepts]: Start accepts. Automaton has 1071 states and 1452 transitions. Word has length 65 [2025-01-09 06:06:40,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:06:40,820 INFO L471 AbstractCegarLoop]: Abstraction has 1071 states and 1452 transitions. [2025-01-09 06:06:40,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 5 states have internal predecessors, (50), 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:06:40,820 INFO L276 IsEmpty]: Start isEmpty. Operand 1071 states and 1452 transitions. [2025-01-09 06:06:40,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-01-09 06:06:40,821 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:06:40,821 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] [2025-01-09 06:06:40,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 06:06:40,822 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:06:40,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:06:40,823 INFO L85 PathProgramCache]: Analyzing trace with hash 1943697835, now seen corresponding path program 1 times [2025-01-09 06:06:40,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:06:40,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493604017] [2025-01-09 06:06:40,823 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:06:40,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:06:40,833 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-01-09 06:06:40,842 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-01-09 06:06:40,842 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:06:40,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:06:40,995 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:06:40,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:06:40,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493604017] [2025-01-09 06:06:40,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493604017] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:06:40,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:06:40,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:06:40,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001799322] [2025-01-09 06:06:40,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:06:40,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:06:40,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:06:40,997 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:06:40,997 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:06:40,998 INFO L87 Difference]: Start difference. First operand 1071 states and 1452 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 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:06:41,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:06:41,763 INFO L93 Difference]: Finished difference Result 1968 states and 2602 transitions. [2025-01-09 06:06:41,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 06:06:41,764 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 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 65 [2025-01-09 06:06:41,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:06:41,772 INFO L225 Difference]: With dead ends: 1968 [2025-01-09 06:06:41,772 INFO L226 Difference]: Without dead ends: 1210 [2025-01-09 06:06:41,774 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-01-09 06:06:41,776 INFO L435 NwaCegarLoop]: 270 mSDtfsCounter, 679 mSDsluCounter, 769 mSDsCounter, 0 mSdLazyCounter, 920 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 704 SdHoareTripleChecker+Valid, 1039 SdHoareTripleChecker+Invalid, 994 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 920 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 06:06:41,777 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [704 Valid, 1039 Invalid, 994 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 920 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 06:06:41,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1210 states. [2025-01-09 06:06:41,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1210 to 1080. [2025-01-09 06:06:41,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1080 states, 861 states have (on average 1.3646922183507548) internal successors, (1175), 876 states have internal predecessors, (1175), 124 states have call successors, (124), 72 states have call predecessors, (124), 93 states have return successors, (156), 135 states have call predecessors, (156), 120 states have call successors, (156) [2025-01-09 06:06:41,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1080 states to 1080 states and 1455 transitions. [2025-01-09 06:06:41,876 INFO L78 Accepts]: Start accepts. Automaton has 1080 states and 1455 transitions. Word has length 65 [2025-01-09 06:06:41,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:06:41,876 INFO L471 AbstractCegarLoop]: Abstraction has 1080 states and 1455 transitions. [2025-01-09 06:06:41,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 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:06:41,876 INFO L276 IsEmpty]: Start isEmpty. Operand 1080 states and 1455 transitions. [2025-01-09 06:06:41,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-01-09 06:06:41,878 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:06:41,878 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] [2025-01-09 06:06:41,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 06:06:41,878 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:06:41,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:06:41,879 INFO L85 PathProgramCache]: Analyzing trace with hash -2132414743, now seen corresponding path program 1 times [2025-01-09 06:06:41,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:06:41,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049102819] [2025-01-09 06:06:41,880 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:06:41,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:06:41,889 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-01-09 06:06:41,901 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-01-09 06:06:41,902 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:06:41,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:06:41,958 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:06:41,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:06:41,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049102819] [2025-01-09 06:06:41,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049102819] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:06:41,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:06:41,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 06:06:41,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863575668] [2025-01-09 06:06:41,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:06:41,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 06:06:41,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:06:41,960 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 06:06:41,960 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 06:06:41,960 INFO L87 Difference]: Start difference. First operand 1080 states and 1455 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 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:06:42,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:06:42,483 INFO L93 Difference]: Finished difference Result 2770 states and 3689 transitions. [2025-01-09 06:06:42,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 06:06:42,484 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 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 65 [2025-01-09 06:06:42,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:06:42,496 INFO L225 Difference]: With dead ends: 2770 [2025-01-09 06:06:42,497 INFO L226 Difference]: Without dead ends: 1921 [2025-01-09 06:06:42,499 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:06:42,500 INFO L435 NwaCegarLoop]: 256 mSDtfsCounter, 634 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 321 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 659 SdHoareTripleChecker+Valid, 530 SdHoareTripleChecker+Invalid, 391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 06:06:42,500 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [659 Valid, 530 Invalid, 391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 321 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 06:06:42,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1921 states. [2025-01-09 06:06:42,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1921 to 1911. [2025-01-09 06:06:42,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1911 states, 1497 states have (on average 1.3226452905811623) internal successors, (1980), 1525 states have internal predecessors, (1980), 228 states have call successors, (228), 136 states have call predecessors, (228), 184 states have return successors, (333), 256 states have call predecessors, (333), 224 states have call successors, (333) [2025-01-09 06:06:42,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1911 states to 1911 states and 2541 transitions. [2025-01-09 06:06:42,629 INFO L78 Accepts]: Start accepts. Automaton has 1911 states and 2541 transitions. Word has length 65 [2025-01-09 06:06:42,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:06:42,630 INFO L471 AbstractCegarLoop]: Abstraction has 1911 states and 2541 transitions. [2025-01-09 06:06:42,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 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:06:42,630 INFO L276 IsEmpty]: Start isEmpty. Operand 1911 states and 2541 transitions. [2025-01-09 06:06:42,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-01-09 06:06:42,632 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:06:42,632 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] [2025-01-09 06:06:42,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 06:06:42,633 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:06:42,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:06:42,633 INFO L85 PathProgramCache]: Analyzing trace with hash 173878863, now seen corresponding path program 1 times [2025-01-09 06:06:42,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:06:42,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147903460] [2025-01-09 06:06:42,634 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:06:42,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:06:42,641 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-01-09 06:06:42,647 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-01-09 06:06:42,648 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:06:42,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:06:42,675 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:06:42,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:06:42,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147903460] [2025-01-09 06:06:42,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147903460] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:06:42,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:06:42,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 06:06:42,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874053486] [2025-01-09 06:06:42,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:06:42,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 06:06:42,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:06:42,677 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 06:06:42,677 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 06:06:42,677 INFO L87 Difference]: Start difference. First operand 1911 states and 2541 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 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:06:42,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:06:42,793 INFO L93 Difference]: Finished difference Result 3455 states and 4629 transitions. [2025-01-09 06:06:42,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 06:06:42,794 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 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 66 [2025-01-09 06:06:42,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:06:42,798 INFO L225 Difference]: With dead ends: 3455 [2025-01-09 06:06:42,798 INFO L226 Difference]: Without dead ends: 208 [2025-01-09 06:06:42,806 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:06:42,806 INFO L435 NwaCegarLoop]: 448 mSDtfsCounter, 431 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 431 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 06:06:42,806 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [431 Valid, 448 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 06:06:42,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2025-01-09 06:06:42,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 208. [2025-01-09 06:06:42,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 180 states have (on average 1.55) internal successors, (279), 182 states have internal predecessors, (279), 21 states have call successors, (21), 7 states have call predecessors, (21), 6 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-01-09 06:06:42,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 319 transitions. [2025-01-09 06:06:42,819 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 319 transitions. Word has length 66 [2025-01-09 06:06:42,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:06:42,819 INFO L471 AbstractCegarLoop]: Abstraction has 208 states and 319 transitions. [2025-01-09 06:06:42,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 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:06:42,820 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 319 transitions. [2025-01-09 06:06:42,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-01-09 06:06:42,820 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:06:42,821 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] [2025-01-09 06:06:42,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 06:06:42,821 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:06:42,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:06:42,822 INFO L85 PathProgramCache]: Analyzing trace with hash -1511400774, now seen corresponding path program 1 times [2025-01-09 06:06:42,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:06:42,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762720379] [2025-01-09 06:06:42,822 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:06:42,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:06:42,831 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-01-09 06:06:42,835 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-01-09 06:06:42,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:06:42,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:06:42,866 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:06:42,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:06:42,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762720379] [2025-01-09 06:06:42,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762720379] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:06:42,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:06:42,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 06:06:42,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011680795] [2025-01-09 06:06:42,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:06:42,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 06:06:42,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:06:42,868 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 06:06:42,868 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 06:06:42,868 INFO L87 Difference]: Start difference. First operand 208 states and 319 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 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:06:42,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:06:42,881 INFO L93 Difference]: Finished difference Result 404 states and 619 transitions. [2025-01-09 06:06:42,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 06:06:42,881 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 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 100 [2025-01-09 06:06:42,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:06:42,884 INFO L225 Difference]: With dead ends: 404 [2025-01-09 06:06:42,884 INFO L226 Difference]: Without dead ends: 208 [2025-01-09 06:06:42,885 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:06:42,885 INFO L435 NwaCegarLoop]: 317 mSDtfsCounter, 307 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 307 SdHoareTripleChecker+Valid, 318 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:06:42,886 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [307 Valid, 318 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 06:06:42,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2025-01-09 06:06:42,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 208. [2025-01-09 06:06:42,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 180 states have (on average 1.5444444444444445) internal successors, (278), 182 states have internal predecessors, (278), 21 states have call successors, (21), 7 states have call predecessors, (21), 6 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-01-09 06:06:42,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 318 transitions. [2025-01-09 06:06:42,897 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 318 transitions. Word has length 100 [2025-01-09 06:06:42,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:06:42,897 INFO L471 AbstractCegarLoop]: Abstraction has 208 states and 318 transitions. [2025-01-09 06:06:42,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 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:06:42,898 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 318 transitions. [2025-01-09 06:06:42,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-01-09 06:06:42,898 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:06:42,898 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] [2025-01-09 06:06:42,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 06:06:42,899 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:06:42,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:06:42,899 INFO L85 PathProgramCache]: Analyzing trace with hash -925124552, now seen corresponding path program 1 times [2025-01-09 06:06:42,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:06:42,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386468979] [2025-01-09 06:06:42,900 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:06:42,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:06:42,907 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-01-09 06:06:42,910 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-01-09 06:06:42,911 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:06:42,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:06:42,987 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:06:42,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:06:42,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386468979] [2025-01-09 06:06:42,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386468979] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:06:42,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:06:42,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 06:06:42,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685795567] [2025-01-09 06:06:42,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:06:42,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 06:06:42,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:06:42,989 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 06:06:42,989 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 06:06:42,990 INFO L87 Difference]: Start difference. First operand 208 states and 318 transitions. Second operand has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 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:06:43,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:06:43,334 INFO L93 Difference]: Finished difference Result 616 states and 954 transitions. [2025-01-09 06:06:43,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 06:06:43,334 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 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 100 [2025-01-09 06:06:43,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:06:43,338 INFO L225 Difference]: With dead ends: 616 [2025-01-09 06:06:43,338 INFO L226 Difference]: Without dead ends: 422 [2025-01-09 06:06:43,339 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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:06:43,340 INFO L435 NwaCegarLoop]: 247 mSDtfsCounter, 568 mSDsluCounter, 615 mSDsCounter, 0 mSdLazyCounter, 350 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 581 SdHoareTripleChecker+Valid, 862 SdHoareTripleChecker+Invalid, 396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 06:06:43,340 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [581 Valid, 862 Invalid, 396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 350 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 06:06:43,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2025-01-09 06:06:43,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 405. [2025-01-09 06:06:43,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 405 states, 356 states have (on average 1.5589887640449438) internal successors, (555), 359 states have internal predecessors, (555), 35 states have call successors, (35), 13 states have call predecessors, (35), 13 states have return successors, (34), 33 states have call predecessors, (34), 33 states have call successors, (34) [2025-01-09 06:06:43,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 624 transitions. [2025-01-09 06:06:43,360 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 624 transitions. Word has length 100 [2025-01-09 06:06:43,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:06:43,361 INFO L471 AbstractCegarLoop]: Abstraction has 405 states and 624 transitions. [2025-01-09 06:06:43,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 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:06:43,361 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 624 transitions. [2025-01-09 06:06:43,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-01-09 06:06:43,362 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:06:43,362 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] [2025-01-09 06:06:43,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 06:06:43,363 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:06:43,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:06:43,363 INFO L85 PathProgramCache]: Analyzing trace with hash 1513344052, now seen corresponding path program 1 times [2025-01-09 06:06:43,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:06:43,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802302741] [2025-01-09 06:06:43,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:06:43,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:06:43,371 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-01-09 06:06:43,375 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-01-09 06:06:43,375 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:06:43,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:06:43,477 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:06:43,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:06:43,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802302741] [2025-01-09 06:06:43,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802302741] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:06:43,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:06:43,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:06:43,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629938087] [2025-01-09 06:06:43,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:06:43,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:06:43,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:06:43,479 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:06:43,479 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:06:43,479 INFO L87 Difference]: Start difference. First operand 405 states and 624 transitions. Second operand has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 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:06:43,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:06:43,939 INFO L93 Difference]: Finished difference Result 1040 states and 1617 transitions. [2025-01-09 06:06:43,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 06:06:43,940 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 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 100 [2025-01-09 06:06:43,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:06:43,945 INFO L225 Difference]: With dead ends: 1040 [2025-01-09 06:06:43,945 INFO L226 Difference]: Without dead ends: 649 [2025-01-09 06:06:43,946 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:06:43,947 INFO L435 NwaCegarLoop]: 289 mSDtfsCounter, 576 mSDsluCounter, 911 mSDsCounter, 0 mSdLazyCounter, 561 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 589 SdHoareTripleChecker+Valid, 1200 SdHoareTripleChecker+Invalid, 599 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 561 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 06:06:43,947 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [589 Valid, 1200 Invalid, 599 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 561 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 06:06:43,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2025-01-09 06:06:43,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 588. [2025-01-09 06:06:43,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 588 states, 518 states have (on average 1.5521235521235521) internal successors, (804), 522 states have internal predecessors, (804), 49 states have call successors, (49), 19 states have call predecessors, (49), 20 states have return successors, (51), 48 states have call predecessors, (51), 47 states have call successors, (51) [2025-01-09 06:06:43,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 904 transitions. [2025-01-09 06:06:43,983 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 904 transitions. Word has length 100 [2025-01-09 06:06:43,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:06:43,983 INFO L471 AbstractCegarLoop]: Abstraction has 588 states and 904 transitions. [2025-01-09 06:06:43,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 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:06:43,983 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 904 transitions. [2025-01-09 06:06:43,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-01-09 06:06:43,984 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:06:43,984 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] [2025-01-09 06:06:43,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 06:06:43,985 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:06:43,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:06:43,985 INFO L85 PathProgramCache]: Analyzing trace with hash -1214865294, now seen corresponding path program 1 times [2025-01-09 06:06:43,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:06:43,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512848007] [2025-01-09 06:06:43,985 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:06:43,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:06:43,994 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-01-09 06:06:43,998 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-01-09 06:06:43,999 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:06:43,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:06:44,141 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:06:44,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:06:44,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512848007] [2025-01-09 06:06:44,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512848007] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:06:44,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:06:44,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:06:44,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661860734] [2025-01-09 06:06:44,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:06:44,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:06:44,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:06:44,144 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:06:44,144 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:06:44,144 INFO L87 Difference]: Start difference. First operand 588 states and 904 transitions. Second operand has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 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:06:44,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:06:44,664 INFO L93 Difference]: Finished difference Result 1614 states and 2506 transitions. [2025-01-09 06:06:44,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 06:06:44,665 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 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 100 [2025-01-09 06:06:44,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:06:44,672 INFO L225 Difference]: With dead ends: 1614 [2025-01-09 06:06:44,672 INFO L226 Difference]: Without dead ends: 1040 [2025-01-09 06:06:44,674 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:06:44,675 INFO L435 NwaCegarLoop]: 404 mSDtfsCounter, 555 mSDsluCounter, 1204 mSDsCounter, 0 mSdLazyCounter, 635 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 568 SdHoareTripleChecker+Valid, 1608 SdHoareTripleChecker+Invalid, 662 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 635 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 06:06:44,675 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [568 Valid, 1608 Invalid, 662 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 635 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 06:06:44,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1040 states. [2025-01-09 06:06:44,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1040 to 973. [2025-01-09 06:06:44,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 973 states, 859 states have (on average 1.5518044237485449) internal successors, (1333), 867 states have internal predecessors, (1333), 77 states have call successors, (77), 31 states have call predecessors, (77), 36 states have return successors, (91), 78 states have call predecessors, (91), 75 states have call successors, (91) [2025-01-09 06:06:44,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 973 states to 973 states and 1501 transitions. [2025-01-09 06:06:44,730 INFO L78 Accepts]: Start accepts. Automaton has 973 states and 1501 transitions. Word has length 100 [2025-01-09 06:06:44,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:06:44,731 INFO L471 AbstractCegarLoop]: Abstraction has 973 states and 1501 transitions. [2025-01-09 06:06:44,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 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:06:44,731 INFO L276 IsEmpty]: Start isEmpty. Operand 973 states and 1501 transitions. [2025-01-09 06:06:44,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-01-09 06:06:44,733 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:06:44,733 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] [2025-01-09 06:06:44,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 06:06:44,734 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:06:44,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:06:44,734 INFO L85 PathProgramCache]: Analyzing trace with hash 2022263924, now seen corresponding path program 1 times [2025-01-09 06:06:44,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:06:44,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258323068] [2025-01-09 06:06:44,735 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:06:44,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:06:44,747 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-01-09 06:06:44,753 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-01-09 06:06:44,753 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:06:44,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:06:44,871 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:06:44,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:06:44,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258323068] [2025-01-09 06:06:44,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258323068] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:06:44,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:06:44,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:06:44,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736360615] [2025-01-09 06:06:44,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:06:44,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:06:44,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:06:44,873 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:06:44,873 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:06:44,874 INFO L87 Difference]: Start difference. First operand 973 states and 1501 transitions. Second operand has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 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:06:45,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:06:45,420 INFO L93 Difference]: Finished difference Result 2833 states and 4429 transitions. [2025-01-09 06:06:45,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 06:06:45,421 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 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 100 [2025-01-09 06:06:45,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:06:45,435 INFO L225 Difference]: With dead ends: 2833 [2025-01-09 06:06:45,435 INFO L226 Difference]: Without dead ends: 1874 [2025-01-09 06:06:45,439 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:06:45,439 INFO L435 NwaCegarLoop]: 401 mSDtfsCounter, 550 mSDsluCounter, 1195 mSDsCounter, 0 mSdLazyCounter, 635 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 563 SdHoareTripleChecker+Valid, 1596 SdHoareTripleChecker+Invalid, 662 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 635 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 06:06:45,439 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [563 Valid, 1596 Invalid, 662 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 635 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 06:06:45,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1874 states. [2025-01-09 06:06:45,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1874 to 1794. [2025-01-09 06:06:45,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1794 states, 1586 states have (on average 1.5592686002522067) internal successors, (2473), 1608 states have internal predecessors, (2473), 133 states have call successors, (133), 55 states have call predecessors, (133), 74 states have return successors, (195), 138 states have call predecessors, (195), 131 states have call successors, (195) [2025-01-09 06:06:45,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1794 states to 1794 states and 2801 transitions. [2025-01-09 06:06:45,556 INFO L78 Accepts]: Start accepts. Automaton has 1794 states and 2801 transitions. Word has length 100 [2025-01-09 06:06:45,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:06:45,557 INFO L471 AbstractCegarLoop]: Abstraction has 1794 states and 2801 transitions. [2025-01-09 06:06:45,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 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:06:45,557 INFO L276 IsEmpty]: Start isEmpty. Operand 1794 states and 2801 transitions. [2025-01-09 06:06:45,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-01-09 06:06:45,559 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:06:45,559 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] [2025-01-09 06:06:45,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 06:06:45,560 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:06:45,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:06:45,560 INFO L85 PathProgramCache]: Analyzing trace with hash 879761458, now seen corresponding path program 1 times [2025-01-09 06:06:45,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:06:45,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175177283] [2025-01-09 06:06:45,560 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:06:45,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:06:45,570 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-01-09 06:06:45,573 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-01-09 06:06:45,574 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:06:45,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:06:45,685 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:06:45,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:06:45,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175177283] [2025-01-09 06:06:45,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175177283] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:06:45,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:06:45,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:06:45,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140237813] [2025-01-09 06:06:45,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:06:45,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:06:45,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:06:45,688 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:06:45,688 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:06:45,688 INFO L87 Difference]: Start difference. First operand 1794 states and 2801 transitions. Second operand has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 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:06:46,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:06:46,328 INFO L93 Difference]: Finished difference Result 5456 states and 8687 transitions. [2025-01-09 06:06:46,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 06:06:46,329 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 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 100 [2025-01-09 06:06:46,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:06:46,351 INFO L225 Difference]: With dead ends: 5456 [2025-01-09 06:06:46,351 INFO L226 Difference]: Without dead ends: 3676 [2025-01-09 06:06:46,358 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:06:46,359 INFO L435 NwaCegarLoop]: 398 mSDtfsCounter, 545 mSDsluCounter, 1186 mSDsCounter, 0 mSdLazyCounter, 635 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 558 SdHoareTripleChecker+Valid, 1584 SdHoareTripleChecker+Invalid, 662 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 635 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 06:06:46,359 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [558 Valid, 1584 Invalid, 662 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 635 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 06:06:46,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3676 states. [2025-01-09 06:06:46,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3676 to 3571. [2025-01-09 06:06:46,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3571 states, 3157 states have (on average 1.572695597085841) internal successors, (4965), 3225 states have internal predecessors, (4965), 245 states have call successors, (245), 103 states have call predecessors, (245), 168 states have return successors, (499), 258 states have call predecessors, (499), 243 states have call successors, (499) [2025-01-09 06:06:46,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3571 states to 3571 states and 5709 transitions. [2025-01-09 06:06:46,583 INFO L78 Accepts]: Start accepts. Automaton has 3571 states and 5709 transitions. Word has length 100 [2025-01-09 06:06:46,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:06:46,583 INFO L471 AbstractCegarLoop]: Abstraction has 3571 states and 5709 transitions. [2025-01-09 06:06:46,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 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:06:46,584 INFO L276 IsEmpty]: Start isEmpty. Operand 3571 states and 5709 transitions. [2025-01-09 06:06:46,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-01-09 06:06:46,587 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:06:46,587 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] [2025-01-09 06:06:46,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 06:06:46,587 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:06:46,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:06:46,588 INFO L85 PathProgramCache]: Analyzing trace with hash 1120001204, now seen corresponding path program 1 times [2025-01-09 06:06:46,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:06:46,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585428024] [2025-01-09 06:06:46,588 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:06:46,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:06:46,595 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-01-09 06:06:46,599 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-01-09 06:06:46,599 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:06:46,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:06:46,700 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:06:46,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:06:46,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585428024] [2025-01-09 06:06:46,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585428024] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:06:46,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:06:46,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:06:46,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480581626] [2025-01-09 06:06:46,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:06:46,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:06:46,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:06:46,701 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:06:46,701 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:06:46,701 INFO L87 Difference]: Start difference. First operand 3571 states and 5709 transitions. Second operand has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 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:06:47,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:06:47,657 INFO L93 Difference]: Finished difference Result 11823 states and 19378 transitions. [2025-01-09 06:06:47,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 06:06:47,658 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 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 100 [2025-01-09 06:06:47,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:06:47,701 INFO L225 Difference]: With dead ends: 11823 [2025-01-09 06:06:47,701 INFO L226 Difference]: Without dead ends: 8266 [2025-01-09 06:06:47,714 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:06:47,715 INFO L435 NwaCegarLoop]: 393 mSDtfsCounter, 593 mSDsluCounter, 1166 mSDsCounter, 0 mSdLazyCounter, 780 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 605 SdHoareTripleChecker+Valid, 1559 SdHoareTripleChecker+Invalid, 809 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 780 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 06:06:47,715 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [605 Valid, 1559 Invalid, 809 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 780 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 06:06:47,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8266 states. [2025-01-09 06:06:48,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8266 to 7428. [2025-01-09 06:06:48,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7428 states, 6564 states have (on average 1.5918647166361974) internal successors, (10449), 6778 states have internal predecessors, (10449), 453 states have call successors, (453), 199 states have call predecessors, (453), 410 states have return successors, (1475), 482 states have call predecessors, (1475), 451 states have call successors, (1475) [2025-01-09 06:06:48,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7428 states to 7428 states and 12377 transitions. [2025-01-09 06:06:48,272 INFO L78 Accepts]: Start accepts. Automaton has 7428 states and 12377 transitions. Word has length 100 [2025-01-09 06:06:48,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:06:48,273 INFO L471 AbstractCegarLoop]: Abstraction has 7428 states and 12377 transitions. [2025-01-09 06:06:48,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 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:06:48,273 INFO L276 IsEmpty]: Start isEmpty. Operand 7428 states and 12377 transitions. [2025-01-09 06:06:48,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-01-09 06:06:48,279 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:06:48,279 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] [2025-01-09 06:06:48,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 06:06:48,279 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:06:48,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:06:48,280 INFO L85 PathProgramCache]: Analyzing trace with hash 1959034866, now seen corresponding path program 1 times [2025-01-09 06:06:48,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:06:48,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180738840] [2025-01-09 06:06:48,281 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:06:48,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:06:48,289 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-01-09 06:06:48,292 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-01-09 06:06:48,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:06:48,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:06:48,398 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:06:48,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:06:48,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180738840] [2025-01-09 06:06:48,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180738840] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:06:48,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:06:48,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:06:48,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089057582] [2025-01-09 06:06:48,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:06:48,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:06:48,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:06:48,400 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:06:48,400 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:06:48,400 INFO L87 Difference]: Start difference. First operand 7428 states and 12377 transitions. Second operand has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 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:06:49,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:06:49,891 INFO L93 Difference]: Finished difference Result 24746 states and 42944 transitions. [2025-01-09 06:06:49,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 06:06:49,891 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 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 100 [2025-01-09 06:06:49,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:06:50,001 INFO L225 Difference]: With dead ends: 24746 [2025-01-09 06:06:50,002 INFO L226 Difference]: Without dead ends: 17332 [2025-01-09 06:06:50,034 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:06:50,035 INFO L435 NwaCegarLoop]: 389 mSDtfsCounter, 668 mSDsluCounter, 1154 mSDsCounter, 0 mSdLazyCounter, 638 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 687 SdHoareTripleChecker+Valid, 1543 SdHoareTripleChecker+Invalid, 668 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 638 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 06:06:50,035 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [687 Valid, 1543 Invalid, 668 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 638 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 06:06:50,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17332 states. [2025-01-09 06:06:51,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17332 to 15697. [2025-01-09 06:06:51,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15697 states, 13787 states have (on average 1.6044824834989482) internal successors, (22121), 14455 states have internal predecessors, (22121), 853 states have call successors, (853), 391 states have call predecessors, (853), 1056 states have return successors, (4947), 914 states have call predecessors, (4947), 851 states have call successors, (4947) [2025-01-09 06:06:51,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15697 states to 15697 states and 27921 transitions. [2025-01-09 06:06:51,469 INFO L78 Accepts]: Start accepts. Automaton has 15697 states and 27921 transitions. Word has length 100 [2025-01-09 06:06:51,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:06:51,469 INFO L471 AbstractCegarLoop]: Abstraction has 15697 states and 27921 transitions. [2025-01-09 06:06:51,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 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:06:51,470 INFO L276 IsEmpty]: Start isEmpty. Operand 15697 states and 27921 transitions. [2025-01-09 06:06:51,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-01-09 06:06:51,483 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:06:51,483 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] [2025-01-09 06:06:51,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 06:06:51,484 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:06:51,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:06:51,484 INFO L85 PathProgramCache]: Analyzing trace with hash 1986100468, now seen corresponding path program 1 times [2025-01-09 06:06:51,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:06:51,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167245884] [2025-01-09 06:06:51,484 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:06:51,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:06:51,500 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-01-09 06:06:51,506 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-01-09 06:06:51,506 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:06:51,506 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:06:51,621 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:06:51,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:06:51,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167245884] [2025-01-09 06:06:51,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167245884] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:06:51,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:06:51,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:06:51,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954460848] [2025-01-09 06:06:51,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:06:51,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:06:51,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:06:51,623 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:06:51,623 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:06:51,623 INFO L87 Difference]: Start difference. First operand 15697 states and 27921 transitions. Second operand has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 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:06:54,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:06:54,061 INFO L93 Difference]: Finished difference Result 52505 states and 99798 transitions. [2025-01-09 06:06:54,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 06:06:54,061 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 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 100 [2025-01-09 06:06:54,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:06:54,434 INFO L225 Difference]: With dead ends: 52505 [2025-01-09 06:06:54,435 INFO L226 Difference]: Without dead ends: 36822 [2025-01-09 06:06:54,482 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:06:54,482 INFO L435 NwaCegarLoop]: 387 mSDtfsCounter, 563 mSDsluCounter, 1148 mSDsCounter, 0 mSdLazyCounter, 740 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 575 SdHoareTripleChecker+Valid, 1535 SdHoareTripleChecker+Invalid, 769 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 740 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 06:06:54,483 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [575 Valid, 1535 Invalid, 769 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 740 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 06:06:54,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36822 states. [2025-01-09 06:06:57,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36822 to 34614. [2025-01-09 06:06:57,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34614 states, 30158 states have (on average 1.6191060415146894) internal successors, (48829), 32220 states have internal predecessors, (48829), 1621 states have call successors, (1621), 775 states have call predecessors, (1621), 2834 states have return successors, (18003), 1746 states have call predecessors, (18003), 1619 states have call successors, (18003) [2025-01-09 06:06:57,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34614 states to 34614 states and 68453 transitions. [2025-01-09 06:06:57,852 INFO L78 Accepts]: Start accepts. Automaton has 34614 states and 68453 transitions. Word has length 100 [2025-01-09 06:06:57,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:06:57,853 INFO L471 AbstractCegarLoop]: Abstraction has 34614 states and 68453 transitions. [2025-01-09 06:06:57,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 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:06:57,853 INFO L276 IsEmpty]: Start isEmpty. Operand 34614 states and 68453 transitions. [2025-01-09 06:06:57,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-01-09 06:06:57,874 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:06:57,874 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] [2025-01-09 06:06:57,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 06:06:57,874 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:06:57,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:06:57,875 INFO L85 PathProgramCache]: Analyzing trace with hash -91236430, now seen corresponding path program 1 times [2025-01-09 06:06:57,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:06:57,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712416716] [2025-01-09 06:06:57,876 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:06:57,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:06:57,886 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-01-09 06:06:57,890 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-01-09 06:06:57,891 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:06:57,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:06:57,974 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:06:57,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:06:57,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712416716] [2025-01-09 06:06:57,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712416716] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:06:57,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:06:57,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:06:57,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327220276] [2025-01-09 06:06:57,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:06:57,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:06:57,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:06:57,976 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:06:57,976 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:06:57,976 INFO L87 Difference]: Start difference. First operand 34614 states and 68453 transitions. Second operand has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 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:07:02,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:07:02,112 INFO L93 Difference]: Finished difference Result 112102 states and 247352 transitions. [2025-01-09 06:07:02,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 06:07:02,112 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 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 100 [2025-01-09 06:07:02,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:07:02,845 INFO L225 Difference]: With dead ends: 112102 [2025-01-09 06:07:02,845 INFO L226 Difference]: Without dead ends: 77502 [2025-01-09 06:07:03,024 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:07:03,025 INFO L435 NwaCegarLoop]: 246 mSDtfsCounter, 598 mSDsluCounter, 820 mSDsCounter, 0 mSdLazyCounter, 517 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 617 SdHoareTripleChecker+Valid, 1066 SdHoareTripleChecker+Invalid, 564 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 517 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 06:07:03,025 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [617 Valid, 1066 Invalid, 564 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 517 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 06:07:03,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77502 states. [2025-01-09 06:07:10,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77502 to 75172. [2025-01-09 06:07:10,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75172 states, 64230 states have (on average 1.611567803207224) internal successors, (103511), 70538 states have internal predecessors, (103511), 3093 states have call successors, (3093), 1543 states have call predecessors, (3093), 7848 states have return successors, (68627), 3346 states have call predecessors, (68627), 3091 states have call successors, (68627) [2025-01-09 06:07:11,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75172 states to 75172 states and 175231 transitions. [2025-01-09 06:07:11,481 INFO L78 Accepts]: Start accepts. Automaton has 75172 states and 175231 transitions. Word has length 100 [2025-01-09 06:07:11,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:07:11,482 INFO L471 AbstractCegarLoop]: Abstraction has 75172 states and 175231 transitions. [2025-01-09 06:07:11,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 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:07:11,482 INFO L276 IsEmpty]: Start isEmpty. Operand 75172 states and 175231 transitions. [2025-01-09 06:07:11,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-01-09 06:07:11,777 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:07:11,777 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] [2025-01-09 06:07:11,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 06:07:11,778 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:07:11,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:07:11,779 INFO L85 PathProgramCache]: Analyzing trace with hash 795986416, now seen corresponding path program 1 times [2025-01-09 06:07:11,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:07:11,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366919835] [2025-01-09 06:07:11,779 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:07:11,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:07:11,788 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-01-09 06:07:11,793 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-01-09 06:07:11,793 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:07:11,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:07:11,897 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:07:11,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:07:11,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366919835] [2025-01-09 06:07:11,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366919835] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:07:11,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:07:11,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:07:11,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430828984] [2025-01-09 06:07:11,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:07:11,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:07:11,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:07:11,899 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:07:11,899 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:07:11,899 INFO L87 Difference]: Start difference. First operand 75172 states and 175231 transitions. Second operand has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 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)