./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.09.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed 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_1.cil-2+token_ring.09.cil-2.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 43061c6fd2cf55dd1721985927e668f0444e5f80f3517bfb8a4405f126e779da --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 07:31:56,084 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 07:31:56,127 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 07:31:56,133 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 07:31:56,134 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 07:31:56,156 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 07:31:56,157 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 07:31:56,157 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 07:31:56,158 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 07:31:56,158 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 07:31:56,158 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 07:31:56,158 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 07:31:56,159 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 07:31:56,159 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 07:31:56,159 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 07:31:56,159 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 07:31:56,159 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 07:31:56,159 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 07:31:56,160 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 07:31:56,160 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 07:31:56,160 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 07:31:56,160 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 07:31:56,160 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 07:31:56,160 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 07:31:56,160 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 07:31:56,160 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 07:31:56,160 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 07:31:56,160 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 07:31:56,160 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 07:31:56,160 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 07:31:56,160 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 07:31:56,160 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 07:31:56,160 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 07:31:56,160 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 07:31:56,160 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 07:31:56,160 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 07:31:56,161 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 07:31:56,161 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 07:31:56,161 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 07:31:56,161 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 07:31:56,161 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 07:31:56,161 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 07:31:56,161 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 07:31:56,161 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 -> 43061c6fd2cf55dd1721985927e668f0444e5f80f3517bfb8a4405f126e779da [2025-03-08 07:31:56,397 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 07:31:56,404 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 07:31:56,406 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 07:31:56,407 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 07:31:56,407 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 07:31:56,408 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.09.cil-2.c [2025-03-08 07:31:57,689 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5cb4a1697/bab57dc5bc0a430a934abce1efc13134/FLAGdec6e7541 [2025-03-08 07:31:57,981 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 07:31:57,982 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.09.cil-2.c [2025-03-08 07:31:57,993 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5cb4a1697/bab57dc5bc0a430a934abce1efc13134/FLAGdec6e7541 [2025-03-08 07:31:58,006 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5cb4a1697/bab57dc5bc0a430a934abce1efc13134 [2025-03-08 07:31:58,008 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 07:31:58,009 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 07:31:58,010 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 07:31:58,010 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 07:31:58,013 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 07:31:58,014 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 07:31:58" (1/1) ... [2025-03-08 07:31:58,015 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@610f9b06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:31:58, skipping insertion in model container [2025-03-08 07:31:58,015 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 07:31:58" (1/1) ... [2025-03-08 07:31:58,043 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 07:31:58,147 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_1.cil-2+token_ring.09.cil-2.c[913,926] [2025-03-08 07:31:58,192 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_1.cil-2+token_ring.09.cil-2.c[5977,5990] [2025-03-08 07:31:58,270 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 07:31:58,284 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 07:31:58,293 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_1.cil-2+token_ring.09.cil-2.c[913,926] [2025-03-08 07:31:58,303 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_1.cil-2+token_ring.09.cil-2.c[5977,5990] [2025-03-08 07:31:58,328 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 07:31:58,350 INFO L204 MainTranslator]: Completed translation [2025-03-08 07:31:58,351 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:31:58 WrapperNode [2025-03-08 07:31:58,352 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 07:31:58,353 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 07:31:58,353 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 07:31:58,353 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 07:31:58,357 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:31:58" (1/1) ... [2025-03-08 07:31:58,365 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:31:58" (1/1) ... [2025-03-08 07:31:58,395 INFO L138 Inliner]: procedures = 66, calls = 76, calls flagged for inlining = 40, calls inlined = 40, statements flattened = 861 [2025-03-08 07:31:58,395 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 07:31:58,395 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 07:31:58,395 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 07:31:58,396 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 07:31:58,408 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:31:58" (1/1) ... [2025-03-08 07:31:58,408 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:31:58" (1/1) ... [2025-03-08 07:31:58,413 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:31:58" (1/1) ... [2025-03-08 07:31:58,423 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-08 07:31:58,424 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:31:58" (1/1) ... [2025-03-08 07:31:58,424 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:31:58" (1/1) ... [2025-03-08 07:31:58,431 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:31:58" (1/1) ... [2025-03-08 07:31:58,432 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:31:58" (1/1) ... [2025-03-08 07:31:58,433 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:31:58" (1/1) ... [2025-03-08 07:31:58,434 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:31:58" (1/1) ... [2025-03-08 07:31:58,436 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 07:31:58,437 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 07:31:58,437 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 07:31:58,437 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 07:31:58,438 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:31:58" (1/1) ... [2025-03-08 07:31:58,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 07:31:58,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 07:31:58,469 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-08 07:31:58,471 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-08 07:31:58,490 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 07:31:58,491 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-03-08 07:31:58,491 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-03-08 07:31:58,491 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify_threads [2025-03-08 07:31:58,491 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify_threads [2025-03-08 07:31:58,491 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2025-03-08 07:31:58,491 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2025-03-08 07:31:58,491 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2025-03-08 07:31:58,491 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2025-03-08 07:31:58,492 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2025-03-08 07:31:58,492 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2025-03-08 07:31:58,492 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2025-03-08 07:31:58,492 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2025-03-08 07:31:58,492 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2025-03-08 07:31:58,492 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2025-03-08 07:31:58,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 07:31:58,492 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2025-03-08 07:31:58,492 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2025-03-08 07:31:58,493 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 07:31:58,493 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 07:31:58,493 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2025-03-08 07:31:58,493 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2025-03-08 07:31:58,493 INFO L130 BoogieDeclarations]: Found specification of procedure error2 [2025-03-08 07:31:58,493 INFO L138 BoogieDeclarations]: Found implementation of procedure error2 [2025-03-08 07:31:58,584 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 07:31:58,586 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 07:31:59,304 INFO L? ?]: Removed 113 outVars from TransFormulas that were not future-live. [2025-03-08 07:31:59,305 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 07:31:59,320 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 07:31:59,320 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 07:31:59,321 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 07:31:59 BoogieIcfgContainer [2025-03-08 07:31:59,321 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 07:31:59,322 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 07:31:59,322 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 07:31:59,325 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 07:31:59,325 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 07:31:58" (1/3) ... [2025-03-08 07:31:59,326 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d0fd2a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 07:31:59, skipping insertion in model container [2025-03-08 07:31:59,326 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:31:58" (2/3) ... [2025-03-08 07:31:59,326 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d0fd2a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 07:31:59, skipping insertion in model container [2025-03-08 07:31:59,326 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 07:31:59" (3/3) ... [2025-03-08 07:31:59,327 INFO L128 eAbstractionObserver]: Analyzing ICFG pc_sfifo_1.cil-2+token_ring.09.cil-2.c [2025-03-08 07:31:59,337 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 07:31:59,339 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pc_sfifo_1.cil-2+token_ring.09.cil-2.c that has 11 procedures, 381 locations, 1 initial locations, 16 loop locations, and 2 error locations. [2025-03-08 07:31:59,391 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 07:31:59,400 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;@7f756671, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 07:31:59,402 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-08 07:31:59,406 INFO L276 IsEmpty]: Start isEmpty. Operand has 381 states, 339 states have (on average 1.5958702064896755) internal successors, (541), 344 states have internal predecessors, (541), 31 states have call successors, (31), 10 states have call predecessors, (31), 10 states have return successors, (31), 29 states have call predecessors, (31), 31 states have call successors, (31) [2025-03-08 07:31:59,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-08 07:31:59,413 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:31:59,414 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] [2025-03-08 07:31:59,414 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:31:59,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:31:59,419 INFO L85 PathProgramCache]: Analyzing trace with hash 1835411092, now seen corresponding path program 1 times [2025-03-08 07:31:59,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:31:59,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504369695] [2025-03-08 07:31:59,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:31:59,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:31:59,502 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-08 07:31:59,538 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-08 07:31:59,538 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:31:59,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:31:59,653 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-08 07:31:59,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:31:59,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504369695] [2025-03-08 07:31:59,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504369695] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:31:59,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:31:59,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 07:31:59,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903886567] [2025-03-08 07:31:59,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:31:59,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 07:31:59,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:31:59,674 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 07:31:59,675 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:31:59,677 INFO L87 Difference]: Start difference. First operand has 381 states, 339 states have (on average 1.5958702064896755) internal successors, (541), 344 states have internal predecessors, (541), 31 states have call successors, (31), 10 states have call predecessors, (31), 10 states have return successors, (31), 29 states have call predecessors, (31), 31 states have call successors, (31) Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 07:31:59,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:31:59,778 INFO L93 Difference]: Finished difference Result 794 states and 1256 transitions. [2025-03-08 07:31:59,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 07:31:59,780 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 41 [2025-03-08 07:31:59,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:31:59,793 INFO L225 Difference]: With dead ends: 794 [2025-03-08 07:31:59,794 INFO L226 Difference]: Without dead ends: 425 [2025-03-08 07:31:59,802 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-08 07:31:59,804 INFO L435 NwaCegarLoop]: 593 mSDtfsCounter, 560 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 560 SdHoareTripleChecker+Valid, 674 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 07:31:59,805 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [560 Valid, 674 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:31:59,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2025-03-08 07:31:59,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 421. [2025-03-08 07:31:59,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 374 states have (on average 1.5374331550802138) internal successors, (575), 378 states have internal predecessors, (575), 35 states have call successors, (35), 12 states have call predecessors, (35), 10 states have return successors, (35), 31 states have call predecessors, (35), 31 states have call successors, (35) [2025-03-08 07:31:59,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 645 transitions. [2025-03-08 07:31:59,873 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 645 transitions. Word has length 41 [2025-03-08 07:31:59,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:31:59,873 INFO L471 AbstractCegarLoop]: Abstraction has 421 states and 645 transitions. [2025-03-08 07:31:59,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 07:31:59,873 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 645 transitions. [2025-03-08 07:31:59,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-08 07:31:59,875 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:31:59,875 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] [2025-03-08 07:31:59,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 07:31:59,875 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:31:59,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:31:59,876 INFO L85 PathProgramCache]: Analyzing trace with hash -97689985, now seen corresponding path program 1 times [2025-03-08 07:31:59,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:31:59,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092313623] [2025-03-08 07:31:59,876 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:31:59,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:31:59,887 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-08 07:31:59,902 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-08 07:31:59,902 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:31:59,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:31:59,976 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-08 07:31:59,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:31:59,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092313623] [2025-03-08 07:31:59,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2092313623] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:31:59,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:31:59,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 07:31:59,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213469493] [2025-03-08 07:31:59,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:31:59,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 07:31:59,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:31:59,978 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 07:31:59,978 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:31:59,978 INFO L87 Difference]: Start difference. First operand 421 states and 645 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 07:32:00,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:32:00,021 INFO L93 Difference]: Finished difference Result 614 states and 918 transitions. [2025-03-08 07:32:00,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 07:32:00,027 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 42 [2025-03-08 07:32:00,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:32:00,030 INFO L225 Difference]: With dead ends: 614 [2025-03-08 07:32:00,030 INFO L226 Difference]: Without dead ends: 507 [2025-03-08 07:32:00,035 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-08 07:32:00,036 INFO L435 NwaCegarLoop]: 597 mSDtfsCounter, 66 mSDsluCounter, 546 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 1143 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 07:32:00,036 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 1143 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:32:00,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2025-03-08 07:32:00,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 482. [2025-03-08 07:32:00,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 482 states, 429 states have (on average 1.5221445221445222) internal successors, (653), 433 states have internal predecessors, (653), 38 states have call successors, (38), 15 states have call predecessors, (38), 13 states have return successors, (39), 34 states have call predecessors, (39), 34 states have call successors, (39) [2025-03-08 07:32:00,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 730 transitions. [2025-03-08 07:32:00,059 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 730 transitions. Word has length 42 [2025-03-08 07:32:00,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:32:00,059 INFO L471 AbstractCegarLoop]: Abstraction has 482 states and 730 transitions. [2025-03-08 07:32:00,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 07:32:00,059 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 730 transitions. [2025-03-08 07:32:00,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-08 07:32:00,061 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:32:00,061 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] [2025-03-08 07:32:00,061 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 07:32:00,061 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:32:00,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:32:00,061 INFO L85 PathProgramCache]: Analyzing trace with hash 1203109953, now seen corresponding path program 1 times [2025-03-08 07:32:00,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:32:00,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653565352] [2025-03-08 07:32:00,062 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:32:00,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:32:00,074 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-08 07:32:00,083 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-08 07:32:00,083 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:32:00,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:32:00,130 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-08 07:32:00,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:32:00,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653565352] [2025-03-08 07:32:00,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653565352] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:32:00,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:32:00,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 07:32:00,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505827762] [2025-03-08 07:32:00,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:32:00,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 07:32:00,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:32:00,132 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 07:32:00,132 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:32:00,132 INFO L87 Difference]: Start difference. First operand 482 states and 730 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 07:32:00,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:32:00,177 INFO L93 Difference]: Finished difference Result 807 states and 1190 transitions. [2025-03-08 07:32:00,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 07:32:00,177 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 43 [2025-03-08 07:32:00,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:32:00,181 INFO L225 Difference]: With dead ends: 807 [2025-03-08 07:32:00,181 INFO L226 Difference]: Without dead ends: 639 [2025-03-08 07:32:00,182 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-08 07:32:00,182 INFO L435 NwaCegarLoop]: 580 mSDtfsCounter, 548 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 548 SdHoareTripleChecker+Valid, 654 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-08 07:32:00,183 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [548 Valid, 654 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:32:00,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2025-03-08 07:32:00,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 627. [2025-03-08 07:32:00,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 627 states, 556 states have (on average 1.4802158273381294) internal successors, (823), 562 states have internal predecessors, (823), 49 states have call successors, (49), 22 states have call predecessors, (49), 20 states have return successors, (55), 43 states have call predecessors, (55), 45 states have call successors, (55) [2025-03-08 07:32:00,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 627 states to 627 states and 927 transitions. [2025-03-08 07:32:00,224 INFO L78 Accepts]: Start accepts. Automaton has 627 states and 927 transitions. Word has length 43 [2025-03-08 07:32:00,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:32:00,225 INFO L471 AbstractCegarLoop]: Abstraction has 627 states and 927 transitions. [2025-03-08 07:32:00,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 07:32:00,225 INFO L276 IsEmpty]: Start isEmpty. Operand 627 states and 927 transitions. [2025-03-08 07:32:00,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-08 07:32:00,228 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:32:00,228 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:32:00,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 07:32:00,228 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:32:00,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:32:00,229 INFO L85 PathProgramCache]: Analyzing trace with hash 329963476, now seen corresponding path program 1 times [2025-03-08 07:32:00,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:32:00,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925199618] [2025-03-08 07:32:00,229 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:32:00,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:32:00,240 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-08 07:32:00,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-08 07:32:00,252 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:32:00,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:32:00,348 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-08 07:32:00,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:32:00,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925199618] [2025-03-08 07:32:00,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925199618] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:32:00,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:32:00,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 07:32:00,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180753588] [2025-03-08 07:32:00,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:32:00,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 07:32:00,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:32:00,349 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 07:32:00,349 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:32:00,350 INFO L87 Difference]: Start difference. First operand 627 states and 927 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 07:32:00,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:32:00,397 INFO L93 Difference]: Finished difference Result 1098 states and 1583 transitions. [2025-03-08 07:32:00,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 07:32:00,398 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 58 [2025-03-08 07:32:00,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:32:00,401 INFO L225 Difference]: With dead ends: 1098 [2025-03-08 07:32:00,401 INFO L226 Difference]: Without dead ends: 785 [2025-03-08 07:32:00,403 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-08 07:32:00,406 INFO L435 NwaCegarLoop]: 626 mSDtfsCounter, 53 mSDsluCounter, 561 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 1187 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 07:32:00,406 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 1187 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:32:00,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 785 states. [2025-03-08 07:32:00,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 785 to 785. [2025-03-08 07:32:00,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 785 states, 692 states have (on average 1.4291907514450868) internal successors, (989), 698 states have internal predecessors, (989), 63 states have call successors, (63), 30 states have call predecessors, (63), 28 states have return successors, (77), 57 states have call predecessors, (77), 59 states have call successors, (77) [2025-03-08 07:32:00,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 1129 transitions. [2025-03-08 07:32:00,437 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 1129 transitions. Word has length 58 [2025-03-08 07:32:00,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:32:00,437 INFO L471 AbstractCegarLoop]: Abstraction has 785 states and 1129 transitions. [2025-03-08 07:32:00,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 07:32:00,438 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 1129 transitions. [2025-03-08 07:32:00,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-08 07:32:00,440 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:32:00,440 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] [2025-03-08 07:32:00,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 07:32:00,440 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:32:00,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:32:00,440 INFO L85 PathProgramCache]: Analyzing trace with hash 579353067, now seen corresponding path program 1 times [2025-03-08 07:32:00,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:32:00,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309652385] [2025-03-08 07:32:00,440 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:32:00,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:32:00,452 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-08 07:32:00,461 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-08 07:32:00,461 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:32:00,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:32:00,633 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 07:32:00,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:32:00,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309652385] [2025-03-08 07:32:00,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309652385] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 07:32:00,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [351306937] [2025-03-08 07:32:00,634 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:32:00,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 07:32:00,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 07:32:00,638 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-08 07:32:00,639 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-08 07:32:00,703 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-08 07:32:00,743 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-08 07:32:00,743 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:32:00,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:32:00,745 INFO L256 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 07:32:00,750 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 07:32:00,792 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 07:32:00,793 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 07:32:00,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [351306937] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:32:00,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 07:32:00,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2025-03-08 07:32:00,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786830790] [2025-03-08 07:32:00,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:32:00,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 07:32:00,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:32:00,796 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 07:32:00,796 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-03-08 07:32:00,796 INFO L87 Difference]: Start difference. First operand 785 states and 1129 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-08 07:32:00,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:32:00,843 INFO L93 Difference]: Finished difference Result 1287 states and 1806 transitions. [2025-03-08 07:32:00,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 07:32:00,844 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 63 [2025-03-08 07:32:00,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:32:00,851 INFO L225 Difference]: With dead ends: 1287 [2025-03-08 07:32:00,851 INFO L226 Difference]: Without dead ends: 904 [2025-03-08 07:32:00,852 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-03-08 07:32:00,852 INFO L435 NwaCegarLoop]: 574 mSDtfsCounter, 527 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 527 SdHoareTripleChecker+Valid, 648 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 07:32:00,852 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [527 Valid, 648 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:32:00,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 904 states. [2025-03-08 07:32:00,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 904 to 904. [2025-03-08 07:32:00,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 904 states, 797 states have (on average 1.4002509410288582) internal successors, (1116), 803 states have internal predecessors, (1116), 71 states have call successors, (71), 36 states have call predecessors, (71), 34 states have return successors, (89), 65 states have call predecessors, (89), 67 states have call successors, (89) [2025-03-08 07:32:00,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 904 states to 904 states and 1276 transitions. [2025-03-08 07:32:00,888 INFO L78 Accepts]: Start accepts. Automaton has 904 states and 1276 transitions. Word has length 63 [2025-03-08 07:32:00,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:32:00,888 INFO L471 AbstractCegarLoop]: Abstraction has 904 states and 1276 transitions. [2025-03-08 07:32:00,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-08 07:32:00,888 INFO L276 IsEmpty]: Start isEmpty. Operand 904 states and 1276 transitions. [2025-03-08 07:32:00,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-08 07:32:00,890 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:32:00,890 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 07:32:00,897 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-08 07:32:01,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 07:32:01,091 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:32:01,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:32:01,091 INFO L85 PathProgramCache]: Analyzing trace with hash -408667064, now seen corresponding path program 1 times [2025-03-08 07:32:01,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:32:01,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378414267] [2025-03-08 07:32:01,092 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:32:01,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:32:01,099 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-08 07:32:01,108 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-08 07:32:01,108 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:32:01,108 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:32:01,184 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 07:32:01,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:32:01,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378414267] [2025-03-08 07:32:01,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378414267] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 07:32:01,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1012767714] [2025-03-08 07:32:01,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:32:01,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 07:32:01,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 07:32:01,186 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 07:32:01,188 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 07:32:01,245 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-08 07:32:01,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-08 07:32:01,282 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:32:01,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:32:01,284 INFO L256 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-08 07:32:01,286 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 07:32:01,363 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:32:01,363 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 07:32:01,401 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-08 07:32:01,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1012767714] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-08 07:32:01,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-08 07:32:01,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 4] total 7 [2025-03-08 07:32:01,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561781981] [2025-03-08 07:32:01,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:32:01,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 07:32:01,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:32:01,402 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 07:32:01,402 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 07:32:01,402 INFO L87 Difference]: Start difference. First operand 904 states and 1276 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 07:32:01,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:32:01,555 INFO L93 Difference]: Finished difference Result 954 states and 1338 transitions. [2025-03-08 07:32:01,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 07:32:01,557 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 63 [2025-03-08 07:32:01,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:32:01,562 INFO L225 Difference]: With dead ends: 954 [2025-03-08 07:32:01,562 INFO L226 Difference]: Without dead ends: 951 [2025-03-08 07:32:01,562 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-08 07:32:01,562 INFO L435 NwaCegarLoop]: 593 mSDtfsCounter, 1035 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1035 SdHoareTripleChecker+Valid, 656 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 07:32:01,562 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1035 Valid, 656 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 07:32:01,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 951 states. [2025-03-08 07:32:01,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 951 to 903. [2025-03-08 07:32:01,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 903 states, 797 states have (on average 1.397741530740276) internal successors, (1114), 802 states have internal predecessors, (1114), 70 states have call successors, (70), 36 states have call predecessors, (70), 34 states have return successors, (89), 65 states have call predecessors, (89), 67 states have call successors, (89) [2025-03-08 07:32:01,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 903 states to 903 states and 1273 transitions. [2025-03-08 07:32:01,602 INFO L78 Accepts]: Start accepts. Automaton has 903 states and 1273 transitions. Word has length 63 [2025-03-08 07:32:01,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:32:01,602 INFO L471 AbstractCegarLoop]: Abstraction has 903 states and 1273 transitions. [2025-03-08 07:32:01,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 07:32:01,602 INFO L276 IsEmpty]: Start isEmpty. Operand 903 states and 1273 transitions. [2025-03-08 07:32:01,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-08 07:32:01,603 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:32:01,604 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 07:32:01,610 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 07:32:01,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-03-08 07:32:01,804 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:32:01,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:32:01,805 INFO L85 PathProgramCache]: Analyzing trace with hash 215738915, now seen corresponding path program 1 times [2025-03-08 07:32:01,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:32:01,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794617842] [2025-03-08 07:32:01,805 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:32:01,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:32:01,812 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-08 07:32:01,816 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-08 07:32:01,817 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:32:01,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:32:01,864 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 07:32:01,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:32:01,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794617842] [2025-03-08 07:32:01,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794617842] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 07:32:01,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [96453696] [2025-03-08 07:32:01,864 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:32:01,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 07:32:01,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 07:32:01,868 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 07:32:01,869 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 07:32:01,918 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-08 07:32:01,949 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-08 07:32:01,949 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:32:01,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:32:01,950 INFO L256 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-08 07:32:01,952 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 07:32:02,178 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:32:02,179 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 07:32:02,245 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-08 07:32:02,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [96453696] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 07:32:02,245 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 07:32:02,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 4] total 10 [2025-03-08 07:32:02,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888814581] [2025-03-08 07:32:02,245 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 07:32:02,245 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 07:32:02,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:32:02,246 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 07:32:02,246 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-03-08 07:32:02,246 INFO L87 Difference]: Start difference. First operand 903 states and 1273 transitions. Second operand has 10 states, 10 states have (on average 13.5) internal successors, (135), 10 states have internal predecessors, (135), 7 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2025-03-08 07:32:02,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:32:02,660 INFO L93 Difference]: Finished difference Result 2140 states and 2950 transitions. [2025-03-08 07:32:02,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-08 07:32:02,660 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 13.5) internal successors, (135), 10 states have internal predecessors, (135), 7 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) Word has length 64 [2025-03-08 07:32:02,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:32:02,668 INFO L225 Difference]: With dead ends: 2140 [2025-03-08 07:32:02,668 INFO L226 Difference]: Without dead ends: 1683 [2025-03-08 07:32:02,670 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=382, Unknown=0, NotChecked=0, Total=462 [2025-03-08 07:32:02,670 INFO L435 NwaCegarLoop]: 654 mSDtfsCounter, 1194 mSDsluCounter, 3741 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1194 SdHoareTripleChecker+Valid, 4395 SdHoareTripleChecker+Invalid, 351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 07:32:02,670 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1194 Valid, 4395 Invalid, 351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 295 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 07:32:02,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1683 states. [2025-03-08 07:32:02,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1683 to 1238. [2025-03-08 07:32:02,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1238 states, 1096 states have (on average 1.3585766423357664) internal successors, (1489), 1106 states have internal predecessors, (1489), 90 states have call successors, (90), 50 states have call predecessors, (90), 50 states have return successors, (120), 82 states have call predecessors, (120), 87 states have call successors, (120) [2025-03-08 07:32:02,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1238 states to 1238 states and 1699 transitions. [2025-03-08 07:32:02,746 INFO L78 Accepts]: Start accepts. Automaton has 1238 states and 1699 transitions. Word has length 64 [2025-03-08 07:32:02,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:32:02,746 INFO L471 AbstractCegarLoop]: Abstraction has 1238 states and 1699 transitions. [2025-03-08 07:32:02,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 13.5) internal successors, (135), 10 states have internal predecessors, (135), 7 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2025-03-08 07:32:02,747 INFO L276 IsEmpty]: Start isEmpty. Operand 1238 states and 1699 transitions. [2025-03-08 07:32:02,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-08 07:32:02,750 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:32:02,750 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-08 07:32:02,758 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-08 07:32:02,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 07:32:02,951 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:32:02,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:32:02,951 INFO L85 PathProgramCache]: Analyzing trace with hash -2060134261, now seen corresponding path program 1 times [2025-03-08 07:32:02,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:32:02,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903294615] [2025-03-08 07:32:02,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:32:02,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:32:02,958 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-08 07:32:02,965 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-08 07:32:02,965 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:32:02,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:32:03,025 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-03-08 07:32:03,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:32:03,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903294615] [2025-03-08 07:32:03,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903294615] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 07:32:03,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1380125279] [2025-03-08 07:32:03,025 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:32:03,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 07:32:03,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 07:32:03,028 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 07:32:03,029 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 07:32:03,084 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-08 07:32:03,115 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-08 07:32:03,115 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:32:03,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:32:03,117 INFO L256 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 07:32:03,118 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 07:32:03,157 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-08 07:32:03,157 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 07:32:03,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1380125279] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:32:03,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 07:32:03,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-08 07:32:03,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021120229] [2025-03-08 07:32:03,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:32:03,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 07:32:03,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:32:03,158 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 07:32:03,158 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:32:03,158 INFO L87 Difference]: Start difference. First operand 1238 states and 1699 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-08 07:32:03,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:32:03,205 INFO L93 Difference]: Finished difference Result 1838 states and 2494 transitions. [2025-03-08 07:32:03,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 07:32:03,205 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 82 [2025-03-08 07:32:03,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:32:03,210 INFO L225 Difference]: With dead ends: 1838 [2025-03-08 07:32:03,211 INFO L226 Difference]: Without dead ends: 1126 [2025-03-08 07:32:03,212 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 82 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-08 07:32:03,213 INFO L435 NwaCegarLoop]: 599 mSDtfsCounter, 532 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 532 SdHoareTripleChecker+Valid, 670 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 07:32:03,213 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [532 Valid, 670 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:32:03,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1126 states. [2025-03-08 07:32:03,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1126 to 1117. [2025-03-08 07:32:03,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1117 states, 989 states have (on average 1.3599595551061678) internal successors, (1345), 1000 states have internal predecessors, (1345), 82 states have call successors, (82), 44 states have call predecessors, (82), 44 states have return successors, (108), 73 states have call predecessors, (108), 79 states have call successors, (108) [2025-03-08 07:32:03,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1117 states to 1117 states and 1535 transitions. [2025-03-08 07:32:03,273 INFO L78 Accepts]: Start accepts. Automaton has 1117 states and 1535 transitions. Word has length 82 [2025-03-08 07:32:03,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:32:03,273 INFO L471 AbstractCegarLoop]: Abstraction has 1117 states and 1535 transitions. [2025-03-08 07:32:03,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-08 07:32:03,273 INFO L276 IsEmpty]: Start isEmpty. Operand 1117 states and 1535 transitions. [2025-03-08 07:32:03,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-08 07:32:03,275 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:32:03,275 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 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-08 07:32:03,286 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-08 07:32:03,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 07:32:03,480 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:32:03,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:32:03,480 INFO L85 PathProgramCache]: Analyzing trace with hash 335402875, now seen corresponding path program 1 times [2025-03-08 07:32:03,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:32:03,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771001693] [2025-03-08 07:32:03,481 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:32:03,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:32:03,486 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-08 07:32:03,493 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-08 07:32:03,493 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:32:03,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:32:03,547 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2025-03-08 07:32:03,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:32:03,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771001693] [2025-03-08 07:32:03,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771001693] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 07:32:03,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [908878784] [2025-03-08 07:32:03,547 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:32:03,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 07:32:03,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 07:32:03,550 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 07:32:03,551 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-08 07:32:03,608 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-08 07:32:03,650 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-08 07:32:03,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:32:03,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:32:03,652 INFO L256 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 07:32:03,654 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 07:32:03,673 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-08 07:32:03,674 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 07:32:03,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [908878784] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:32:03,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 07:32:03,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-08 07:32:03,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358535943] [2025-03-08 07:32:03,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:32:03,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 07:32:03,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:32:03,675 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 07:32:03,676 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:32:03,676 INFO L87 Difference]: Start difference. First operand 1117 states and 1535 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-08 07:32:03,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:32:03,720 INFO L93 Difference]: Finished difference Result 1466 states and 1976 transitions. [2025-03-08 07:32:03,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 07:32:03,720 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) Word has length 96 [2025-03-08 07:32:03,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:32:03,723 INFO L225 Difference]: With dead ends: 1466 [2025-03-08 07:32:03,723 INFO L226 Difference]: Without dead ends: 308 [2025-03-08 07:32:03,725 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 96 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-08 07:32:03,728 INFO L435 NwaCegarLoop]: 613 mSDtfsCounter, 60 mSDsluCounter, 546 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 1159 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 07:32:03,728 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 1159 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:32:03,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2025-03-08 07:32:03,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 308. [2025-03-08 07:32:03,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 276 states have (on average 1.576086956521739) internal successors, (435), 278 states have internal predecessors, (435), 25 states have call successors, (25), 7 states have call predecessors, (25), 6 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-08 07:32:03,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 483 transitions. [2025-03-08 07:32:03,739 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 483 transitions. Word has length 96 [2025-03-08 07:32:03,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:32:03,739 INFO L471 AbstractCegarLoop]: Abstraction has 308 states and 483 transitions. [2025-03-08 07:32:03,740 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-08 07:32:03,740 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 483 transitions. [2025-03-08 07:32:03,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-08 07:32:03,741 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:32:03,741 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, 1, 1, 1, 1, 1, 1, 1, 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-08 07:32:03,749 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-08 07:32:03,941 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 07:32:03,942 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:32:03,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:32:03,943 INFO L85 PathProgramCache]: Analyzing trace with hash -796600532, now seen corresponding path program 1 times [2025-03-08 07:32:03,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:32:03,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982693732] [2025-03-08 07:32:03,943 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:32:03,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:32:03,952 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-08 07:32:03,955 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-08 07:32:03,955 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:32:03,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:32:04,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-08 07:32:04,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:32:04,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982693732] [2025-03-08 07:32:04,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982693732] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:32:04,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:32:04,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 07:32:04,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998959077] [2025-03-08 07:32:04,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:32:04,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 07:32:04,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:32:04,002 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 07:32:04,002 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:32:04,003 INFO L87 Difference]: Start difference. First operand 308 states and 483 transitions. Second operand has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:32:04,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:32:04,029 INFO L93 Difference]: Finished difference Result 606 states and 951 transitions. [2025-03-08 07:32:04,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 07:32:04,031 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 144 [2025-03-08 07:32:04,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:32:04,033 INFO L225 Difference]: With dead ends: 606 [2025-03-08 07:32:04,033 INFO L226 Difference]: Without dead ends: 308 [2025-03-08 07:32:04,034 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-08 07:32:04,034 INFO L435 NwaCegarLoop]: 481 mSDtfsCounter, 473 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 473 SdHoareTripleChecker+Valid, 482 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-08 07:32:04,034 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [473 Valid, 482 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:32:04,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2025-03-08 07:32:04,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 308. [2025-03-08 07:32:04,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 276 states have (on average 1.5724637681159421) internal successors, (434), 278 states have internal predecessors, (434), 25 states have call successors, (25), 7 states have call predecessors, (25), 6 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-08 07:32:04,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 482 transitions. [2025-03-08 07:32:04,045 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 482 transitions. Word has length 144 [2025-03-08 07:32:04,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:32:04,045 INFO L471 AbstractCegarLoop]: Abstraction has 308 states and 482 transitions. [2025-03-08 07:32:04,045 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:32:04,045 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 482 transitions. [2025-03-08 07:32:04,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-08 07:32:04,046 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:32:04,046 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, 1, 1, 1, 1, 1, 1, 1, 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-08 07:32:04,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 07:32:04,046 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:32:04,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:32:04,046 INFO L85 PathProgramCache]: Analyzing trace with hash -978333781, now seen corresponding path program 1 times [2025-03-08 07:32:04,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:32:04,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123698493] [2025-03-08 07:32:04,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:32:04,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:32:04,054 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-08 07:32:04,057 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-08 07:32:04,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:32:04,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:32:04,150 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-08 07:32:04,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:32:04,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123698493] [2025-03-08 07:32:04,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123698493] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:32:04,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:32:04,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 07:32:04,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014969707] [2025-03-08 07:32:04,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:32:04,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 07:32:04,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:32:04,151 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 07:32:04,151 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 07:32:04,151 INFO L87 Difference]: Start difference. First operand 308 states and 482 transitions. Second operand has 5 states, 5 states have (on average 26.6) internal successors, (133), 4 states have internal predecessors, (133), 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-08 07:32:04,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:32:04,568 INFO L93 Difference]: Finished difference Result 924 states and 1462 transitions. [2025-03-08 07:32:04,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 07:32:04,569 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.6) internal successors, (133), 4 states have internal predecessors, (133), 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 144 [2025-03-08 07:32:04,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:32:04,572 INFO L225 Difference]: With dead ends: 924 [2025-03-08 07:32:04,572 INFO L226 Difference]: Without dead ends: 634 [2025-03-08 07:32:04,572 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-08 07:32:04,573 INFO L435 NwaCegarLoop]: 375 mSDtfsCounter, 908 mSDsluCounter, 951 mSDsCounter, 0 mSdLazyCounter, 514 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 925 SdHoareTripleChecker+Valid, 1326 SdHoareTripleChecker+Invalid, 568 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 514 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 07:32:04,573 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [925 Valid, 1326 Invalid, 568 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 514 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 07:32:04,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2025-03-08 07:32:04,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 609. [2025-03-08 07:32:04,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 609 states, 552 states have (on average 1.585144927536232) internal successors, (875), 555 states have internal predecessors, (875), 43 states have call successors, (43), 13 states have call predecessors, (43), 13 states have return successors, (42), 41 states have call predecessors, (42), 41 states have call successors, (42) [2025-03-08 07:32:04,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 609 states to 609 states and 960 transitions. [2025-03-08 07:32:04,593 INFO L78 Accepts]: Start accepts. Automaton has 609 states and 960 transitions. Word has length 144 [2025-03-08 07:32:04,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:32:04,593 INFO L471 AbstractCegarLoop]: Abstraction has 609 states and 960 transitions. [2025-03-08 07:32:04,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.6) internal successors, (133), 4 states have internal predecessors, (133), 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-08 07:32:04,593 INFO L276 IsEmpty]: Start isEmpty. Operand 609 states and 960 transitions. [2025-03-08 07:32:04,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-08 07:32:04,594 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:32:04,594 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, 1, 1, 1, 1, 1, 1, 1, 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-08 07:32:04,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 07:32:04,594 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:32:04,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:32:04,595 INFO L85 PathProgramCache]: Analyzing trace with hash 1127989161, now seen corresponding path program 1 times [2025-03-08 07:32:04,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:32:04,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233243383] [2025-03-08 07:32:04,595 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:32:04,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:32:04,603 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-08 07:32:04,605 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-08 07:32:04,605 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:32:04,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:32:04,705 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-08 07:32:04,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:32:04,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233243383] [2025-03-08 07:32:04,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233243383] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:32:04,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:32:04,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:32:04,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348100429] [2025-03-08 07:32:04,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:32:04,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:32:04,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:32:04,706 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:32:04,706 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:32:04,706 INFO L87 Difference]: Start difference. First operand 609 states and 960 transitions. Second operand has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 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-08 07:32:05,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:32:05,273 INFO L93 Difference]: Finished difference Result 1585 states and 2527 transitions. [2025-03-08 07:32:05,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 07:32:05,273 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 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 144 [2025-03-08 07:32:05,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:32:05,277 INFO L225 Difference]: With dead ends: 1585 [2025-03-08 07:32:05,277 INFO L226 Difference]: Without dead ends: 994 [2025-03-08 07:32:05,279 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-08 07:32:05,279 INFO L435 NwaCegarLoop]: 632 mSDtfsCounter, 911 mSDsluCounter, 1922 mSDsCounter, 0 mSdLazyCounter, 899 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 928 SdHoareTripleChecker+Valid, 2554 SdHoareTripleChecker+Invalid, 930 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 899 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 07:32:05,279 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [928 Valid, 2554 Invalid, 930 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 899 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 07:32:05,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 994 states. [2025-03-08 07:32:05,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 994 to 889. [2025-03-08 07:32:05,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 889 states, 807 states have (on average 1.5786864931846345) internal successors, (1274), 811 states have internal predecessors, (1274), 61 states have call successors, (61), 19 states have call predecessors, (61), 20 states have return successors, (63), 60 states have call predecessors, (63), 59 states have call successors, (63) [2025-03-08 07:32:05,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 889 states to 889 states and 1398 transitions. [2025-03-08 07:32:05,312 INFO L78 Accepts]: Start accepts. Automaton has 889 states and 1398 transitions. Word has length 144 [2025-03-08 07:32:05,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:32:05,313 INFO L471 AbstractCegarLoop]: Abstraction has 889 states and 1398 transitions. [2025-03-08 07:32:05,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 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-08 07:32:05,313 INFO L276 IsEmpty]: Start isEmpty. Operand 889 states and 1398 transitions. [2025-03-08 07:32:05,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-08 07:32:05,314 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:32:05,315 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, 1, 1, 1, 1, 1, 1, 1, 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-08 07:32:05,315 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 07:32:05,315 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:32:05,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:32:05,315 INFO L85 PathProgramCache]: Analyzing trace with hash 1558905962, now seen corresponding path program 1 times [2025-03-08 07:32:05,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:32:05,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592083607] [2025-03-08 07:32:05,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:32:05,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:32:05,323 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-08 07:32:05,325 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-08 07:32:05,329 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:32:05,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:32:05,440 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-08 07:32:05,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:32:05,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592083607] [2025-03-08 07:32:05,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592083607] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:32:05,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:32:05,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:32:05,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236655172] [2025-03-08 07:32:05,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:32:05,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:32:05,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:32:05,442 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:32:05,442 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:32:05,442 INFO L87 Difference]: Start difference. First operand 889 states and 1398 transitions. Second operand has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 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-08 07:32:05,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:32:05,998 INFO L93 Difference]: Finished difference Result 2477 states and 3944 transitions. [2025-03-08 07:32:05,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 07:32:05,998 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 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 144 [2025-03-08 07:32:05,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:32:06,004 INFO L225 Difference]: With dead ends: 2477 [2025-03-08 07:32:06,004 INFO L226 Difference]: Without dead ends: 1606 [2025-03-08 07:32:06,006 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-08 07:32:06,007 INFO L435 NwaCegarLoop]: 628 mSDtfsCounter, 906 mSDsluCounter, 1910 mSDsCounter, 0 mSdLazyCounter, 899 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 923 SdHoareTripleChecker+Valid, 2538 SdHoareTripleChecker+Invalid, 930 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 899 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 07:32:06,007 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [923 Valid, 2538 Invalid, 930 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 899 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 07:32:06,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1606 states. [2025-03-08 07:32:06,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1606 to 1486. [2025-03-08 07:32:06,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1486 states, 1352 states have (on average 1.5821005917159763) internal successors, (2139), 1360 states have internal predecessors, (2139), 97 states have call successors, (97), 31 states have call predecessors, (97), 36 states have return successors, (111), 98 states have call predecessors, (111), 95 states have call successors, (111) [2025-03-08 07:32:06,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1486 states to 1486 states and 2347 transitions. [2025-03-08 07:32:06,074 INFO L78 Accepts]: Start accepts. Automaton has 1486 states and 2347 transitions. Word has length 144 [2025-03-08 07:32:06,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:32:06,074 INFO L471 AbstractCegarLoop]: Abstraction has 1486 states and 2347 transitions. [2025-03-08 07:32:06,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 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-08 07:32:06,074 INFO L276 IsEmpty]: Start isEmpty. Operand 1486 states and 2347 transitions. [2025-03-08 07:32:06,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-08 07:32:06,075 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:32:06,075 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, 1, 1, 1, 1, 1, 1, 1, 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-08 07:32:06,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 07:32:06,075 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:32:06,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:32:06,076 INFO L85 PathProgramCache]: Analyzing trace with hash -1613782135, now seen corresponding path program 1 times [2025-03-08 07:32:06,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:32:06,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391957315] [2025-03-08 07:32:06,076 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:32:06,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:32:06,083 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-08 07:32:06,085 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-08 07:32:06,085 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:32:06,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:32:06,185 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-08 07:32:06,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:32:06,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391957315] [2025-03-08 07:32:06,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391957315] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:32:06,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:32:06,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:32:06,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400622809] [2025-03-08 07:32:06,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:32:06,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:32:06,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:32:06,186 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:32:06,186 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:32:06,186 INFO L87 Difference]: Start difference. First operand 1486 states and 2347 transitions. Second operand has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 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-08 07:32:06,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:32:06,801 INFO L93 Difference]: Finished difference Result 4404 states and 7067 transitions. [2025-03-08 07:32:06,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 07:32:06,802 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 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 144 [2025-03-08 07:32:06,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:32:06,814 INFO L225 Difference]: With dead ends: 4404 [2025-03-08 07:32:06,814 INFO L226 Difference]: Without dead ends: 2936 [2025-03-08 07:32:06,818 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-08 07:32:06,819 INFO L435 NwaCegarLoop]: 625 mSDtfsCounter, 901 mSDsluCounter, 1901 mSDsCounter, 0 mSdLazyCounter, 899 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 918 SdHoareTripleChecker+Valid, 2526 SdHoareTripleChecker+Invalid, 930 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 899 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 07:32:06,819 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [918 Valid, 2526 Invalid, 930 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 899 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 07:32:06,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2936 states. [2025-03-08 07:32:06,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2936 to 2785. [2025-03-08 07:32:06,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2785 states, 2541 states have (on average 1.5974025974025974) internal successors, (4059), 2563 states have internal predecessors, (4059), 169 states have call successors, (169), 55 states have call predecessors, (169), 74 states have return successors, (231), 174 states have call predecessors, (231), 167 states have call successors, (231) [2025-03-08 07:32:06,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2785 states to 2785 states and 4459 transitions. [2025-03-08 07:32:06,916 INFO L78 Accepts]: Start accepts. Automaton has 2785 states and 4459 transitions. Word has length 144 [2025-03-08 07:32:06,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:32:06,916 INFO L471 AbstractCegarLoop]: Abstraction has 2785 states and 4459 transitions. [2025-03-08 07:32:06,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 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-08 07:32:06,916 INFO L276 IsEmpty]: Start isEmpty. Operand 2785 states and 4459 transitions. [2025-03-08 07:32:06,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-08 07:32:06,919 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:32:06,919 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, 1, 1, 1, 1, 1, 1, 1, 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-08 07:32:06,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 07:32:06,919 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:32:06,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:32:06,919 INFO L85 PathProgramCache]: Analyzing trace with hash 777725066, now seen corresponding path program 1 times [2025-03-08 07:32:06,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:32:06,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882652571] [2025-03-08 07:32:06,920 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:32:06,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:32:06,929 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-08 07:32:06,931 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-08 07:32:06,932 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:32:06,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:32:07,053 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-08 07:32:07,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:32:07,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882652571] [2025-03-08 07:32:07,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882652571] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:32:07,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:32:07,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:32:07,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779672952] [2025-03-08 07:32:07,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:32:07,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:32:07,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:32:07,055 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:32:07,055 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:32:07,055 INFO L87 Difference]: Start difference. First operand 2785 states and 4459 transitions. Second operand has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 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-08 07:32:07,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:32:07,766 INFO L93 Difference]: Finished difference Result 8659 states and 14157 transitions. [2025-03-08 07:32:07,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 07:32:07,766 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 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 144 [2025-03-08 07:32:07,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:32:07,790 INFO L225 Difference]: With dead ends: 8659 [2025-03-08 07:32:07,790 INFO L226 Difference]: Without dead ends: 5892 [2025-03-08 07:32:07,799 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-08 07:32:07,799 INFO L435 NwaCegarLoop]: 622 mSDtfsCounter, 896 mSDsluCounter, 1892 mSDsCounter, 0 mSdLazyCounter, 899 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 913 SdHoareTripleChecker+Valid, 2514 SdHoareTripleChecker+Invalid, 930 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 899 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 07:32:07,799 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [913 Valid, 2514 Invalid, 930 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 899 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 07:32:07,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5892 states. [2025-03-08 07:32:07,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5892 to 5680. [2025-03-08 07:32:08,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5680 states, 5198 states have (on average 1.6227395151981532) internal successors, (8435), 5266 states have internal predecessors, (8435), 313 states have call successors, (313), 103 states have call predecessors, (313), 168 states have return successors, (567), 326 states have call predecessors, (567), 311 states have call successors, (567) [2025-03-08 07:32:08,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5680 states to 5680 states and 9315 transitions. [2025-03-08 07:32:08,018 INFO L78 Accepts]: Start accepts. Automaton has 5680 states and 9315 transitions. Word has length 144 [2025-03-08 07:32:08,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:32:08,018 INFO L471 AbstractCegarLoop]: Abstraction has 5680 states and 9315 transitions. [2025-03-08 07:32:08,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 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-08 07:32:08,018 INFO L276 IsEmpty]: Start isEmpty. Operand 5680 states and 9315 transitions. [2025-03-08 07:32:08,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-08 07:32:08,021 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:32:08,021 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, 1, 1, 1, 1, 1, 1, 1, 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-08 07:32:08,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 07:32:08,021 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:32:08,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:32:08,022 INFO L85 PathProgramCache]: Analyzing trace with hash -1916076183, now seen corresponding path program 1 times [2025-03-08 07:32:08,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:32:08,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036560839] [2025-03-08 07:32:08,022 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:32:08,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:32:08,029 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-08 07:32:08,032 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-08 07:32:08,032 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:32:08,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:32:08,157 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-08 07:32:08,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:32:08,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036560839] [2025-03-08 07:32:08,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036560839] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:32:08,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:32:08,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 07:32:08,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021382577] [2025-03-08 07:32:08,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:32:08,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 07:32:08,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:32:08,162 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 07:32:08,163 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 07:32:08,163 INFO L87 Difference]: Start difference. First operand 5680 states and 9315 transitions. Second operand has 5 states, 5 states have (on average 26.6) internal successors, (133), 5 states have internal predecessors, (133), 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-08 07:32:08,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:32:08,675 INFO L93 Difference]: Finished difference Result 12670 states and 21300 transitions. [2025-03-08 07:32:08,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 07:32:08,676 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.6) internal successors, (133), 5 states have internal predecessors, (133), 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 144 [2025-03-08 07:32:08,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:32:08,706 INFO L225 Difference]: With dead ends: 12670 [2025-03-08 07:32:08,706 INFO L226 Difference]: Without dead ends: 7008 [2025-03-08 07:32:08,716 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-08 07:32:08,717 INFO L435 NwaCegarLoop]: 356 mSDtfsCounter, 643 mSDsluCounter, 583 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 660 SdHoareTripleChecker+Valid, 939 SdHoareTripleChecker+Invalid, 396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 07:32:08,717 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [660 Valid, 939 Invalid, 396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 364 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 07:32:08,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7008 states. [2025-03-08 07:32:08,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7008 to 5680. [2025-03-08 07:32:08,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5680 states, 5198 states have (on average 1.6194690265486726) internal successors, (8418), 5266 states have internal predecessors, (8418), 313 states have call successors, (313), 103 states have call predecessors, (313), 168 states have return successors, (567), 326 states have call predecessors, (567), 311 states have call successors, (567) [2025-03-08 07:32:08,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5680 states to 5680 states and 9298 transitions. [2025-03-08 07:32:08,984 INFO L78 Accepts]: Start accepts. Automaton has 5680 states and 9298 transitions. Word has length 144 [2025-03-08 07:32:08,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:32:08,984 INFO L471 AbstractCegarLoop]: Abstraction has 5680 states and 9298 transitions. [2025-03-08 07:32:08,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.6) internal successors, (133), 5 states have internal predecessors, (133), 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-08 07:32:08,985 INFO L276 IsEmpty]: Start isEmpty. Operand 5680 states and 9298 transitions. [2025-03-08 07:32:08,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-08 07:32:08,987 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:32:08,987 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, 1, 1, 1, 1, 1, 1, 1, 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-08 07:32:08,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 07:32:08,987 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:32:08,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:32:08,988 INFO L85 PathProgramCache]: Analyzing trace with hash 1737804970, now seen corresponding path program 1 times [2025-03-08 07:32:08,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:32:08,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529688560] [2025-03-08 07:32:08,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:32:08,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:32:08,997 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-08 07:32:09,001 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-08 07:32:09,002 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:32:09,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:32:09,075 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-08 07:32:09,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:32:09,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529688560] [2025-03-08 07:32:09,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529688560] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:32:09,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:32:09,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 07:32:09,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607347424] [2025-03-08 07:32:09,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:32:09,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 07:32:09,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:32:09,077 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 07:32:09,077 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 07:32:09,077 INFO L87 Difference]: Start difference. First operand 5680 states and 9298 transitions. Second operand has 5 states, 5 states have (on average 26.6) internal successors, (133), 5 states have internal predecessors, (133), 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-08 07:32:09,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:32:09,494 INFO L93 Difference]: Finished difference Result 12504 states and 20934 transitions. [2025-03-08 07:32:09,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 07:32:09,495 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.6) internal successors, (133), 5 states have internal predecessors, (133), 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 144 [2025-03-08 07:32:09,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:32:09,521 INFO L225 Difference]: With dead ends: 12504 [2025-03-08 07:32:09,522 INFO L226 Difference]: Without dead ends: 6842 [2025-03-08 07:32:09,536 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-08 07:32:09,536 INFO L435 NwaCegarLoop]: 351 mSDtfsCounter, 639 mSDsluCounter, 574 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 656 SdHoareTripleChecker+Valid, 925 SdHoareTripleChecker+Invalid, 396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 07:32:09,537 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [656 Valid, 925 Invalid, 396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 364 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 07:32:09,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6842 states. [2025-03-08 07:32:09,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6842 to 5680. [2025-03-08 07:32:09,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5680 states, 5198 states have (on average 1.616198537899192) internal successors, (8401), 5266 states have internal predecessors, (8401), 313 states have call successors, (313), 103 states have call predecessors, (313), 168 states have return successors, (567), 326 states have call predecessors, (567), 311 states have call successors, (567) [2025-03-08 07:32:09,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5680 states to 5680 states and 9281 transitions. [2025-03-08 07:32:09,821 INFO L78 Accepts]: Start accepts. Automaton has 5680 states and 9281 transitions. Word has length 144 [2025-03-08 07:32:09,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:32:09,822 INFO L471 AbstractCegarLoop]: Abstraction has 5680 states and 9281 transitions. [2025-03-08 07:32:09,822 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.6) internal successors, (133), 5 states have internal predecessors, (133), 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-08 07:32:09,822 INFO L276 IsEmpty]: Start isEmpty. Operand 5680 states and 9281 transitions. [2025-03-08 07:32:09,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-08 07:32:09,826 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:32:09,827 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, 1, 1, 1, 1, 1, 1, 1, 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-08 07:32:09,827 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 07:32:09,827 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:32:09,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:32:09,827 INFO L85 PathProgramCache]: Analyzing trace with hash -1270680021, now seen corresponding path program 1 times [2025-03-08 07:32:09,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:32:09,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756634564] [2025-03-08 07:32:09,828 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:32:09,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:32:09,837 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-08 07:32:09,842 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-08 07:32:09,843 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:32:09,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:32:09,947 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-08 07:32:09,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:32:09,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756634564] [2025-03-08 07:32:09,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756634564] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:32:09,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:32:09,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:32:09,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529281714] [2025-03-08 07:32:09,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:32:09,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:32:09,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:32:09,949 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:32:09,949 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:32:09,949 INFO L87 Difference]: Start difference. First operand 5680 states and 9281 transitions. Second operand has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 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-08 07:32:10,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:32:10,949 INFO L93 Difference]: Finished difference Result 17998 states and 30145 transitions. [2025-03-08 07:32:10,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 07:32:10,954 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 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 144 [2025-03-08 07:32:10,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:32:11,002 INFO L225 Difference]: With dead ends: 17998 [2025-03-08 07:32:11,002 INFO L226 Difference]: Without dead ends: 12336 [2025-03-08 07:32:11,017 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-08 07:32:11,017 INFO L435 NwaCegarLoop]: 605 mSDtfsCounter, 872 mSDsluCounter, 1845 mSDsCounter, 0 mSdLazyCounter, 899 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 889 SdHoareTripleChecker+Valid, 2450 SdHoareTripleChecker+Invalid, 930 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 899 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 07:32:11,018 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [889 Valid, 2450 Invalid, 930 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 899 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 07:32:11,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12336 states. [2025-03-08 07:32:11,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12336 to 12064. [2025-03-08 07:32:11,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12064 states, 11052 states have (on average 1.6412414042707202) internal successors, (18139), 11266 states have internal predecessors, (18139), 601 states have call successors, (601), 199 states have call predecessors, (601), 410 states have return successors, (1623), 630 states have call predecessors, (1623), 599 states have call successors, (1623) [2025-03-08 07:32:11,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12064 states to 12064 states and 20363 transitions. [2025-03-08 07:32:11,538 INFO L78 Accepts]: Start accepts. Automaton has 12064 states and 20363 transitions. Word has length 144 [2025-03-08 07:32:11,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:32:11,539 INFO L471 AbstractCegarLoop]: Abstraction has 12064 states and 20363 transitions. [2025-03-08 07:32:11,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 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-08 07:32:11,539 INFO L276 IsEmpty]: Start isEmpty. Operand 12064 states and 20363 transitions. [2025-03-08 07:32:11,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-08 07:32:11,544 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:32:11,544 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, 1, 1, 1, 1, 1, 1, 1, 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-08 07:32:11,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 07:32:11,544 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:32:11,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:32:11,545 INFO L85 PathProgramCache]: Analyzing trace with hash 710482058, now seen corresponding path program 1 times [2025-03-08 07:32:11,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:32:11,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223107083] [2025-03-08 07:32:11,545 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:32:11,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:32:11,556 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-08 07:32:11,560 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-08 07:32:11,560 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:32:11,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:32:11,629 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-08 07:32:11,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:32:11,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223107083] [2025-03-08 07:32:11,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223107083] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:32:11,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:32:11,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 07:32:11,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866260458] [2025-03-08 07:32:11,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:32:11,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 07:32:11,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:32:11,630 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 07:32:11,630 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 07:32:11,630 INFO L87 Difference]: Start difference. First operand 12064 states and 20363 transitions. Second operand has 5 states, 5 states have (on average 26.6) internal successors, (133), 5 states have internal predecessors, (133), 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-08 07:32:12,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:32:12,244 INFO L93 Difference]: Finished difference Result 27050 states and 46934 transitions. [2025-03-08 07:32:12,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 07:32:12,245 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.6) internal successors, (133), 5 states have internal predecessors, (133), 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 144 [2025-03-08 07:32:12,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:32:12,294 INFO L225 Difference]: With dead ends: 27050 [2025-03-08 07:32:12,294 INFO L226 Difference]: Without dead ends: 15004 [2025-03-08 07:32:12,324 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-08 07:32:12,325 INFO L435 NwaCegarLoop]: 346 mSDtfsCounter, 635 mSDsluCounter, 565 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 652 SdHoareTripleChecker+Valid, 911 SdHoareTripleChecker+Invalid, 396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 07:32:12,325 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [652 Valid, 911 Invalid, 396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 364 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 07:32:12,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15004 states. [2025-03-08 07:32:13,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15004 to 12064. [2025-03-08 07:32:13,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12064 states, 11052 states have (on average 1.6382555193630113) internal successors, (18106), 11266 states have internal predecessors, (18106), 601 states have call successors, (601), 199 states have call predecessors, (601), 410 states have return successors, (1623), 630 states have call predecessors, (1623), 599 states have call successors, (1623) [2025-03-08 07:32:13,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12064 states to 12064 states and 20330 transitions. [2025-03-08 07:32:13,166 INFO L78 Accepts]: Start accepts. Automaton has 12064 states and 20330 transitions. Word has length 144 [2025-03-08 07:32:13,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:32:13,166 INFO L471 AbstractCegarLoop]: Abstraction has 12064 states and 20330 transitions. [2025-03-08 07:32:13,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.6) internal successors, (133), 5 states have internal predecessors, (133), 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-08 07:32:13,167 INFO L276 IsEmpty]: Start isEmpty. Operand 12064 states and 20330 transitions. [2025-03-08 07:32:13,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-08 07:32:13,173 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:32:13,173 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, 1, 1, 1, 1, 1, 1, 1, 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-08 07:32:13,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 07:32:13,174 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:32:13,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:32:13,174 INFO L85 PathProgramCache]: Analyzing trace with hash -472535477, now seen corresponding path program 1 times [2025-03-08 07:32:13,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:32:13,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835547847] [2025-03-08 07:32:13,174 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:32:13,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:32:13,184 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-08 07:32:13,188 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-08 07:32:13,188 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:32:13,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:32:13,292 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-08 07:32:13,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:32:13,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835547847] [2025-03-08 07:32:13,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835547847] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:32:13,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:32:13,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:32:13,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291293641] [2025-03-08 07:32:13,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:32:13,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:32:13,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:32:13,295 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:32:13,295 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:32:13,295 INFO L87 Difference]: Start difference. First operand 12064 states and 20330 transitions. Second operand has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 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-08 07:32:14,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:32:14,582 INFO L93 Difference]: Finished difference Result 41084 states and 71171 transitions. [2025-03-08 07:32:14,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 07:32:14,583 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 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 144 [2025-03-08 07:32:14,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:32:14,661 INFO L225 Difference]: With dead ends: 41084 [2025-03-08 07:32:14,661 INFO L226 Difference]: Without dead ends: 29038 [2025-03-08 07:32:14,685 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-08 07:32:14,686 INFO L435 NwaCegarLoop]: 595 mSDtfsCounter, 1143 mSDsluCounter, 1811 mSDsCounter, 0 mSdLazyCounter, 902 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1170 SdHoareTripleChecker+Valid, 2406 SdHoareTripleChecker+Invalid, 936 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 902 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 07:32:14,688 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1170 Valid, 2406 Invalid, 936 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 902 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 07:32:14,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29038 states. [2025-03-08 07:32:15,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29038 to 26356. [2025-03-08 07:32:15,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26356 states, 24154 states have (on average 1.6653142336673015) internal successors, (40224), 24822 states have internal predecessors, (40224), 1145 states have call successors, (1145), 391 states have call predecessors, (1145), 1056 states have return successors, (5239), 1206 states have call predecessors, (5239), 1143 states have call successors, (5239) [2025-03-08 07:32:15,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26356 states to 26356 states and 46608 transitions. [2025-03-08 07:32:15,717 INFO L78 Accepts]: Start accepts. Automaton has 26356 states and 46608 transitions. Word has length 144 [2025-03-08 07:32:15,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:32:15,717 INFO L471 AbstractCegarLoop]: Abstraction has 26356 states and 46608 transitions. [2025-03-08 07:32:15,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 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-08 07:32:15,717 INFO L276 IsEmpty]: Start isEmpty. Operand 26356 states and 46608 transitions. [2025-03-08 07:32:15,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-08 07:32:15,727 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:32:15,727 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, 1, 1, 1, 1, 1, 1, 1, 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-08 07:32:15,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-08 07:32:15,727 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:32:15,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:32:15,728 INFO L85 PathProgramCache]: Analyzing trace with hash -1619075990, now seen corresponding path program 1 times [2025-03-08 07:32:15,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:32:15,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679750238] [2025-03-08 07:32:15,728 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:32:15,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:32:15,738 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-08 07:32:15,742 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-08 07:32:15,742 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:32:15,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:32:15,817 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-08 07:32:15,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:32:15,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679750238] [2025-03-08 07:32:15,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679750238] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:32:15,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:32:15,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:32:15,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963079763] [2025-03-08 07:32:15,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:32:15,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:32:15,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:32:15,819 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:32:15,819 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:32:15,819 INFO L87 Difference]: Start difference. First operand 26356 states and 46608 transitions. Second operand has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 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-08 07:32:18,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:32:18,708 INFO L93 Difference]: Finished difference Result 90526 states and 167055 transitions. [2025-03-08 07:32:18,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 07:32:18,709 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 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 144 [2025-03-08 07:32:18,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:32:18,965 INFO L225 Difference]: With dead ends: 90526 [2025-03-08 07:32:18,965 INFO L226 Difference]: Without dead ends: 64188 [2025-03-08 07:32:19,051 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-08 07:32:19,052 INFO L435 NwaCegarLoop]: 591 mSDtfsCounter, 1107 mSDsluCounter, 1799 mSDsCounter, 0 mSdLazyCounter, 902 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1134 SdHoareTripleChecker+Valid, 2390 SdHoareTripleChecker+Invalid, 936 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 902 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 07:32:19,052 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1134 Valid, 2390 Invalid, 936 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 902 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 07:32:19,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64188 states. [2025-03-08 07:32:21,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64188 to 58885. [2025-03-08 07:32:21,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58885 states, 53849 states have (on average 1.6908763393934891) internal successors, (91052), 55911 states have internal predecessors, (91052), 2201 states have call successors, (2201), 775 states have call predecessors, (2201), 2834 states have return successors, (18583), 2326 states have call predecessors, (18583), 2199 states have call successors, (18583) [2025-03-08 07:32:21,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58885 states to 58885 states and 111836 transitions. [2025-03-08 07:32:21,868 INFO L78 Accepts]: Start accepts. Automaton has 58885 states and 111836 transitions. Word has length 144 [2025-03-08 07:32:21,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:32:21,868 INFO L471 AbstractCegarLoop]: Abstraction has 58885 states and 111836 transitions. [2025-03-08 07:32:21,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 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-08 07:32:21,869 INFO L276 IsEmpty]: Start isEmpty. Operand 58885 states and 111836 transitions. [2025-03-08 07:32:21,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-08 07:32:21,884 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:32:21,884 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, 1, 1, 1, 1, 1, 1, 1, 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-08 07:32:21,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-08 07:32:21,884 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:32:21,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:32:21,885 INFO L85 PathProgramCache]: Analyzing trace with hash 1391980139, now seen corresponding path program 1 times [2025-03-08 07:32:21,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:32:21,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496414030] [2025-03-08 07:32:21,885 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:32:21,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:32:21,894 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-08 07:32:21,897 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-08 07:32:21,898 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:32:21,898 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:32:21,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:32:21,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:32:21,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496414030] [2025-03-08 07:32:21,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496414030] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:32:21,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:32:21,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:32:21,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703831987] [2025-03-08 07:32:21,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:32:21,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:32:21,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:32:21,976 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:32:21,976 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:32:21,976 INFO L87 Difference]: Start difference. First operand 58885 states and 111836 transitions. Second operand has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 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-08 07:32:28,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:32:28,419 INFO L93 Difference]: Finished difference Result 204087 states and 413385 transitions. [2025-03-08 07:32:28,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 07:32:28,422 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 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 144 [2025-03-08 07:32:28,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:32:29,145 INFO L225 Difference]: With dead ends: 204087 [2025-03-08 07:32:29,145 INFO L226 Difference]: Without dead ends: 145220 [2025-03-08 07:32:29,385 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-08 07:32:29,386 INFO L435 NwaCegarLoop]: 589 mSDtfsCounter, 922 mSDsluCounter, 1793 mSDsCounter, 0 mSdLazyCounter, 1100 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 938 SdHoareTripleChecker+Valid, 2382 SdHoareTripleChecker+Invalid, 1133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 07:32:29,386 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [938 Valid, 2382 Invalid, 1133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1100 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 07:32:29,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145220 states. [2025-03-08 07:32:36,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145220 to 136720. [2025-03-08 07:32:37,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136720 states, 124622 states have (on average 1.71732117924604) internal successors, (214016), 130930 states have internal predecessors, (214016), 4249 states have call successors, (4249), 1543 states have call predecessors, (4249), 7848 states have return successors, (69783), 4502 states have call predecessors, (69783), 4247 states have call successors, (69783) [2025-03-08 07:32:37,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136720 states to 136720 states and 288048 transitions. [2025-03-08 07:32:37,849 INFO L78 Accepts]: Start accepts. Automaton has 136720 states and 288048 transitions. Word has length 144 [2025-03-08 07:32:37,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:32:37,849 INFO L471 AbstractCegarLoop]: Abstraction has 136720 states and 288048 transitions. [2025-03-08 07:32:37,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 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-08 07:32:37,850 INFO L276 IsEmpty]: Start isEmpty. Operand 136720 states and 288048 transitions. [2025-03-08 07:32:37,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-08 07:32:37,880 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:32:37,880 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, 1, 1, 1, 1, 1, 1, 1, 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-08 07:32:37,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-08 07:32:37,881 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:32:37,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:32:37,881 INFO L85 PathProgramCache]: Analyzing trace with hash 1627658314, now seen corresponding path program 1 times [2025-03-08 07:32:37,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:32:37,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654331951] [2025-03-08 07:32:37,881 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:32:37,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:32:37,888 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-08 07:32:37,890 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-08 07:32:37,891 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:32:37,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:32:37,959 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-08 07:32:37,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:32:37,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654331951] [2025-03-08 07:32:37,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654331951] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:32:37,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:32:37,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:32:37,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774604147] [2025-03-08 07:32:37,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:32:37,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:32:37,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:32:37,961 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:32:37,961 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:32:37,961 INFO L87 Difference]: Start difference. First operand 136720 states and 288048 transitions. Second operand has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 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)