./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.06.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.06.cil-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2299ca1c26d35c3e5f6d860495fd40e041317a8644bf02bee237b59c63427ec2 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 16:21:28,306 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 16:21:28,356 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 16:21:28,360 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 16:21:28,360 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 16:21:28,380 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 16:21:28,381 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 16:21:28,381 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 16:21:28,381 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 16:21:28,381 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 16:21:28,381 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 16:21:28,381 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 16:21:28,381 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 16:21:28,381 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 16:21:28,381 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 16:21:28,382 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 16:21:28,382 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 16:21:28,382 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 16:21:28,382 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 16:21:28,382 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 16:21:28,382 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 16:21:28,382 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 16:21:28,382 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 16:21:28,382 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 16:21:28,382 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 16:21:28,382 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 16:21:28,382 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 16:21:28,382 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 16:21:28,382 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 16:21:28,382 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 16:21:28,382 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 16:21:28,382 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 16:21:28,382 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 16:21:28,383 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 16:21:28,383 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 16:21:28,383 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 16:21:28,383 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 16:21:28,383 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 16:21:28,383 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 16:21:28,383 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 16:21:28,383 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 16:21:28,383 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 16:21:28,383 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 16:21:28,383 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/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2299ca1c26d35c3e5f6d860495fd40e041317a8644bf02bee237b59c63427ec2 [2025-03-03 16:21:28,610 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 16:21:28,618 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 16:21:28,620 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 16:21:28,620 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 16:21:28,621 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 16:21:28,621 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.06.cil-1.c [2025-03-03 16:21:29,763 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb6359452/79cc81a189e7411a99a1416b923fac46/FLAGe12d0e18a [2025-03-03 16:21:29,997 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 16:21:30,002 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.06.cil-1.c [2025-03-03 16:21:30,017 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb6359452/79cc81a189e7411a99a1416b923fac46/FLAGe12d0e18a [2025-03-03 16:21:30,344 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb6359452/79cc81a189e7411a99a1416b923fac46 [2025-03-03 16:21:30,345 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 16:21:30,347 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 16:21:30,347 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 16:21:30,347 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 16:21:30,351 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 16:21:30,352 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 04:21:30" (1/1) ... [2025-03-03 16:21:30,352 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@282bd43a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:21:30, skipping insertion in model container [2025-03-03 16:21:30,352 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 04:21:30" (1/1) ... [2025-03-03 16:21:30,382 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 16:21:30,479 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.06.cil-1.c[914,927] [2025-03-03 16:21:30,515 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.06.cil-1.c[7115,7128] [2025-03-03 16:21:30,562 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 16:21:30,572 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 16:21:30,580 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.06.cil-1.c[914,927] [2025-03-03 16:21:30,592 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.06.cil-1.c[7115,7128] [2025-03-03 16:21:30,622 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 16:21:30,642 INFO L204 MainTranslator]: Completed translation [2025-03-03 16:21:30,643 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:21:30 WrapperNode [2025-03-03 16:21:30,643 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 16:21:30,644 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 16:21:30,644 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 16:21:30,644 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 16:21:30,648 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:21:30" (1/1) ... [2025-03-03 16:21:30,656 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:21:30" (1/1) ... [2025-03-03 16:21:30,688 INFO L138 Inliner]: procedures = 65, calls = 76, calls flagged for inlining = 33, calls inlined = 33, statements flattened = 675 [2025-03-03 16:21:30,688 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 16:21:30,689 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 16:21:30,689 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 16:21:30,689 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 16:21:30,695 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:21:30" (1/1) ... [2025-03-03 16:21:30,696 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:21:30" (1/1) ... [2025-03-03 16:21:30,699 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:21:30" (1/1) ... [2025-03-03 16:21:30,710 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-03-03 16:21:30,710 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:21:30" (1/1) ... [2025-03-03 16:21:30,710 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:21:30" (1/1) ... [2025-03-03 16:21:30,720 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:21:30" (1/1) ... [2025-03-03 16:21:30,726 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:21:30" (1/1) ... [2025-03-03 16:21:30,728 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:21:30" (1/1) ... [2025-03-03 16:21:30,732 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:21:30" (1/1) ... [2025-03-03 16:21:30,738 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 16:21:30,739 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 16:21:30,740 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 16:21:30,740 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 16:21:30,741 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:21:30" (1/1) ... [2025-03-03 16:21:30,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 16:21:30,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:21:30,773 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 16:21:30,776 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 16:21:30,799 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 16:21:30,799 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-03-03 16:21:30,799 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-03-03 16:21:30,799 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2025-03-03 16:21:30,799 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2025-03-03 16:21:30,799 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2025-03-03 16:21:30,800 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2025-03-03 16:21:30,800 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2025-03-03 16:21:30,800 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2025-03-03 16:21:30,800 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2025-03-03 16:21:30,800 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2025-03-03 16:21:30,800 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2025-03-03 16:21:30,800 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2025-03-03 16:21:30,800 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2025-03-03 16:21:30,800 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2025-03-03 16:21:30,800 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2025-03-03 16:21:30,800 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2025-03-03 16:21:30,800 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2025-03-03 16:21:30,800 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2025-03-03 16:21:30,800 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2025-03-03 16:21:30,800 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2025-03-03 16:21:30,800 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2025-03-03 16:21:30,800 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2025-03-03 16:21:30,800 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 16:21:30,800 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2025-03-03 16:21:30,800 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2025-03-03 16:21:30,800 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2025-03-03 16:21:30,800 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2025-03-03 16:21:30,800 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 16:21:30,800 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 16:21:30,801 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2025-03-03 16:21:30,801 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2025-03-03 16:21:30,801 INFO L130 BoogieDeclarations]: Found specification of procedure error2 [2025-03-03 16:21:30,801 INFO L138 BoogieDeclarations]: Found implementation of procedure error2 [2025-03-03 16:21:30,892 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 16:21:30,894 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 16:21:31,486 INFO L? ?]: Removed 95 outVars from TransFormulas that were not future-live. [2025-03-03 16:21:31,486 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 16:21:31,505 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 16:21:31,505 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 16:21:31,506 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 04:21:31 BoogieIcfgContainer [2025-03-03 16:21:31,506 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 16:21:31,507 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 16:21:31,507 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 16:21:31,513 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 16:21:31,514 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 04:21:30" (1/3) ... [2025-03-03 16:21:31,514 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6da5d0ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 04:21:31, skipping insertion in model container [2025-03-03 16:21:31,514 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:21:30" (2/3) ... [2025-03-03 16:21:31,514 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6da5d0ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 04:21:31, skipping insertion in model container [2025-03-03 16:21:31,514 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 04:21:31" (3/3) ... [2025-03-03 16:21:31,515 INFO L128 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-1+token_ring.06.cil-1.c [2025-03-03 16:21:31,526 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 16:21:31,527 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pc_sfifo_2.cil-1+token_ring.06.cil-1.c that has 16 procedures, 357 locations, 1 initial locations, 13 loop locations, and 2 error locations. [2025-03-03 16:21:31,581 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 16:21:31,593 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;@706456cc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 16:21:31,593 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-03 16:21:31,601 INFO L276 IsEmpty]: Start isEmpty. Operand has 357 states, 303 states have (on average 1.537953795379538) internal successors, (466), 311 states have internal predecessors, (466), 36 states have call successors, (36), 15 states have call predecessors, (36), 15 states have return successors, (36), 34 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-03 16:21:31,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-03 16:21:31,611 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:21:31,611 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-03-03 16:21:31,611 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:21:31,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:21:31,615 INFO L85 PathProgramCache]: Analyzing trace with hash -1886951583, now seen corresponding path program 1 times [2025-03-03 16:21:31,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:21:31,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491719002] [2025-03-03 16:21:31,620 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:21:31,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:21:31,681 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-03 16:21:31,707 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-03 16:21:31,708 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:21:31,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:21:31,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:21:31,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:21:31,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491719002] [2025-03-03 16:21:31,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491719002] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:21:31,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:21:31,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:21:31,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492377239] [2025-03-03 16:21:31,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:21:31,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:21:31,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:21:31,866 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:21:31,867 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:21:31,871 INFO L87 Difference]: Start difference. First operand has 357 states, 303 states have (on average 1.537953795379538) internal successors, (466), 311 states have internal predecessors, (466), 36 states have call successors, (36), 15 states have call predecessors, (36), 15 states have return successors, (36), 34 states have call predecessors, (36), 36 states have call successors, (36) Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-03 16:21:31,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:21:31,975 INFO L93 Difference]: Finished difference Result 692 states and 1041 transitions. [2025-03-03 16:21:31,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:21:31,980 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2025-03-03 16:21:31,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:21:31,991 INFO L225 Difference]: With dead ends: 692 [2025-03-03 16:21:31,992 INFO L226 Difference]: Without dead ends: 346 [2025-03-03 16:21:31,997 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-03-03 16:21:31,999 INFO L435 NwaCegarLoop]: 515 mSDtfsCounter, 133 mSDsluCounter, 380 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 895 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-03-03 16:21:32,000 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 895 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:21:32,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2025-03-03 16:21:32,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 346. [2025-03-03 16:21:32,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 295 states have (on average 1.4915254237288136) internal successors, (440), 300 states have internal predecessors, (440), 36 states have call successors, (36), 15 states have call predecessors, (36), 13 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-03 16:21:32,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 508 transitions. [2025-03-03 16:21:32,049 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 508 transitions. Word has length 65 [2025-03-03 16:21:32,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:21:32,050 INFO L471 AbstractCegarLoop]: Abstraction has 346 states and 508 transitions. [2025-03-03 16:21:32,051 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-03 16:21:32,051 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 508 transitions. [2025-03-03 16:21:32,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-03 16:21:32,053 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:21:32,053 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-03-03 16:21:32,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 16:21:32,053 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:21:32,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:21:32,054 INFO L85 PathProgramCache]: Analyzing trace with hash -1907288958, now seen corresponding path program 1 times [2025-03-03 16:21:32,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:21:32,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158726560] [2025-03-03 16:21:32,054 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:21:32,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:21:32,074 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-03 16:21:32,085 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-03 16:21:32,086 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:21:32,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:21:32,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:21:32,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:21:32,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158726560] [2025-03-03 16:21:32,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158726560] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:21:32,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:21:32,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 16:21:32,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808835926] [2025-03-03 16:21:32,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:21:32,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 16:21:32,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:21:32,236 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 16:21:32,236 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 16:21:32,237 INFO L87 Difference]: Start difference. First operand 346 states and 508 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 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-03-03 16:21:32,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:21:32,845 INFO L93 Difference]: Finished difference Result 541 states and 780 transitions. [2025-03-03 16:21:32,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 16:21:32,845 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 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-03-03 16:21:32,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:21:32,852 INFO L225 Difference]: With dead ends: 541 [2025-03-03 16:21:32,852 INFO L226 Difference]: Without dead ends: 451 [2025-03-03 16:21:32,852 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-03-03 16:21:32,853 INFO L435 NwaCegarLoop]: 323 mSDtfsCounter, 357 mSDsluCounter, 807 mSDsCounter, 0 mSdLazyCounter, 716 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 364 SdHoareTripleChecker+Valid, 1130 SdHoareTripleChecker+Invalid, 771 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 716 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 16:21:32,853 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [364 Valid, 1130 Invalid, 771 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 716 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 16:21:32,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2025-03-03 16:21:32,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 444. [2025-03-03 16:21:32,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 444 states, 373 states have (on average 1.4638069705093835) internal successors, (546), 380 states have internal predecessors, (546), 47 states have call successors, (47), 22 states have call predecessors, (47), 22 states have return successors, (48), 44 states have call predecessors, (48), 43 states have call successors, (48) [2025-03-03 16:21:32,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 641 transitions. [2025-03-03 16:21:32,893 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 641 transitions. Word has length 65 [2025-03-03 16:21:32,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:21:32,893 INFO L471 AbstractCegarLoop]: Abstraction has 444 states and 641 transitions. [2025-03-03 16:21:32,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 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-03-03 16:21:32,894 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 641 transitions. [2025-03-03 16:21:32,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-03 16:21:32,895 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:21:32,895 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-03-03 16:21:32,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 16:21:32,895 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:21:32,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:21:32,896 INFO L85 PathProgramCache]: Analyzing trace with hash 1079639010, now seen corresponding path program 1 times [2025-03-03 16:21:32,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:21:32,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453317721] [2025-03-03 16:21:32,896 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:21:32,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:21:32,904 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-03 16:21:32,910 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-03 16:21:32,910 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:21:32,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:21:33,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:21:33,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:21:33,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453317721] [2025-03-03 16:21:33,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453317721] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:21:33,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:21:33,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 16:21:33,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588291058] [2025-03-03 16:21:33,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:21:33,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 16:21:33,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:21:33,061 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 16:21:33,061 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:21:33,061 INFO L87 Difference]: Start difference. First operand 444 states and 641 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-03-03 16:21:33,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:21:33,669 INFO L93 Difference]: Finished difference Result 767 states and 1077 transitions. [2025-03-03 16:21:33,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 16:21:33,670 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-03-03 16:21:33,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:21:33,674 INFO L225 Difference]: With dead ends: 767 [2025-03-03 16:21:33,674 INFO L226 Difference]: Without dead ends: 586 [2025-03-03 16:21:33,675 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-03-03 16:21:33,678 INFO L435 NwaCegarLoop]: 362 mSDtfsCounter, 728 mSDsluCounter, 1011 mSDsCounter, 0 mSdLazyCounter, 963 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 754 SdHoareTripleChecker+Valid, 1373 SdHoareTripleChecker+Invalid, 1025 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 963 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 16:21:33,678 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [754 Valid, 1373 Invalid, 1025 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 963 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 16:21:33,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2025-03-03 16:21:33,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 542. [2025-03-03 16:21:33,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 542 states, 451 states have (on average 1.4434589800443458) internal successors, (651), 460 states have internal predecessors, (651), 58 states have call successors, (58), 29 states have call predecessors, (58), 31 states have return successors, (67), 56 states have call predecessors, (67), 54 states have call successors, (67) [2025-03-03 16:21:33,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 776 transitions. [2025-03-03 16:21:33,718 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 776 transitions. Word has length 65 [2025-03-03 16:21:33,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:21:33,718 INFO L471 AbstractCegarLoop]: Abstraction has 542 states and 776 transitions. [2025-03-03 16:21:33,718 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-03-03 16:21:33,719 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 776 transitions. [2025-03-03 16:21:33,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-03 16:21:33,720 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:21:33,720 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-03-03 16:21:33,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 16:21:33,721 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:21:33,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:21:33,721 INFO L85 PathProgramCache]: Analyzing trace with hash -2082137693, now seen corresponding path program 1 times [2025-03-03 16:21:33,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:21:33,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981581394] [2025-03-03 16:21:33,721 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:21:33,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:21:33,741 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-03 16:21:33,749 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-03 16:21:33,750 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:21:33,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:21:33,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:21:33,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:21:33,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981581394] [2025-03-03 16:21:33,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981581394] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:21:33,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:21:33,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 16:21:33,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350033993] [2025-03-03 16:21:33,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:21:33,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 16:21:33,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:21:33,809 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 16:21:33,809 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:21:33,810 INFO L87 Difference]: Start difference. First operand 542 states and 776 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-03-03 16:21:33,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:21:33,857 INFO L93 Difference]: Finished difference Result 820 states and 1155 transitions. [2025-03-03 16:21:33,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 16:21:33,857 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-03-03 16:21:33,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:21:33,860 INFO L225 Difference]: With dead ends: 820 [2025-03-03 16:21:33,860 INFO L226 Difference]: Without dead ends: 547 [2025-03-03 16:21:33,861 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-03-03 16:21:33,863 INFO L435 NwaCegarLoop]: 505 mSDtfsCounter, 0 mSDsluCounter, 2015 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2520 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-03-03 16:21:33,864 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2520 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:21:33,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2025-03-03 16:21:33,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 547. [2025-03-03 16:21:33,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 547 states, 455 states have (on average 1.4351648351648352) internal successors, (653), 464 states have internal predecessors, (653), 58 states have call successors, (58), 29 states have call predecessors, (58), 32 states have return successors, (68), 57 states have call predecessors, (68), 54 states have call successors, (68) [2025-03-03 16:21:33,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 779 transitions. [2025-03-03 16:21:33,891 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 779 transitions. Word has length 65 [2025-03-03 16:21:33,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:21:33,892 INFO L471 AbstractCegarLoop]: Abstraction has 547 states and 779 transitions. [2025-03-03 16:21:33,892 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-03-03 16:21:33,892 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 779 transitions. [2025-03-03 16:21:33,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-03 16:21:33,893 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:21:33,894 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-03-03 16:21:33,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 16:21:33,894 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:21:33,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:21:33,894 INFO L85 PathProgramCache]: Analyzing trace with hash -449333694, now seen corresponding path program 1 times [2025-03-03 16:21:33,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:21:33,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528651321] [2025-03-03 16:21:33,895 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:21:33,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:21:33,901 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-03 16:21:33,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-03 16:21:33,905 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:21:33,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:21:34,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:21:34,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:21:34,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528651321] [2025-03-03 16:21:34,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528651321] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:21:34,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:21:34,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 16:21:34,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852675154] [2025-03-03 16:21:34,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:21:34,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 16:21:34,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:21:34,005 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 16:21:34,005 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-03 16:21:34,006 INFO L87 Difference]: Start difference. First operand 547 states and 779 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 7 states have internal predecessors, (50), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2025-03-03 16:21:34,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:21:34,908 INFO L93 Difference]: Finished difference Result 1815 states and 2500 transitions. [2025-03-03 16:21:34,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-03 16:21:34,910 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 7 states have internal predecessors, (50), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 65 [2025-03-03 16:21:34,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:21:34,918 INFO L225 Difference]: With dead ends: 1815 [2025-03-03 16:21:34,919 INFO L226 Difference]: Without dead ends: 1519 [2025-03-03 16:21:34,921 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=292, Unknown=0, NotChecked=0, Total=380 [2025-03-03 16:21:34,922 INFO L435 NwaCegarLoop]: 366 mSDtfsCounter, 2295 mSDsluCounter, 1183 mSDsCounter, 0 mSdLazyCounter, 1172 mSolverCounterSat, 415 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2309 SdHoareTripleChecker+Valid, 1549 SdHoareTripleChecker+Invalid, 1587 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 415 IncrementalHoareTripleChecker+Valid, 1172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 16:21:34,922 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2309 Valid, 1549 Invalid, 1587 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [415 Valid, 1172 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 16:21:34,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1519 states. [2025-03-03 16:21:35,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1519 to 1465. [2025-03-03 16:21:35,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1465 states, 1187 states have (on average 1.3572030328559392) internal successors, (1611), 1211 states have internal predecessors, (1611), 146 states have call successors, (146), 112 states have call predecessors, (146), 130 states have return successors, (182), 144 states have call predecessors, (182), 142 states have call successors, (182) [2025-03-03 16:21:35,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1465 states to 1465 states and 1939 transitions. [2025-03-03 16:21:35,014 INFO L78 Accepts]: Start accepts. Automaton has 1465 states and 1939 transitions. Word has length 65 [2025-03-03 16:21:35,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:21:35,014 INFO L471 AbstractCegarLoop]: Abstraction has 1465 states and 1939 transitions. [2025-03-03 16:21:35,015 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 7 states have internal predecessors, (50), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2025-03-03 16:21:35,015 INFO L276 IsEmpty]: Start isEmpty. Operand 1465 states and 1939 transitions. [2025-03-03 16:21:35,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-03 16:21:35,016 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:21:35,016 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-03-03 16:21:35,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 16:21:35,016 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:21:35,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:21:35,017 INFO L85 PathProgramCache]: Analyzing trace with hash 1757343242, now seen corresponding path program 1 times [2025-03-03 16:21:35,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:21:35,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076270076] [2025-03-03 16:21:35,017 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:21:35,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:21:35,023 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-03 16:21:35,026 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-03 16:21:35,027 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:21:35,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:21:35,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:21:35,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:21:35,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076270076] [2025-03-03 16:21:35,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076270076] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:21:35,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:21:35,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 16:21:35,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081020544] [2025-03-03 16:21:35,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:21:35,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 16:21:35,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:21:35,069 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 16:21:35,069 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:21:35,070 INFO L87 Difference]: Start difference. First operand 1465 states and 1939 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 5 states have internal predecessors, (51), 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-03-03 16:21:35,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:21:35,143 INFO L93 Difference]: Finished difference Result 2703 states and 3540 transitions. [2025-03-03 16:21:35,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 16:21:35,143 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 5 states have internal predecessors, (51), 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 66 [2025-03-03 16:21:35,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:21:35,150 INFO L225 Difference]: With dead ends: 2703 [2025-03-03 16:21:35,150 INFO L226 Difference]: Without dead ends: 1495 [2025-03-03 16:21:35,153 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-03-03 16:21:35,153 INFO L435 NwaCegarLoop]: 505 mSDtfsCounter, 0 mSDsluCounter, 2015 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2520 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-03-03 16:21:35,154 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2520 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:21:35,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1495 states. [2025-03-03 16:21:35,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1495 to 1495. [2025-03-03 16:21:35,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1495 states, 1211 states have (on average 1.3435177539223782) internal successors, (1627), 1235 states have internal predecessors, (1627), 146 states have call successors, (146), 112 states have call predecessors, (146), 136 states have return successors, (188), 150 states have call predecessors, (188), 142 states have call successors, (188) [2025-03-03 16:21:35,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1495 states to 1495 states and 1961 transitions. [2025-03-03 16:21:35,238 INFO L78 Accepts]: Start accepts. Automaton has 1495 states and 1961 transitions. Word has length 66 [2025-03-03 16:21:35,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:21:35,239 INFO L471 AbstractCegarLoop]: Abstraction has 1495 states and 1961 transitions. [2025-03-03 16:21:35,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 5 states have internal predecessors, (51), 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-03-03 16:21:35,239 INFO L276 IsEmpty]: Start isEmpty. Operand 1495 states and 1961 transitions. [2025-03-03 16:21:35,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-03 16:21:35,240 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:21:35,240 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-03-03 16:21:35,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 16:21:35,241 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:21:35,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:21:35,241 INFO L85 PathProgramCache]: Analyzing trace with hash 1768659369, now seen corresponding path program 1 times [2025-03-03 16:21:35,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:21:35,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747648798] [2025-03-03 16:21:35,241 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:21:35,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:21:35,250 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-03 16:21:35,254 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-03 16:21:35,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:21:35,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:21:35,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:21:35,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:21:35,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747648798] [2025-03-03 16:21:35,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747648798] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:21:35,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:21:35,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 16:21:35,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020062884] [2025-03-03 16:21:35,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:21:35,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 16:21:35,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:21:35,364 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 16:21:35,364 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:21:35,364 INFO L87 Difference]: Start difference. First operand 1495 states and 1961 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 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-03-03 16:21:36,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:21:36,037 INFO L93 Difference]: Finished difference Result 2727 states and 3477 transitions. [2025-03-03 16:21:36,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 16:21:36,037 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 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 66 [2025-03-03 16:21:36,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:21:36,046 INFO L225 Difference]: With dead ends: 2727 [2025-03-03 16:21:36,046 INFO L226 Difference]: Without dead ends: 1717 [2025-03-03 16:21:36,049 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-03 16:21:36,049 INFO L435 NwaCegarLoop]: 301 mSDtfsCounter, 730 mSDsluCounter, 855 mSDsCounter, 0 mSdLazyCounter, 931 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 754 SdHoareTripleChecker+Valid, 1156 SdHoareTripleChecker+Invalid, 1001 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 931 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 16:21:36,049 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [754 Valid, 1156 Invalid, 1001 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 931 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 16:21:36,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1717 states. [2025-03-03 16:21:36,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1717 to 1436. [2025-03-03 16:21:36,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1436 states, 1168 states have (on average 1.3398972602739727) internal successors, (1565), 1187 states have internal predecessors, (1565), 140 states have call successors, (140), 107 states have call predecessors, (140), 126 states have return successors, (173), 143 states have call predecessors, (173), 136 states have call successors, (173) [2025-03-03 16:21:36,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1436 states to 1436 states and 1878 transitions. [2025-03-03 16:21:36,116 INFO L78 Accepts]: Start accepts. Automaton has 1436 states and 1878 transitions. Word has length 66 [2025-03-03 16:21:36,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:21:36,116 INFO L471 AbstractCegarLoop]: Abstraction has 1436 states and 1878 transitions. [2025-03-03 16:21:36,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 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-03-03 16:21:36,117 INFO L276 IsEmpty]: Start isEmpty. Operand 1436 states and 1878 transitions. [2025-03-03 16:21:36,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-03 16:21:36,117 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:21:36,118 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-03-03 16:21:36,118 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 16:21:36,118 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:21:36,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:21:36,118 INFO L85 PathProgramCache]: Analyzing trace with hash -308549974, now seen corresponding path program 1 times [2025-03-03 16:21:36,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:21:36,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81885251] [2025-03-03 16:21:36,118 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:21:36,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:21:36,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-03 16:21:36,128 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-03 16:21:36,128 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:21:36,128 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:21:36,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:21:36,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:21:36,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81885251] [2025-03-03 16:21:36,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81885251] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:21:36,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:21:36,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 16:21:36,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397070489] [2025-03-03 16:21:36,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:21:36,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 16:21:36,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:21:36,179 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 16:21:36,179 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 16:21:36,180 INFO L87 Difference]: Start difference. First operand 1436 states and 1878 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 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-03-03 16:21:36,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:21:36,569 INFO L93 Difference]: Finished difference Result 3682 states and 4728 transitions. [2025-03-03 16:21:36,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 16:21:36,570 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 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 66 [2025-03-03 16:21:36,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:21:36,581 INFO L225 Difference]: With dead ends: 3682 [2025-03-03 16:21:36,581 INFO L226 Difference]: Without dead ends: 2504 [2025-03-03 16:21:36,586 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-03-03 16:21:36,586 INFO L435 NwaCegarLoop]: 294 mSDtfsCounter, 688 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 322 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 713 SdHoareTripleChecker+Valid, 594 SdHoareTripleChecker+Invalid, 381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 16:21:36,587 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [713 Valid, 594 Invalid, 381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 322 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 16:21:36,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2504 states. [2025-03-03 16:21:36,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2504 to 2500. [2025-03-03 16:21:36,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2500 states, 1992 states have (on average 1.285140562248996) internal successors, (2560), 2027 states have internal predecessors, (2560), 256 states have call successors, (256), 206 states have call predecessors, (256), 250 states have return successors, (361), 268 states have call predecessors, (361), 252 states have call successors, (361) [2025-03-03 16:21:36,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2500 states to 2500 states and 3177 transitions. [2025-03-03 16:21:36,722 INFO L78 Accepts]: Start accepts. Automaton has 2500 states and 3177 transitions. Word has length 66 [2025-03-03 16:21:36,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:21:36,722 INFO L471 AbstractCegarLoop]: Abstraction has 2500 states and 3177 transitions. [2025-03-03 16:21:36,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 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-03-03 16:21:36,723 INFO L276 IsEmpty]: Start isEmpty. Operand 2500 states and 3177 transitions. [2025-03-03 16:21:36,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-03 16:21:36,724 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:21:36,724 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] [2025-03-03 16:21:36,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 16:21:36,725 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:21:36,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:21:36,725 INFO L85 PathProgramCache]: Analyzing trace with hash -1166448166, now seen corresponding path program 1 times [2025-03-03 16:21:36,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:21:36,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856670418] [2025-03-03 16:21:36,726 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:21:36,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:21:36,731 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-03 16:21:36,736 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-03 16:21:36,737 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:21:36,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:21:36,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:21:36,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:21:36,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856670418] [2025-03-03 16:21:36,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856670418] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:21:36,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:21:36,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:21:36,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783581583] [2025-03-03 16:21:36,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:21:36,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:21:36,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:21:36,757 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:21:36,757 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:21:36,757 INFO L87 Difference]: Start difference. First operand 2500 states and 3177 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 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-03-03 16:21:36,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:21:36,913 INFO L93 Difference]: Finished difference Result 5599 states and 7065 transitions. [2025-03-03 16:21:36,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:21:36,913 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 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 67 [2025-03-03 16:21:36,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:21:36,929 INFO L225 Difference]: With dead ends: 5599 [2025-03-03 16:21:36,929 INFO L226 Difference]: Without dead ends: 3357 [2025-03-03 16:21:36,934 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-03-03 16:21:36,935 INFO L435 NwaCegarLoop]: 524 mSDtfsCounter, 102 mSDsluCounter, 474 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 998 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:21:36,935 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 998 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:21:36,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3357 states. [2025-03-03 16:21:37,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3357 to 3277. [2025-03-03 16:21:37,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3277 states, 2598 states have (on average 1.2721324095458044) internal successors, (3305), 2638 states have internal predecessors, (3305), 340 states have call successors, (340), 279 states have call predecessors, (340), 337 states have return successors, (465), 361 states have call predecessors, (465), 336 states have call successors, (465) [2025-03-03 16:21:37,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3277 states to 3277 states and 4110 transitions. [2025-03-03 16:21:37,162 INFO L78 Accepts]: Start accepts. Automaton has 3277 states and 4110 transitions. Word has length 67 [2025-03-03 16:21:37,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:21:37,163 INFO L471 AbstractCegarLoop]: Abstraction has 3277 states and 4110 transitions. [2025-03-03 16:21:37,163 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 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-03-03 16:21:37,163 INFO L276 IsEmpty]: Start isEmpty. Operand 3277 states and 4110 transitions. [2025-03-03 16:21:37,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-03 16:21:37,164 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:21:37,164 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] [2025-03-03 16:21:37,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 16:21:37,164 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:21:37,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:21:37,165 INFO L85 PathProgramCache]: Analyzing trace with hash -1017662922, now seen corresponding path program 1 times [2025-03-03 16:21:37,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:21:37,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780320000] [2025-03-03 16:21:37,165 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:21:37,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:21:37,170 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-03 16:21:37,173 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-03 16:21:37,173 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:21:37,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:21:37,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:21:37,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:21:37,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780320000] [2025-03-03 16:21:37,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1780320000] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:21:37,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:21:37,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:21:37,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447929654] [2025-03-03 16:21:37,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:21:37,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:21:37,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:21:37,196 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:21:37,196 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:21:37,196 INFO L87 Difference]: Start difference. First operand 3277 states and 4110 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 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-03-03 16:21:37,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:21:37,333 INFO L93 Difference]: Finished difference Result 6636 states and 8245 transitions. [2025-03-03 16:21:37,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:21:37,333 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 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 73 [2025-03-03 16:21:37,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:21:37,348 INFO L225 Difference]: With dead ends: 6636 [2025-03-03 16:21:37,349 INFO L226 Difference]: Without dead ends: 3616 [2025-03-03 16:21:37,356 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-03-03 16:21:37,356 INFO L435 NwaCegarLoop]: 531 mSDtfsCounter, 472 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 472 SdHoareTripleChecker+Valid, 641 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:21:37,356 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [472 Valid, 641 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:21:37,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3616 states. [2025-03-03 16:21:37,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3616 to 3555. [2025-03-03 16:21:37,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3555 states, 2819 states have (on average 1.2660517914153955) internal successors, (3569), 2861 states have internal predecessors, (3569), 368 states have call successors, (368), 304 states have call predecessors, (368), 366 states have return successors, (497), 391 states have call predecessors, (497), 364 states have call successors, (497) [2025-03-03 16:21:37,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3555 states to 3555 states and 4434 transitions. [2025-03-03 16:21:37,530 INFO L78 Accepts]: Start accepts. Automaton has 3555 states and 4434 transitions. Word has length 73 [2025-03-03 16:21:37,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:21:37,531 INFO L471 AbstractCegarLoop]: Abstraction has 3555 states and 4434 transitions. [2025-03-03 16:21:37,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 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-03-03 16:21:37,531 INFO L276 IsEmpty]: Start isEmpty. Operand 3555 states and 4434 transitions. [2025-03-03 16:21:37,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-03 16:21:37,534 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:21:37,535 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:21:37,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 16:21:37,535 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:21:37,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:21:37,535 INFO L85 PathProgramCache]: Analyzing trace with hash 1946962291, now seen corresponding path program 1 times [2025-03-03 16:21:37,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:21:37,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464374469] [2025-03-03 16:21:37,535 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:21:37,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:21:37,542 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-03 16:21:37,550 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-03 16:21:37,551 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:21:37,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:21:37,605 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:21:37,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:21:37,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464374469] [2025-03-03 16:21:37,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464374469] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:21:37,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:21:37,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 16:21:37,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421491383] [2025-03-03 16:21:37,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:21:37,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 16:21:37,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:21:37,607 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 16:21:37,607 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 16:21:37,607 INFO L87 Difference]: Start difference. First operand 3555 states and 4434 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-03-03 16:21:37,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:21:37,975 INFO L93 Difference]: Finished difference Result 4354 states and 5402 transitions. [2025-03-03 16:21:37,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 16:21:37,975 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 75 [2025-03-03 16:21:37,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:21:37,992 INFO L225 Difference]: With dead ends: 4354 [2025-03-03 16:21:37,993 INFO L226 Difference]: Without dead ends: 4351 [2025-03-03 16:21:37,995 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 16:21:37,995 INFO L435 NwaCegarLoop]: 532 mSDtfsCounter, 927 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 927 SdHoareTripleChecker+Valid, 624 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 16:21:37,995 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [927 Valid, 624 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 16:21:37,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4351 states. [2025-03-03 16:21:38,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4351 to 4017. [2025-03-03 16:21:38,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4017 states, 3174 states have (on average 1.25645872715816) internal successors, (3988), 3219 states have internal predecessors, (3988), 418 states have call successors, (418), 348 states have call predecessors, (418), 423 states have return successors, (574), 451 states have call predecessors, (574), 415 states have call successors, (574) [2025-03-03 16:21:38,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4017 states to 4017 states and 4980 transitions. [2025-03-03 16:21:38,363 INFO L78 Accepts]: Start accepts. Automaton has 4017 states and 4980 transitions. Word has length 75 [2025-03-03 16:21:38,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:21:38,363 INFO L471 AbstractCegarLoop]: Abstraction has 4017 states and 4980 transitions. [2025-03-03 16:21:38,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-03-03 16:21:38,364 INFO L276 IsEmpty]: Start isEmpty. Operand 4017 states and 4980 transitions. [2025-03-03 16:21:38,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-03 16:21:38,365 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:21:38,365 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:21:38,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 16:21:38,365 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:21:38,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:21:38,366 INFO L85 PathProgramCache]: Analyzing trace with hash 225849855, now seen corresponding path program 1 times [2025-03-03 16:21:38,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:21:38,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352997316] [2025-03-03 16:21:38,366 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:21:38,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:21:38,373 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-03 16:21:38,379 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-03 16:21:38,379 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:21:38,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:21:38,472 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:21:38,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:21:38,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352997316] [2025-03-03 16:21:38,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352997316] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:21:38,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1925307518] [2025-03-03 16:21:38,472 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:21:38,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:21:38,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:21:38,475 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 16:21:38,477 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 16:21:38,525 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-03 16:21:38,554 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-03 16:21:38,554 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:21:38,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:21:38,556 INFO L256 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-03 16:21:38,560 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:21:38,753 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:21:38,753 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 16:21:38,835 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:21:38,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1925307518] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 16:21:38,836 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 16:21:38,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 4] total 7 [2025-03-03 16:21:38,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396062587] [2025-03-03 16:21:38,836 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 16:21:38,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 16:21:38,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:21:38,837 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 16:21:38,837 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-03 16:21:38,837 INFO L87 Difference]: Start difference. First operand 4017 states and 4980 transitions. Second operand has 7 states, 7 states have (on average 17.142857142857142) internal successors, (120), 7 states have internal predecessors, (120), 4 states have call successors, (20), 3 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2025-03-03 16:21:39,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:21:39,389 INFO L93 Difference]: Finished difference Result 7868 states and 9657 transitions. [2025-03-03 16:21:39,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 16:21:39,389 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.142857142857142) internal successors, (120), 7 states have internal predecessors, (120), 4 states have call successors, (20), 3 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) Word has length 76 [2025-03-03 16:21:39,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:21:39,428 INFO L225 Difference]: With dead ends: 7868 [2025-03-03 16:21:39,428 INFO L226 Difference]: Without dead ends: 7865 [2025-03-03 16:21:39,432 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-03 16:21:39,432 INFO L435 NwaCegarLoop]: 684 mSDtfsCounter, 1232 mSDsluCounter, 1315 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1232 SdHoareTripleChecker+Valid, 1999 SdHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 16:21:39,433 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1232 Valid, 1999 Invalid, 320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 16:21:39,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7865 states. [2025-03-03 16:21:39,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7865 to 7460. [2025-03-03 16:21:39,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7460 states, 5875 states have (on average 1.2420425531914894) internal successors, (7297), 5955 states have internal predecessors, (7297), 777 states have call successors, (777), 662 states have call predecessors, (777), 806 states have return successors, (1075), 844 states have call predecessors, (1075), 774 states have call successors, (1075) [2025-03-03 16:21:39,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7460 states to 7460 states and 9149 transitions. [2025-03-03 16:21:39,890 INFO L78 Accepts]: Start accepts. Automaton has 7460 states and 9149 transitions. Word has length 76 [2025-03-03 16:21:39,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:21:39,891 INFO L471 AbstractCegarLoop]: Abstraction has 7460 states and 9149 transitions. [2025-03-03 16:21:39,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.142857142857142) internal successors, (120), 7 states have internal predecessors, (120), 4 states have call successors, (20), 3 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2025-03-03 16:21:39,891 INFO L276 IsEmpty]: Start isEmpty. Operand 7460 states and 9149 transitions. [2025-03-03 16:21:39,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-03 16:21:39,892 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:21:39,892 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:21:39,900 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 16:21:40,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-03 16:21:40,093 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:21:40,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:21:40,094 INFO L85 PathProgramCache]: Analyzing trace with hash -2013772975, now seen corresponding path program 2 times [2025-03-03 16:21:40,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:21:40,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678308404] [2025-03-03 16:21:40,094 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 16:21:40,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:21:40,102 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 79 statements into 2 equivalence classes. [2025-03-03 16:21:40,108 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 79 of 79 statements. [2025-03-03 16:21:40,109 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 16:21:40,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:21:40,126 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:21:40,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:21:40,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678308404] [2025-03-03 16:21:40,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678308404] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:21:40,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:21:40,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:21:40,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708479664] [2025-03-03 16:21:40,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:21:40,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:21:40,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:21:40,128 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:21:40,128 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:21:40,128 INFO L87 Difference]: Start difference. First operand 7460 states and 9149 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-03-03 16:21:40,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:21:40,366 INFO L93 Difference]: Finished difference Result 9885 states and 12172 transitions. [2025-03-03 16:21:40,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:21:40,366 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 79 [2025-03-03 16:21:40,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:21:40,383 INFO L225 Difference]: With dead ends: 9885 [2025-03-03 16:21:40,383 INFO L226 Difference]: Without dead ends: 3661 [2025-03-03 16:21:40,394 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-03-03 16:21:40,395 INFO L435 NwaCegarLoop]: 578 mSDtfsCounter, 477 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 477 SdHoareTripleChecker+Valid, 695 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:21:40,395 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [477 Valid, 695 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:21:40,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3661 states. [2025-03-03 16:21:40,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3661 to 2858. [2025-03-03 16:21:40,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2858 states, 2277 states have (on average 1.2468159859464207) internal successors, (2839), 2303 states have internal predecessors, (2839), 297 states have call successors, (297), 245 states have call predecessors, (297), 282 states have return successors, (376), 311 states have call predecessors, (376), 294 states have call successors, (376) [2025-03-03 16:21:40,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2858 states to 2858 states and 3512 transitions. [2025-03-03 16:21:40,646 INFO L78 Accepts]: Start accepts. Automaton has 2858 states and 3512 transitions. Word has length 79 [2025-03-03 16:21:40,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:21:40,646 INFO L471 AbstractCegarLoop]: Abstraction has 2858 states and 3512 transitions. [2025-03-03 16:21:40,646 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-03-03 16:21:40,646 INFO L276 IsEmpty]: Start isEmpty. Operand 2858 states and 3512 transitions. [2025-03-03 16:21:40,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-03-03 16:21:40,648 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:21:40,648 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:21:40,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 16:21:40,648 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:21:40,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:21:40,648 INFO L85 PathProgramCache]: Analyzing trace with hash 2132783296, now seen corresponding path program 1 times [2025-03-03 16:21:40,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:21:40,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034280925] [2025-03-03 16:21:40,649 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:21:40,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:21:40,654 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-03 16:21:40,660 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-03 16:21:40,660 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:21:40,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:21:40,736 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-03 16:21:40,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:21:40,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034280925] [2025-03-03 16:21:40,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034280925] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:21:40,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:21:40,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 16:21:40,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78132925] [2025-03-03 16:21:40,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:21:40,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 16:21:40,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:21:40,738 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 16:21:40,738 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:21:40,738 INFO L87 Difference]: Start difference. First operand 2858 states and 3512 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 4 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-03 16:21:41,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:21:41,601 INFO L93 Difference]: Finished difference Result 8039 states and 9772 transitions. [2025-03-03 16:21:41,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-03 16:21:41,602 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 4 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 85 [2025-03-03 16:21:41,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:21:41,624 INFO L225 Difference]: With dead ends: 8039 [2025-03-03 16:21:41,624 INFO L226 Difference]: Without dead ends: 4715 [2025-03-03 16:21:41,630 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2025-03-03 16:21:41,631 INFO L435 NwaCegarLoop]: 343 mSDtfsCounter, 698 mSDsluCounter, 1135 mSDsCounter, 0 mSdLazyCounter, 1015 mSolverCounterSat, 133 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 709 SdHoareTripleChecker+Valid, 1478 SdHoareTripleChecker+Invalid, 1148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 1015 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 16:21:41,631 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [709 Valid, 1478 Invalid, 1148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [133 Valid, 1015 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 16:21:41,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4715 states. [2025-03-03 16:21:41,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4715 to 4523. [2025-03-03 16:21:41,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4523 states, 3559 states have (on average 1.2157909525147514) internal successors, (4327), 3616 states have internal predecessors, (4327), 478 states have call successors, (478), 404 states have call predecessors, (478), 484 states have return successors, (669), 504 states have call predecessors, (669), 475 states have call successors, (669) [2025-03-03 16:21:41,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4523 states to 4523 states and 5474 transitions. [2025-03-03 16:21:41,861 INFO L78 Accepts]: Start accepts. Automaton has 4523 states and 5474 transitions. Word has length 85 [2025-03-03 16:21:41,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:21:41,862 INFO L471 AbstractCegarLoop]: Abstraction has 4523 states and 5474 transitions. [2025-03-03 16:21:41,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 4 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-03 16:21:41,863 INFO L276 IsEmpty]: Start isEmpty. Operand 4523 states and 5474 transitions. [2025-03-03 16:21:41,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-03 16:21:41,864 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:21:41,864 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:21:41,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 16:21:41,865 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:21:41,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:21:41,865 INFO L85 PathProgramCache]: Analyzing trace with hash -543095293, now seen corresponding path program 1 times [2025-03-03 16:21:41,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:21:41,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868482788] [2025-03-03 16:21:41,865 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:21:41,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:21:41,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-03 16:21:41,876 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-03 16:21:41,877 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:21:41,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:21:41,958 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 16:21:41,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:21:41,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868482788] [2025-03-03 16:21:41,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868482788] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:21:41,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:21:41,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 16:21:41,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887382842] [2025-03-03 16:21:41,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:21:41,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 16:21:41,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:21:41,960 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 16:21:41,962 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 16:21:41,962 INFO L87 Difference]: Start difference. First operand 4523 states and 5474 transitions. Second operand has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 4 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-03 16:21:42,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:21:42,836 INFO L93 Difference]: Finished difference Result 7385 states and 8939 transitions. [2025-03-03 16:21:42,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-03 16:21:42,836 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 4 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 95 [2025-03-03 16:21:42,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:21:42,852 INFO L225 Difference]: With dead ends: 7385 [2025-03-03 16:21:42,853 INFO L226 Difference]: Without dead ends: 3644 [2025-03-03 16:21:42,859 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=257, Unknown=0, NotChecked=0, Total=342 [2025-03-03 16:21:42,859 INFO L435 NwaCegarLoop]: 358 mSDtfsCounter, 1323 mSDsluCounter, 1200 mSDsCounter, 0 mSdLazyCounter, 1176 mSolverCounterSat, 221 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1352 SdHoareTripleChecker+Valid, 1558 SdHoareTripleChecker+Invalid, 1397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 221 IncrementalHoareTripleChecker+Valid, 1176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 16:21:42,860 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1352 Valid, 1558 Invalid, 1397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [221 Valid, 1176 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 16:21:42,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3644 states. [2025-03-03 16:21:43,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3644 to 3304. [2025-03-03 16:21:43,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3304 states, 2598 states have (on average 1.2082371054657428) internal successors, (3139), 2642 states have internal predecessors, (3139), 347 states have call successors, (347), 287 states have call predecessors, (347), 357 states have return successors, (464), 376 states have call predecessors, (464), 344 states have call successors, (464) [2025-03-03 16:21:43,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3304 states to 3304 states and 3950 transitions. [2025-03-03 16:21:43,057 INFO L78 Accepts]: Start accepts. Automaton has 3304 states and 3950 transitions. Word has length 95 [2025-03-03 16:21:43,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:21:43,057 INFO L471 AbstractCegarLoop]: Abstraction has 3304 states and 3950 transitions. [2025-03-03 16:21:43,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 4 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-03 16:21:43,057 INFO L276 IsEmpty]: Start isEmpty. Operand 3304 states and 3950 transitions. [2025-03-03 16:21:43,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-03 16:21:43,060 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:21:43,060 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:21:43,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 16:21:43,060 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:21:43,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:21:43,061 INFO L85 PathProgramCache]: Analyzing trace with hash -793737609, now seen corresponding path program 1 times [2025-03-03 16:21:43,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:21:43,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558242911] [2025-03-03 16:21:43,061 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:21:43,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:21:43,069 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-03 16:21:43,072 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-03 16:21:43,073 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:21:43,073 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:21:43,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:21:43,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:21:43,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558242911] [2025-03-03 16:21:43,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558242911] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:21:43,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:21:43,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 16:21:43,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233239981] [2025-03-03 16:21:43,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:21:43,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 16:21:43,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:21:43,147 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 16:21:43,147 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 16:21:43,148 INFO L87 Difference]: Start difference. First operand 3304 states and 3950 transitions. Second operand has 5 states, 5 states have (on average 20.4) internal successors, (102), 4 states have internal predecessors, (102), 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-03-03 16:21:43,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:21:43,666 INFO L93 Difference]: Finished difference Result 3796 states and 4704 transitions. [2025-03-03 16:21:43,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 16:21:43,667 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 4 states have internal predecessors, (102), 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 113 [2025-03-03 16:21:43,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:21:43,678 INFO L225 Difference]: With dead ends: 3796 [2025-03-03 16:21:43,678 INFO L226 Difference]: Without dead ends: 3562 [2025-03-03 16:21:43,679 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-03-03 16:21:43,680 INFO L435 NwaCegarLoop]: 360 mSDtfsCounter, 836 mSDsluCounter, 855 mSDsCounter, 0 mSdLazyCounter, 542 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 860 SdHoareTripleChecker+Valid, 1215 SdHoareTripleChecker+Invalid, 609 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 542 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 16:21:43,680 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [860 Valid, 1215 Invalid, 609 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 542 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 16:21:43,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3562 states. [2025-03-03 16:21:43,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3562 to 3543. [2025-03-03 16:21:43,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3543 states, 2815 states have (on average 1.233747779751332) internal successors, (3473), 2860 states have internal predecessors, (3473), 362 states have call successors, (362), 293 states have call predecessors, (362), 364 states have return successors, (480), 391 states have call predecessors, (480), 359 states have call successors, (480) [2025-03-03 16:21:43,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3543 states to 3543 states and 4315 transitions. [2025-03-03 16:21:43,869 INFO L78 Accepts]: Start accepts. Automaton has 3543 states and 4315 transitions. Word has length 113 [2025-03-03 16:21:43,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:21:43,869 INFO L471 AbstractCegarLoop]: Abstraction has 3543 states and 4315 transitions. [2025-03-03 16:21:43,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 4 states have internal predecessors, (102), 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-03-03 16:21:43,870 INFO L276 IsEmpty]: Start isEmpty. Operand 3543 states and 4315 transitions. [2025-03-03 16:21:43,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-03 16:21:43,871 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:21:43,871 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:21:43,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 16:21:43,871 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:21:43,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:21:43,872 INFO L85 PathProgramCache]: Analyzing trace with hash -296611211, now seen corresponding path program 1 times [2025-03-03 16:21:43,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:21:43,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44763620] [2025-03-03 16:21:43,872 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:21:43,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:21:43,881 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-03 16:21:43,883 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-03 16:21:43,884 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:21:43,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:21:44,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:21:44,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:21:44,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44763620] [2025-03-03 16:21:44,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44763620] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:21:44,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:21:44,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 16:21:44,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987666755] [2025-03-03 16:21:44,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:21:44,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 16:21:44,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:21:44,003 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 16:21:44,003 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:21:44,004 INFO L87 Difference]: Start difference. First operand 3543 states and 4315 transitions. Second operand has 6 states, 6 states have (on average 17.0) internal successors, (102), 5 states have internal predecessors, (102), 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-03-03 16:21:44,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:21:44,825 INFO L93 Difference]: Finished difference Result 4315 states and 5507 transitions. [2025-03-03 16:21:44,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 16:21:44,826 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.0) internal successors, (102), 5 states have internal predecessors, (102), 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 113 [2025-03-03 16:21:44,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:21:44,839 INFO L225 Difference]: With dead ends: 4315 [2025-03-03 16:21:44,839 INFO L226 Difference]: Without dead ends: 3842 [2025-03-03 16:21:44,842 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-03-03 16:21:44,842 INFO L435 NwaCegarLoop]: 564 mSDtfsCounter, 833 mSDsluCounter, 1674 mSDsCounter, 0 mSdLazyCounter, 928 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 857 SdHoareTripleChecker+Valid, 2238 SdHoareTripleChecker+Invalid, 975 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 928 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 16:21:44,842 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [857 Valid, 2238 Invalid, 975 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 928 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 16:21:44,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3842 states. [2025-03-03 16:21:45,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3842 to 3767. [2025-03-03 16:21:45,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3767 states, 3017 states have (on average 1.2519058667550547) internal successors, (3777), 3063 states have internal predecessors, (3777), 377 states have call successors, (377), 299 states have call predecessors, (377), 371 states have return successors, (498), 407 states have call predecessors, (498), 374 states have call successors, (498) [2025-03-03 16:21:45,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3767 states to 3767 states and 4652 transitions. [2025-03-03 16:21:45,055 INFO L78 Accepts]: Start accepts. Automaton has 3767 states and 4652 transitions. Word has length 113 [2025-03-03 16:21:45,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:21:45,056 INFO L471 AbstractCegarLoop]: Abstraction has 3767 states and 4652 transitions. [2025-03-03 16:21:45,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.0) internal successors, (102), 5 states have internal predecessors, (102), 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-03-03 16:21:45,056 INFO L276 IsEmpty]: Start isEmpty. Operand 3767 states and 4652 transitions. [2025-03-03 16:21:45,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-03 16:21:45,058 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:21:45,058 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:21:45,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 16:21:45,058 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:21:45,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:21:45,058 INFO L85 PathProgramCache]: Analyzing trace with hash 379081398, now seen corresponding path program 1 times [2025-03-03 16:21:45,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:21:45,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010952113] [2025-03-03 16:21:45,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:21:45,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:21:45,065 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-03 16:21:45,067 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-03 16:21:45,067 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:21:45,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:21:45,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:21:45,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:21:45,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010952113] [2025-03-03 16:21:45,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010952113] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:21:45,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:21:45,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 16:21:45,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218168460] [2025-03-03 16:21:45,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:21:45,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 16:21:45,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:21:45,156 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 16:21:45,156 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:21:45,156 INFO L87 Difference]: Start difference. First operand 3767 states and 4652 transitions. Second operand has 6 states, 6 states have (on average 17.0) internal successors, (102), 5 states have internal predecessors, (102), 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-03-03 16:21:45,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:21:45,804 INFO L93 Difference]: Finished difference Result 5021 states and 6585 transitions. [2025-03-03 16:21:45,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 16:21:45,805 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.0) internal successors, (102), 5 states have internal predecessors, (102), 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 113 [2025-03-03 16:21:45,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:21:45,816 INFO L225 Difference]: With dead ends: 5021 [2025-03-03 16:21:45,817 INFO L226 Difference]: Without dead ends: 4324 [2025-03-03 16:21:45,819 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-03-03 16:21:45,819 INFO L435 NwaCegarLoop]: 560 mSDtfsCounter, 828 mSDsluCounter, 1662 mSDsCounter, 0 mSdLazyCounter, 928 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 852 SdHoareTripleChecker+Valid, 2222 SdHoareTripleChecker+Invalid, 975 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 928 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 16:21:45,820 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [852 Valid, 2222 Invalid, 975 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 928 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 16:21:45,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4324 states. [2025-03-03 16:21:46,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4324 to 4240. [2025-03-03 16:21:46,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4240 states, 3444 states have (on average 1.2857142857142858) internal successors, (4428), 3494 states have internal predecessors, (4428), 407 states have call successors, (407), 311 states have call predecessors, (407), 387 states have return successors, (540), 439 states have call predecessors, (540), 404 states have call successors, (540) [2025-03-03 16:21:46,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4240 states to 4240 states and 5375 transitions. [2025-03-03 16:21:46,075 INFO L78 Accepts]: Start accepts. Automaton has 4240 states and 5375 transitions. Word has length 113 [2025-03-03 16:21:46,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:21:46,076 INFO L471 AbstractCegarLoop]: Abstraction has 4240 states and 5375 transitions. [2025-03-03 16:21:46,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.0) internal successors, (102), 5 states have internal predecessors, (102), 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-03-03 16:21:46,076 INFO L276 IsEmpty]: Start isEmpty. Operand 4240 states and 5375 transitions. [2025-03-03 16:21:46,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-03 16:21:46,078 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:21:46,078 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:21:46,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 16:21:46,078 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:21:46,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:21:46,079 INFO L85 PathProgramCache]: Analyzing trace with hash -430406059, now seen corresponding path program 1 times [2025-03-03 16:21:46,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:21:46,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889154732] [2025-03-03 16:21:46,079 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:21:46,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:21:46,085 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-03 16:21:46,089 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-03 16:21:46,089 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:21:46,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:21:46,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:21:46,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:21:46,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889154732] [2025-03-03 16:21:46,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889154732] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:21:46,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:21:46,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 16:21:46,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957542276] [2025-03-03 16:21:46,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:21:46,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 16:21:46,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:21:46,171 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 16:21:46,171 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:21:46,171 INFO L87 Difference]: Start difference. First operand 4240 states and 5375 transitions. Second operand has 6 states, 6 states have (on average 17.0) internal successors, (102), 5 states have internal predecessors, (102), 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-03-03 16:21:46,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:21:46,896 INFO L93 Difference]: Finished difference Result 6528 states and 8934 transitions. [2025-03-03 16:21:46,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 16:21:46,897 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.0) internal successors, (102), 5 states have internal predecessors, (102), 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 113 [2025-03-03 16:21:46,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:21:46,912 INFO L225 Difference]: With dead ends: 6528 [2025-03-03 16:21:46,912 INFO L226 Difference]: Without dead ends: 5358 [2025-03-03 16:21:46,916 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-03-03 16:21:46,916 INFO L435 NwaCegarLoop]: 557 mSDtfsCounter, 823 mSDsluCounter, 1653 mSDsCounter, 0 mSdLazyCounter, 928 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 847 SdHoareTripleChecker+Valid, 2210 SdHoareTripleChecker+Invalid, 975 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 928 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 16:21:46,916 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [847 Valid, 2210 Invalid, 975 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 928 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 16:21:46,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5358 states. [2025-03-03 16:21:47,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5358 to 5255. [2025-03-03 16:21:47,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5255 states, 4361 states have (on average 1.3409768401742719) internal successors, (5848), 4425 states have internal predecessors, (5848), 467 states have call successors, (467), 335 states have call predecessors, (467), 425 states have return successors, (648), 503 states have call predecessors, (648), 464 states have call successors, (648) [2025-03-03 16:21:47,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5255 states to 5255 states and 6963 transitions. [2025-03-03 16:21:47,230 INFO L78 Accepts]: Start accepts. Automaton has 5255 states and 6963 transitions. Word has length 113 [2025-03-03 16:21:47,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:21:47,230 INFO L471 AbstractCegarLoop]: Abstraction has 5255 states and 6963 transitions. [2025-03-03 16:21:47,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.0) internal successors, (102), 5 states have internal predecessors, (102), 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-03-03 16:21:47,230 INFO L276 IsEmpty]: Start isEmpty. Operand 5255 states and 6963 transitions. [2025-03-03 16:21:47,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-03 16:21:47,233 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:21:47,233 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:21:47,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-03 16:21:47,234 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:21:47,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:21:47,235 INFO L85 PathProgramCache]: Analyzing trace with hash -872160554, now seen corresponding path program 1 times [2025-03-03 16:21:47,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:21:47,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200587908] [2025-03-03 16:21:47,235 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:21:47,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:21:47,241 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-03 16:21:47,244 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-03 16:21:47,244 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:21:47,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:21:47,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:21:47,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:21:47,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200587908] [2025-03-03 16:21:47,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200587908] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:21:47,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:21:47,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 16:21:47,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256910322] [2025-03-03 16:21:47,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:21:47,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 16:21:47,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:21:47,311 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 16:21:47,311 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:21:47,312 INFO L87 Difference]: Start difference. First operand 5255 states and 6963 transitions. Second operand has 6 states, 6 states have (on average 17.0) internal successors, (102), 5 states have internal predecessors, (102), 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-03-03 16:21:48,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:21:48,093 INFO L93 Difference]: Finished difference Result 9799 states and 14188 transitions. [2025-03-03 16:21:48,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 16:21:48,093 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.0) internal successors, (102), 5 states have internal predecessors, (102), 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 113 [2025-03-03 16:21:48,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:21:48,114 INFO L225 Difference]: With dead ends: 9799 [2025-03-03 16:21:48,114 INFO L226 Difference]: Without dead ends: 7614 [2025-03-03 16:21:48,120 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-03-03 16:21:48,121 INFO L435 NwaCegarLoop]: 554 mSDtfsCounter, 818 mSDsluCounter, 1644 mSDsCounter, 0 mSdLazyCounter, 928 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 842 SdHoareTripleChecker+Valid, 2198 SdHoareTripleChecker+Invalid, 975 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 928 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 16:21:48,121 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [842 Valid, 2198 Invalid, 975 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 928 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 16:21:48,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7614 states. [2025-03-03 16:21:48,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7614 to 7474. [2025-03-03 16:21:48,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7474 states, 6366 states have (on average 1.4150172792962614) internal successors, (9008), 6476 states have internal predecessors, (9008), 587 states have call successors, (587), 383 states have call predecessors, (587), 519 states have return successors, (960), 631 states have call predecessors, (960), 584 states have call successors, (960) [2025-03-03 16:21:48,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7474 states to 7474 states and 10555 transitions. [2025-03-03 16:21:48,544 INFO L78 Accepts]: Start accepts. Automaton has 7474 states and 10555 transitions. Word has length 113 [2025-03-03 16:21:48,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:21:48,544 INFO L471 AbstractCegarLoop]: Abstraction has 7474 states and 10555 transitions. [2025-03-03 16:21:48,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.0) internal successors, (102), 5 states have internal predecessors, (102), 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-03-03 16:21:48,544 INFO L276 IsEmpty]: Start isEmpty. Operand 7474 states and 10555 transitions. [2025-03-03 16:21:48,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-03 16:21:48,548 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:21:48,548 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:21:48,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-03 16:21:48,549 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:21:48,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:21:48,549 INFO L85 PathProgramCache]: Analyzing trace with hash -886410699, now seen corresponding path program 1 times [2025-03-03 16:21:48,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:21:48,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447815760] [2025-03-03 16:21:48,550 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:21:48,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:21:48,557 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-03 16:21:48,562 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-03 16:21:48,563 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:21:48,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:21:48,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:21:48,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:21:48,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447815760] [2025-03-03 16:21:48,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447815760] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:21:48,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:21:48,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 16:21:48,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448568485] [2025-03-03 16:21:48,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:21:48,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 16:21:48,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:21:48,630 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 16:21:48,630 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 16:21:48,630 INFO L87 Difference]: Start difference. First operand 7474 states and 10555 transitions. Second operand has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 states have internal predecessors, (102), 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-03-03 16:21:49,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:21:49,351 INFO L93 Difference]: Finished difference Result 12708 states and 19215 transitions. [2025-03-03 16:21:49,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 16:21:49,353 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 states have internal predecessors, (102), 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 113 [2025-03-03 16:21:49,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:21:49,380 INFO L225 Difference]: With dead ends: 12708 [2025-03-03 16:21:49,380 INFO L226 Difference]: Without dead ends: 8304 [2025-03-03 16:21:49,393 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-03-03 16:21:49,394 INFO L435 NwaCegarLoop]: 341 mSDtfsCounter, 649 mSDsluCounter, 561 mSDsCounter, 0 mSdLazyCounter, 431 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 673 SdHoareTripleChecker+Valid, 902 SdHoareTripleChecker+Invalid, 479 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 16:21:49,394 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [673 Valid, 902 Invalid, 479 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 431 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 16:21:49,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8304 states. [2025-03-03 16:21:49,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8304 to 7474. [2025-03-03 16:21:49,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7474 states, 6366 states have (on average 1.4123468426013195) internal successors, (8991), 6476 states have internal predecessors, (8991), 587 states have call successors, (587), 383 states have call predecessors, (587), 519 states have return successors, (960), 631 states have call predecessors, (960), 584 states have call successors, (960) [2025-03-03 16:21:49,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7474 states to 7474 states and 10538 transitions. [2025-03-03 16:21:49,825 INFO L78 Accepts]: Start accepts. Automaton has 7474 states and 10538 transitions. Word has length 113 [2025-03-03 16:21:49,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:21:49,825 INFO L471 AbstractCegarLoop]: Abstraction has 7474 states and 10538 transitions. [2025-03-03 16:21:49,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 states have internal predecessors, (102), 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-03-03 16:21:49,825 INFO L276 IsEmpty]: Start isEmpty. Operand 7474 states and 10538 transitions. [2025-03-03 16:21:49,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-03 16:21:49,828 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:21:49,828 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:21:49,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-03 16:21:49,828 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:21:49,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:21:49,828 INFO L85 PathProgramCache]: Analyzing trace with hash -1856701706, now seen corresponding path program 1 times [2025-03-03 16:21:49,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:21:49,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033836013] [2025-03-03 16:21:49,828 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:21:49,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:21:49,834 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-03 16:21:49,836 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-03 16:21:49,836 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:21:49,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:21:49,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:21:49,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:21:49,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033836013] [2025-03-03 16:21:49,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033836013] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:21:49,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:21:49,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 16:21:49,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720636825] [2025-03-03 16:21:49,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:21:49,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 16:21:49,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:21:49,884 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 16:21:49,884 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 16:21:49,885 INFO L87 Difference]: Start difference. First operand 7474 states and 10538 transitions. Second operand has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 states have internal predecessors, (102), 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-03-03 16:21:50,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:21:50,526 INFO L93 Difference]: Finished difference Result 12625 states and 19015 transitions. [2025-03-03 16:21:50,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 16:21:50,527 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 states have internal predecessors, (102), 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 113 [2025-03-03 16:21:50,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:21:50,553 INFO L225 Difference]: With dead ends: 12625 [2025-03-03 16:21:50,554 INFO L226 Difference]: Without dead ends: 8221 [2025-03-03 16:21:50,562 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-03-03 16:21:50,563 INFO L435 NwaCegarLoop]: 338 mSDtfsCounter, 646 mSDsluCounter, 556 mSDsCounter, 0 mSdLazyCounter, 431 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 670 SdHoareTripleChecker+Valid, 894 SdHoareTripleChecker+Invalid, 479 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 16:21:50,565 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [670 Valid, 894 Invalid, 479 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 431 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 16:21:50,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8221 states. [2025-03-03 16:21:51,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8221 to 7474. [2025-03-03 16:21:51,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7474 states, 6366 states have (on average 1.4096764059063775) internal successors, (8974), 6476 states have internal predecessors, (8974), 587 states have call successors, (587), 383 states have call predecessors, (587), 519 states have return successors, (960), 631 states have call predecessors, (960), 584 states have call successors, (960) [2025-03-03 16:21:51,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7474 states to 7474 states and 10521 transitions. [2025-03-03 16:21:51,031 INFO L78 Accepts]: Start accepts. Automaton has 7474 states and 10521 transitions. Word has length 113 [2025-03-03 16:21:51,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:21:51,031 INFO L471 AbstractCegarLoop]: Abstraction has 7474 states and 10521 transitions. [2025-03-03 16:21:51,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 states have internal predecessors, (102), 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-03-03 16:21:51,032 INFO L276 IsEmpty]: Start isEmpty. Operand 7474 states and 10521 transitions. [2025-03-03 16:21:51,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-03 16:21:51,035 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:21:51,036 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:21:51,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-03 16:21:51,036 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:21:51,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:21:51,036 INFO L85 PathProgramCache]: Analyzing trace with hash -918170091, now seen corresponding path program 1 times [2025-03-03 16:21:51,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:21:51,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074527883] [2025-03-03 16:21:51,037 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:21:51,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:21:51,047 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-03 16:21:51,050 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-03 16:21:51,050 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:21:51,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:21:51,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:21:51,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:21:51,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074527883] [2025-03-03 16:21:51,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074527883] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:21:51,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:21:51,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 16:21:51,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083788807] [2025-03-03 16:21:51,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:21:51,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 16:21:51,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:21:51,121 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 16:21:51,121 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:21:51,121 INFO L87 Difference]: Start difference. First operand 7474 states and 10521 transitions. Second operand has 6 states, 6 states have (on average 17.0) internal successors, (102), 5 states have internal predecessors, (102), 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-03-03 16:21:52,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:21:52,265 INFO L93 Difference]: Finished difference Result 17590 states and 26977 transitions. [2025-03-03 16:21:52,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 16:21:52,265 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.0) internal successors, (102), 5 states have internal predecessors, (102), 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 113 [2025-03-03 16:21:52,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:21:52,305 INFO L225 Difference]: With dead ends: 17590 [2025-03-03 16:21:52,305 INFO L226 Difference]: Without dead ends: 13186 [2025-03-03 16:21:52,317 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-03-03 16:21:52,317 INFO L435 NwaCegarLoop]: 539 mSDtfsCounter, 991 mSDsluCounter, 1596 mSDsCounter, 0 mSdLazyCounter, 931 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1022 SdHoareTripleChecker+Valid, 2135 SdHoareTripleChecker+Invalid, 981 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 931 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 16:21:52,318 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1022 Valid, 2135 Invalid, 981 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 931 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 16:21:52,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13186 states. [2025-03-03 16:21:53,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13186 to 12215. [2025-03-03 16:21:53,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12215 states, 10641 states have (on average 1.4812517620524386) internal successors, (15762), 10897 states have internal predecessors, (15762), 811 states have call successors, (811), 479 states have call predecessors, (811), 761 states have return successors, (1952), 871 states have call predecessors, (1952), 808 states have call successors, (1952) [2025-03-03 16:21:53,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12215 states to 12215 states and 18525 transitions. [2025-03-03 16:21:53,260 INFO L78 Accepts]: Start accepts. Automaton has 12215 states and 18525 transitions. Word has length 113 [2025-03-03 16:21:53,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:21:53,260 INFO L471 AbstractCegarLoop]: Abstraction has 12215 states and 18525 transitions. [2025-03-03 16:21:53,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.0) internal successors, (102), 5 states have internal predecessors, (102), 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-03-03 16:21:53,260 INFO L276 IsEmpty]: Start isEmpty. Operand 12215 states and 18525 transitions. [2025-03-03 16:21:53,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-03 16:21:53,265 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:21:53,265 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:21:53,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-03 16:21:53,266 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:21:53,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:21:53,266 INFO L85 PathProgramCache]: Analyzing trace with hash -1303536874, now seen corresponding path program 1 times [2025-03-03 16:21:53,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:21:53,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722390556] [2025-03-03 16:21:53,266 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:21:53,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:21:53,273 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-03 16:21:53,276 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-03 16:21:53,276 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:21:53,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:21:53,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:21:53,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:21:53,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722390556] [2025-03-03 16:21:53,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722390556] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:21:53,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:21:53,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 16:21:53,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467123713] [2025-03-03 16:21:53,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:21:53,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 16:21:53,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:21:53,335 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 16:21:53,335 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:21:53,335 INFO L87 Difference]: Start difference. First operand 12215 states and 18525 transitions. Second operand has 6 states, 6 states have (on average 17.0) internal successors, (102), 5 states have internal predecessors, (102), 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-03-03 16:21:54,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:21:54,581 INFO L93 Difference]: Finished difference Result 33455 states and 55083 transitions. [2025-03-03 16:21:54,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 16:21:54,581 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.0) internal successors, (102), 5 states have internal predecessors, (102), 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 113 [2025-03-03 16:21:54,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:21:54,653 INFO L225 Difference]: With dead ends: 33455 [2025-03-03 16:21:54,654 INFO L226 Difference]: Without dead ends: 24310 [2025-03-03 16:21:54,682 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-03-03 16:21:54,683 INFO L435 NwaCegarLoop]: 535 mSDtfsCounter, 955 mSDsluCounter, 1584 mSDsCounter, 0 mSdLazyCounter, 931 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 986 SdHoareTripleChecker+Valid, 2119 SdHoareTripleChecker+Invalid, 981 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 931 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 16:21:54,683 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [986 Valid, 2119 Invalid, 981 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 931 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 16:21:54,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24310 states. [2025-03-03 16:21:55,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24310 to 22350. [2025-03-03 16:21:55,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22350 states, 19698 states have (on average 1.5383287643415575) internal successors, (30302), 20408 states have internal predecessors, (30302), 1243 states have call successors, (1243), 671 states have call predecessors, (1243), 1407 states have return successors, (5456), 1335 states have call predecessors, (5456), 1240 states have call successors, (5456) [2025-03-03 16:21:55,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22350 states to 22350 states and 37001 transitions. [2025-03-03 16:21:55,932 INFO L78 Accepts]: Start accepts. Automaton has 22350 states and 37001 transitions. Word has length 113 [2025-03-03 16:21:55,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:21:55,932 INFO L471 AbstractCegarLoop]: Abstraction has 22350 states and 37001 transitions. [2025-03-03 16:21:55,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.0) internal successors, (102), 5 states have internal predecessors, (102), 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-03-03 16:21:55,932 INFO L276 IsEmpty]: Start isEmpty. Operand 22350 states and 37001 transitions. [2025-03-03 16:21:55,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-03 16:21:55,939 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:21:55,939 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:21:55,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-03 16:21:55,940 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:21:55,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:21:55,940 INFO L85 PathProgramCache]: Analyzing trace with hash 346599925, now seen corresponding path program 1 times [2025-03-03 16:21:55,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:21:55,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233669216] [2025-03-03 16:21:55,940 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:21:55,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:21:55,947 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-03 16:21:55,949 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-03 16:21:55,949 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:21:55,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:21:55,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:21:55,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:21:55,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233669216] [2025-03-03 16:21:55,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233669216] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:21:55,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:21:55,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 16:21:55,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212783923] [2025-03-03 16:21:55,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:21:55,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 16:21:55,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:21:55,999 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 16:21:55,999 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:21:55,999 INFO L87 Difference]: Start difference. First operand 22350 states and 37001 transitions. Second operand has 6 states, 6 states have (on average 17.0) internal successors, (102), 5 states have internal predecessors, (102), 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-03-03 16:21:58,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:21:58,608 INFO L93 Difference]: Finished difference Result 67554 states and 122121 transitions. [2025-03-03 16:21:58,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 16:21:58,608 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.0) internal successors, (102), 5 states have internal predecessors, (102), 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 113 [2025-03-03 16:21:58,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:21:58,790 INFO L225 Difference]: With dead ends: 67554 [2025-03-03 16:21:58,790 INFO L226 Difference]: Without dead ends: 48274 [2025-03-03 16:21:58,857 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-03-03 16:21:58,858 INFO L435 NwaCegarLoop]: 533 mSDtfsCounter, 921 mSDsluCounter, 1578 mSDsCounter, 0 mSdLazyCounter, 931 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 952 SdHoareTripleChecker+Valid, 2111 SdHoareTripleChecker+Invalid, 981 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 931 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 16:21:58,859 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [952 Valid, 2111 Invalid, 981 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 931 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 16:21:58,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48274 states. [2025-03-03 16:22:01,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48274 to 45549. [2025-03-03 16:22:01,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45549 states, 40287 states have (on average 1.5831906073919626) internal successors, (63782), 42391 states have internal predecessors, (63782), 2075 states have call successors, (2075), 1055 states have call predecessors, (2075), 3185 states have return successors, (18576), 2231 states have call predecessors, (18576), 2072 states have call successors, (18576) [2025-03-03 16:22:02,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45549 states to 45549 states and 84433 transitions. [2025-03-03 16:22:02,148 INFO L78 Accepts]: Start accepts. Automaton has 45549 states and 84433 transitions. Word has length 113 [2025-03-03 16:22:02,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:22:02,148 INFO L471 AbstractCegarLoop]: Abstraction has 45549 states and 84433 transitions. [2025-03-03 16:22:02,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.0) internal successors, (102), 5 states have internal predecessors, (102), 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-03-03 16:22:02,148 INFO L276 IsEmpty]: Start isEmpty. Operand 45549 states and 84433 transitions. [2025-03-03 16:22:02,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-03 16:22:02,161 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:22:02,161 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:22:02,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-03 16:22:02,161 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:22:02,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:22:02,161 INFO L85 PathProgramCache]: Analyzing trace with hash -2094021834, now seen corresponding path program 1 times [2025-03-03 16:22:02,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:22:02,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61021350] [2025-03-03 16:22:02,161 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:22:02,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:22:02,167 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-03 16:22:02,169 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-03 16:22:02,169 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:22:02,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:22:02,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:22:02,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:22:02,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61021350] [2025-03-03 16:22:02,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61021350] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:22:02,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:22:02,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 16:22:02,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060300607] [2025-03-03 16:22:02,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:22:02,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 16:22:02,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:22:02,220 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 16:22:02,220 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:22:02,221 INFO L87 Difference]: Start difference. First operand 45549 states and 84433 transitions. Second operand has 6 states, 6 states have (on average 17.0) internal successors, (102), 5 states have internal predecessors, (102), 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-03-03 16:22:07,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:22:07,816 INFO L93 Difference]: Finished difference Result 145181 states and 300039 transitions. [2025-03-03 16:22:07,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 16:22:07,816 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.0) internal successors, (102), 5 states have internal predecessors, (102), 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 113 [2025-03-03 16:22:07,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:22:08,187 INFO L225 Difference]: With dead ends: 145181 [2025-03-03 16:22:08,187 INFO L226 Difference]: Without dead ends: 102702 [2025-03-03 16:22:08,403 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-03-03 16:22:08,406 INFO L435 NwaCegarLoop]: 530 mSDtfsCounter, 886 mSDsluCounter, 1569 mSDsCounter, 0 mSdLazyCounter, 931 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 917 SdHoareTripleChecker+Valid, 2099 SdHoareTripleChecker+Invalid, 981 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 931 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 16:22:08,406 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [917 Valid, 2099 Invalid, 981 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 931 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 16:22:08,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102702 states.