./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/Problem05_label43+token_ring.06.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/Problem05_label43+token_ring.06.cil-2.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d6bcae8fdfc31b6b7d4775dfad537e0ca42e395c3a990a218ee828052c4f57f7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 05:18:29,860 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 05:18:29,929 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 05:18:29,939 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 05:18:29,940 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 05:18:29,966 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 05:18:29,967 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 05:18:29,967 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 05:18:29,968 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 05:18:29,968 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 05:18:29,968 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 05:18:29,968 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 05:18:29,968 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 05:18:29,968 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 05:18:29,969 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 05:18:29,969 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 05:18:29,969 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 05:18:29,969 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 05:18:29,969 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 05:18:29,969 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 05:18:29,969 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 05:18:29,969 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 05:18:29,969 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 05:18:29,969 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 05:18:29,969 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 05:18:29,969 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 05:18:29,970 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 05:18:29,970 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 05:18:29,970 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 05:18:29,970 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 05:18:29,970 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 05:18:29,970 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 05:18:29,970 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 05:18:29,970 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 05:18:29,970 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 05:18:29,970 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 05:18:29,970 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 05:18:29,970 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 05:18:29,971 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 05:18:29,971 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 05:18:29,971 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 05:18:29,971 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 05:18:29,971 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 05:18:29,971 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 05:18:29,971 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 05:18:29,971 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 05:18:29,971 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 05:18:29,971 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 05:18:29,973 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 -> d6bcae8fdfc31b6b7d4775dfad537e0ca42e395c3a990a218ee828052c4f57f7 [2025-01-09 05:18:30,236 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 05:18:30,245 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 05:18:30,249 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 05:18:30,250 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 05:18:30,251 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 05:18:30,252 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/Problem05_label43+token_ring.06.cil-2.c [2025-01-09 05:18:31,560 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2c713d86e/60999a221ab6427e8c07a41677796031/FLAG3e15f20f9 [2025-01-09 05:18:32,340 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 05:18:32,342 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label43+token_ring.06.cil-2.c [2025-01-09 05:18:32,402 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2c713d86e/60999a221ab6427e8c07a41677796031/FLAG3e15f20f9 [2025-01-09 05:18:32,422 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2c713d86e/60999a221ab6427e8c07a41677796031 [2025-01-09 05:18:32,425 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 05:18:32,426 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 05:18:32,428 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 05:18:32,428 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 05:18:32,432 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 05:18:32,432 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 05:18:32" (1/1) ... [2025-01-09 05:18:32,433 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1fcae284 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:18:32, skipping insertion in model container [2025-01-09 05:18:32,434 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 05:18:32" (1/1) ... [2025-01-09 05:18:32,604 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 05:18:34,059 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/Problem05_label43+token_ring.06.cil-2.c[381679,381692] [2025-01-09 05:18:34,093 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/Problem05_label43+token_ring.06.cil-2.c[383339,383352] [2025-01-09 05:18:34,327 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 05:18:34,339 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 05:18:34,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/Problem05_label43+token_ring.06.cil-2.c[381679,381692] [2025-01-09 05:18:34,988 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/Problem05_label43+token_ring.06.cil-2.c[383339,383352] [2025-01-09 05:18:35,007 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 05:18:35,070 INFO L204 MainTranslator]: Completed translation [2025-01-09 05:18:35,071 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:18:35 WrapperNode [2025-01-09 05:18:35,072 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 05:18:35,073 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 05:18:35,073 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 05:18:35,074 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 05:18:35,079 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:18:35" (1/1) ... [2025-01-09 05:18:35,186 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:18:35" (1/1) ... [2025-01-09 05:18:35,546 INFO L138 Inliner]: procedures = 56, calls = 59, calls flagged for inlining = 34, calls inlined = 34, statements flattened = 12843 [2025-01-09 05:18:35,546 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 05:18:35,547 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 05:18:35,547 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 05:18:35,547 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 05:18:35,556 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:18:35" (1/1) ... [2025-01-09 05:18:35,556 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:18:35" (1/1) ... [2025-01-09 05:18:35,608 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:18:35" (1/1) ... [2025-01-09 05:18:35,795 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-09 05:18:35,796 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:18:35" (1/1) ... [2025-01-09 05:18:35,797 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:18:35" (1/1) ... [2025-01-09 05:18:36,003 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:18:35" (1/1) ... [2025-01-09 05:18:36,031 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:18:35" (1/1) ... [2025-01-09 05:18:36,084 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:18:35" (1/1) ... [2025-01-09 05:18:36,126 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:18:35" (1/1) ... [2025-01-09 05:18:36,158 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:18:35" (1/1) ... [2025-01-09 05:18:36,223 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 05:18:36,226 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 05:18:36,226 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 05:18:36,226 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 05:18:36,227 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:18:35" (1/1) ... [2025-01-09 05:18:36,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 05:18:36,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:18:36,255 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 05:18:36,260 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 05:18:36,277 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 05:18:36,277 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2025-01-09 05:18:36,277 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2025-01-09 05:18:36,277 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-01-09 05:18:36,278 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-01-09 05:18:36,278 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2025-01-09 05:18:36,278 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2025-01-09 05:18:36,278 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2025-01-09 05:18:36,278 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2025-01-09 05:18:36,278 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2025-01-09 05:18:36,278 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2025-01-09 05:18:36,278 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2025-01-09 05:18:36,278 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2025-01-09 05:18:36,278 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 05:18:36,279 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 05:18:36,279 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 05:18:36,379 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 05:18:36,381 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 05:18:44,087 INFO L? ?]: Removed 1719 outVars from TransFormulas that were not future-live. [2025-01-09 05:18:44,088 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 05:18:44,151 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 05:18:44,155 INFO L312 CfgBuilder]: Removed 10 assume(true) statements. [2025-01-09 05:18:44,156 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 05:18:44 BoogieIcfgContainer [2025-01-09 05:18:44,156 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 05:18:44,158 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 05:18:44,158 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 05:18:44,163 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 05:18:44,163 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 05:18:32" (1/3) ... [2025-01-09 05:18:44,163 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46f150c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 05:18:44, skipping insertion in model container [2025-01-09 05:18:44,163 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:18:35" (2/3) ... [2025-01-09 05:18:44,164 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46f150c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 05:18:44, skipping insertion in model container [2025-01-09 05:18:44,164 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 05:18:44" (3/3) ... [2025-01-09 05:18:44,165 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem05_label43+token_ring.06.cil-2.c [2025-01-09 05:18:44,177 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 05:18:44,180 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem05_label43+token_ring.06.cil-2.c that has 7 procedures, 2413 locations, 1 initial locations, 10 loop locations, and 2 error locations. [2025-01-09 05:18:44,277 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 05:18:44,292 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;@7aceee3c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 05:18:44,293 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-01-09 05:18:44,305 INFO L276 IsEmpty]: Start isEmpty. Operand has 2413 states, 2385 states have (on average 1.8469601677148848) internal successors, (4405), 2387 states have internal predecessors, (4405), 20 states have call successors, (20), 6 states have call predecessors, (20), 6 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-01-09 05:18:44,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-01-09 05:18:44,323 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:18:44,324 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] [2025-01-09 05:18:44,324 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:18:44,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:18:44,329 INFO L85 PathProgramCache]: Analyzing trace with hash -1860339110, now seen corresponding path program 1 times [2025-01-09 05:18:44,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:18:44,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298535676] [2025-01-09 05:18:44,339 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:18:44,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:18:44,422 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-01-09 05:18:44,457 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-01-09 05:18:44,457 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:18:44,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:18:44,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:18:44,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:18:44,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298535676] [2025-01-09 05:18:44,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298535676] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:18:44,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:18:44,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:18:44,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863117538] [2025-01-09 05:18:44,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:18:44,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:18:44,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:18:44,754 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:18:44,755 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:18:44,763 INFO L87 Difference]: Start difference. First operand has 2413 states, 2385 states have (on average 1.8469601677148848) internal successors, (4405), 2387 states have internal predecessors, (4405), 20 states have call successors, (20), 6 states have call predecessors, (20), 6 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:18:44,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:18:44,988 INFO L93 Difference]: Finished difference Result 4815 states and 8869 transitions. [2025-01-09 05:18:44,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:18:44,990 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 110 [2025-01-09 05:18:44,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:18:45,013 INFO L225 Difference]: With dead ends: 4815 [2025-01-09 05:18:45,013 INFO L226 Difference]: Without dead ends: 2346 [2025-01-09 05:18:45,025 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:18:45,028 INFO L435 NwaCegarLoop]: 4372 mSDtfsCounter, 340 mSDsluCounter, 4022 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 340 SdHoareTripleChecker+Valid, 8394 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:18:45,029 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [340 Valid, 8394 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:18:45,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2346 states. [2025-01-09 05:18:45,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2346 to 2346. [2025-01-09 05:18:45,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2346 states, 2318 states have (on average 1.8395168248490077) internal successors, (4264), 2320 states have internal predecessors, (4264), 20 states have call successors, (20), 6 states have call predecessors, (20), 6 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-01-09 05:18:45,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2346 states to 2346 states and 4304 transitions. [2025-01-09 05:18:45,174 INFO L78 Accepts]: Start accepts. Automaton has 2346 states and 4304 transitions. Word has length 110 [2025-01-09 05:18:45,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:18:45,176 INFO L471 AbstractCegarLoop]: Abstraction has 2346 states and 4304 transitions. [2025-01-09 05:18:45,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:18:45,176 INFO L276 IsEmpty]: Start isEmpty. Operand 2346 states and 4304 transitions. [2025-01-09 05:18:45,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-01-09 05:18:45,182 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:18:45,182 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] [2025-01-09 05:18:45,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 05:18:45,183 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:18:45,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:18:45,183 INFO L85 PathProgramCache]: Analyzing trace with hash -803607908, now seen corresponding path program 1 times [2025-01-09 05:18:45,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:18:45,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067378046] [2025-01-09 05:18:45,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:18:45,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:18:45,198 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-01-09 05:18:45,211 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-01-09 05:18:45,215 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:18:45,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:18:45,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:18:45,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:18:45,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067378046] [2025-01-09 05:18:45,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067378046] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:18:45,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:18:45,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:18:45,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492821679] [2025-01-09 05:18:45,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:18:45,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:18:45,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:18:45,548 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:18:45,549 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:18:45,549 INFO L87 Difference]: Start difference. First operand 2346 states and 4304 transitions. Second operand has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 5 states have internal predecessors, (100), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:18:46,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:18:46,306 INFO L93 Difference]: Finished difference Result 2808 states and 5037 transitions. [2025-01-09 05:18:46,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:18:46,307 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 5 states have internal predecessors, (100), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 110 [2025-01-09 05:18:46,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:18:46,324 INFO L225 Difference]: With dead ends: 2808 [2025-01-09 05:18:46,325 INFO L226 Difference]: Without dead ends: 2597 [2025-01-09 05:18:46,328 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-01-09 05:18:46,329 INFO L435 NwaCegarLoop]: 4404 mSDtfsCounter, 4594 mSDsluCounter, 13289 mSDsCounter, 0 mSdLazyCounter, 702 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4608 SdHoareTripleChecker+Valid, 17693 SdHoareTripleChecker+Invalid, 731 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 702 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 05:18:46,329 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4608 Valid, 17693 Invalid, 731 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 702 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 05:18:46,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2597 states. [2025-01-09 05:18:46,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2597 to 2567. [2025-01-09 05:18:46,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2567 states, 2514 states have (on average 1.819013524264121) internal successors, (4573), 2518 states have internal predecessors, (4573), 37 states have call successors, (37), 12 states have call predecessors, (37), 14 states have return successors, (44), 38 states have call predecessors, (44), 37 states have call successors, (44) [2025-01-09 05:18:46,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2567 states to 2567 states and 4654 transitions. [2025-01-09 05:18:46,415 INFO L78 Accepts]: Start accepts. Automaton has 2567 states and 4654 transitions. Word has length 110 [2025-01-09 05:18:46,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:18:46,416 INFO L471 AbstractCegarLoop]: Abstraction has 2567 states and 4654 transitions. [2025-01-09 05:18:46,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 5 states have internal predecessors, (100), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:18:46,416 INFO L276 IsEmpty]: Start isEmpty. Operand 2567 states and 4654 transitions. [2025-01-09 05:18:46,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-01-09 05:18:46,419 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:18:46,419 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] [2025-01-09 05:18:46,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 05:18:46,419 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:18:46,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:18:46,420 INFO L85 PathProgramCache]: Analyzing trace with hash -832108198, now seen corresponding path program 1 times [2025-01-09 05:18:46,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:18:46,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85788010] [2025-01-09 05:18:46,420 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:18:46,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:18:46,429 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-01-09 05:18:46,439 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-01-09 05:18:46,439 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:18:46,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:18:46,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:18:46,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:18:46,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85788010] [2025-01-09 05:18:46,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85788010] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:18:46,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:18:46,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:18:46,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155727471] [2025-01-09 05:18:46,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:18:46,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:18:46,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:18:46,618 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:18:46,618 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:18:46,618 INFO L87 Difference]: Start difference. First operand 2567 states and 4654 transitions. Second operand has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 5 states have internal predecessors, (100), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:18:47,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:18:47,247 INFO L93 Difference]: Finished difference Result 3470 states and 6086 transitions. [2025-01-09 05:18:47,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:18:47,247 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 5 states have internal predecessors, (100), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 110 [2025-01-09 05:18:47,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:18:47,261 INFO L225 Difference]: With dead ends: 3470 [2025-01-09 05:18:47,261 INFO L226 Difference]: Without dead ends: 3040 [2025-01-09 05:18:47,264 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 05:18:47,264 INFO L435 NwaCegarLoop]: 4346 mSDtfsCounter, 4590 mSDsluCounter, 13143 mSDsCounter, 0 mSdLazyCounter, 661 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4604 SdHoareTripleChecker+Valid, 17489 SdHoareTripleChecker+Invalid, 693 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 661 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 05:18:47,265 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4604 Valid, 17489 Invalid, 693 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 661 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 05:18:47,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3040 states. [2025-01-09 05:18:47,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3040 to 2999. [2025-01-09 05:18:47,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2999 states, 2900 states have (on average 1.7855172413793103) internal successors, (5178), 2908 states have internal predecessors, (5178), 67 states have call successors, (67), 24 states have call predecessors, (67), 30 states have return successors, (90), 70 states have call predecessors, (90), 67 states have call successors, (90) [2025-01-09 05:18:47,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2999 states to 2999 states and 5335 transitions. [2025-01-09 05:18:47,370 INFO L78 Accepts]: Start accepts. Automaton has 2999 states and 5335 transitions. Word has length 110 [2025-01-09 05:18:47,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:18:47,371 INFO L471 AbstractCegarLoop]: Abstraction has 2999 states and 5335 transitions. [2025-01-09 05:18:47,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 5 states have internal predecessors, (100), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:18:47,372 INFO L276 IsEmpty]: Start isEmpty. Operand 2999 states and 5335 transitions. [2025-01-09 05:18:47,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-01-09 05:18:47,374 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:18:47,374 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] [2025-01-09 05:18:47,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 05:18:47,375 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:18:47,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:18:47,377 INFO L85 PathProgramCache]: Analyzing trace with hash 1522277084, now seen corresponding path program 1 times [2025-01-09 05:18:47,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:18:47,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542279274] [2025-01-09 05:18:47,377 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:18:47,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:18:47,391 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-01-09 05:18:47,398 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-01-09 05:18:47,398 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:18:47,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:18:47,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:18:47,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:18:47,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542279274] [2025-01-09 05:18:47,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542279274] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:18:47,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:18:47,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:18:47,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981329564] [2025-01-09 05:18:47,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:18:47,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:18:47,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:18:47,564 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:18:47,564 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:18:47,565 INFO L87 Difference]: Start difference. First operand 2999 states and 5335 transitions. Second operand has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 5 states have internal predecessors, (100), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:18:48,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:18:48,351 INFO L93 Difference]: Finished difference Result 4855 states and 8313 transitions. [2025-01-09 05:18:48,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:18:48,352 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 5 states have internal predecessors, (100), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 110 [2025-01-09 05:18:48,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:18:48,374 INFO L225 Difference]: With dead ends: 4855 [2025-01-09 05:18:48,375 INFO L226 Difference]: Without dead ends: 3993 [2025-01-09 05:18:48,380 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 05:18:48,381 INFO L435 NwaCegarLoop]: 4400 mSDtfsCounter, 4584 mSDsluCounter, 13263 mSDsCounter, 0 mSdLazyCounter, 705 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4598 SdHoareTripleChecker+Valid, 17663 SdHoareTripleChecker+Invalid, 734 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 705 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 05:18:48,381 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4598 Valid, 17663 Invalid, 734 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [29 Valid, 705 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 05:18:48,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3993 states. [2025-01-09 05:18:48,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3993 to 3931. [2025-01-09 05:18:48,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3931 states, 3734 states have (on average 1.741831815747188) internal successors, (6504), 3756 states have internal predecessors, (6504), 127 states have call successors, (127), 48 states have call predecessors, (127), 68 states have return successors, (206), 134 states have call predecessors, (206), 127 states have call successors, (206) [2025-01-09 05:18:48,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3931 states to 3931 states and 6837 transitions. [2025-01-09 05:18:48,560 INFO L78 Accepts]: Start accepts. Automaton has 3931 states and 6837 transitions. Word has length 110 [2025-01-09 05:18:48,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:18:48,560 INFO L471 AbstractCegarLoop]: Abstraction has 3931 states and 6837 transitions. [2025-01-09 05:18:48,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 5 states have internal predecessors, (100), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:18:48,561 INFO L276 IsEmpty]: Start isEmpty. Operand 3931 states and 6837 transitions. [2025-01-09 05:18:48,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-01-09 05:18:48,564 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:18:48,564 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] [2025-01-09 05:18:48,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 05:18:48,565 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:18:48,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:18:48,565 INFO L85 PathProgramCache]: Analyzing trace with hash -895626982, now seen corresponding path program 1 times [2025-01-09 05:18:48,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:18:48,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651297211] [2025-01-09 05:18:48,566 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:18:48,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:18:48,576 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-01-09 05:18:48,580 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-01-09 05:18:48,581 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:18:48,581 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:18:48,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:18:48,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:18:48,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651297211] [2025-01-09 05:18:48,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651297211] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:18:48,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:18:48,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:18:48,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730549022] [2025-01-09 05:18:48,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:18:48,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:18:48,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:18:48,720 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:18:48,720 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:18:48,721 INFO L87 Difference]: Start difference. First operand 3931 states and 6837 transitions. Second operand has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 5 states have internal predecessors, (100), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:18:49,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:18:49,517 INFO L93 Difference]: Finished difference Result 7878 states and 13315 transitions. [2025-01-09 05:18:49,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:18:49,518 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 5 states have internal predecessors, (100), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 110 [2025-01-09 05:18:49,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:18:49,557 INFO L225 Difference]: With dead ends: 7878 [2025-01-09 05:18:49,557 INFO L226 Difference]: Without dead ends: 6084 [2025-01-09 05:18:49,568 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 05:18:49,569 INFO L435 NwaCegarLoop]: 4396 mSDtfsCounter, 4579 mSDsluCounter, 13246 mSDsCounter, 0 mSdLazyCounter, 702 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4593 SdHoareTripleChecker+Valid, 17642 SdHoareTripleChecker+Invalid, 731 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 702 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 05:18:49,570 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4593 Valid, 17642 Invalid, 731 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 702 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 05:18:49,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6084 states. [2025-01-09 05:18:49,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6084 to 5983. [2025-01-09 05:18:49,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5983 states, 5572 states have (on average 1.7002871500358938) internal successors, (9474), 5640 states have internal predecessors, (9474), 247 states have call successors, (247), 96 states have call predecessors, (247), 162 states have return successors, (534), 262 states have call predecessors, (534), 247 states have call successors, (534) [2025-01-09 05:18:49,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5983 states to 5983 states and 10255 transitions. [2025-01-09 05:18:49,897 INFO L78 Accepts]: Start accepts. Automaton has 5983 states and 10255 transitions. Word has length 110 [2025-01-09 05:18:49,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:18:49,898 INFO L471 AbstractCegarLoop]: Abstraction has 5983 states and 10255 transitions. [2025-01-09 05:18:49,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 5 states have internal predecessors, (100), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:18:49,899 INFO L276 IsEmpty]: Start isEmpty. Operand 5983 states and 10255 transitions. [2025-01-09 05:18:49,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-01-09 05:18:49,906 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:18:49,906 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] [2025-01-09 05:18:49,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 05:18:49,906 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:18:49,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:18:49,907 INFO L85 PathProgramCache]: Analyzing trace with hash -1666360548, now seen corresponding path program 1 times [2025-01-09 05:18:49,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:18:49,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502054137] [2025-01-09 05:18:49,907 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:18:49,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:18:49,920 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-01-09 05:18:49,924 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-01-09 05:18:49,925 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:18:49,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:18:50,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:18:50,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:18:50,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502054137] [2025-01-09 05:18:50,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502054137] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:18:50,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:18:50,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:18:50,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825269782] [2025-01-09 05:18:50,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:18:50,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:18:50,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:18:50,077 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:18:50,077 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:18:50,077 INFO L87 Difference]: Start difference. First operand 5983 states and 10255 transitions. Second operand has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 5 states have internal predecessors, (100), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:18:51,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:18:51,005 INFO L93 Difference]: Finished difference Result 14617 states and 24957 transitions. [2025-01-09 05:18:51,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:18:51,005 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 5 states have internal predecessors, (100), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 110 [2025-01-09 05:18:51,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:18:51,069 INFO L225 Difference]: With dead ends: 14617 [2025-01-09 05:18:51,070 INFO L226 Difference]: Without dead ends: 10771 [2025-01-09 05:18:51,090 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 05:18:51,092 INFO L435 NwaCegarLoop]: 4394 mSDtfsCounter, 4574 mSDsluCounter, 13234 mSDsCounter, 0 mSdLazyCounter, 702 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4588 SdHoareTripleChecker+Valid, 17628 SdHoareTripleChecker+Invalid, 731 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 702 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 05:18:51,092 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4588 Valid, 17628 Invalid, 731 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 702 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 05:18:51,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10771 states. [2025-01-09 05:18:51,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10771 to 10599. [2025-01-09 05:18:51,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10599 states, 9706 states have (on average 1.6760766536163199) internal successors, (16268), 9920 states have internal predecessors, (16268), 487 states have call successors, (487), 192 states have call predecessors, (487), 404 states have return successors, (1574), 518 states have call predecessors, (1574), 487 states have call successors, (1574) [2025-01-09 05:18:51,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10599 states to 10599 states and 18329 transitions. [2025-01-09 05:18:51,682 INFO L78 Accepts]: Start accepts. Automaton has 10599 states and 18329 transitions. Word has length 110 [2025-01-09 05:18:51,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:18:51,682 INFO L471 AbstractCegarLoop]: Abstraction has 10599 states and 18329 transitions. [2025-01-09 05:18:51,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 5 states have internal predecessors, (100), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:18:51,683 INFO L276 IsEmpty]: Start isEmpty. Operand 10599 states and 18329 transitions. [2025-01-09 05:18:51,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-01-09 05:18:51,693 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:18:51,693 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] [2025-01-09 05:18:51,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 05:18:51,693 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:18:51,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:18:51,694 INFO L85 PathProgramCache]: Analyzing trace with hash 1633913050, now seen corresponding path program 1 times [2025-01-09 05:18:51,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:18:51,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235765321] [2025-01-09 05:18:51,694 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:18:51,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:18:51,701 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-01-09 05:18:51,706 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-01-09 05:18:51,707 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:18:51,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:18:51,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:18:51,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:18:51,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235765321] [2025-01-09 05:18:51,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235765321] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:18:51,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:18:51,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:18:51,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926522068] [2025-01-09 05:18:51,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:18:51,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:18:51,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:18:51,827 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:18:51,827 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:18:51,827 INFO L87 Difference]: Start difference. First operand 10599 states and 18329 transitions. Second operand has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 5 states have internal predecessors, (100), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:18:52,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:18:52,858 INFO L93 Difference]: Finished difference Result 29968 states and 53235 transitions. [2025-01-09 05:18:52,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:18:52,858 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 5 states have internal predecessors, (100), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 110 [2025-01-09 05:18:52,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:18:52,995 INFO L225 Difference]: With dead ends: 29968 [2025-01-09 05:18:52,995 INFO L226 Difference]: Without dead ends: 21506 [2025-01-09 05:18:53,047 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 05:18:53,048 INFO L435 NwaCegarLoop]: 4391 mSDtfsCounter, 4569 mSDsluCounter, 13221 mSDsCounter, 0 mSdLazyCounter, 699 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4583 SdHoareTripleChecker+Valid, 17612 SdHoareTripleChecker+Invalid, 728 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 699 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 05:18:53,049 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4583 Valid, 17612 Invalid, 728 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 699 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 05:18:53,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21506 states. [2025-01-09 05:18:54,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21506 to 21207. [2025-01-09 05:18:54,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21207 states, 19188 states have (on average 1.6732332707942463) internal successors, (32106), 19856 states have internal predecessors, (32106), 967 states have call successors, (967), 384 states have call predecessors, (967), 1050 states have return successors, (5190), 1030 states have call predecessors, (5190), 967 states have call successors, (5190) [2025-01-09 05:18:54,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21207 states to 21207 states and 38263 transitions. [2025-01-09 05:18:54,176 INFO L78 Accepts]: Start accepts. Automaton has 21207 states and 38263 transitions. Word has length 110 [2025-01-09 05:18:54,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:18:54,176 INFO L471 AbstractCegarLoop]: Abstraction has 21207 states and 38263 transitions. [2025-01-09 05:18:54,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 5 states have internal predecessors, (100), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:18:54,176 INFO L276 IsEmpty]: Start isEmpty. Operand 21207 states and 38263 transitions. [2025-01-09 05:18:54,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-01-09 05:18:54,192 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:18:54,192 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] [2025-01-09 05:18:54,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 05:18:54,193 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:18:54,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:18:54,194 INFO L85 PathProgramCache]: Analyzing trace with hash 1047636828, now seen corresponding path program 1 times [2025-01-09 05:18:54,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:18:54,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337707182] [2025-01-09 05:18:54,194 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:18:54,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:18:54,202 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-01-09 05:18:54,206 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-01-09 05:18:54,207 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:18:54,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:18:54,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:18:54,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:18:54,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337707182] [2025-01-09 05:18:54,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337707182] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:18:54,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:18:54,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:18:54,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499578558] [2025-01-09 05:18:54,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:18:54,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:18:54,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:18:54,326 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:18:54,326 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:18:54,327 INFO L87 Difference]: Start difference. First operand 21207 states and 38263 transitions. Second operand has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 5 states have internal predecessors, (100), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:18:56,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:18:56,438 INFO L93 Difference]: Finished difference Result 68667 states and 130002 transitions. [2025-01-09 05:18:56,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:18:56,438 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 5 states have internal predecessors, (100), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 110 [2025-01-09 05:18:56,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:18:56,791 INFO L225 Difference]: With dead ends: 68667 [2025-01-09 05:18:56,792 INFO L226 Difference]: Without dead ends: 49597 [2025-01-09 05:18:56,891 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 05:18:56,891 INFO L435 NwaCegarLoop]: 4389 mSDtfsCounter, 4758 mSDsluCounter, 13203 mSDsCounter, 0 mSdLazyCounter, 705 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4779 SdHoareTripleChecker+Valid, 17592 SdHoareTripleChecker+Invalid, 737 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 705 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 05:18:56,893 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4779 Valid, 17592 Invalid, 737 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 705 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 05:18:56,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49597 states. [2025-01-09 05:18:59,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49597 to 45875. [2025-01-09 05:18:59,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45875 states, 41182 states have (on average 1.6864649604196007) internal successors, (69452), 43244 states have internal predecessors, (69452), 1863 states have call successors, (1863), 768 states have call predecessors, (1863), 2828 states have return successors, (18502), 1990 states have call predecessors, (18502), 1863 states have call successors, (18502) [2025-01-09 05:18:59,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45875 states to 45875 states and 89817 transitions. [2025-01-09 05:18:59,806 INFO L78 Accepts]: Start accepts. Automaton has 45875 states and 89817 transitions. Word has length 110 [2025-01-09 05:18:59,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:18:59,809 INFO L471 AbstractCegarLoop]: Abstraction has 45875 states and 89817 transitions. [2025-01-09 05:18:59,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 5 states have internal predecessors, (100), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:18:59,810 INFO L276 IsEmpty]: Start isEmpty. Operand 45875 states and 89817 transitions. [2025-01-09 05:18:59,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-01-09 05:18:59,835 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:18:59,836 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] [2025-01-09 05:18:59,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 05:18:59,836 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:18:59,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:18:59,837 INFO L85 PathProgramCache]: Analyzing trace with hash -910937958, now seen corresponding path program 1 times [2025-01-09 05:18:59,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:18:59,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573178020] [2025-01-09 05:18:59,837 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:18:59,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:18:59,845 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-01-09 05:18:59,849 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-01-09 05:18:59,849 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:18:59,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:18:59,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:18:59,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:18:59,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573178020] [2025-01-09 05:18:59,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573178020] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:18:59,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:18:59,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:18:59,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761780197] [2025-01-09 05:18:59,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:18:59,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:18:59,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:18:59,954 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:18:59,954 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:18:59,955 INFO L87 Difference]: Start difference. First operand 45875 states and 89817 transitions. Second operand has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 5 states have internal predecessors, (100), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:19:04,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:19:04,141 INFO L93 Difference]: Finished difference Result 151431 states and 321874 transitions. [2025-01-09 05:19:04,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:19:04,141 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 5 states have internal predecessors, (100), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 110 [2025-01-09 05:19:04,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:19:04,936 INFO L225 Difference]: With dead ends: 151431 [2025-01-09 05:19:04,937 INFO L226 Difference]: Without dead ends: 107693 [2025-01-09 05:19:05,083 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 05:19:05,084 INFO L435 NwaCegarLoop]: 4382 mSDtfsCounter, 4690 mSDsluCounter, 13173 mSDsCounter, 0 mSdLazyCounter, 705 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4711 SdHoareTripleChecker+Valid, 17555 SdHoareTripleChecker+Invalid, 737 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 705 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 05:19:05,084 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4711 Valid, 17555 Invalid, 737 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 705 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 05:19:05,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107693 states. [2025-01-09 05:19:11,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107693 to 102309. [2025-01-09 05:19:11,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102309 states, 90874 states have (on average 1.6963928076237427) internal successors, (154158), 97182 states have internal predecessors, (154158), 3591 states have call successors, (3591), 1536 states have call predecessors, (3591), 7842 states have return successors, (69638), 3846 states have call predecessors, (69638), 3591 states have call successors, (69638) [2025-01-09 05:19:12,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102309 states to 102309 states and 227387 transitions. [2025-01-09 05:19:12,834 INFO L78 Accepts]: Start accepts. Automaton has 102309 states and 227387 transitions. Word has length 110 [2025-01-09 05:19:12,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:19:12,834 INFO L471 AbstractCegarLoop]: Abstraction has 102309 states and 227387 transitions. [2025-01-09 05:19:12,834 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 5 states have internal predecessors, (100), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:19:12,835 INFO L276 IsEmpty]: Start isEmpty. Operand 102309 states and 227387 transitions. [2025-01-09 05:19:12,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-01-09 05:19:12,887 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:19:12,887 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] [2025-01-09 05:19:12,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 05:19:12,888 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:19:12,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:19:12,888 INFO L85 PathProgramCache]: Analyzing trace with hash 1504898392, now seen corresponding path program 1 times [2025-01-09 05:19:12,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:19:12,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900571824] [2025-01-09 05:19:12,889 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:19:12,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:19:12,897 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-01-09 05:19:12,902 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-01-09 05:19:12,902 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:19:12,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:19:13,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:19:13,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:19:13,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900571824] [2025-01-09 05:19:13,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900571824] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:19:13,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:19:13,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:19:13,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791682189] [2025-01-09 05:19:13,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:19:13,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:19:13,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:19:13,012 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:19:13,012 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:19:13,012 INFO L87 Difference]: Start difference. First operand 102309 states and 227387 transitions. Second operand has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 5 states have internal predecessors, (100), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5)