./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/Problem05_label45+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_label45+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 54f526c05851bf34c26c8de127e86052a91be3d9e5ccf7068c1070e69b950b3c --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 05:21:22,095 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 05:21:22,147 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:21:22,154 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 05:21:22,154 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 05:21:22,172 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 05:21:22,173 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 05:21:22,173 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 05:21:22,174 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 05:21:22,174 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 05:21:22,174 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 05:21:22,175 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 05:21:22,175 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 05:21:22,175 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 05:21:22,175 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 05:21:22,176 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 05:21:22,176 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 05:21:22,176 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 05:21:22,176 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 05:21:22,176 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 05:21:22,176 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 05:21:22,176 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 05:21:22,176 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 05:21:22,176 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 05:21:22,176 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 05:21:22,176 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 05:21:22,176 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 05:21:22,177 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 05:21:22,177 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 05:21:22,177 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 05:21:22,177 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 05:21:22,177 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 05:21:22,177 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 05:21:22,177 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 05:21:22,177 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 05:21:22,177 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 05:21:22,177 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 05:21:22,178 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 05:21:22,178 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 05:21:22,178 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 05:21:22,178 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 05:21:22,178 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 05:21:22,178 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 05:21:22,178 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 05:21:22,178 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 05:21:22,178 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 05:21:22,178 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 05:21:22,179 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 05:21:22,179 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 -> 54f526c05851bf34c26c8de127e86052a91be3d9e5ccf7068c1070e69b950b3c [2025-01-09 05:21:22,383 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 05:21:22,391 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 05:21:22,393 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 05:21:22,394 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 05:21:22,394 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 05:21:22,396 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/Problem05_label45+token_ring.06.cil-2.c [2025-01-09 05:21:23,586 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/63d7e641d/a2114698d33b40839395531b3b35fe72/FLAG5528a8b99 [2025-01-09 05:21:24,061 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 05:21:24,062 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label45+token_ring.06.cil-2.c [2025-01-09 05:21:24,105 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/63d7e641d/a2114698d33b40839395531b3b35fe72/FLAG5528a8b99 [2025-01-09 05:21:24,117 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/63d7e641d/a2114698d33b40839395531b3b35fe72 [2025-01-09 05:21:24,119 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 05:21:24,120 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 05:21:24,121 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 05:21:24,121 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 05:21:24,124 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 05:21:24,124 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 05:21:24" (1/1) ... [2025-01-09 05:21:24,125 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c6bf221 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:21:24, skipping insertion in model container [2025-01-09 05:21:24,125 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 05:21:24" (1/1) ... [2025-01-09 05:21:24,270 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 05:21:25,425 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_label45+token_ring.06.cil-2.c[380323,380336] [2025-01-09 05:21:25,459 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_label45+token_ring.06.cil-2.c[383339,383352] [2025-01-09 05:21:25,667 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 05:21:25,676 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 05:21:26,171 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_label45+token_ring.06.cil-2.c[380323,380336] [2025-01-09 05:21:26,176 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_label45+token_ring.06.cil-2.c[383339,383352] [2025-01-09 05:21:26,192 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 05:21:26,234 INFO L204 MainTranslator]: Completed translation [2025-01-09 05:21:26,235 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:21:26 WrapperNode [2025-01-09 05:21:26,235 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 05:21:26,236 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 05:21:26,236 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 05:21:26,236 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 05:21:26,241 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:21:26" (1/1) ... [2025-01-09 05:21:26,300 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:21:26" (1/1) ... [2025-01-09 05:21:26,615 INFO L138 Inliner]: procedures = 56, calls = 59, calls flagged for inlining = 34, calls inlined = 34, statements flattened = 12843 [2025-01-09 05:21:26,616 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 05:21:26,616 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 05:21:26,616 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 05:21:26,616 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 05:21:26,624 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:21:26" (1/1) ... [2025-01-09 05:21:26,624 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:21:26" (1/1) ... [2025-01-09 05:21:26,757 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:21:26" (1/1) ... [2025-01-09 05:21:26,874 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:21:26,874 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:21:26" (1/1) ... [2025-01-09 05:21:26,874 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:21:26" (1/1) ... [2025-01-09 05:21:27,015 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:21:26" (1/1) ... [2025-01-09 05:21:27,036 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:21:26" (1/1) ... [2025-01-09 05:21:27,130 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:21:26" (1/1) ... [2025-01-09 05:21:27,158 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:21:26" (1/1) ... [2025-01-09 05:21:27,179 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:21:26" (1/1) ... [2025-01-09 05:21:27,224 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 05:21:27,226 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 05:21:27,226 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 05:21:27,226 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 05:21:27,227 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:21:26" (1/1) ... [2025-01-09 05:21:27,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 05:21:27,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:21:27,256 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:21:27,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:21:27,274 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 05:21:27,274 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2025-01-09 05:21:27,274 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2025-01-09 05:21:27,274 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-01-09 05:21:27,274 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-01-09 05:21:27,274 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2025-01-09 05:21:27,274 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2025-01-09 05:21:27,274 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2025-01-09 05:21:27,274 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2025-01-09 05:21:27,274 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2025-01-09 05:21:27,274 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2025-01-09 05:21:27,275 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2025-01-09 05:21:27,275 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2025-01-09 05:21:27,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 05:21:27,275 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 05:21:27,275 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 05:21:27,371 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 05:21:27,373 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 05:21:33,464 INFO L? ?]: Removed 1719 outVars from TransFormulas that were not future-live. [2025-01-09 05:21:33,465 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 05:21:33,500 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 05:21:33,500 INFO L312 CfgBuilder]: Removed 10 assume(true) statements. [2025-01-09 05:21:33,501 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 05:21:33 BoogieIcfgContainer [2025-01-09 05:21:33,501 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 05:21:33,502 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 05:21:33,502 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 05:21:33,506 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 05:21:33,506 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 05:21:24" (1/3) ... [2025-01-09 05:21:33,506 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fe5e8be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 05:21:33, skipping insertion in model container [2025-01-09 05:21:33,506 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:21:26" (2/3) ... [2025-01-09 05:21:33,507 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fe5e8be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 05:21:33, skipping insertion in model container [2025-01-09 05:21:33,507 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 05:21:33" (3/3) ... [2025-01-09 05:21:33,511 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem05_label45+token_ring.06.cil-2.c [2025-01-09 05:21:33,522 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 05:21:33,526 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem05_label45+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:21:33,614 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 05:21:33,623 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;@77c3176f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 05:21:33,623 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-01-09 05:21:33,636 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:21:33,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-01-09 05:21:33,647 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:21:33,647 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:21:33,648 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:21:33,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:21:33,654 INFO L85 PathProgramCache]: Analyzing trace with hash -1860339110, now seen corresponding path program 1 times [2025-01-09 05:21:33,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:21:33,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929094990] [2025-01-09 05:21:33,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:21:33,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:21:33,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-01-09 05:21:33,765 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-01-09 05:21:33,766 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:21:33,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:21:33,937 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:21:33,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:21:33,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929094990] [2025-01-09 05:21:33,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929094990] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:21:33,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:21:33,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:21:33,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452737640] [2025-01-09 05:21:33,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:21:33,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:21:33,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:21:33,959 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:21:33,960 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:21:33,966 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:21:34,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:21:34,135 INFO L93 Difference]: Finished difference Result 4815 states and 8869 transitions. [2025-01-09 05:21:34,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:21:34,137 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:21:34,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:21:34,163 INFO L225 Difference]: With dead ends: 4815 [2025-01-09 05:21:34,163 INFO L226 Difference]: Without dead ends: 2346 [2025-01-09 05:21:34,174 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:21:34,178 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:21:34,179 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:21:34,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2346 states. [2025-01-09 05:21:34,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2346 to 2346. [2025-01-09 05:21:34,270 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:21:34,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2346 states to 2346 states and 4304 transitions. [2025-01-09 05:21:34,285 INFO L78 Accepts]: Start accepts. Automaton has 2346 states and 4304 transitions. Word has length 110 [2025-01-09 05:21:34,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:21:34,286 INFO L471 AbstractCegarLoop]: Abstraction has 2346 states and 4304 transitions. [2025-01-09 05:21:34,286 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:21:34,286 INFO L276 IsEmpty]: Start isEmpty. Operand 2346 states and 4304 transitions. [2025-01-09 05:21:34,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-01-09 05:21:34,293 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:21:34,293 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:21:34,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 05:21:34,294 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:21:34,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:21:34,295 INFO L85 PathProgramCache]: Analyzing trace with hash -803607908, now seen corresponding path program 1 times [2025-01-09 05:21:34,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:21:34,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586997964] [2025-01-09 05:21:34,295 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:21:34,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:21:34,311 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-01-09 05:21:34,328 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-01-09 05:21:34,331 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:21:34,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:21:34,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:21:34,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:21:34,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586997964] [2025-01-09 05:21:34,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586997964] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:21:34,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:21:34,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:21:34,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727805837] [2025-01-09 05:21:34,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:21:34,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:21:34,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:21:34,546 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:21:34,546 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:21:34,546 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:21:35,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:21:35,129 INFO L93 Difference]: Finished difference Result 2808 states and 5037 transitions. [2025-01-09 05:21:35,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:21:35,131 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:21:35,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:21:35,145 INFO L225 Difference]: With dead ends: 2808 [2025-01-09 05:21:35,146 INFO L226 Difference]: Without dead ends: 2597 [2025-01-09 05:21:35,148 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:21:35,149 INFO L435 NwaCegarLoop]: 4404 mSDtfsCounter, 4594 mSDsluCounter, 13289 mSDsCounter, 0 mSdLazyCounter, 702 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.4s IncrementalHoareTripleChecker+Time [2025-01-09 05:21:35,149 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.4s Time] [2025-01-09 05:21:35,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2597 states. [2025-01-09 05:21:35,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2597 to 2567. [2025-01-09 05:21:35,216 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:21:35,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2567 states to 2567 states and 4654 transitions. [2025-01-09 05:21:35,228 INFO L78 Accepts]: Start accepts. Automaton has 2567 states and 4654 transitions. Word has length 110 [2025-01-09 05:21:35,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:21:35,228 INFO L471 AbstractCegarLoop]: Abstraction has 2567 states and 4654 transitions. [2025-01-09 05:21:35,228 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:21:35,228 INFO L276 IsEmpty]: Start isEmpty. Operand 2567 states and 4654 transitions. [2025-01-09 05:21:35,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-01-09 05:21:35,230 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:21:35,231 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:21:35,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 05:21:35,231 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:21:35,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:21:35,231 INFO L85 PathProgramCache]: Analyzing trace with hash -832108198, now seen corresponding path program 1 times [2025-01-09 05:21:35,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:21:35,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46017481] [2025-01-09 05:21:35,232 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:21:35,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:21:35,241 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-01-09 05:21:35,250 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-01-09 05:21:35,250 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:21:35,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:21:35,469 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:21:35,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:21:35,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46017481] [2025-01-09 05:21:35,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46017481] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:21:35,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:21:35,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:21:35,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466279946] [2025-01-09 05:21:35,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:21:35,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:21:35,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:21:35,471 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:21:35,471 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:21:35,471 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:21:36,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:21:36,034 INFO L93 Difference]: Finished difference Result 3470 states and 6086 transitions. [2025-01-09 05:21:36,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:21:36,035 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:21:36,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:21:36,047 INFO L225 Difference]: With dead ends: 3470 [2025-01-09 05:21:36,048 INFO L226 Difference]: Without dead ends: 3040 [2025-01-09 05:21:36,050 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:21:36,051 INFO L435 NwaCegarLoop]: 4346 mSDtfsCounter, 4590 mSDsluCounter, 13143 mSDsCounter, 0 mSdLazyCounter, 661 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.4s IncrementalHoareTripleChecker+Time [2025-01-09 05:21:36,051 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.4s Time] [2025-01-09 05:21:36,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3040 states. [2025-01-09 05:21:36,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3040 to 2999. [2025-01-09 05:21:36,139 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:21:36,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2999 states to 2999 states and 5335 transitions. [2025-01-09 05:21:36,156 INFO L78 Accepts]: Start accepts. Automaton has 2999 states and 5335 transitions. Word has length 110 [2025-01-09 05:21:36,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:21:36,156 INFO L471 AbstractCegarLoop]: Abstraction has 2999 states and 5335 transitions. [2025-01-09 05:21:36,157 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:21:36,157 INFO L276 IsEmpty]: Start isEmpty. Operand 2999 states and 5335 transitions. [2025-01-09 05:21:36,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-01-09 05:21:36,160 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:21:36,160 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:21:36,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 05:21:36,161 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:21:36,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:21:36,163 INFO L85 PathProgramCache]: Analyzing trace with hash 1522277084, now seen corresponding path program 1 times [2025-01-09 05:21:36,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:21:36,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462306564] [2025-01-09 05:21:36,163 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:21:36,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:21:36,179 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-01-09 05:21:36,184 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-01-09 05:21:36,185 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:21:36,185 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:21:36,307 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:21:36,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:21:36,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462306564] [2025-01-09 05:21:36,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462306564] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:21:36,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:21:36,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:21:36,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575761214] [2025-01-09 05:21:36,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:21:36,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:21:36,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:21:36,309 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:21:36,309 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:21:36,310 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:21:36,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:21:36,869 INFO L93 Difference]: Finished difference Result 4855 states and 8313 transitions. [2025-01-09 05:21:36,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:21:36,870 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:21:36,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:21:36,887 INFO L225 Difference]: With dead ends: 4855 [2025-01-09 05:21:36,888 INFO L226 Difference]: Without dead ends: 3993 [2025-01-09 05:21:36,892 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:21:36,894 INFO L435 NwaCegarLoop]: 4400 mSDtfsCounter, 4584 mSDsluCounter, 13263 mSDsCounter, 0 mSdLazyCounter, 705 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4598 SdHoareTripleChecker+Valid, 17663 SdHoareTripleChecker+Invalid, 734 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 705 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 05:21:36,894 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4598 Valid, 17663 Invalid, 734 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 705 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 05:21:36,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3993 states. [2025-01-09 05:21:37,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3993 to 3931. [2025-01-09 05:21:37,012 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:21:37,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3931 states to 3931 states and 6837 transitions. [2025-01-09 05:21:37,037 INFO L78 Accepts]: Start accepts. Automaton has 3931 states and 6837 transitions. Word has length 110 [2025-01-09 05:21:37,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:21:37,037 INFO L471 AbstractCegarLoop]: Abstraction has 3931 states and 6837 transitions. [2025-01-09 05:21:37,037 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:21:37,038 INFO L276 IsEmpty]: Start isEmpty. Operand 3931 states and 6837 transitions. [2025-01-09 05:21:37,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-01-09 05:21:37,042 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:21:37,042 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:21:37,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 05:21:37,042 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:21:37,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:21:37,043 INFO L85 PathProgramCache]: Analyzing trace with hash -895626982, now seen corresponding path program 1 times [2025-01-09 05:21:37,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:21:37,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879359094] [2025-01-09 05:21:37,043 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:21:37,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:21:37,052 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-01-09 05:21:37,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-01-09 05:21:37,060 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:21:37,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:21:37,170 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:21:37,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:21:37,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879359094] [2025-01-09 05:21:37,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879359094] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:21:37,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:21:37,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:21:37,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372456443] [2025-01-09 05:21:37,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:21:37,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:21:37,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:21:37,171 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:21:37,171 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:21:37,172 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:21:37,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:21:37,718 INFO L93 Difference]: Finished difference Result 7878 states and 13315 transitions. [2025-01-09 05:21:37,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:21:37,718 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:21:37,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:21:37,744 INFO L225 Difference]: With dead ends: 7878 [2025-01-09 05:21:37,744 INFO L226 Difference]: Without dead ends: 6084 [2025-01-09 05:21:37,752 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:21:37,753 INFO L435 NwaCegarLoop]: 4396 mSDtfsCounter, 4579 mSDsluCounter, 13246 mSDsCounter, 0 mSdLazyCounter, 702 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.4s IncrementalHoareTripleChecker+Time [2025-01-09 05:21:37,753 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.4s Time] [2025-01-09 05:21:37,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6084 states. [2025-01-09 05:21:37,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6084 to 5983. [2025-01-09 05:21:37,985 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:21:38,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5983 states to 5983 states and 10255 transitions. [2025-01-09 05:21:38,005 INFO L78 Accepts]: Start accepts. Automaton has 5983 states and 10255 transitions. Word has length 110 [2025-01-09 05:21:38,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:21:38,005 INFO L471 AbstractCegarLoop]: Abstraction has 5983 states and 10255 transitions. [2025-01-09 05:21:38,006 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:21:38,006 INFO L276 IsEmpty]: Start isEmpty. Operand 5983 states and 10255 transitions. [2025-01-09 05:21:38,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-01-09 05:21:38,010 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:21:38,010 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:21:38,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 05:21:38,010 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:21:38,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:21:38,011 INFO L85 PathProgramCache]: Analyzing trace with hash -1666360548, now seen corresponding path program 1 times [2025-01-09 05:21:38,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:21:38,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635391254] [2025-01-09 05:21:38,011 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:21:38,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:21:38,020 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-01-09 05:21:38,024 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-01-09 05:21:38,025 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:21:38,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:21:38,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:21:38,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:21:38,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635391254] [2025-01-09 05:21:38,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635391254] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:21:38,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:21:38,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:21:38,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28525377] [2025-01-09 05:21:38,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:21:38,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:21:38,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:21:38,131 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:21:38,132 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:21:38,132 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:21:38,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:21:38,735 INFO L93 Difference]: Finished difference Result 14617 states and 24957 transitions. [2025-01-09 05:21:38,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:21:38,735 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:21:38,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:21:38,786 INFO L225 Difference]: With dead ends: 14617 [2025-01-09 05:21:38,787 INFO L226 Difference]: Without dead ends: 10771 [2025-01-09 05:21:38,801 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:21:38,802 INFO L435 NwaCegarLoop]: 4394 mSDtfsCounter, 4574 mSDsluCounter, 13234 mSDsCounter, 0 mSdLazyCounter, 702 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.4s IncrementalHoareTripleChecker+Time [2025-01-09 05:21:38,802 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.4s Time] [2025-01-09 05:21:38,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10771 states. [2025-01-09 05:21:39,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10771 to 10599. [2025-01-09 05:21:39,156 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:21:39,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10599 states to 10599 states and 18329 transitions. [2025-01-09 05:21:39,188 INFO L78 Accepts]: Start accepts. Automaton has 10599 states and 18329 transitions. Word has length 110 [2025-01-09 05:21:39,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:21:39,189 INFO L471 AbstractCegarLoop]: Abstraction has 10599 states and 18329 transitions. [2025-01-09 05:21:39,193 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:21:39,193 INFO L276 IsEmpty]: Start isEmpty. Operand 10599 states and 18329 transitions. [2025-01-09 05:21:39,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-01-09 05:21:39,202 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:21:39,202 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:21:39,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 05:21:39,202 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:21:39,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:21:39,203 INFO L85 PathProgramCache]: Analyzing trace with hash 1633913050, now seen corresponding path program 1 times [2025-01-09 05:21:39,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:21:39,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485671648] [2025-01-09 05:21:39,203 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:21:39,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:21:39,213 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-01-09 05:21:39,217 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-01-09 05:21:39,217 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:21:39,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:21:39,304 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:21:39,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:21:39,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485671648] [2025-01-09 05:21:39,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485671648] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:21:39,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:21:39,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:21:39,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155153547] [2025-01-09 05:21:39,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:21:39,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:21:39,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:21:39,306 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:21:39,306 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:21:39,307 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:21:40,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:21:40,059 INFO L93 Difference]: Finished difference Result 29968 states and 53235 transitions. [2025-01-09 05:21:40,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:21:40,060 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:21:40,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:21:40,220 INFO L225 Difference]: With dead ends: 29968 [2025-01-09 05:21:40,221 INFO L226 Difference]: Without dead ends: 21506 [2025-01-09 05:21:40,245 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:21:40,246 INFO L435 NwaCegarLoop]: 4391 mSDtfsCounter, 4569 mSDsluCounter, 13221 mSDsCounter, 0 mSdLazyCounter, 699 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.4s IncrementalHoareTripleChecker+Time [2025-01-09 05:21:40,247 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.4s Time] [2025-01-09 05:21:40,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21506 states. [2025-01-09 05:21:40,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21506 to 21207. [2025-01-09 05:21:41,013 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:21:41,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21207 states to 21207 states and 38263 transitions. [2025-01-09 05:21:41,098 INFO L78 Accepts]: Start accepts. Automaton has 21207 states and 38263 transitions. Word has length 110 [2025-01-09 05:21:41,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:21:41,099 INFO L471 AbstractCegarLoop]: Abstraction has 21207 states and 38263 transitions. [2025-01-09 05:21:41,099 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:21:41,100 INFO L276 IsEmpty]: Start isEmpty. Operand 21207 states and 38263 transitions. [2025-01-09 05:21:41,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-01-09 05:21:41,113 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:21:41,113 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:21:41,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 05:21:41,114 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:21:41,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:21:41,114 INFO L85 PathProgramCache]: Analyzing trace with hash 1047636828, now seen corresponding path program 1 times [2025-01-09 05:21:41,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:21:41,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147636870] [2025-01-09 05:21:41,115 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:21:41,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:21:41,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-01-09 05:21:41,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-01-09 05:21:41,127 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:21:41,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:21:41,222 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:21:41,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:21:41,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147636870] [2025-01-09 05:21:41,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147636870] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:21:41,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:21:41,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:21:41,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562167851] [2025-01-09 05:21:41,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:21:41,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:21:41,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:21:41,223 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:21:41,224 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:21:41,224 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:21:42,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:21:42,636 INFO L93 Difference]: Finished difference Result 68667 states and 130002 transitions. [2025-01-09 05:21:42,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:21:42,637 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:21:42,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:21:42,854 INFO L225 Difference]: With dead ends: 68667 [2025-01-09 05:21:42,855 INFO L226 Difference]: Without dead ends: 49597 [2025-01-09 05:21:42,926 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:21:42,927 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:21:42,930 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:21:42,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49597 states. [2025-01-09 05:21:44,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49597 to 45875. [2025-01-09 05:21:44,842 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:21:45,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45875 states to 45875 states and 89817 transitions. [2025-01-09 05:21:45,235 INFO L78 Accepts]: Start accepts. Automaton has 45875 states and 89817 transitions. Word has length 110 [2025-01-09 05:21:45,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:21:45,236 INFO L471 AbstractCegarLoop]: Abstraction has 45875 states and 89817 transitions. [2025-01-09 05:21:45,236 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:21:45,236 INFO L276 IsEmpty]: Start isEmpty. Operand 45875 states and 89817 transitions. [2025-01-09 05:21:45,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-01-09 05:21:45,257 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:21:45,257 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:21:45,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 05:21:45,257 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:21:45,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:21:45,258 INFO L85 PathProgramCache]: Analyzing trace with hash -910937958, now seen corresponding path program 1 times [2025-01-09 05:21:45,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:21:45,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240113378] [2025-01-09 05:21:45,258 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:21:45,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:21:45,265 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-01-09 05:21:45,268 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-01-09 05:21:45,268 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:21:45,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:21:45,358 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:21:45,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:21:45,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240113378] [2025-01-09 05:21:45,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240113378] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:21:45,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:21:45,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:21:45,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279773442] [2025-01-09 05:21:45,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:21:45,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:21:45,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:21:45,360 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:21:45,361 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:21:45,361 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:21:48,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:21:48,544 INFO L93 Difference]: Finished difference Result 151431 states and 321874 transitions. [2025-01-09 05:21:48,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:21:48,544 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:21:48,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:21:49,099 INFO L225 Difference]: With dead ends: 151431 [2025-01-09 05:21:49,099 INFO L226 Difference]: Without dead ends: 107693 [2025-01-09 05:21:49,242 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:21:49,242 INFO L435 NwaCegarLoop]: 4382 mSDtfsCounter, 4690 mSDsluCounter, 13173 mSDsCounter, 0 mSdLazyCounter, 705 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.4s IncrementalHoareTripleChecker+Time [2025-01-09 05:21:49,242 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.4s Time] [2025-01-09 05:21:49,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107693 states. [2025-01-09 05:21:56,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107693 to 102309. [2025-01-09 05:21:56,616 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:21:57,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102309 states to 102309 states and 227387 transitions. [2025-01-09 05:21:57,164 INFO L78 Accepts]: Start accepts. Automaton has 102309 states and 227387 transitions. Word has length 110 [2025-01-09 05:21:57,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:21:57,164 INFO L471 AbstractCegarLoop]: Abstraction has 102309 states and 227387 transitions. [2025-01-09 05:21:57,165 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:21:57,165 INFO L276 IsEmpty]: Start isEmpty. Operand 102309 states and 227387 transitions. [2025-01-09 05:21:57,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-01-09 05:21:57,209 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:21:57,209 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:21:57,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 05:21:57,209 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:21:57,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:21:57,213 INFO L85 PathProgramCache]: Analyzing trace with hash 1504898392, now seen corresponding path program 1 times [2025-01-09 05:21:57,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:21:57,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305843535] [2025-01-09 05:21:57,213 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:21:57,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:21:57,219 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-01-09 05:21:57,224 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-01-09 05:21:57,224 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:21:57,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:21:57,306 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:21:57,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:21:57,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305843535] [2025-01-09 05:21:57,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305843535] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:21:57,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:21:57,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:21:57,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421473278] [2025-01-09 05:21:57,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:21:57,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:21:57,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:21:57,308 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:21:57,308 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:21:57,308 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)