./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.12.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.12.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 67128d109acca52d0fda3c2f0434d60ee9cc5cc865496b6446183c0a601e748c --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 17:53:33,831 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 17:53:33,885 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:33,889 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 17:53:33,889 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 17:53:33,906 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 17:53:33,907 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 17:53:33,907 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 17:53:33,907 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 17:53:33,908 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 17:53:33,908 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 17:53:33,908 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 17:53:33,908 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 17:53:33,908 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 17:53:33,908 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 17:53:33,908 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 17:53:33,908 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 17:53:33,908 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 17:53:33,909 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 17:53:33,909 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 17:53:33,909 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 17:53:33,909 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 17:53:33,909 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 17:53:33,909 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 17:53:33,909 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 17:53:33,909 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 17:53:33,909 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 17:53:33,909 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 17:53:33,909 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 17:53:33,909 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 17:53:33,909 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 17:53:33,909 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 17:53:33,909 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 17:53:33,910 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 17:53:33,910 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 17:53:33,910 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 17:53:33,910 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 17:53:33,910 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 17:53:33,910 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 17:53:33,910 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 17:53:33,910 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 17:53:33,910 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 17:53:33,910 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 17:53:33,910 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 -> 67128d109acca52d0fda3c2f0434d60ee9cc5cc865496b6446183c0a601e748c [2025-02-05 17:53:34,124 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 17:53:34,133 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 17:53:34,136 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 17:53:34,137 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 17:53:34,138 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 17:53:34,139 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.12.cil-1.c [2025-02-05 17:53:35,394 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2fe105eeb/b1d8e3681296487a891c610e49554cf6/FLAGc6982b848 [2025-02-05 17:53:35,674 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 17:53:35,677 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.12.cil-1.c [2025-02-05 17:53:35,701 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2fe105eeb/b1d8e3681296487a891c610e49554cf6/FLAGc6982b848 [2025-02-05 17:53:35,728 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2fe105eeb/b1d8e3681296487a891c610e49554cf6 [2025-02-05 17:53:35,731 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 17:53:35,732 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 17:53:35,733 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 17:53:35,733 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 17:53:35,736 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 17:53:35,736 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 05:53:35" (1/1) ... [2025-02-05 17:53:35,737 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22ce3f45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:53:35, skipping insertion in model container [2025-02-05 17:53:35,737 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 05:53:35" (1/1) ... [2025-02-05 17:53:35,767 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 17:53:35,924 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.12.cil-1.c[913,926] [2025-02-05 17:53:35,979 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.12.cil-1.c[5977,5990] [2025-02-05 17:53:36,075 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 17:53:36,083 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 17:53:36,089 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.12.cil-1.c[913,926] [2025-02-05 17:53:36,096 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.12.cil-1.c[5977,5990] [2025-02-05 17:53:36,131 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 17:53:36,160 INFO L204 MainTranslator]: Completed translation [2025-02-05 17:53:36,161 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:53:36 WrapperNode [2025-02-05 17:53:36,161 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 17:53:36,162 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 17:53:36,165 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 17:53:36,165 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 17:53:36,171 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:36" (1/1) ... [2025-02-05 17:53:36,190 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:36" (1/1) ... [2025-02-05 17:53:36,245 INFO L138 Inliner]: procedures = 72, calls = 85, calls flagged for inlining = 46, calls inlined = 46, statements flattened = 1032 [2025-02-05 17:53:36,245 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 17:53:36,246 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 17:53:36,246 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 17:53:36,246 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 17:53:36,258 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:36" (1/1) ... [2025-02-05 17:53:36,259 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:36" (1/1) ... [2025-02-05 17:53:36,264 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:36" (1/1) ... [2025-02-05 17:53:36,290 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:36,293 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:36" (1/1) ... [2025-02-05 17:53:36,294 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:36" (1/1) ... [2025-02-05 17:53:36,309 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:36" (1/1) ... [2025-02-05 17:53:36,311 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:36" (1/1) ... [2025-02-05 17:53:36,316 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:36" (1/1) ... [2025-02-05 17:53:36,317 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:36" (1/1) ... [2025-02-05 17:53:36,324 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 17:53:36,325 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 17:53:36,325 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 17:53:36,325 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 17:53:36,326 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:53:36" (1/1) ... [2025-02-05 17:53:36,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 17:53:36,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 17:53:36,349 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:36,351 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:36,367 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 17:53:36,367 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-02-05 17:53:36,367 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-02-05 17:53:36,367 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify_threads [2025-02-05 17:53:36,367 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify_threads [2025-02-05 17:53:36,367 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2025-02-05 17:53:36,368 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2025-02-05 17:53:36,368 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2025-02-05 17:53:36,368 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2025-02-05 17:53:36,368 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2025-02-05 17:53:36,368 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2025-02-05 17:53:36,368 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2025-02-05 17:53:36,368 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2025-02-05 17:53:36,368 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2025-02-05 17:53:36,368 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2025-02-05 17:53:36,368 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 17:53:36,368 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2025-02-05 17:53:36,368 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2025-02-05 17:53:36,368 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 17:53:36,369 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 17:53:36,369 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2025-02-05 17:53:36,369 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2025-02-05 17:53:36,369 INFO L130 BoogieDeclarations]: Found specification of procedure error2 [2025-02-05 17:53:36,369 INFO L138 BoogieDeclarations]: Found implementation of procedure error2 [2025-02-05 17:53:36,489 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 17:53:36,491 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 17:53:37,261 INFO L? ?]: Removed 131 outVars from TransFormulas that were not future-live. [2025-02-05 17:53:37,261 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 17:53:37,274 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 17:53:37,274 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 17:53:37,274 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 05:53:37 BoogieIcfgContainer [2025-02-05 17:53:37,274 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 17:53:37,276 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 17:53:37,276 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 17:53:37,279 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 17:53:37,279 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 05:53:35" (1/3) ... [2025-02-05 17:53:37,279 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d8114a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 05:53:37, skipping insertion in model container [2025-02-05 17:53:37,279 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:53:36" (2/3) ... [2025-02-05 17:53:37,279 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d8114a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 05:53:37, skipping insertion in model container [2025-02-05 17:53:37,279 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 05:53:37" (3/3) ... [2025-02-05 17:53:37,280 INFO L128 eAbstractionObserver]: Analyzing ICFG pc_sfifo_1.cil-2+token_ring.12.cil-1.c [2025-02-05 17:53:37,290 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 17:53:37,292 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pc_sfifo_1.cil-2+token_ring.12.cil-1.c that has 11 procedures, 490 locations, 1 initial locations, 19 loop locations, and 2 error locations. [2025-02-05 17:53:37,343 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 17:53:37,351 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;@26ac1653, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 17:53:37,351 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-02-05 17:53:37,355 INFO L276 IsEmpty]: Start isEmpty. Operand has 491 states, 443 states have (on average 1.5688487584650113) internal successors, (695), 451 states have internal predecessors, (695), 34 states have call successors, (34), 10 states have call predecessors, (34), 10 states have return successors, (34), 32 states have call predecessors, (34), 34 states have call successors, (34) [2025-02-05 17:53:37,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-02-05 17:53:37,360 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:53:37,360 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:37,360 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:53:37,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:53:37,364 INFO L85 PathProgramCache]: Analyzing trace with hash 1610464994, now seen corresponding path program 1 times [2025-02-05 17:53:37,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:53:37,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48833852] [2025-02-05 17:53:37,371 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:53:37,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:53:37,434 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-02-05 17:53:37,464 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-02-05 17:53:37,465 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:53:37,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:53:37,579 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:37,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:53:37,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48833852] [2025-02-05 17:53:37,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48833852] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:53:37,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:53:37,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:53:37,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921004277] [2025-02-05 17:53:37,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:53:37,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:53:37,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:53:37,597 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:53:37,598 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:53:37,600 INFO L87 Difference]: Start difference. First operand has 491 states, 443 states have (on average 1.5688487584650113) internal successors, (695), 451 states have internal predecessors, (695), 34 states have call successors, (34), 10 states have call predecessors, (34), 10 states have return successors, (34), 32 states have call predecessors, (34), 34 states have call successors, (34) 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:37,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:53:37,662 INFO L93 Difference]: Finished difference Result 955 states and 1480 transitions. [2025-02-05 17:53:37,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:53:37,664 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:37,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:53:37,672 INFO L225 Difference]: With dead ends: 955 [2025-02-05 17:53:37,672 INFO L226 Difference]: Without dead ends: 479 [2025-02-05 17:53:37,681 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:37,683 INFO L435 NwaCegarLoop]: 734 mSDtfsCounter, 95 mSDsluCounter, 638 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 1372 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:37,684 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 1372 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:37,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2025-02-05 17:53:37,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 479. [2025-02-05 17:53:37,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 479 states, 435 states have (on average 1.5218390804597701) internal successors, (662), 439 states have internal predecessors, (662), 34 states have call successors, (34), 10 states have call predecessors, (34), 8 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-02-05 17:53:37,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 726 transitions. [2025-02-05 17:53:37,756 INFO L78 Accepts]: Start accepts. Automaton has 479 states and 726 transitions. Word has length 44 [2025-02-05 17:53:37,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:53:37,758 INFO L471 AbstractCegarLoop]: Abstraction has 479 states and 726 transitions. [2025-02-05 17:53:37,758 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:37,759 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 726 transitions. [2025-02-05 17:53:37,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-02-05 17:53:37,760 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:53:37,760 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:37,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 17:53:37,761 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:53:37,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:53:37,761 INFO L85 PathProgramCache]: Analyzing trace with hash -1761818719, now seen corresponding path program 1 times [2025-02-05 17:53:37,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:53:37,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326773840] [2025-02-05 17:53:37,761 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:53:37,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:53:37,776 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-02-05 17:53:37,794 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-02-05 17:53:37,795 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:53:37,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:53:37,834 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:37,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:53:37,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326773840] [2025-02-05 17:53:37,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326773840] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:53:37,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:53:37,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:53:37,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674314461] [2025-02-05 17:53:37,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:53:37,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:53:37,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:53:37,836 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:53:37,836 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:53:37,836 INFO L87 Difference]: Start difference. First operand 479 states and 726 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:37,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:53:37,887 INFO L93 Difference]: Finished difference Result 601 states and 893 transitions. [2025-02-05 17:53:37,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:53:37,887 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:37,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:53:37,896 INFO L225 Difference]: With dead ends: 601 [2025-02-05 17:53:37,896 INFO L226 Difference]: Without dead ends: 537 [2025-02-05 17:53:37,897 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:37,897 INFO L435 NwaCegarLoop]: 736 mSDtfsCounter, 703 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 703 SdHoareTripleChecker+Valid, 816 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:37,897 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [703 Valid, 816 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:37,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2025-02-05 17:53:37,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 530. [2025-02-05 17:53:37,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 530 states, 481 states have (on average 1.503118503118503) internal successors, (723), 485 states have internal predecessors, (723), 37 states have call successors, (37), 12 states have call predecessors, (37), 10 states have return successors, (37), 33 states have call predecessors, (37), 33 states have call successors, (37) [2025-02-05 17:53:37,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 797 transitions. [2025-02-05 17:53:37,921 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 797 transitions. Word has length 44 [2025-02-05 17:53:37,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:53:37,922 INFO L471 AbstractCegarLoop]: Abstraction has 530 states and 797 transitions. [2025-02-05 17:53:37,922 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:37,922 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 797 transitions. [2025-02-05 17:53:37,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-02-05 17:53:37,923 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:53:37,923 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:37,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 17:53:37,923 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:53:37,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:53:37,924 INFO L85 PathProgramCache]: Analyzing trace with hash -217552690, now seen corresponding path program 1 times [2025-02-05 17:53:37,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:53:37,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004172959] [2025-02-05 17:53:37,924 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:53:37,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:53:37,931 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-02-05 17:53:37,938 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-02-05 17:53:37,939 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:53:37,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:53:37,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:53:37,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:53:37,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004172959] [2025-02-05 17:53:37,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004172959] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:53:37,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:53:37,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:53:37,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326405032] [2025-02-05 17:53:37,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:53:37,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:53:37,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:53:37,975 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:53:37,976 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:53:37,976 INFO L87 Difference]: Start difference. First operand 530 states and 797 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:38,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:53:38,027 INFO L93 Difference]: Finished difference Result 748 states and 1100 transitions. [2025-02-05 17:53:38,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:53:38,030 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:38,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:53:38,038 INFO L225 Difference]: With dead ends: 748 [2025-02-05 17:53:38,038 INFO L226 Difference]: Without dead ends: 635 [2025-02-05 17:53:38,039 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:38,040 INFO L435 NwaCegarLoop]: 724 mSDtfsCounter, 701 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 701 SdHoareTripleChecker+Valid, 803 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:38,040 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [701 Valid, 803 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:38,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2025-02-05 17:53:38,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 631. [2025-02-05 17:53:38,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 631 states, 571 states have (on average 1.4728546409807355) internal successors, (841), 575 states have internal predecessors, (841), 44 states have call successors, (44), 16 states have call predecessors, (44), 14 states have return successors, (48), 40 states have call predecessors, (48), 40 states have call successors, (48) [2025-02-05 17:53:38,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 631 states to 631 states and 933 transitions. [2025-02-05 17:53:38,089 INFO L78 Accepts]: Start accepts. Automaton has 631 states and 933 transitions. Word has length 45 [2025-02-05 17:53:38,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:53:38,089 INFO L471 AbstractCegarLoop]: Abstraction has 631 states and 933 transitions. [2025-02-05 17:53:38,090 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:38,090 INFO L276 IsEmpty]: Start isEmpty. Operand 631 states and 933 transitions. [2025-02-05 17:53:38,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-02-05 17:53:38,091 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:53:38,091 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:38,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 17:53:38,095 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:53:38,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:53:38,096 INFO L85 PathProgramCache]: Analyzing trace with hash -1598407621, now seen corresponding path program 1 times [2025-02-05 17:53:38,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:53:38,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655322662] [2025-02-05 17:53:38,096 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:53:38,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:53:38,103 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-02-05 17:53:38,109 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-02-05 17:53:38,109 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:53:38,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:53:38,164 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,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:53:38,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655322662] [2025-02-05 17:53:38,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655322662] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:53:38,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:53:38,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:53:38,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814256325] [2025-02-05 17:53:38,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:53:38,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:53:38,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:53:38,166 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:53:38,166 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:53:38,166 INFO L87 Difference]: Start difference. First operand 631 states and 933 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:38,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:53:38,223 INFO L93 Difference]: Finished difference Result 1015 states and 1448 transitions. [2025-02-05 17:53:38,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:53:38,223 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:38,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:53:38,229 INFO L225 Difference]: With dead ends: 1015 [2025-02-05 17:53:38,229 INFO L226 Difference]: Without dead ends: 795 [2025-02-05 17:53:38,230 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:38,231 INFO L435 NwaCegarLoop]: 753 mSDtfsCounter, 66 mSDsluCounter, 703 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 1456 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:38,233 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 1456 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:38,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 795 states. [2025-02-05 17:53:38,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 795 to 760. [2025-02-05 17:53:38,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 760 states, 686 states have (on average 1.4431486880466473) internal successors, (990), 692 states have internal predecessors, (990), 52 states have call successors, (52), 22 states have call predecessors, (52), 20 states have return successors, (58), 46 states have call predecessors, (58), 48 states have call successors, (58) [2025-02-05 17:53:38,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 760 states to 760 states and 1100 transitions. [2025-02-05 17:53:38,266 INFO L78 Accepts]: Start accepts. Automaton has 760 states and 1100 transitions. Word has length 46 [2025-02-05 17:53:38,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:53:38,266 INFO L471 AbstractCegarLoop]: Abstraction has 760 states and 1100 transitions. [2025-02-05 17:53:38,267 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:38,267 INFO L276 IsEmpty]: Start isEmpty. Operand 760 states and 1100 transitions. [2025-02-05 17:53:38,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-02-05 17:53:38,268 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:53:38,269 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:38,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 17:53:38,269 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:53:38,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:53:38,269 INFO L85 PathProgramCache]: Analyzing trace with hash -1288741401, now seen corresponding path program 1 times [2025-02-05 17:53:38,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:53:38,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425739065] [2025-02-05 17:53:38,270 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:53:38,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:53:38,277 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-02-05 17:53:38,283 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-02-05 17:53:38,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:53:38,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:53:38,336 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:38,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:53:38,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425739065] [2025-02-05 17:53:38,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425739065] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:53:38,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:53:38,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:53:38,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93770946] [2025-02-05 17:53:38,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:53:38,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:53:38,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:53:38,338 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:53:38,338 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:53:38,338 INFO L87 Difference]: Start difference. First operand 760 states and 1100 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:38,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:53:38,411 INFO L93 Difference]: Finished difference Result 1046 states and 1484 transitions. [2025-02-05 17:53:38,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:53:38,411 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:38,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:53:38,417 INFO L225 Difference]: With dead ends: 1046 [2025-02-05 17:53:38,417 INFO L226 Difference]: Without dead ends: 821 [2025-02-05 17:53:38,417 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:38,419 INFO L435 NwaCegarLoop]: 783 mSDtfsCounter, 54 mSDsluCounter, 717 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 1500 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:38,419 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 1500 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:38,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 821 states. [2025-02-05 17:53:38,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 821 to 821. [2025-02-05 17:53:38,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 821 states, 739 states have (on average 1.419485791610284) internal successors, (1049), 745 states have internal predecessors, (1049), 57 states have call successors, (57), 25 states have call predecessors, (57), 23 states have return successors, (66), 51 states have call predecessors, (66), 53 states have call successors, (66) [2025-02-05 17:53:38,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 821 states to 821 states and 1172 transitions. [2025-02-05 17:53:38,459 INFO L78 Accepts]: Start accepts. Automaton has 821 states and 1172 transitions. Word has length 63 [2025-02-05 17:53:38,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:53:38,459 INFO L471 AbstractCegarLoop]: Abstraction has 821 states and 1172 transitions. [2025-02-05 17:53:38,460 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:38,460 INFO L276 IsEmpty]: Start isEmpty. Operand 821 states and 1172 transitions. [2025-02-05 17:53:38,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-02-05 17:53:38,464 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:53:38,464 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:38,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 17:53:38,464 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:53:38,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:53:38,465 INFO L85 PathProgramCache]: Analyzing trace with hash 1931491107, now seen corresponding path program 1 times [2025-02-05 17:53:38,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:53:38,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687200547] [2025-02-05 17:53:38,465 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:53:38,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:53:38,477 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-02-05 17:53:38,485 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-02-05 17:53:38,485 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:53:38,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:53:38,530 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:38,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:53:38,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687200547] [2025-02-05 17:53:38,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687200547] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:53:38,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:53:38,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:53:38,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099806935] [2025-02-05 17:53:38,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:53:38,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:53:38,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:53:38,532 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:53:38,533 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:53:38,533 INFO L87 Difference]: Start difference. First operand 821 states and 1172 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:38,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:53:38,558 INFO L93 Difference]: Finished difference Result 870 states and 1232 transitions. [2025-02-05 17:53:38,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:53:38,559 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:38,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:53:38,561 INFO L225 Difference]: With dead ends: 870 [2025-02-05 17:53:38,562 INFO L226 Difference]: Without dead ends: 411 [2025-02-05 17:53:38,563 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:38,563 INFO L435 NwaCegarLoop]: 677 mSDtfsCounter, 663 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 663 SdHoareTripleChecker+Valid, 677 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:38,564 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [663 Valid, 677 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:38,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2025-02-05 17:53:38,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 411. [2025-02-05 17:53:38,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 411 states, 376 states have (on average 1.5425531914893618) internal successors, (580), 378 states have internal predecessors, (580), 28 states have call successors, (28), 7 states have call predecessors, (28), 6 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-02-05 17:53:38,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 634 transitions. [2025-02-05 17:53:38,580 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 634 transitions. Word has length 68 [2025-02-05 17:53:38,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:53:38,580 INFO L471 AbstractCegarLoop]: Abstraction has 411 states and 634 transitions. [2025-02-05 17:53:38,581 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:38,581 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 634 transitions. [2025-02-05 17:53:38,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-02-05 17:53:38,583 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:53:38,584 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:53:38,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 17:53:38,584 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:53:38,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:53:38,584 INFO L85 PathProgramCache]: Analyzing trace with hash 1809278548, now seen corresponding path program 1 times [2025-02-05 17:53:38,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:53:38,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911669722] [2025-02-05 17:53:38,585 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:53:38,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:53:38,607 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-02-05 17:53:38,614 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-02-05 17:53:38,617 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:53:38,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:53:38,848 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,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:53:38,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911669722] [2025-02-05 17:53:38,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911669722] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:53:38,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:53:38,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:53:38,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628352319] [2025-02-05 17:53:38,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:53:38,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:53:38,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:53:38,852 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:53:38,852 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:53:38,852 INFO L87 Difference]: Start difference. First operand 411 states and 634 transitions. Second operand has 5 states, 5 states have (on average 33.6) internal successors, (168), 4 states have internal predecessors, (168), 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,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:53:39,490 INFO L93 Difference]: Finished difference Result 1239 states and 1928 transitions. [2025-02-05 17:53:39,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 17:53:39,492 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 4 states have internal predecessors, (168), 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 179 [2025-02-05 17:53:39,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:53:39,496 INFO L225 Difference]: With dead ends: 1239 [2025-02-05 17:53:39,496 INFO L226 Difference]: Without dead ends: 849 [2025-02-05 17:53:39,498 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:39,498 INFO L435 NwaCegarLoop]: 500 mSDtfsCounter, 1192 mSDsluCounter, 1289 mSDsCounter, 0 mSdLazyCounter, 637 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1212 SdHoareTripleChecker+Valid, 1789 SdHoareTripleChecker+Invalid, 697 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 637 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 17:53:39,498 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1212 Valid, 1789 Invalid, 697 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 637 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 17:53:39,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 849 states. [2025-02-05 17:53:39,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 849 to 818. [2025-02-05 17:53:39,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 818 states, 755 states have (on average 1.552317880794702) internal successors, (1172), 758 states have internal predecessors, (1172), 49 states have call successors, (49), 13 states have call predecessors, (49), 13 states have return successors, (48), 47 states have call predecessors, (48), 47 states have call successors, (48) [2025-02-05 17:53:39,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 818 states to 818 states and 1269 transitions. [2025-02-05 17:53:39,550 INFO L78 Accepts]: Start accepts. Automaton has 818 states and 1269 transitions. Word has length 179 [2025-02-05 17:53:39,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:53:39,551 INFO L471 AbstractCegarLoop]: Abstraction has 818 states and 1269 transitions. [2025-02-05 17:53:39,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 4 states have internal predecessors, (168), 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,552 INFO L276 IsEmpty]: Start isEmpty. Operand 818 states and 1269 transitions. [2025-02-05 17:53:39,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-02-05 17:53:39,553 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:53:39,553 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:53:39,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 17:53:39,554 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:53:39,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:53:39,555 INFO L85 PathProgramCache]: Analyzing trace with hash -1031074990, now seen corresponding path program 1 times [2025-02-05 17:53:39,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:53:39,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022375278] [2025-02-05 17:53:39,555 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:53:39,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:53:39,567 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-02-05 17:53:39,575 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-02-05 17:53:39,575 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:53:39,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:53:39,729 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,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:53:39,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022375278] [2025-02-05 17:53:39,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022375278] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:53:39,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:53:39,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:53:39,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820663574] [2025-02-05 17:53:39,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:53:39,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:53:39,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:53:39,731 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:53:39,731 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:53:39,731 INFO L87 Difference]: Start difference. First operand 818 states and 1269 transitions. Second operand has 6 states, 6 states have (on average 28.0) internal successors, (168), 5 states have internal predecessors, (168), 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,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:53:40,519 INFO L93 Difference]: Finished difference Result 2130 states and 3343 transitions. [2025-02-05 17:53:40,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:53:40,519 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 28.0) internal successors, (168), 5 states have internal predecessors, (168), 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 179 [2025-02-05 17:53:40,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:53:40,525 INFO L225 Difference]: With dead ends: 2130 [2025-02-05 17:53:40,525 INFO L226 Difference]: Without dead ends: 1333 [2025-02-05 17:53:40,527 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,527 INFO L435 NwaCegarLoop]: 854 mSDtfsCounter, 1201 mSDsluCounter, 2643 mSDsCounter, 0 mSdLazyCounter, 1097 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1221 SdHoareTripleChecker+Valid, 3497 SdHoareTripleChecker+Invalid, 1131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1097 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 17:53:40,527 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1221 Valid, 3497 Invalid, 1131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 1097 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 17:53:40,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1333 states. [2025-02-05 17:53:40,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1333 to 1198. [2025-02-05 17:53:40,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1198 states, 1107 states have (on average 1.5447154471544715) internal successors, (1710), 1111 states have internal predecessors, (1710), 70 states have call successors, (70), 19 states have call predecessors, (70), 20 states have return successors, (72), 69 states have call predecessors, (72), 68 states have call successors, (72) [2025-02-05 17:53:40,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1198 states to 1198 states and 1852 transitions. [2025-02-05 17:53:40,567 INFO L78 Accepts]: Start accepts. Automaton has 1198 states and 1852 transitions. Word has length 179 [2025-02-05 17:53:40,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:53:40,567 INFO L471 AbstractCegarLoop]: Abstraction has 1198 states and 1852 transitions. [2025-02-05 17:53:40,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.0) internal successors, (168), 5 states have internal predecessors, (168), 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,567 INFO L276 IsEmpty]: Start isEmpty. Operand 1198 states and 1852 transitions. [2025-02-05 17:53:40,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-02-05 17:53:40,572 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:53:40,572 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:53:40,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 17:53:40,572 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:53:40,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:53:40,573 INFO L85 PathProgramCache]: Analyzing trace with hash -1915810797, now seen corresponding path program 1 times [2025-02-05 17:53:40,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:53:40,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825172515] [2025-02-05 17:53:40,573 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:53:40,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:53:40,584 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-02-05 17:53:40,587 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-02-05 17:53:40,588 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:53:40,588 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:53:40,774 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,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:53:40,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825172515] [2025-02-05 17:53:40,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825172515] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:53:40,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:53:40,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:53:40,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123392145] [2025-02-05 17:53:40,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:53:40,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:53:40,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:53:40,776 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:53:40,776 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:53:40,776 INFO L87 Difference]: Start difference. First operand 1198 states and 1852 transitions. Second operand has 6 states, 6 states have (on average 28.0) internal successors, (168), 5 states have internal predecessors, (168), 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,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:53:41,574 INFO L93 Difference]: Finished difference Result 3340 states and 5231 transitions. [2025-02-05 17:53:41,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:53:41,575 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 28.0) internal successors, (168), 5 states have internal predecessors, (168), 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 179 [2025-02-05 17:53:41,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:53:41,584 INFO L225 Difference]: With dead ends: 3340 [2025-02-05 17:53:41,584 INFO L226 Difference]: Without dead ends: 2163 [2025-02-05 17:53:41,587 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-02-05 17:53:41,587 INFO L435 NwaCegarLoop]: 850 mSDtfsCounter, 1196 mSDsluCounter, 2631 mSDsCounter, 0 mSdLazyCounter, 1097 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1216 SdHoareTripleChecker+Valid, 3481 SdHoareTripleChecker+Invalid, 1131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1097 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 17:53:41,587 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1216 Valid, 3481 Invalid, 1131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 1097 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 17:53:41,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2163 states. [2025-02-05 17:53:41,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2163 to 2007. [2025-02-05 17:53:41,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2007 states, 1858 states have (on average 1.5484391819160388) internal successors, (2877), 1866 states have internal predecessors, (2877), 112 states have call successors, (112), 31 states have call predecessors, (112), 36 states have return successors, (126), 113 states have call predecessors, (126), 110 states have call successors, (126) [2025-02-05 17:53:41,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2007 states to 2007 states and 3115 transitions. [2025-02-05 17:53:41,665 INFO L78 Accepts]: Start accepts. Automaton has 2007 states and 3115 transitions. Word has length 179 [2025-02-05 17:53:41,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:53:41,665 INFO L471 AbstractCegarLoop]: Abstraction has 2007 states and 3115 transitions. [2025-02-05 17:53:41,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.0) internal successors, (168), 5 states have internal predecessors, (168), 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,666 INFO L276 IsEmpty]: Start isEmpty. Operand 2007 states and 3115 transitions. [2025-02-05 17:53:41,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-02-05 17:53:41,667 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:53:41,668 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:53:41,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 17:53:41,668 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:53:41,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:53:41,668 INFO L85 PathProgramCache]: Analyzing trace with hash 2073521970, now seen corresponding path program 1 times [2025-02-05 17:53:41,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:53:41,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556664713] [2025-02-05 17:53:41,668 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:53:41,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:53:41,678 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-02-05 17:53:41,682 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-02-05 17:53:41,682 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:53:41,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:53:41,822 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,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:53:41,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556664713] [2025-02-05 17:53:41,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556664713] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:53:41,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:53:41,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:53:41,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623103212] [2025-02-05 17:53:41,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:53:41,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:53:41,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:53:41,824 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:53:41,824 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:53:41,824 INFO L87 Difference]: Start difference. First operand 2007 states and 3115 transitions. Second operand has 6 states, 6 states have (on average 28.0) internal successors, (168), 5 states have internal predecessors, (168), 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,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:53:42,522 INFO L93 Difference]: Finished difference Result 5951 states and 9392 transitions. [2025-02-05 17:53:42,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:53:42,522 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 28.0) internal successors, (168), 5 states have internal predecessors, (168), 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 179 [2025-02-05 17:53:42,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:53:42,537 INFO L225 Difference]: With dead ends: 5951 [2025-02-05 17:53:42,537 INFO L226 Difference]: Without dead ends: 3965 [2025-02-05 17:53:42,541 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:42,542 INFO L435 NwaCegarLoop]: 847 mSDtfsCounter, 1191 mSDsluCounter, 2622 mSDsCounter, 0 mSdLazyCounter, 1097 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1211 SdHoareTripleChecker+Valid, 3469 SdHoareTripleChecker+Invalid, 1131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1097 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 17:53:42,542 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1211 Valid, 3469 Invalid, 1131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 1097 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 17:53:42,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3965 states. [2025-02-05 17:53:42,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3965 to 3766. [2025-02-05 17:53:42,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3766 states, 3495 states have (on average 1.5659513590844063) internal successors, (5473), 3517 states have internal predecessors, (5473), 196 states have call successors, (196), 55 states have call predecessors, (196), 74 states have return successors, (258), 201 states have call predecessors, (258), 194 states have call successors, (258) [2025-02-05 17:53:42,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3766 states to 3766 states and 5927 transitions. [2025-02-05 17:53:42,652 INFO L78 Accepts]: Start accepts. Automaton has 3766 states and 5927 transitions. Word has length 179 [2025-02-05 17:53:42,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:53:42,653 INFO L471 AbstractCegarLoop]: Abstraction has 3766 states and 5927 transitions. [2025-02-05 17:53:42,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.0) internal successors, (168), 5 states have internal predecessors, (168), 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,653 INFO L276 IsEmpty]: Start isEmpty. Operand 3766 states and 5927 transitions. [2025-02-05 17:53:42,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-02-05 17:53:42,655 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:53:42,656 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:53:42,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 17:53:42,656 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:53:42,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:53:42,656 INFO L85 PathProgramCache]: Analyzing trace with hash 1370926131, now seen corresponding path program 1 times [2025-02-05 17:53:42,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:53:42,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866306648] [2025-02-05 17:53:42,657 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:53:42,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:53:42,666 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-02-05 17:53:42,671 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-02-05 17:53:42,671 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:53:42,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:53:42,808 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,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:53:42,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866306648] [2025-02-05 17:53:42,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866306648] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:53:42,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:53:42,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:53:42,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610033218] [2025-02-05 17:53:42,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:53:42,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:53:42,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:53:42,810 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:53:42,810 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:53:42,810 INFO L87 Difference]: Start difference. First operand 3766 states and 5927 transitions. Second operand has 6 states, 6 states have (on average 28.0) internal successors, (168), 5 states have internal predecessors, (168), 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,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:53:43,704 INFO L93 Difference]: Finished difference Result 11718 states and 18846 transitions. [2025-02-05 17:53:43,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:53:43,705 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 28.0) internal successors, (168), 5 states have internal predecessors, (168), 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 179 [2025-02-05 17:53:43,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:53:43,735 INFO L225 Difference]: With dead ends: 11718 [2025-02-05 17:53:43,735 INFO L226 Difference]: Without dead ends: 7973 [2025-02-05 17:53:43,745 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:43,747 INFO L435 NwaCegarLoop]: 844 mSDtfsCounter, 1186 mSDsluCounter, 2613 mSDsCounter, 0 mSdLazyCounter, 1097 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1206 SdHoareTripleChecker+Valid, 3457 SdHoareTripleChecker+Invalid, 1131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1097 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 17:53:43,747 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1206 Valid, 3457 Invalid, 1131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 1097 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 17:53:43,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7973 states. [2025-02-05 17:53:43,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7973 to 7689. [2025-02-05 17:53:43,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7689 states, 7156 states have (on average 1.5954443823365008) internal successors, (11417), 7224 states have internal predecessors, (11417), 364 states have call successors, (364), 103 states have call predecessors, (364), 168 states have return successors, (618), 377 states have call predecessors, (618), 362 states have call successors, (618) [2025-02-05 17:53:43,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7689 states to 7689 states and 12399 transitions. [2025-02-05 17:53:43,977 INFO L78 Accepts]: Start accepts. Automaton has 7689 states and 12399 transitions. Word has length 179 [2025-02-05 17:53:43,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:53:43,978 INFO L471 AbstractCegarLoop]: Abstraction has 7689 states and 12399 transitions. [2025-02-05 17:53:43,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.0) internal successors, (168), 5 states have internal predecessors, (168), 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,978 INFO L276 IsEmpty]: Start isEmpty. Operand 7689 states and 12399 transitions. [2025-02-05 17:53:43,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-02-05 17:53:43,981 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:53:43,982 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:53:43,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 17:53:43,982 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:53:43,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:53:43,982 INFO L85 PathProgramCache]: Analyzing trace with hash -1976874222, now seen corresponding path program 1 times [2025-02-05 17:53:43,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:53:43,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197783188] [2025-02-05 17:53:43,983 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:53:43,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:53:43,992 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-02-05 17:53:43,996 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-02-05 17:53:43,996 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:53:43,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:53:44,137 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,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:53:44,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197783188] [2025-02-05 17:53:44,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197783188] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:53:44,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:53:44,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:53:44,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089507433] [2025-02-05 17:53:44,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:53:44,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:53:44,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:53:44,139 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:53:44,139 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:53:44,139 INFO L87 Difference]: Start difference. First operand 7689 states and 12399 transitions. Second operand has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 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,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:53:44,696 INFO L93 Difference]: Finished difference Result 17183 states and 28457 transitions. [2025-02-05 17:53:44,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:53:44,697 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 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 179 [2025-02-05 17:53:44,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:53:44,730 INFO L225 Difference]: With dead ends: 17183 [2025-02-05 17:53:44,730 INFO L226 Difference]: Without dead ends: 9515 [2025-02-05 17:53:44,746 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:44,746 INFO L435 NwaCegarLoop]: 481 mSDtfsCounter, 849 mSDsluCounter, 803 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 869 SdHoareTripleChecker+Valid, 1284 SdHoareTripleChecker+Invalid, 483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 17:53:44,746 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [869 Valid, 1284 Invalid, 483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 448 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 17:53:44,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9515 states. [2025-02-05 17:53:44,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9515 to 7689. [2025-02-05 17:53:45,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7689 states, 7156 states have (on average 1.593068753493572) internal successors, (11400), 7224 states have internal predecessors, (11400), 364 states have call successors, (364), 103 states have call predecessors, (364), 168 states have return successors, (618), 377 states have call predecessors, (618), 362 states have call successors, (618) [2025-02-05 17:53:45,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7689 states to 7689 states and 12382 transitions. [2025-02-05 17:53:45,036 INFO L78 Accepts]: Start accepts. Automaton has 7689 states and 12382 transitions. Word has length 179 [2025-02-05 17:53:45,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:53:45,036 INFO L471 AbstractCegarLoop]: Abstraction has 7689 states and 12382 transitions. [2025-02-05 17:53:45,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 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,037 INFO L276 IsEmpty]: Start isEmpty. Operand 7689 states and 12382 transitions. [2025-02-05 17:53:45,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-02-05 17:53:45,041 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:53:45,041 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:53:45,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 17:53:45,042 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:53:45,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:53:45,042 INFO L85 PathProgramCache]: Analyzing trace with hash -1253583789, now seen corresponding path program 1 times [2025-02-05 17:53:45,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:53:45,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624251047] [2025-02-05 17:53:45,042 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:53:45,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:53:45,054 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-02-05 17:53:45,061 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-02-05 17:53:45,061 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:53:45,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:53:45,196 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:45,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:53:45,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624251047] [2025-02-05 17:53:45,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624251047] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:53:45,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:53:45,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:53:45,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446130474] [2025-02-05 17:53:45,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:53:45,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:53:45,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:53:45,199 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:53:45,199 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:53:45,199 INFO L87 Difference]: Start difference. First operand 7689 states and 12382 transitions. Second operand has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 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,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:53:46,022 INFO L93 Difference]: Finished difference Result 17017 states and 28091 transitions. [2025-02-05 17:53:46,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:53:46,022 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 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 179 [2025-02-05 17:53:46,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:53:46,104 INFO L225 Difference]: With dead ends: 17017 [2025-02-05 17:53:46,104 INFO L226 Difference]: Without dead ends: 9349 [2025-02-05 17:53:46,149 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,150 INFO L435 NwaCegarLoop]: 476 mSDtfsCounter, 845 mSDsluCounter, 794 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 865 SdHoareTripleChecker+Valid, 1270 SdHoareTripleChecker+Invalid, 483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 17:53:46,150 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [865 Valid, 1270 Invalid, 483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 448 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 17:53:46,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9349 states. [2025-02-05 17:53:46,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9349 to 7689. [2025-02-05 17:53:46,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7689 states, 7156 states have (on average 1.5906931246506428) internal successors, (11383), 7224 states have internal predecessors, (11383), 364 states have call successors, (364), 103 states have call predecessors, (364), 168 states have return successors, (618), 377 states have call predecessors, (618), 362 states have call successors, (618) [2025-02-05 17:53:46,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7689 states to 7689 states and 12365 transitions. [2025-02-05 17:53:46,525 INFO L78 Accepts]: Start accepts. Automaton has 7689 states and 12365 transitions. Word has length 179 [2025-02-05 17:53:46,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:53:46,525 INFO L471 AbstractCegarLoop]: Abstraction has 7689 states and 12365 transitions. [2025-02-05 17:53:46,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 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,526 INFO L276 IsEmpty]: Start isEmpty. Operand 7689 states and 12365 transitions. [2025-02-05 17:53:46,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-02-05 17:53:46,530 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:53:46,530 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:53:46,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 17:53:46,530 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:53:46,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:53:46,530 INFO L85 PathProgramCache]: Analyzing trace with hash -1060652588, now seen corresponding path program 1 times [2025-02-05 17:53:46,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:53:46,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946324274] [2025-02-05 17:53:46,531 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:53:46,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:53:46,539 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-02-05 17:53:46,543 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-02-05 17:53:46,543 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:53:46,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:53:46,649 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,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:53:46,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946324274] [2025-02-05 17:53:46,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946324274] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:53:46,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:53:46,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:53:46,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903603534] [2025-02-05 17:53:46,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:53:46,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:53:46,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:53:46,651 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:53:46,651 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:53:46,651 INFO L87 Difference]: Start difference. First operand 7689 states and 12365 transitions. Second operand has 6 states, 6 states have (on average 28.0) internal successors, (168), 5 states have internal predecessors, (168), 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:47,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:53:47,745 INFO L93 Difference]: Finished difference Result 24513 states and 40426 transitions. [2025-02-05 17:53:47,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:53:47,746 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 28.0) internal successors, (168), 5 states have internal predecessors, (168), 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 179 [2025-02-05 17:53:47,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:53:47,825 INFO L225 Difference]: With dead ends: 24513 [2025-02-05 17:53:47,826 INFO L226 Difference]: Without dead ends: 16845 [2025-02-05 17:53:47,858 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:47,858 INFO L435 NwaCegarLoop]: 827 mSDtfsCounter, 1162 mSDsluCounter, 2566 mSDsCounter, 0 mSdLazyCounter, 1097 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1182 SdHoareTripleChecker+Valid, 3393 SdHoareTripleChecker+Invalid, 1131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1097 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 17:53:47,859 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1182 Valid, 3393 Invalid, 1131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 1097 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 17:53:47,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16845 states. [2025-02-05 17:53:48,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16845 to 16453. [2025-02-05 17:53:48,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16453 states, 15342 states have (on average 1.623321600834311) internal successors, (24905), 15556 states have internal predecessors, (24905), 700 states have call successors, (700), 199 states have call predecessors, (700), 410 states have return successors, (1722), 729 states have call predecessors, (1722), 698 states have call successors, (1722) [2025-02-05 17:53:48,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16453 states to 16453 states and 27327 transitions. [2025-02-05 17:53:48,805 INFO L78 Accepts]: Start accepts. Automaton has 16453 states and 27327 transitions. Word has length 179 [2025-02-05 17:53:48,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:53:48,806 INFO L471 AbstractCegarLoop]: Abstraction has 16453 states and 27327 transitions. [2025-02-05 17:53:48,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.0) internal successors, (168), 5 states have internal predecessors, (168), 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,807 INFO L276 IsEmpty]: Start isEmpty. Operand 16453 states and 27327 transitions. [2025-02-05 17:53:48,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-02-05 17:53:48,814 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:53:48,815 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:53:48,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 17:53:48,815 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:53:48,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:53:48,816 INFO L85 PathProgramCache]: Analyzing trace with hash -1192976333, now seen corresponding path program 1 times [2025-02-05 17:53:48,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:53:48,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941987889] [2025-02-05 17:53:48,816 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:53:48,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:53:48,829 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-02-05 17:53:48,836 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-02-05 17:53:48,836 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:53:48,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:53:48,957 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:48,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:53:48,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941987889] [2025-02-05 17:53:48,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941987889] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:53:48,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:53:48,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:53:48,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882071183] [2025-02-05 17:53:48,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:53:48,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:53:48,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:53:48,959 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:53:48,959 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:53:48,959 INFO L87 Difference]: Start difference. First operand 16453 states and 27327 transitions. Second operand has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 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:49,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:53:49,658 INFO L93 Difference]: Finished difference Result 37295 states and 63795 transitions. [2025-02-05 17:53:49,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:53:49,658 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 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 179 [2025-02-05 17:53:49,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:53:49,723 INFO L225 Difference]: With dead ends: 37295 [2025-02-05 17:53:49,724 INFO L226 Difference]: Without dead ends: 20863 [2025-02-05 17:53:49,762 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:49,763 INFO L435 NwaCegarLoop]: 471 mSDtfsCounter, 841 mSDsluCounter, 785 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 861 SdHoareTripleChecker+Valid, 1256 SdHoareTripleChecker+Invalid, 483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 17:53:49,763 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [861 Valid, 1256 Invalid, 483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 448 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 17:53:49,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20863 states. [2025-02-05 17:53:50,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20863 to 16453. [2025-02-05 17:53:50,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16453 states, 15342 states have (on average 1.6211706426802241) internal successors, (24872), 15556 states have internal predecessors, (24872), 700 states have call successors, (700), 199 states have call predecessors, (700), 410 states have return successors, (1722), 729 states have call predecessors, (1722), 698 states have call successors, (1722) [2025-02-05 17:53:50,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16453 states to 16453 states and 27294 transitions. [2025-02-05 17:53:50,355 INFO L78 Accepts]: Start accepts. Automaton has 16453 states and 27294 transitions. Word has length 179 [2025-02-05 17:53:50,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:53:50,356 INFO L471 AbstractCegarLoop]: Abstraction has 16453 states and 27294 transitions. [2025-02-05 17:53:50,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 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,356 INFO L276 IsEmpty]: Start isEmpty. Operand 16453 states and 27294 transitions. [2025-02-05 17:53:50,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-02-05 17:53:50,362 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:53:50,362 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 17:53:50,362 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:53:50,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:53:50,363 INFO L85 PathProgramCache]: Analyzing trace with hash -227413516, now seen corresponding path program 1 times [2025-02-05 17:53:50,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:53:50,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440623596] [2025-02-05 17:53:50,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:53:50,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:53:50,380 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-02-05 17:53:50,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-02-05 17:53:50,386 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:53:50,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:53:50,581 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,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:53:50,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440623596] [2025-02-05 17:53:50,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440623596] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:53:50,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:53:50,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:53:50,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321408685] [2025-02-05 17:53:50,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:53:50,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:53:50,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:53:50,584 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:53:50,584 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:53:50,585 INFO L87 Difference]: Start difference. First operand 16453 states and 27294 transitions. Second operand has 6 states, 6 states have (on average 28.0) internal successors, (168), 5 states have internal predecessors, (168), 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,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:53:52,161 INFO L93 Difference]: Finished difference Result 53631 states and 91899 transitions. [2025-02-05 17:53:52,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:53:52,161 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 28.0) internal successors, (168), 5 states have internal predecessors, (168), 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 179 [2025-02-05 17:53:52,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:53:52,294 INFO L225 Difference]: With dead ends: 53631 [2025-02-05 17:53:52,294 INFO L226 Difference]: Without dead ends: 37199 [2025-02-05 17:53:52,347 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:52,348 INFO L435 NwaCegarLoop]: 819 mSDtfsCounter, 1149 mSDsluCounter, 2543 mSDsCounter, 0 mSdLazyCounter, 1097 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1169 SdHoareTripleChecker+Valid, 3362 SdHoareTripleChecker+Invalid, 1131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1097 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 17:53:52,348 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1169 Valid, 3362 Invalid, 1131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 1097 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 17:53:52,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37199 states. [2025-02-05 17:53:53,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37199 to 36573. [2025-02-05 17:53:53,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36573 states, 34144 states have (on average 1.6566893158388003) internal successors, (56566), 34812 states have internal predecessors, (56566), 1372 states have call successors, (1372), 391 states have call predecessors, (1372), 1056 states have return successors, (5466), 1433 states have call predecessors, (5466), 1370 states have call successors, (5466) [2025-02-05 17:53:53,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36573 states to 36573 states and 63404 transitions. [2025-02-05 17:53:53,909 INFO L78 Accepts]: Start accepts. Automaton has 36573 states and 63404 transitions. Word has length 179 [2025-02-05 17:53:53,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:53:53,909 INFO L471 AbstractCegarLoop]: Abstraction has 36573 states and 63404 transitions. [2025-02-05 17:53:53,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.0) internal successors, (168), 5 states have internal predecessors, (168), 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:53,909 INFO L276 IsEmpty]: Start isEmpty. Operand 36573 states and 63404 transitions. [2025-02-05 17:53:53,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-02-05 17:53:53,921 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:53:53,921 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:53:53,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 17:53:53,922 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:53:53,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:53:53,923 INFO L85 PathProgramCache]: Analyzing trace with hash -889002989, now seen corresponding path program 1 times [2025-02-05 17:53:53,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:53:53,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335932638] [2025-02-05 17:53:53,923 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:53:53,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:53:53,937 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-02-05 17:53:53,943 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-02-05 17:53:53,943 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:53:53,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:53:54,036 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:54,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:53:54,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335932638] [2025-02-05 17:53:54,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335932638] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:53:54,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:53:54,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:53:54,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107287051] [2025-02-05 17:53:54,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:53:54,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:53:54,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:53:54,039 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:53:54,039 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:53:54,039 INFO L87 Difference]: Start difference. First operand 36573 states and 63404 transitions. Second operand has 6 states, 6 states have (on average 28.0) internal successors, (168), 5 states have internal predecessors, (168), 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:56,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:53:56,712 INFO L93 Difference]: Finished difference Result 122001 states and 220903 transitions. [2025-02-05 17:53:56,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:53:56,713 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 28.0) internal successors, (168), 5 states have internal predecessors, (168), 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 179 [2025-02-05 17:53:56,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:53:57,104 INFO L225 Difference]: With dead ends: 122001 [2025-02-05 17:53:57,104 INFO L226 Difference]: Without dead ends: 85449 [2025-02-05 17:53:57,239 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:57,240 INFO L435 NwaCegarLoop]: 816 mSDtfsCounter, 1144 mSDsluCounter, 2534 mSDsCounter, 0 mSdLazyCounter, 1097 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1164 SdHoareTripleChecker+Valid, 3350 SdHoareTripleChecker+Invalid, 1131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1097 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 17:53:57,241 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1164 Valid, 3350 Invalid, 1131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 1097 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 17:53:57,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85449 states. [2025-02-05 17:54:00,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85449 to 84346. [2025-02-05 17:54:00,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84346 states, 78795 states have (on average 1.6946506758043023) internal successors, (133530), 80857 states have internal predecessors, (133530), 2716 states have call successors, (2716), 775 states have call predecessors, (2716), 2834 states have return successors, (19098), 2841 states have call predecessors, (19098), 2714 states have call successors, (19098) [2025-02-05 17:54:00,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84346 states to 84346 states and 155344 transitions. [2025-02-05 17:54:01,007 INFO L78 Accepts]: Start accepts. Automaton has 84346 states and 155344 transitions. Word has length 179 [2025-02-05 17:54:01,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:54:01,009 INFO L471 AbstractCegarLoop]: Abstraction has 84346 states and 155344 transitions. [2025-02-05 17:54:01,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.0) internal successors, (168), 5 states have internal predecessors, (168), 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:01,009 INFO L276 IsEmpty]: Start isEmpty. Operand 84346 states and 155344 transitions. [2025-02-05 17:54:01,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-02-05 17:54:01,032 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:54:01,032 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:54:01,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-05 17:54:01,033 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:54:01,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:54:01,033 INFO L85 PathProgramCache]: Analyzing trace with hash 59486740, now seen corresponding path program 1 times [2025-02-05 17:54:01,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:54:01,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236475322] [2025-02-05 17:54:01,034 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:54:01,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:54:01,046 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-02-05 17:54:01,056 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-02-05 17:54:01,057 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:54:01,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:54:01,174 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:54:01,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:54:01,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236475322] [2025-02-05 17:54:01,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236475322] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:54:01,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:54:01,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:54:01,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834463140] [2025-02-05 17:54:01,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:54:01,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:54:01,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:54:01,176 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:54:01,176 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:54:01,176 INFO L87 Difference]: Start difference. First operand 84346 states and 155344 transitions. Second operand has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 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,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:54:05,736 INFO L93 Difference]: Finished difference Result 201506 states and 386399 transitions. [2025-02-05 17:54:05,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:54:05,737 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 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 179 [2025-02-05 17:54:05,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:54:06,393 INFO L225 Difference]: With dead ends: 201506 [2025-02-05 17:54:06,393 INFO L226 Difference]: Without dead ends: 117181 [2025-02-05 17:54:06,653 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:54:06,654 INFO L435 NwaCegarLoop]: 464 mSDtfsCounter, 836 mSDsluCounter, 772 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 856 SdHoareTripleChecker+Valid, 1236 SdHoareTripleChecker+Invalid, 483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 17:54:06,654 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [856 Valid, 1236 Invalid, 483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 448 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 17:54:06,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117181 states. [2025-02-05 17:54:11,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117181 to 84346. [2025-02-05 17:54:11,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84346 states, 78795 states have (on average 1.693013516086046) internal successors, (133401), 80857 states have internal predecessors, (133401), 2716 states have call successors, (2716), 775 states have call predecessors, (2716), 2834 states have return successors, (19098), 2841 states have call predecessors, (19098), 2714 states have call successors, (19098) [2025-02-05 17:54:11,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84346 states to 84346 states and 155215 transitions. [2025-02-05 17:54:11,792 INFO L78 Accepts]: Start accepts. Automaton has 84346 states and 155215 transitions. Word has length 179 [2025-02-05 17:54:11,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:54:11,793 INFO L471 AbstractCegarLoop]: Abstraction has 84346 states and 155215 transitions. [2025-02-05 17:54:11,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 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:11,793 INFO L276 IsEmpty]: Start isEmpty. Operand 84346 states and 155215 transitions. [2025-02-05 17:54:11,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-02-05 17:54:11,813 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:54:11,813 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54:11,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-05 17:54:11,814 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:54:11,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:54:11,814 INFO L85 PathProgramCache]: Analyzing trace with hash 228630515, now seen corresponding path program 1 times [2025-02-05 17:54:11,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:54:11,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940411301] [2025-02-05 17:54:11,815 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:54:11,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:54:11,835 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-02-05 17:54:11,840 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-02-05 17:54:11,841 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:54:11,841 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:54:11,973 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:54:11,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:54:11,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940411301] [2025-02-05 17:54:11,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940411301] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:54:11,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:54:11,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:54:11,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549696737] [2025-02-05 17:54:11,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:54:11,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:54:11,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:54:11,975 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:54:11,975 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:54:11,975 INFO L87 Difference]: Start difference. First operand 84346 states and 155215 transitions. Second operand has 6 states, 6 states have (on average 28.0) internal successors, (168), 5 states have internal predecessors, (168), 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:18,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:54:18,296 INFO L93 Difference]: Finished difference Result 296428 states and 573443 transitions. [2025-02-05 17:54:18,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:54:18,296 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 28.0) internal successors, (168), 5 states have internal predecessors, (168), 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 179 [2025-02-05 17:54:18,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted.