./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.11.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.11.cil-1.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ff5431a1a166986f09cf6e8d9d49f276cd283b8e2ac68f401ad73509be5780b8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 17:53:30,819 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 17:53:30,865 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 17:53:30,869 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 17:53:30,870 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 17:53:30,885 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 17:53:30,885 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 17:53:30,885 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 17:53:30,886 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 17:53:30,886 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 17:53:30,886 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 17:53:30,886 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 17:53:30,886 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 17:53:30,886 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 17:53:30,886 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 17:53:30,887 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 17:53:30,887 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 17:53:30,887 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 17:53:30,887 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 17:53:30,887 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 17:53:30,887 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 17:53:30,887 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 17:53:30,887 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 17:53:30,887 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 17:53:30,887 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 17:53:30,887 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 17:53:30,887 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 17:53:30,888 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 17:53:30,888 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 17:53:30,888 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 17:53:30,888 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 17:53:30,888 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 17:53:30,888 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 17:53:30,888 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 17:53:30,888 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 17:53:30,888 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 17:53:30,888 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 17:53:30,889 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 17:53:30,889 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 17:53:30,889 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 17:53:30,889 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 17:53:30,889 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 17:53:30,889 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 17:53:30,889 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ff5431a1a166986f09cf6e8d9d49f276cd283b8e2ac68f401ad73509be5780b8 [2025-02-05 17:53:31,065 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 17:53:31,071 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 17:53:31,072 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 17:53:31,073 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 17:53:31,073 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 17:53:31,074 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.11.cil-1.c [2025-02-05 17:53:32,190 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d4b89c5ce/9c58022b531e42479c409ea7469abcad/FLAG6f5b68a4b [2025-02-05 17:53:32,500 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 17:53:32,504 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.11.cil-1.c [2025-02-05 17:53:32,521 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d4b89c5ce/9c58022b531e42479c409ea7469abcad/FLAG6f5b68a4b [2025-02-05 17:53:32,774 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d4b89c5ce/9c58022b531e42479c409ea7469abcad [2025-02-05 17:53:32,776 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 17:53:32,777 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 17:53:32,778 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 17:53:32,778 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 17:53:32,781 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 17:53:32,781 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 05:53:32" (1/1) ... [2025-02-05 17:53:32,782 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44a541f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:53:32, skipping insertion in model container [2025-02-05 17:53:32,782 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 05:53:32" (1/1) ... [2025-02-05 17:53:32,807 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 17:53:32,927 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.11.cil-1.c[913,926] [2025-02-05 17:53:32,968 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.11.cil-1.c[5977,5990] [2025-02-05 17:53:33,060 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 17:53:33,068 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 17:53:33,076 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.11.cil-1.c[913,926] [2025-02-05 17:53:33,084 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.11.cil-1.c[5977,5990] [2025-02-05 17:53:33,120 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 17:53:33,135 INFO L204 MainTranslator]: Completed translation [2025-02-05 17:53:33,136 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:53:33 WrapperNode [2025-02-05 17:53:33,136 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 17:53:33,137 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 17:53:33,137 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 17:53:33,137 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 17:53:33,142 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:53:33" (1/1) ... [2025-02-05 17:53:33,153 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:53:33" (1/1) ... [2025-02-05 17:53:33,214 INFO L138 Inliner]: procedures = 70, calls = 82, calls flagged for inlining = 44, calls inlined = 44, statements flattened = 975 [2025-02-05 17:53:33,214 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 17:53:33,215 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 17:53:33,215 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 17:53:33,215 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 17:53:33,223 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:53:33" (1/1) ... [2025-02-05 17:53:33,223 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:53:33" (1/1) ... [2025-02-05 17:53:33,225 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:53:33" (1/1) ... [2025-02-05 17:53:33,242 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-02-05 17:53:33,244 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:53:33" (1/1) ... [2025-02-05 17:53:33,244 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:53:33" (1/1) ... [2025-02-05 17:53:33,254 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:53:33" (1/1) ... [2025-02-05 17:53:33,258 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:53:33" (1/1) ... [2025-02-05 17:53:33,265 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:53:33" (1/1) ... [2025-02-05 17:53:33,272 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:53:33" (1/1) ... [2025-02-05 17:53:33,275 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 17:53:33,279 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 17:53:33,279 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 17:53:33,279 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 17:53:33,280 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:53:33" (1/1) ... [2025-02-05 17:53:33,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 17:53:33,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 17:53:33,325 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 17:53:33,328 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 17:53:33,345 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 17:53:33,346 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-02-05 17:53:33,346 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-02-05 17:53:33,346 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify_threads [2025-02-05 17:53:33,346 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify_threads [2025-02-05 17:53:33,347 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2025-02-05 17:53:33,347 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2025-02-05 17:53:33,347 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2025-02-05 17:53:33,347 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2025-02-05 17:53:33,347 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2025-02-05 17:53:33,347 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2025-02-05 17:53:33,348 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2025-02-05 17:53:33,348 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2025-02-05 17:53:33,348 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2025-02-05 17:53:33,348 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2025-02-05 17:53:33,348 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 17:53:33,348 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2025-02-05 17:53:33,348 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2025-02-05 17:53:33,348 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 17:53:33,348 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 17:53:33,348 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2025-02-05 17:53:33,348 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2025-02-05 17:53:33,348 INFO L130 BoogieDeclarations]: Found specification of procedure error2 [2025-02-05 17:53:33,349 INFO L138 BoogieDeclarations]: Found implementation of procedure error2 [2025-02-05 17:53:33,466 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 17:53:33,467 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 17:53:34,193 INFO L? ?]: Removed 125 outVars from TransFormulas that were not future-live. [2025-02-05 17:53:34,194 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 17:53:34,207 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 17:53:34,207 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 17:53:34,207 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 05:53:34 BoogieIcfgContainer [2025-02-05 17:53:34,207 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 17:53:34,209 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 17:53:34,209 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 17:53:34,212 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 17:53:34,212 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 05:53:32" (1/3) ... [2025-02-05 17:53:34,212 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@271acfcb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 05:53:34, skipping insertion in model container [2025-02-05 17:53:34,212 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:53:33" (2/3) ... [2025-02-05 17:53:34,212 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@271acfcb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 05:53:34, skipping insertion in model container [2025-02-05 17:53:34,212 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 05:53:34" (3/3) ... [2025-02-05 17:53:34,213 INFO L128 eAbstractionObserver]: Analyzing ICFG pc_sfifo_1.cil-2+token_ring.11.cil-1.c [2025-02-05 17:53:34,223 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 17:53:34,226 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pc_sfifo_1.cil-2+token_ring.11.cil-1.c that has 11 procedures, 463 locations, 1 initial locations, 18 loop locations, and 2 error locations. [2025-02-05 17:53:34,285 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 17:53:34,293 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;@21624793, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 17:53:34,294 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-02-05 17:53:34,300 INFO L276 IsEmpty]: Start isEmpty. Operand has 464 states, 417 states have (on average 1.565947242206235) internal successors, (653), 425 states have internal predecessors, (653), 33 states have call successors, (33), 10 states have call predecessors, (33), 10 states have return successors, (33), 31 states have call predecessors, (33), 33 states have call successors, (33) [2025-02-05 17:53:34,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-02-05 17:53:34,309 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:53:34,310 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] [2025-02-05 17:53:34,310 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:53:34,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:53:34,314 INFO L85 PathProgramCache]: Analyzing trace with hash 1067270017, now seen corresponding path program 1 times [2025-02-05 17:53:34,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:53:34,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915332437] [2025-02-05 17:53:34,321 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:53:34,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:53:34,378 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-02-05 17:53:34,404 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-02-05 17:53:34,404 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:53:34,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:53:34,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:53:34,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:53:34,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915332437] [2025-02-05 17:53:34,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915332437] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:53:34,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:53:34,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:53:34,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963842571] [2025-02-05 17:53:34,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:53:34,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:53:34,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:53:34,551 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:53:34,552 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:53:34,554 INFO L87 Difference]: Start difference. First operand has 464 states, 417 states have (on average 1.565947242206235) internal successors, (653), 425 states have internal predecessors, (653), 33 states have call successors, (33), 10 states have call predecessors, (33), 10 states have return successors, (33), 31 states have call predecessors, (33), 33 states have call successors, (33) Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-05 17:53:34,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:53:34,664 INFO L93 Difference]: Finished difference Result 902 states and 1394 transitions. [2025-02-05 17:53:34,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:53:34,666 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 44 [2025-02-05 17:53:34,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:53:34,673 INFO L225 Difference]: With dead ends: 902 [2025-02-05 17:53:34,673 INFO L226 Difference]: Without dead ends: 452 [2025-02-05 17:53:34,677 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-02-05 17:53:34,679 INFO L435 NwaCegarLoop]: 691 mSDtfsCounter, 95 mSDsluCounter, 595 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 1286 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-02-05 17:53:34,679 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 1286 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:53:34,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2025-02-05 17:53:34,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 452. [2025-02-05 17:53:34,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 452 states, 409 states have (on average 1.5183374083129584) internal successors, (621), 413 states have internal predecessors, (621), 33 states have call successors, (33), 10 states have call predecessors, (33), 8 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2025-02-05 17:53:34,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 683 transitions. [2025-02-05 17:53:34,746 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 683 transitions. Word has length 44 [2025-02-05 17:53:34,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:53:34,746 INFO L471 AbstractCegarLoop]: Abstraction has 452 states and 683 transitions. [2025-02-05 17:53:34,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-05 17:53:34,747 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 683 transitions. [2025-02-05 17:53:34,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-02-05 17:53:34,748 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:53:34,748 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] [2025-02-05 17:53:34,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 17:53:34,749 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:53:34,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:53:34,749 INFO L85 PathProgramCache]: Analyzing trace with hash 1989953600, now seen corresponding path program 1 times [2025-02-05 17:53:34,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:53:34,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641797126] [2025-02-05 17:53:34,749 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:53:34,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:53:34,758 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-02-05 17:53:34,769 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-02-05 17:53:34,769 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:53:34,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:53:34,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:53:34,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:53:34,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641797126] [2025-02-05 17:53:34,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641797126] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:53:34,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:53:34,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:53:34,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925400896] [2025-02-05 17:53:34,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:53:34,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:53:34,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:53:34,809 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:53:34,809 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:53:34,809 INFO L87 Difference]: Start difference. First operand 452 states and 683 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 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-02-05 17:53:34,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:53:34,853 INFO L93 Difference]: Finished difference Result 574 states and 850 transitions. [2025-02-05 17:53:34,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:53:34,856 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 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 44 [2025-02-05 17:53:34,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:53:34,865 INFO L225 Difference]: With dead ends: 574 [2025-02-05 17:53:34,865 INFO L226 Difference]: Without dead ends: 510 [2025-02-05 17:53:34,866 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-02-05 17:53:34,866 INFO L435 NwaCegarLoop]: 695 mSDtfsCounter, 659 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 659 SdHoareTripleChecker+Valid, 775 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-02-05 17:53:34,868 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [659 Valid, 775 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:53:34,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2025-02-05 17:53:34,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 503. [2025-02-05 17:53:34,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 503 states, 455 states have (on average 1.498901098901099) internal successors, (682), 459 states have internal predecessors, (682), 36 states have call successors, (36), 12 states have call predecessors, (36), 10 states have return successors, (36), 32 states have call predecessors, (36), 32 states have call successors, (36) [2025-02-05 17:53:34,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 503 states and 754 transitions. [2025-02-05 17:53:34,892 INFO L78 Accepts]: Start accepts. Automaton has 503 states and 754 transitions. Word has length 44 [2025-02-05 17:53:34,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:53:34,892 INFO L471 AbstractCegarLoop]: Abstraction has 503 states and 754 transitions. [2025-02-05 17:53:34,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 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-02-05 17:53:34,892 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 754 transitions. [2025-02-05 17:53:34,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-02-05 17:53:34,893 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:53:34,894 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:53:34,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 17:53:34,894 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:53:34,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:53:34,894 INFO L85 PathProgramCache]: Analyzing trace with hash -2105116387, now seen corresponding path program 1 times [2025-02-05 17:53:34,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:53:34,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568212662] [2025-02-05 17:53:34,895 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:53:34,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:53:34,902 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-02-05 17:53:34,913 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-02-05 17:53:34,913 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:53:34,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:53:34,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:53:34,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:53:34,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568212662] [2025-02-05 17:53:34,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568212662] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:53:34,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:53:34,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:53:34,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805788019] [2025-02-05 17:53:34,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:53:34,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:53:34,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:53:34,946 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:53:34,946 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:53:34,946 INFO L87 Difference]: Start difference. First operand 503 states and 754 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 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-02-05 17:53:35,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:53:35,005 INFO L93 Difference]: Finished difference Result 721 states and 1057 transitions. [2025-02-05 17:53:35,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:53:35,007 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 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 45 [2025-02-05 17:53:35,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:53:35,009 INFO L225 Difference]: With dead ends: 721 [2025-02-05 17:53:35,010 INFO L226 Difference]: Without dead ends: 608 [2025-02-05 17:53:35,010 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-02-05 17:53:35,013 INFO L435 NwaCegarLoop]: 681 mSDtfsCounter, 658 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 658 SdHoareTripleChecker+Valid, 760 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-02-05 17:53:35,014 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [658 Valid, 760 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:53:35,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2025-02-05 17:53:35,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 604. [2025-02-05 17:53:35,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 604 states, 545 states have (on average 1.4678899082568808) internal successors, (800), 549 states have internal predecessors, (800), 43 states have call successors, (43), 16 states have call predecessors, (43), 14 states have return successors, (47), 39 states have call predecessors, (47), 39 states have call successors, (47) [2025-02-05 17:53:35,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 890 transitions. [2025-02-05 17:53:35,084 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 890 transitions. Word has length 45 [2025-02-05 17:53:35,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:53:35,085 INFO L471 AbstractCegarLoop]: Abstraction has 604 states and 890 transitions. [2025-02-05 17:53:35,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 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-02-05 17:53:35,085 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 890 transitions. [2025-02-05 17:53:35,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-02-05 17:53:35,086 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:53:35,086 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] [2025-02-05 17:53:35,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 17:53:35,087 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:53:35,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:53:35,087 INFO L85 PathProgramCache]: Analyzing trace with hash 2083238618, now seen corresponding path program 1 times [2025-02-05 17:53:35,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:53:35,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333491999] [2025-02-05 17:53:35,087 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:53:35,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:53:35,094 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-02-05 17:53:35,106 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-02-05 17:53:35,106 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:53:35,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:53:35,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:53:35,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:53:35,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333491999] [2025-02-05 17:53:35,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333491999] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:53:35,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:53:35,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:53:35,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404873168] [2025-02-05 17:53:35,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:53:35,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:53:35,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:53:35,155 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:53:35,155 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:53:35,156 INFO L87 Difference]: Start difference. First operand 604 states and 890 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 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-02-05 17:53:35,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:53:35,223 INFO L93 Difference]: Finished difference Result 988 states and 1405 transitions. [2025-02-05 17:53:35,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:53:35,224 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 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 46 [2025-02-05 17:53:35,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:53:35,229 INFO L225 Difference]: With dead ends: 988 [2025-02-05 17:53:35,234 INFO L226 Difference]: Without dead ends: 768 [2025-02-05 17:53:35,235 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-02-05 17:53:35,236 INFO L435 NwaCegarLoop]: 710 mSDtfsCounter, 66 mSDsluCounter, 660 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 1370 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:53:35,236 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 1370 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:53:35,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 768 states. [2025-02-05 17:53:35,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 768 to 733. [2025-02-05 17:53:35,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 733 states, 660 states have (on average 1.437878787878788) internal successors, (949), 666 states have internal predecessors, (949), 51 states have call successors, (51), 22 states have call predecessors, (51), 20 states have return successors, (57), 45 states have call predecessors, (57), 47 states have call successors, (57) [2025-02-05 17:53:35,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 733 states to 733 states and 1057 transitions. [2025-02-05 17:53:35,277 INFO L78 Accepts]: Start accepts. Automaton has 733 states and 1057 transitions. Word has length 46 [2025-02-05 17:53:35,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:53:35,278 INFO L471 AbstractCegarLoop]: Abstraction has 733 states and 1057 transitions. [2025-02-05 17:53:35,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 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-02-05 17:53:35,278 INFO L276 IsEmpty]: Start isEmpty. Operand 733 states and 1057 transitions. [2025-02-05 17:53:35,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-02-05 17:53:35,280 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:53:35,280 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-02-05 17:53:35,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 17:53:35,280 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:53:35,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:53:35,280 INFO L85 PathProgramCache]: Analyzing trace with hash 1846535862, now seen corresponding path program 1 times [2025-02-05 17:53:35,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:53:35,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546661744] [2025-02-05 17:53:35,281 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:53:35,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:53:35,293 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-02-05 17:53:35,299 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-02-05 17:53:35,299 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:53:35,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:53:35,351 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-05 17:53:35,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:53:35,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546661744] [2025-02-05 17:53:35,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546661744] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:53:35,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:53:35,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:53:35,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542449629] [2025-02-05 17:53:35,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:53:35,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:53:35,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:53:35,352 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:53:35,352 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:53:35,353 INFO L87 Difference]: Start difference. First operand 733 states and 1057 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 3 states have call successors, (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-02-05 17:53:35,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:53:35,408 INFO L93 Difference]: Finished difference Result 1019 states and 1441 transitions. [2025-02-05 17:53:35,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:53:35,409 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 3 states have call successors, (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-02-05 17:53:35,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:53:35,412 INFO L225 Difference]: With dead ends: 1019 [2025-02-05 17:53:35,412 INFO L226 Difference]: Without dead ends: 794 [2025-02-05 17:53:35,415 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-02-05 17:53:35,416 INFO L435 NwaCegarLoop]: 740 mSDtfsCounter, 54 mSDsluCounter, 674 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 1414 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:53:35,417 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 1414 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:53:35,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 794 states. [2025-02-05 17:53:35,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 794 to 794. [2025-02-05 17:53:35,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 794 states, 713 states have (on average 1.4137447405329593) internal successors, (1008), 719 states have internal predecessors, (1008), 56 states have call successors, (56), 25 states have call predecessors, (56), 23 states have return successors, (65), 50 states have call predecessors, (65), 52 states have call successors, (65) [2025-02-05 17:53:35,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 1129 transitions. [2025-02-05 17:53:35,486 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 1129 transitions. Word has length 63 [2025-02-05 17:53:35,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:53:35,486 INFO L471 AbstractCegarLoop]: Abstraction has 794 states and 1129 transitions. [2025-02-05 17:53:35,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 3 states have call successors, (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-02-05 17:53:35,487 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 1129 transitions. [2025-02-05 17:53:35,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-02-05 17:53:35,489 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:53:35,489 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:53:35,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 17:53:35,489 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:53:35,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:53:35,490 INFO L85 PathProgramCache]: Analyzing trace with hash -1973881734, now seen corresponding path program 1 times [2025-02-05 17:53:35,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:53:35,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835993158] [2025-02-05 17:53:35,490 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:53:35,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:53:35,507 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-02-05 17:53:35,516 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-02-05 17:53:35,516 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:53:35,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:53:35,576 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-02-05 17:53:35,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:53:35,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835993158] [2025-02-05 17:53:35,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835993158] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:53:35,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:53:35,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:53:35,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711413992] [2025-02-05 17:53:35,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:53:35,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:53:35,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:53:35,577 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:53:35,577 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:53:35,578 INFO L87 Difference]: Start difference. First operand 794 states and 1129 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-05 17:53:35,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:53:35,608 INFO L93 Difference]: Finished difference Result 843 states and 1189 transitions. [2025-02-05 17:53:35,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:53:35,608 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 68 [2025-02-05 17:53:35,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:53:35,612 INFO L225 Difference]: With dead ends: 843 [2025-02-05 17:53:35,612 INFO L226 Difference]: Without dead ends: 384 [2025-02-05 17:53:35,613 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-02-05 17:53:35,614 INFO L435 NwaCegarLoop]: 634 mSDtfsCounter, 620 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 620 SdHoareTripleChecker+Valid, 634 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:53:35,614 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [620 Valid, 634 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:53:35,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2025-02-05 17:53:35,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 384. [2025-02-05 17:53:35,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 384 states, 350 states have (on average 1.54) internal successors, (539), 352 states have internal predecessors, (539), 27 states have call successors, (27), 7 states have call predecessors, (27), 6 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-02-05 17:53:35,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 591 transitions. [2025-02-05 17:53:35,633 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 591 transitions. Word has length 68 [2025-02-05 17:53:35,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:53:35,633 INFO L471 AbstractCegarLoop]: Abstraction has 384 states and 591 transitions. [2025-02-05 17:53:35,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-05 17:53:35,633 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 591 transitions. [2025-02-05 17:53:35,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-02-05 17:53:35,636 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:53:35,636 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, 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-02-05 17:53:35,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 17:53:35,636 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:53:35,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:53:35,638 INFO L85 PathProgramCache]: Analyzing trace with hash 511737624, now seen corresponding path program 1 times [2025-02-05 17:53:35,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:53:35,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023899110] [2025-02-05 17:53:35,638 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:53:35,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:53:35,663 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-02-05 17:53:35,667 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-02-05 17:53:35,667 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:53:35,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:53:35,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:53:35,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:53:35,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023899110] [2025-02-05 17:53:35,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023899110] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:53:35,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:53:35,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:53:35,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115116344] [2025-02-05 17:53:35,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:53:35,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:53:35,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:53:35,775 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:53:35,775 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:53:35,775 INFO L87 Difference]: Start difference. First operand 384 states and 591 transitions. Second operand has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 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-02-05 17:53:35,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:53:35,807 INFO L93 Difference]: Finished difference Result 757 states and 1165 transitions. [2025-02-05 17:53:35,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:53:35,808 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 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 168 [2025-02-05 17:53:35,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:53:35,812 INFO L225 Difference]: With dead ends: 757 [2025-02-05 17:53:35,812 INFO L226 Difference]: Without dead ends: 384 [2025-02-05 17:53:35,815 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-02-05 17:53:35,816 INFO L435 NwaCegarLoop]: 589 mSDtfsCounter, 580 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 580 SdHoareTripleChecker+Valid, 590 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-02-05 17:53:35,816 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [580 Valid, 590 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:53:35,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2025-02-05 17:53:35,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 384. [2025-02-05 17:53:35,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 384 states, 350 states have (on average 1.5371428571428571) internal successors, (538), 352 states have internal predecessors, (538), 27 states have call successors, (27), 7 states have call predecessors, (27), 6 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-02-05 17:53:35,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 590 transitions. [2025-02-05 17:53:35,835 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 590 transitions. Word has length 168 [2025-02-05 17:53:35,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:53:35,835 INFO L471 AbstractCegarLoop]: Abstraction has 384 states and 590 transitions. [2025-02-05 17:53:35,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 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-02-05 17:53:35,835 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 590 transitions. [2025-02-05 17:53:35,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-02-05 17:53:35,837 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:53:35,837 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, 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-02-05 17:53:35,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 17:53:35,838 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:53:35,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:53:35,838 INFO L85 PathProgramCache]: Analyzing trace with hash -2126223431, now seen corresponding path program 1 times [2025-02-05 17:53:35,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:53:35,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531553218] [2025-02-05 17:53:35,838 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:53:35,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:53:35,855 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-02-05 17:53:35,859 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-02-05 17:53:35,859 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:53:35,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:53:36,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:53:36,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:53:36,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531553218] [2025-02-05 17:53:36,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531553218] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:53:36,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:53:36,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:53:36,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810711042] [2025-02-05 17:53:36,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:53:36,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:53:36,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:53:36,040 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:53:36,040 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:53:36,041 INFO L87 Difference]: Start difference. First operand 384 states and 590 transitions. Second operand has 5 states, 5 states have (on average 31.4) internal successors, (157), 4 states have internal predecessors, (157), 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-02-05 17:53:36,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:53:36,699 INFO L93 Difference]: Finished difference Result 1156 states and 1794 transitions. [2025-02-05 17:53:36,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 17:53:36,699 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 4 states have internal predecessors, (157), 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 168 [2025-02-05 17:53:36,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:53:36,703 INFO L225 Difference]: With dead ends: 1156 [2025-02-05 17:53:36,703 INFO L226 Difference]: Without dead ends: 792 [2025-02-05 17:53:36,707 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-02-05 17:53:36,708 INFO L435 NwaCegarLoop]: 465 mSDtfsCounter, 1104 mSDsluCounter, 1197 mSDsCounter, 0 mSdLazyCounter, 596 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1123 SdHoareTripleChecker+Valid, 1662 SdHoareTripleChecker+Invalid, 654 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 596 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 17:53:36,708 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1123 Valid, 1662 Invalid, 654 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 596 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 17:53:36,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 792 states. [2025-02-05 17:53:36,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 792 to 763. [2025-02-05 17:53:36,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 763 states, 702 states have (on average 1.5484330484330484) internal successors, (1087), 705 states have internal predecessors, (1087), 47 states have call successors, (47), 13 states have call predecessors, (47), 13 states have return successors, (46), 45 states have call predecessors, (46), 45 states have call successors, (46) [2025-02-05 17:53:36,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 763 states to 763 states and 1180 transitions. [2025-02-05 17:53:36,746 INFO L78 Accepts]: Start accepts. Automaton has 763 states and 1180 transitions. Word has length 168 [2025-02-05 17:53:36,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:53:36,746 INFO L471 AbstractCegarLoop]: Abstraction has 763 states and 1180 transitions. [2025-02-05 17:53:36,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 4 states have internal predecessors, (157), 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-02-05 17:53:36,746 INFO L276 IsEmpty]: Start isEmpty. Operand 763 states and 1180 transitions. [2025-02-05 17:53:36,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-02-05 17:53:36,748 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:53:36,749 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, 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-02-05 17:53:36,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 17:53:36,749 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:53:36,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:53:36,765 INFO L85 PathProgramCache]: Analyzing trace with hash 482460471, now seen corresponding path program 1 times [2025-02-05 17:53:36,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:53:36,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193741668] [2025-02-05 17:53:36,765 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:53:36,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:53:36,778 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-02-05 17:53:36,783 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-02-05 17:53:36,783 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:53:36,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:53:36,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:53:36,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:53:36,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193741668] [2025-02-05 17:53:36,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193741668] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:53:36,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:53:36,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:53:36,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702972655] [2025-02-05 17:53:36,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:53:36,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:53:36,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:53:36,939 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:53:36,940 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:53:36,940 INFO L87 Difference]: Start difference. First operand 763 states and 1180 transitions. Second operand has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 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-02-05 17:53:37,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:53:37,825 INFO L93 Difference]: Finished difference Result 1985 states and 3107 transitions. [2025-02-05 17:53:37,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:53:37,826 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 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 168 [2025-02-05 17:53:37,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:53:37,835 INFO L225 Difference]: With dead ends: 1985 [2025-02-05 17:53:37,835 INFO L226 Difference]: Without dead ends: 1242 [2025-02-05 17:53:37,837 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-02-05 17:53:37,839 INFO L435 NwaCegarLoop]: 794 mSDtfsCounter, 1111 mSDsluCounter, 2452 mSDsCounter, 0 mSdLazyCounter, 1031 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1130 SdHoareTripleChecker+Valid, 3246 SdHoareTripleChecker+Invalid, 1064 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1031 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 17:53:37,840 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1130 Valid, 3246 Invalid, 1064 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1031 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 17:53:37,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1242 states. [2025-02-05 17:53:37,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1242 to 1117. [2025-02-05 17:53:37,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1117 states, 1029 states have (on average 1.5413022351797863) internal successors, (1586), 1033 states have internal predecessors, (1586), 67 states have call successors, (67), 19 states have call predecessors, (67), 20 states have return successors, (69), 66 states have call predecessors, (69), 65 states have call successors, (69) [2025-02-05 17:53:37,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1117 states to 1117 states and 1722 transitions. [2025-02-05 17:53:37,883 INFO L78 Accepts]: Start accepts. Automaton has 1117 states and 1722 transitions. Word has length 168 [2025-02-05 17:53:37,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:53:37,884 INFO L471 AbstractCegarLoop]: Abstraction has 1117 states and 1722 transitions. [2025-02-05 17:53:37,884 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 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-02-05 17:53:37,884 INFO L276 IsEmpty]: Start isEmpty. Operand 1117 states and 1722 transitions. [2025-02-05 17:53:37,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-02-05 17:53:37,886 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:53:37,886 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, 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-02-05 17:53:37,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 17:53:37,887 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:53:37,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:53:37,887 INFO L85 PathProgramCache]: Analyzing trace with hash 1430950200, now seen corresponding path program 1 times [2025-02-05 17:53:37,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:53:37,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145172666] [2025-02-05 17:53:37,887 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:53:37,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:53:37,897 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-02-05 17:53:37,901 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-02-05 17:53:37,901 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:53:37,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:53:38,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:53:38,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:53:38,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145172666] [2025-02-05 17:53:38,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145172666] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:53:38,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:53:38,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:53:38,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093432624] [2025-02-05 17:53:38,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:53:38,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:53:38,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:53:38,142 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:53:38,143 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:53:38,143 INFO L87 Difference]: Start difference. First operand 1117 states and 1722 transitions. Second operand has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 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-02-05 17:53:38,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:53:38,865 INFO L93 Difference]: Finished difference Result 3111 states and 4860 transitions. [2025-02-05 17:53:38,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:53:38,865 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 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 168 [2025-02-05 17:53:38,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:53:38,873 INFO L225 Difference]: With dead ends: 3111 [2025-02-05 17:53:38,873 INFO L226 Difference]: Without dead ends: 2014 [2025-02-05 17:53:38,875 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-02-05 17:53:38,876 INFO L435 NwaCegarLoop]: 790 mSDtfsCounter, 1106 mSDsluCounter, 2440 mSDsCounter, 0 mSdLazyCounter, 1031 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1125 SdHoareTripleChecker+Valid, 3230 SdHoareTripleChecker+Invalid, 1064 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1031 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 17:53:38,876 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1125 Valid, 3230 Invalid, 1064 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1031 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 17:53:38,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2014 states. [2025-02-05 17:53:38,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2014 to 1870. [2025-02-05 17:53:38,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1870 states, 1726 states have (on average 1.545191193511008) internal successors, (2667), 1734 states have internal predecessors, (2667), 107 states have call successors, (107), 31 states have call predecessors, (107), 36 states have return successors, (121), 108 states have call predecessors, (121), 105 states have call successors, (121) [2025-02-05 17:53:38,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1870 states to 1870 states and 2895 transitions. [2025-02-05 17:53:38,946 INFO L78 Accepts]: Start accepts. Automaton has 1870 states and 2895 transitions. Word has length 168 [2025-02-05 17:53:38,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:53:38,947 INFO L471 AbstractCegarLoop]: Abstraction has 1870 states and 2895 transitions. [2025-02-05 17:53:38,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 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-02-05 17:53:38,947 INFO L276 IsEmpty]: Start isEmpty. Operand 1870 states and 2895 transitions. [2025-02-05 17:53:38,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-02-05 17:53:38,949 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:53:38,949 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, 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-02-05 17:53:38,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 17:53:38,951 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:53:38,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:53:38,952 INFO L85 PathProgramCache]: Analyzing trace with hash 1600093975, now seen corresponding path program 1 times [2025-02-05 17:53:38,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:53:38,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920924141] [2025-02-05 17:53:38,952 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:53:38,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:53:38,963 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-02-05 17:53:38,967 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-02-05 17:53:38,969 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:53:38,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:53:39,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:53:39,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:53:39,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920924141] [2025-02-05 17:53:39,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920924141] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:53:39,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:53:39,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:53:39,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589886250] [2025-02-05 17:53:39,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:53:39,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:53:39,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:53:39,117 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:53:39,117 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:53:39,118 INFO L87 Difference]: Start difference. First operand 1870 states and 2895 transitions. Second operand has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 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-02-05 17:53:39,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:53:39,788 INFO L93 Difference]: Finished difference Result 5538 states and 8719 transitions. [2025-02-05 17:53:39,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:53:39,789 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 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 168 [2025-02-05 17:53:39,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:53:39,801 INFO L225 Difference]: With dead ends: 5538 [2025-02-05 17:53:39,802 INFO L226 Difference]: Without dead ends: 3688 [2025-02-05 17:53:39,806 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-02-05 17:53:39,806 INFO L435 NwaCegarLoop]: 787 mSDtfsCounter, 1101 mSDsluCounter, 2431 mSDsCounter, 0 mSdLazyCounter, 1031 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1120 SdHoareTripleChecker+Valid, 3218 SdHoareTripleChecker+Invalid, 1064 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1031 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 17:53:39,806 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1120 Valid, 3218 Invalid, 1064 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1031 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 17:53:39,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3688 states. [2025-02-05 17:53:39,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3688 to 3505. [2025-02-05 17:53:39,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3505 states, 3243 states have (on average 1.5624421831637372) internal successors, (5067), 3265 states have internal predecessors, (5067), 187 states have call successors, (187), 55 states have call predecessors, (187), 74 states have return successors, (249), 192 states have call predecessors, (249), 185 states have call successors, (249) [2025-02-05 17:53:39,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3505 states to 3505 states and 5503 transitions. [2025-02-05 17:53:39,928 INFO L78 Accepts]: Start accepts. Automaton has 3505 states and 5503 transitions. Word has length 168 [2025-02-05 17:53:39,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:53:39,928 INFO L471 AbstractCegarLoop]: Abstraction has 3505 states and 5503 transitions. [2025-02-05 17:53:39,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 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-02-05 17:53:39,928 INFO L276 IsEmpty]: Start isEmpty. Operand 3505 states and 5503 transitions. [2025-02-05 17:53:39,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-02-05 17:53:39,931 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:53:39,931 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, 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-02-05 17:53:39,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 17:53:39,931 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:53:39,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:53:39,931 INFO L85 PathProgramCache]: Analyzing trace with hash -334112424, now seen corresponding path program 1 times [2025-02-05 17:53:39,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:53:39,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557204365] [2025-02-05 17:53:39,932 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:53:39,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:53:39,940 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-02-05 17:53:39,943 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-02-05 17:53:39,943 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:53:39,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:53:40,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:53:40,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:53:40,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557204365] [2025-02-05 17:53:40,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557204365] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:53:40,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:53:40,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:53:40,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313217591] [2025-02-05 17:53:40,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:53:40,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:53:40,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:53:40,050 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:53:40,051 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:53:40,051 INFO L87 Difference]: Start difference. First operand 3505 states and 5503 transitions. Second operand has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 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-02-05 17:53:40,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:53:40,827 INFO L93 Difference]: Finished difference Result 10889 states and 17473 transitions. [2025-02-05 17:53:40,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:53:40,828 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 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 168 [2025-02-05 17:53:40,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:53:40,856 INFO L225 Difference]: With dead ends: 10889 [2025-02-05 17:53:40,856 INFO L226 Difference]: Without dead ends: 7404 [2025-02-05 17:53:40,867 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-02-05 17:53:40,867 INFO L435 NwaCegarLoop]: 784 mSDtfsCounter, 1096 mSDsluCounter, 2422 mSDsCounter, 0 mSdLazyCounter, 1031 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1115 SdHoareTripleChecker+Valid, 3206 SdHoareTripleChecker+Invalid, 1064 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1031 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 17:53:40,868 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1115 Valid, 3206 Invalid, 1064 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1031 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 17:53:40,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7404 states. [2025-02-05 17:53:41,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7404 to 7144. [2025-02-05 17:53:41,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7144 states, 6628 states have (on average 1.5912794206397103) internal successors, (10547), 6696 states have internal predecessors, (10547), 347 states have call successors, (347), 103 states have call predecessors, (347), 168 states have return successors, (601), 360 states have call predecessors, (601), 345 states have call successors, (601) [2025-02-05 17:53:41,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7144 states to 7144 states and 11495 transitions. [2025-02-05 17:53:41,112 INFO L78 Accepts]: Start accepts. Automaton has 7144 states and 11495 transitions. Word has length 168 [2025-02-05 17:53:41,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:53:41,112 INFO L471 AbstractCegarLoop]: Abstraction has 7144 states and 11495 transitions. [2025-02-05 17:53:41,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 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-02-05 17:53:41,113 INFO L276 IsEmpty]: Start isEmpty. Operand 7144 states and 11495 transitions. [2025-02-05 17:53:41,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-02-05 17:53:41,116 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:53:41,116 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, 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-02-05 17:53:41,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 17:53:41,117 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:53:41,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:53:41,117 INFO L85 PathProgramCache]: Analyzing trace with hash 1543156471, now seen corresponding path program 1 times [2025-02-05 17:53:41,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:53:41,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028930149] [2025-02-05 17:53:41,117 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:53:41,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:53:41,125 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-02-05 17:53:41,129 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-02-05 17:53:41,129 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:53:41,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:53:41,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:53:41,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:53:41,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028930149] [2025-02-05 17:53:41,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028930149] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:53:41,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:53:41,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:53:41,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013192861] [2025-02-05 17:53:41,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:53:41,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:53:41,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:53:41,236 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:53:41,236 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:53:41,236 INFO L87 Difference]: Start difference. First operand 7144 states and 11495 transitions. Second operand has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 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-02-05 17:53:41,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:53:41,707 INFO L93 Difference]: Finished difference Result 15928 states and 26320 transitions. [2025-02-05 17:53:41,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:53:41,708 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 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 168 [2025-02-05 17:53:41,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:53:41,741 INFO L225 Difference]: With dead ends: 15928 [2025-02-05 17:53:41,741 INFO L226 Difference]: Without dead ends: 8804 [2025-02-05 17:53:41,758 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-02-05 17:53:41,759 INFO L435 NwaCegarLoop]: 446 mSDtfsCounter, 787 mSDsluCounter, 743 mSDsCounter, 0 mSdLazyCounter, 420 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 806 SdHoareTripleChecker+Valid, 1189 SdHoareTripleChecker+Invalid, 454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 17:53:41,759 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [806 Valid, 1189 Invalid, 454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 420 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 17:53:41,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8804 states. [2025-02-05 17:53:42,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8804 to 7144. [2025-02-05 17:53:42,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7144 states, 6628 states have (on average 1.588714544357272) internal successors, (10530), 6696 states have internal predecessors, (10530), 347 states have call successors, (347), 103 states have call predecessors, (347), 168 states have return successors, (601), 360 states have call predecessors, (601), 345 states have call successors, (601) [2025-02-05 17:53:42,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7144 states to 7144 states and 11478 transitions. [2025-02-05 17:53:42,048 INFO L78 Accepts]: Start accepts. Automaton has 7144 states and 11478 transitions. Word has length 168 [2025-02-05 17:53:42,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:53:42,048 INFO L471 AbstractCegarLoop]: Abstraction has 7144 states and 11478 transitions. [2025-02-05 17:53:42,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 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-02-05 17:53:42,048 INFO L276 IsEmpty]: Start isEmpty. Operand 7144 states and 11478 transitions. [2025-02-05 17:53:42,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-02-05 17:53:42,051 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:53:42,051 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, 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-02-05 17:53:42,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 17:53:42,052 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:53:42,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:53:42,052 INFO L85 PathProgramCache]: Analyzing trace with hash 1465166200, now seen corresponding path program 1 times [2025-02-05 17:53:42,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:53:42,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548377624] [2025-02-05 17:53:42,052 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:53:42,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:53:42,061 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-02-05 17:53:42,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-02-05 17:53:42,065 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:53:42,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:53:42,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-02-05 17:53:42,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:53:42,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548377624] [2025-02-05 17:53:42,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548377624] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:53:42,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:53:42,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:53:42,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819971313] [2025-02-05 17:53:42,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:53:42,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:53:42,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:53:42,151 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:53:42,151 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:53:42,151 INFO L87 Difference]: Start difference. First operand 7144 states and 11478 transitions. Second operand has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 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-02-05 17:53:42,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:53:42,746 INFO L93 Difference]: Finished difference Result 15762 states and 25954 transitions. [2025-02-05 17:53:42,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:53:42,747 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 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 168 [2025-02-05 17:53:42,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:53:42,788 INFO L225 Difference]: With dead ends: 15762 [2025-02-05 17:53:42,788 INFO L226 Difference]: Without dead ends: 8638 [2025-02-05 17:53:42,812 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-02-05 17:53:42,813 INFO L435 NwaCegarLoop]: 441 mSDtfsCounter, 783 mSDsluCounter, 734 mSDsCounter, 0 mSdLazyCounter, 420 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 802 SdHoareTripleChecker+Valid, 1175 SdHoareTripleChecker+Invalid, 454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 17:53:42,813 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [802 Valid, 1175 Invalid, 454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 420 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 17:53:42,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8638 states. [2025-02-05 17:53:43,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8638 to 7144. [2025-02-05 17:53:43,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7144 states, 6628 states have (on average 1.586149668074834) internal successors, (10513), 6696 states have internal predecessors, (10513), 347 states have call successors, (347), 103 states have call predecessors, (347), 168 states have return successors, (601), 360 states have call predecessors, (601), 345 states have call successors, (601) [2025-02-05 17:53:43,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7144 states to 7144 states and 11461 transitions. [2025-02-05 17:53:43,132 INFO L78 Accepts]: Start accepts. Automaton has 7144 states and 11461 transitions. Word has length 168 [2025-02-05 17:53:43,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:53:43,132 INFO L471 AbstractCegarLoop]: Abstraction has 7144 states and 11461 transitions. [2025-02-05 17:53:43,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 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-02-05 17:53:43,133 INFO L276 IsEmpty]: Start isEmpty. Operand 7144 states and 11461 transitions. [2025-02-05 17:53:43,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-02-05 17:53:43,138 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:53:43,138 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, 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-02-05 17:53:43,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 17:53:43,138 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:53:43,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:53:43,139 INFO L85 PathProgramCache]: Analyzing trace with hash 571231289, now seen corresponding path program 1 times [2025-02-05 17:53:43,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:53:43,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262810991] [2025-02-05 17:53:43,139 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:53:43,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:53:43,151 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-02-05 17:53:43,156 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-02-05 17:53:43,156 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:53:43,156 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:53:43,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:53:43,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:53:43,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262810991] [2025-02-05 17:53:43,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262810991] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:53:43,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:53:43,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:53:43,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212241170] [2025-02-05 17:53:43,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:53:43,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:53:43,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:53:43,283 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:53:43,283 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:53:43,283 INFO L87 Difference]: Start difference. First operand 7144 states and 11461 transitions. Second operand has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 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-02-05 17:53:44,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:53:44,191 INFO L93 Difference]: Finished difference Result 22708 states and 37365 transitions. [2025-02-05 17:53:44,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:53:44,192 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 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 168 [2025-02-05 17:53:44,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:53:44,241 INFO L225 Difference]: With dead ends: 22708 [2025-02-05 17:53:44,241 INFO L226 Difference]: Without dead ends: 15584 [2025-02-05 17:53:44,264 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-02-05 17:53:44,265 INFO L435 NwaCegarLoop]: 767 mSDtfsCounter, 1072 mSDsluCounter, 2375 mSDsCounter, 0 mSdLazyCounter, 1031 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1091 SdHoareTripleChecker+Valid, 3142 SdHoareTripleChecker+Invalid, 1064 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1031 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 17:53:44,265 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1091 Valid, 3142 Invalid, 1064 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1031 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 17:53:44,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15584 states. [2025-02-05 17:53:44,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15584 to 15232. [2025-02-05 17:53:44,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15232 states, 14154 states have (on average 1.6172813338985446) internal successors, (22891), 14368 states have internal predecessors, (22891), 667 states have call successors, (667), 199 states have call predecessors, (667), 410 states have return successors, (1689), 696 states have call predecessors, (1689), 665 states have call successors, (1689) [2025-02-05 17:53:44,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15232 states to 15232 states and 25247 transitions. [2025-02-05 17:53:44,773 INFO L78 Accepts]: Start accepts. Automaton has 15232 states and 25247 transitions. Word has length 168 [2025-02-05 17:53:44,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:53:44,774 INFO L471 AbstractCegarLoop]: Abstraction has 15232 states and 25247 transitions. [2025-02-05 17:53:44,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 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-02-05 17:53:44,774 INFO L276 IsEmpty]: Start isEmpty. Operand 15232 states and 25247 transitions. [2025-02-05 17:53:44,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-02-05 17:53:44,781 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:53:44,782 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, 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-02-05 17:53:44,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 17:53:44,782 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:53:44,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:53:44,782 INFO L85 PathProgramCache]: Analyzing trace with hash 1650773336, now seen corresponding path program 1 times [2025-02-05 17:53:44,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:53:44,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923295558] [2025-02-05 17:53:44,783 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:53:44,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:53:44,793 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-02-05 17:53:44,798 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-02-05 17:53:44,800 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:53:44,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:53:44,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:53:44,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:53:44,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923295558] [2025-02-05 17:53:44,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923295558] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:53:44,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:53:44,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:53:44,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008017201] [2025-02-05 17:53:44,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:53:44,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:53:44,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:53:44,957 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:53:44,957 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:53:44,957 INFO L87 Difference]: Start difference. First operand 15232 states and 25247 transitions. Second operand has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 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-02-05 17:53:45,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:53:45,884 INFO L93 Difference]: Finished difference Result 34364 states and 58658 transitions. [2025-02-05 17:53:45,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:53:45,885 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 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 168 [2025-02-05 17:53:45,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:53:45,957 INFO L225 Difference]: With dead ends: 34364 [2025-02-05 17:53:45,957 INFO L226 Difference]: Without dead ends: 19152 [2025-02-05 17:53:46,000 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-02-05 17:53:46,001 INFO L435 NwaCegarLoop]: 436 mSDtfsCounter, 779 mSDsluCounter, 725 mSDsCounter, 0 mSdLazyCounter, 420 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 798 SdHoareTripleChecker+Valid, 1161 SdHoareTripleChecker+Invalid, 454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 17:53:46,001 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [798 Valid, 1161 Invalid, 454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 420 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 17:53:46,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19152 states. [2025-02-05 17:53:46,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19152 to 15232. [2025-02-05 17:53:46,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15232 states, 14154 states have (on average 1.6149498375017663) internal successors, (22858), 14368 states have internal predecessors, (22858), 667 states have call successors, (667), 199 states have call predecessors, (667), 410 states have return successors, (1689), 696 states have call predecessors, (1689), 665 states have call successors, (1689) [2025-02-05 17:53:46,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15232 states to 15232 states and 25214 transitions. [2025-02-05 17:53:46,655 INFO L78 Accepts]: Start accepts. Automaton has 15232 states and 25214 transitions. Word has length 168 [2025-02-05 17:53:46,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:53:46,656 INFO L471 AbstractCegarLoop]: Abstraction has 15232 states and 25214 transitions. [2025-02-05 17:53:46,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 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-02-05 17:53:46,656 INFO L276 IsEmpty]: Start isEmpty. Operand 15232 states and 25214 transitions. [2025-02-05 17:53:46,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-02-05 17:53:46,663 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:53:46,663 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, 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-02-05 17:53:46,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 17:53:46,664 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:53:46,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:53:46,665 INFO L85 PathProgramCache]: Analyzing trace with hash 1685597273, now seen corresponding path program 1 times [2025-02-05 17:53:46,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:53:46,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587384794] [2025-02-05 17:53:46,665 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:53:46,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:53:46,679 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-02-05 17:53:46,683 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-02-05 17:53:46,683 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:53:46,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:53:46,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:53:46,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:53:46,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587384794] [2025-02-05 17:53:46,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587384794] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:53:46,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:53:46,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:53:46,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620452003] [2025-02-05 17:53:46,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:53:46,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:53:46,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:53:46,797 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:53:46,797 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:53:46,797 INFO L87 Difference]: Start difference. First operand 15232 states and 25214 transitions. Second operand has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 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-02-05 17:53:48,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:53:48,196 INFO L93 Difference]: Finished difference Result 49442 states and 84598 transitions. [2025-02-05 17:53:48,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:53:48,197 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 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 168 [2025-02-05 17:53:48,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:53:48,302 INFO L225 Difference]: With dead ends: 49442 [2025-02-05 17:53:48,302 INFO L226 Difference]: Without dead ends: 34230 [2025-02-05 17:53:48,334 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-02-05 17:53:48,335 INFO L435 NwaCegarLoop]: 759 mSDtfsCounter, 1059 mSDsluCounter, 2352 mSDsCounter, 0 mSdLazyCounter, 1031 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1078 SdHoareTripleChecker+Valid, 3111 SdHoareTripleChecker+Invalid, 1064 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1031 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 17:53:48,335 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1078 Valid, 3111 Invalid, 1064 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1031 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 17:53:48,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34230 states. [2025-02-05 17:53:49,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34230 to 33676. [2025-02-05 17:53:49,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33676 states, 31312 states have (on average 1.648441492079714) internal successors, (51616), 31980 states have internal predecessors, (51616), 1307 states have call successors, (1307), 391 states have call predecessors, (1307), 1056 states have return successors, (5401), 1368 states have call predecessors, (5401), 1305 states have call successors, (5401) [2025-02-05 17:53:50,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33676 states to 33676 states and 58324 transitions. [2025-02-05 17:53:50,023 INFO L78 Accepts]: Start accepts. Automaton has 33676 states and 58324 transitions. Word has length 168 [2025-02-05 17:53:50,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:53:50,024 INFO L471 AbstractCegarLoop]: Abstraction has 33676 states and 58324 transitions. [2025-02-05 17:53:50,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 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-02-05 17:53:50,024 INFO L276 IsEmpty]: Start isEmpty. Operand 33676 states and 58324 transitions. [2025-02-05 17:53:50,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-02-05 17:53:50,037 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:53:50,038 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, 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-02-05 17:53:50,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-05 17:53:50,038 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:53:50,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:53:50,039 INFO L85 PathProgramCache]: Analyzing trace with hash -252942024, now seen corresponding path program 1 times [2025-02-05 17:53:50,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:53:50,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398575814] [2025-02-05 17:53:50,039 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:53:50,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:53:50,052 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-02-05 17:53:50,057 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-02-05 17:53:50,057 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:53:50,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:53:50,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:53:50,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:53:50,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398575814] [2025-02-05 17:53:50,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398575814] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:53:50,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:53:50,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:53:50,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176463382] [2025-02-05 17:53:50,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:53:50,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:53:50,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:53:50,219 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:53:50,220 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:53:50,220 INFO L87 Difference]: Start difference. First operand 33676 states and 58324 transitions. Second operand has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 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-02-05 17:53:52,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:53:52,767 INFO L93 Difference]: Finished difference Result 111748 states and 202530 transitions. [2025-02-05 17:53:52,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:53:52,768 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 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 168 [2025-02-05 17:53:52,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:53:53,211 INFO L225 Difference]: With dead ends: 111748 [2025-02-05 17:53:53,212 INFO L226 Difference]: Without dead ends: 78092 [2025-02-05 17:53:53,355 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-02-05 17:53:53,356 INFO L435 NwaCegarLoop]: 756 mSDtfsCounter, 1054 mSDsluCounter, 2343 mSDsCounter, 0 mSdLazyCounter, 1031 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1073 SdHoareTripleChecker+Valid, 3099 SdHoareTripleChecker+Invalid, 1064 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1031 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 17:53:53,356 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1073 Valid, 3099 Invalid, 1064 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1031 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 17:53:53,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78092 states. [2025-02-05 17:53:57,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78092 to 77125. [2025-02-05 17:53:57,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77125 states, 71703 states have (on average 1.684225206755645) internal successors, (120764), 73765 states have internal predecessors, (120764), 2587 states have call successors, (2587), 775 states have call predecessors, (2587), 2834 states have return successors, (18969), 2712 states have call predecessors, (18969), 2585 states have call successors, (18969) [2025-02-05 17:53:58,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77125 states to 77125 states and 142320 transitions. [2025-02-05 17:53:58,249 INFO L78 Accepts]: Start accepts. Automaton has 77125 states and 142320 transitions. Word has length 168 [2025-02-05 17:53:58,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:53:58,250 INFO L471 AbstractCegarLoop]: Abstraction has 77125 states and 142320 transitions. [2025-02-05 17:53:58,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 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-02-05 17:53:58,250 INFO L276 IsEmpty]: Start isEmpty. Operand 77125 states and 142320 transitions. [2025-02-05 17:53:58,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-02-05 17:53:58,273 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:53:58,273 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, 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-02-05 17:53:58,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-05 17:53:58,273 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:53:58,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:53:58,274 INFO L85 PathProgramCache]: Analyzing trace with hash -1700948871, now seen corresponding path program 1 times [2025-02-05 17:53:58,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:53:58,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503124984] [2025-02-05 17:53:58,274 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:53:58,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:53:58,285 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-02-05 17:53:58,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-02-05 17:53:58,290 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:53:58,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:53:58,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:53:58,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:53:58,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503124984] [2025-02-05 17:53:58,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503124984] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:53:58,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:53:58,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:53:58,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869898912] [2025-02-05 17:53:58,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:53:58,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:53:58,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:53:58,663 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:53:58,663 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:53:58,664 INFO L87 Difference]: Start difference. First operand 77125 states and 142320 transitions. Second operand has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 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-02-05 17:54:05,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:54:05,785 INFO L93 Difference]: Finished difference Result 271581 states and 528765 transitions. [2025-02-05 17:54:05,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:54:05,785 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 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 168 [2025-02-05 17:54:05,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:54:07,525 INFO L225 Difference]: With dead ends: 271581 [2025-02-05 17:54:07,526 INFO L226 Difference]: Without dead ends: 194476 [2025-02-05 17:54:07,705 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-02-05 17:54:07,706 INFO L435 NwaCegarLoop]: 751 mSDtfsCounter, 1162 mSDsluCounter, 2323 mSDsCounter, 0 mSdLazyCounter, 1320 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1180 SdHoareTripleChecker+Valid, 3074 SdHoareTripleChecker+Invalid, 1355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 1320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-05 17:54:07,706 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1180 Valid, 3074 Invalid, 1355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 1320 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-05 17:54:07,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194476 states.