./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/Problem05_label40+token_ring.05.cil-1.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_label40+token_ring.05.cil-1.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e270b9f7665b1c8abbbdbbd0440b4b4aa4509b75796aa73b96f40d2382c01832 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 05:14:05,049 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 05:14:05,110 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:14:05,115 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 05:14:05,115 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 05:14:05,140 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 05:14:05,141 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 05:14:05,141 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 05:14:05,142 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 05:14:05,142 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 05:14:05,142 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 05:14:05,143 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 05:14:05,143 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 05:14:05,143 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 05:14:05,143 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 05:14:05,143 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 05:14:05,143 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 05:14:05,144 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 05:14:05,144 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 05:14:05,144 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 05:14:05,144 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 05:14:05,144 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 05:14:05,144 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 05:14:05,144 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 05:14:05,144 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 05:14:05,144 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 05:14:05,144 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 05:14:05,144 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 05:14:05,145 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 05:14:05,145 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 05:14:05,145 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 05:14:05,145 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 05:14:05,145 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 05:14:05,145 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 05:14:05,145 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 05:14:05,146 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 05:14:05,146 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 05:14:05,146 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 05:14:05,146 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 05:14:05,146 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 05:14:05,146 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 05:14:05,146 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 05:14:05,146 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 05:14:05,146 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 05:14:05,147 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 05:14:05,147 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 05:14:05,147 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 05:14:05,147 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 05:14:05,147 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 -> e270b9f7665b1c8abbbdbbd0440b4b4aa4509b75796aa73b96f40d2382c01832 [2025-01-09 05:14:05,378 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 05:14:05,384 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 05:14:05,386 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 05:14:05,386 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 05:14:05,387 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 05:14:05,388 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/Problem05_label40+token_ring.05.cil-1.c [2025-01-09 05:14:06,598 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a0ca31d1e/f988ab64892349c98b5945255f12d1c1/FLAG86e1942af [2025-01-09 05:14:07,182 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 05:14:07,183 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label40+token_ring.05.cil-1.c [2025-01-09 05:14:07,250 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a0ca31d1e/f988ab64892349c98b5945255f12d1c1/FLAG86e1942af [2025-01-09 05:14:07,267 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a0ca31d1e/f988ab64892349c98b5945255f12d1c1 [2025-01-09 05:14:07,269 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 05:14:07,270 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 05:14:07,272 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 05:14:07,273 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 05:14:07,278 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 05:14:07,278 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 05:14:07" (1/1) ... [2025-01-09 05:14:07,279 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e51afc4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:14:07, skipping insertion in model container [2025-01-09 05:14:07,279 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 05:14:07" (1/1) ... [2025-01-09 05:14:07,402 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 05:14:08,485 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_label40+token_ring.05.cil-1.c[377069,377082] [2025-01-09 05:14:08,516 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_label40+token_ring.05.cil-1.c[383339,383352] [2025-01-09 05:14:08,670 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 05:14:08,680 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 05:14:09,190 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_label40+token_ring.05.cil-1.c[377069,377082] [2025-01-09 05:14:09,198 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_label40+token_ring.05.cil-1.c[383339,383352] [2025-01-09 05:14:09,214 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 05:14:09,259 INFO L204 MainTranslator]: Completed translation [2025-01-09 05:14:09,259 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:14:09 WrapperNode [2025-01-09 05:14:09,260 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 05:14:09,261 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 05:14:09,262 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 05:14:09,262 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 05:14:09,266 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:14:09" (1/1) ... [2025-01-09 05:14:09,335 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:14:09" (1/1) ... [2025-01-09 05:14:09,623 INFO L138 Inliner]: procedures = 54, calls = 56, calls flagged for inlining = 32, calls inlined = 32, statements flattened = 12786 [2025-01-09 05:14:09,623 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 05:14:09,624 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 05:14:09,624 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 05:14:09,624 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 05:14:09,631 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:14:09" (1/1) ... [2025-01-09 05:14:09,631 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:14:09" (1/1) ... [2025-01-09 05:14:09,667 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:14:09" (1/1) ... [2025-01-09 05:14:09,877 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:14:09,877 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:14:09" (1/1) ... [2025-01-09 05:14:09,878 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:14:09" (1/1) ... [2025-01-09 05:14:10,023 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:14:09" (1/1) ... [2025-01-09 05:14:10,047 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:14:09" (1/1) ... [2025-01-09 05:14:10,093 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:14:09" (1/1) ... [2025-01-09 05:14:10,141 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:14:09" (1/1) ... [2025-01-09 05:14:10,163 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:14:09" (1/1) ... [2025-01-09 05:14:10,219 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 05:14:10,221 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 05:14:10,221 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 05:14:10,221 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 05:14:10,222 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:14:09" (1/1) ... [2025-01-09 05:14:10,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 05:14:10,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:14:10,248 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:14:10,252 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:14:10,273 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 05:14:10,273 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2025-01-09 05:14:10,273 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2025-01-09 05:14:10,274 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-01-09 05:14:10,274 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-01-09 05:14:10,274 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2025-01-09 05:14:10,274 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2025-01-09 05:14:10,274 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2025-01-09 05:14:10,274 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2025-01-09 05:14:10,274 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2025-01-09 05:14:10,275 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2025-01-09 05:14:10,275 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2025-01-09 05:14:10,275 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2025-01-09 05:14:10,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 05:14:10,275 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 05:14:10,275 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 05:14:10,373 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 05:14:10,374 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 05:14:16,776 INFO L? ?]: Removed 1713 outVars from TransFormulas that were not future-live. [2025-01-09 05:14:16,777 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 05:14:16,844 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 05:14:16,844 INFO L312 CfgBuilder]: Removed 9 assume(true) statements. [2025-01-09 05:14:16,845 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 05:14:16 BoogieIcfgContainer [2025-01-09 05:14:16,845 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 05:14:16,846 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 05:14:16,846 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 05:14:16,854 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 05:14:16,854 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 05:14:07" (1/3) ... [2025-01-09 05:14:16,855 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b5fe846 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 05:14:16, skipping insertion in model container [2025-01-09 05:14:16,855 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:14:09" (2/3) ... [2025-01-09 05:14:16,855 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b5fe846 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 05:14:16, skipping insertion in model container [2025-01-09 05:14:16,855 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 05:14:16" (3/3) ... [2025-01-09 05:14:16,856 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem05_label40+token_ring.05.cil-1.c [2025-01-09 05:14:16,866 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 05:14:16,874 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem05_label40+token_ring.05.cil-1.c that has 7 procedures, 2388 locations, 1 initial locations, 9 loop locations, and 2 error locations. [2025-01-09 05:14:16,963 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 05:14:16,974 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;@48b6184a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 05:14:16,974 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-01-09 05:14:16,984 INFO L276 IsEmpty]: Start isEmpty. Operand has 2388 states, 2361 states have (on average 1.8487928843710293) internal successors, (4365), 2363 states have internal predecessors, (4365), 19 states have call successors, (19), 6 states have call predecessors, (19), 6 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-01-09 05:14:16,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-01-09 05:14:16,993 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:14:16,994 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] [2025-01-09 05:14:16,994 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:14:16,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:14:16,998 INFO L85 PathProgramCache]: Analyzing trace with hash -148207991, now seen corresponding path program 1 times [2025-01-09 05:14:17,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:14:17,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175549881] [2025-01-09 05:14:17,003 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:14:17,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:14:17,070 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-01-09 05:14:17,084 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-01-09 05:14:17,084 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:14:17,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:14:17,247 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:14:17,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:14:17,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175549881] [2025-01-09 05:14:17,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175549881] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:14:17,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:14:17,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:14:17,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305338002] [2025-01-09 05:14:17,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:14:17,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:14:17,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:14:17,265 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:14:17,265 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:14:17,271 INFO L87 Difference]: Start difference. First operand has 2388 states, 2361 states have (on average 1.8487928843710293) internal successors, (4365), 2363 states have internal predecessors, (4365), 19 states have call successors, (19), 6 states have call predecessors, (19), 6 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 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:14:17,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:14:17,438 INFO L93 Difference]: Finished difference Result 4767 states and 8789 transitions. [2025-01-09 05:14:17,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:14:17,443 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 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 99 [2025-01-09 05:14:17,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:14:17,463 INFO L225 Difference]: With dead ends: 4767 [2025-01-09 05:14:17,463 INFO L226 Difference]: Without dead ends: 2321 [2025-01-09 05:14:17,472 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:14:17,473 INFO L435 NwaCegarLoop]: 4331 mSDtfsCounter, 301 mSDsluCounter, 4022 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 301 SdHoareTripleChecker+Valid, 8353 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:14:17,474 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [301 Valid, 8353 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:14:17,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2321 states. [2025-01-09 05:14:17,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2321 to 2321. [2025-01-09 05:14:17,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2321 states, 2294 states have (on average 1.8417611159546643) internal successors, (4225), 2296 states have internal predecessors, (4225), 19 states have call successors, (19), 6 states have call predecessors, (19), 6 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-01-09 05:14:17,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2321 states to 2321 states and 4263 transitions. [2025-01-09 05:14:17,584 INFO L78 Accepts]: Start accepts. Automaton has 2321 states and 4263 transitions. Word has length 99 [2025-01-09 05:14:17,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:14:17,585 INFO L471 AbstractCegarLoop]: Abstraction has 2321 states and 4263 transitions. [2025-01-09 05:14:17,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 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:14:17,586 INFO L276 IsEmpty]: Start isEmpty. Operand 2321 states and 4263 transitions. [2025-01-09 05:14:17,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-01-09 05:14:17,589 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:14:17,589 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] [2025-01-09 05:14:17,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 05:14:17,589 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:14:17,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:14:17,590 INFO L85 PathProgramCache]: Analyzing trace with hash 438068231, now seen corresponding path program 1 times [2025-01-09 05:14:17,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:14:17,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921440500] [2025-01-09 05:14:17,590 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:14:17,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:14:17,606 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-01-09 05:14:17,620 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-01-09 05:14:17,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:14:17,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:14:17,776 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:14:17,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:14:17,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921440500] [2025-01-09 05:14:17,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921440500] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:14:17,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:14:17,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 05:14:17,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083213277] [2025-01-09 05:14:17,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:14:17,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 05:14:17,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:14:17,780 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 05:14:17,780 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 05:14:17,780 INFO L87 Difference]: Start difference. First operand 2321 states and 4263 transitions. Second operand has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 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:14:18,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:14:18,289 INFO L93 Difference]: Finished difference Result 2715 states and 4875 transitions. [2025-01-09 05:14:18,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 05:14:18,290 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 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 99 [2025-01-09 05:14:18,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:14:18,302 INFO L225 Difference]: With dead ends: 2715 [2025-01-09 05:14:18,303 INFO L226 Difference]: Without dead ends: 2528 [2025-01-09 05:14:18,305 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:14:18,306 INFO L435 NwaCegarLoop]: 4193 mSDtfsCounter, 4511 mSDsluCounter, 8500 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4524 SdHoareTripleChecker+Valid, 12693 SdHoareTripleChecker+Invalid, 387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 05:14:18,306 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4524 Valid, 12693 Invalid, 387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 345 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 05:14:18,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2528 states. [2025-01-09 05:14:18,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2528 to 2513. [2025-01-09 05:14:18,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2513 states, 2465 states have (on average 1.822312373225152) internal successors, (4492), 2468 states have internal predecessors, (4492), 33 states have call successors, (33), 12 states have call predecessors, (33), 13 states have return successors, (34), 33 states have call predecessors, (34), 33 states have call successors, (34) [2025-01-09 05:14:18,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2513 states to 2513 states and 4559 transitions. [2025-01-09 05:14:18,373 INFO L78 Accepts]: Start accepts. Automaton has 2513 states and 4559 transitions. Word has length 99 [2025-01-09 05:14:18,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:14:18,373 INFO L471 AbstractCegarLoop]: Abstraction has 2513 states and 4559 transitions. [2025-01-09 05:14:18,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 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:14:18,374 INFO L276 IsEmpty]: Start isEmpty. Operand 2513 states and 4559 transitions. [2025-01-09 05:14:18,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-01-09 05:14:18,378 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:14:18,378 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] [2025-01-09 05:14:18,378 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 05:14:18,378 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:14:18,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:14:18,379 INFO L85 PathProgramCache]: Analyzing trace with hash -1145839477, now seen corresponding path program 1 times [2025-01-09 05:14:18,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:14:18,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625985078] [2025-01-09 05:14:18,379 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:14:18,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:14:18,389 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-01-09 05:14:18,399 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-01-09 05:14:18,399 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:14:18,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:14:18,681 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:14:18,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:14:18,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625985078] [2025-01-09 05:14:18,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625985078] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:14:18,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:14:18,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:14:18,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119923947] [2025-01-09 05:14:18,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:14:18,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:14:18,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:14:18,682 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:14:18,682 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:14:18,682 INFO L87 Difference]: Start difference. First operand 2513 states and 4559 transitions. Second operand has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 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:14:19,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:14:19,324 INFO L93 Difference]: Finished difference Result 3134 states and 5528 transitions. [2025-01-09 05:14:19,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:14:19,324 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 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 99 [2025-01-09 05:14:19,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:14:19,334 INFO L225 Difference]: With dead ends: 3134 [2025-01-09 05:14:19,334 INFO L226 Difference]: Without dead ends: 2755 [2025-01-09 05:14:19,336 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:14:19,336 INFO L435 NwaCegarLoop]: 4347 mSDtfsCounter, 4507 mSDsluCounter, 13032 mSDsCounter, 0 mSdLazyCounter, 620 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4520 SdHoareTripleChecker+Valid, 17379 SdHoareTripleChecker+Invalid, 645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 620 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 05:14:19,337 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4520 Valid, 17379 Invalid, 645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 620 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 05:14:19,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2755 states. [2025-01-09 05:14:19,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2755 to 2692. [2025-01-09 05:14:19,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2692 states, 2623 states have (on average 1.8044224170796797) internal successors, (4733), 2627 states have internal predecessors, (4733), 47 states have call successors, (47), 18 states have call predecessors, (47), 20 states have return successors, (51), 48 states have call predecessors, (51), 47 states have call successors, (51) [2025-01-09 05:14:19,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2692 states to 2692 states and 4831 transitions. [2025-01-09 05:14:19,396 INFO L78 Accepts]: Start accepts. Automaton has 2692 states and 4831 transitions. Word has length 99 [2025-01-09 05:14:19,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:14:19,397 INFO L471 AbstractCegarLoop]: Abstraction has 2692 states and 4831 transitions. [2025-01-09 05:14:19,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 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:14:19,397 INFO L276 IsEmpty]: Start isEmpty. Operand 2692 states and 4831 transitions. [2025-01-09 05:14:19,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-01-09 05:14:19,400 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:14:19,400 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] [2025-01-09 05:14:19,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 05:14:19,401 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:14:19,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:14:19,402 INFO L85 PathProgramCache]: Analyzing trace with hash 420918473, now seen corresponding path program 1 times [2025-01-09 05:14:19,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:14:19,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509073047] [2025-01-09 05:14:19,402 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:14:19,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:14:19,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-01-09 05:14:19,422 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-01-09 05:14:19,422 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:14:19,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:14:19,554 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:14:19,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:14:19,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509073047] [2025-01-09 05:14:19,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509073047] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:14:19,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:14:19,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:14:19,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144773994] [2025-01-09 05:14:19,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:14:19,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:14:19,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:14:19,556 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:14:19,556 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:14:19,557 INFO L87 Difference]: Start difference. First operand 2692 states and 4831 transitions. Second operand has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 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:14:20,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:14:20,007 INFO L93 Difference]: Finished difference Result 3691 states and 6383 transitions. [2025-01-09 05:14:20,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:14:20,008 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 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 99 [2025-01-09 05:14:20,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:14:20,021 INFO L225 Difference]: With dead ends: 3691 [2025-01-09 05:14:20,021 INFO L226 Difference]: Without dead ends: 3133 [2025-01-09 05:14:20,023 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:14:20,024 INFO L435 NwaCegarLoop]: 4339 mSDtfsCounter, 4499 mSDsluCounter, 13010 mSDsCounter, 0 mSdLazyCounter, 620 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4512 SdHoareTripleChecker+Valid, 17349 SdHoareTripleChecker+Invalid, 645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 620 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 05:14:20,024 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4512 Valid, 17349 Invalid, 645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 620 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 05:14:20,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3133 states. [2025-01-09 05:14:20,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3133 to 3068. [2025-01-09 05:14:20,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3068 states, 2955 states have (on average 1.7746192893401016) internal successors, (5244), 2963 states have internal predecessors, (5244), 75 states have call successors, (75), 30 states have call predecessors, (75), 36 states have return successors, (91), 78 states have call predecessors, (91), 75 states have call successors, (91) [2025-01-09 05:14:20,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3068 states to 3068 states and 5410 transitions. [2025-01-09 05:14:20,095 INFO L78 Accepts]: Start accepts. Automaton has 3068 states and 5410 transitions. Word has length 99 [2025-01-09 05:14:20,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:14:20,095 INFO L471 AbstractCegarLoop]: Abstraction has 3068 states and 5410 transitions. [2025-01-09 05:14:20,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 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:14:20,095 INFO L276 IsEmpty]: Start isEmpty. Operand 3068 states and 5410 transitions. [2025-01-09 05:14:20,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-01-09 05:14:20,096 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:14:20,096 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] [2025-01-09 05:14:20,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 05:14:20,097 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:14:20,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:14:20,097 INFO L85 PathProgramCache]: Analyzing trace with hash -721583993, now seen corresponding path program 1 times [2025-01-09 05:14:20,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:14:20,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202936455] [2025-01-09 05:14:20,097 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:14:20,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:14:20,107 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-01-09 05:14:20,110 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-01-09 05:14:20,110 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:14:20,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:14:20,221 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:14:20,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:14:20,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202936455] [2025-01-09 05:14:20,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202936455] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:14:20,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:14:20,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:14:20,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088154205] [2025-01-09 05:14:20,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:14:20,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:14:20,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:14:20,223 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:14:20,223 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:14:20,223 INFO L87 Difference]: Start difference. First operand 3068 states and 5410 transitions. Second operand has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 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:14:20,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:14:20,770 INFO L93 Difference]: Finished difference Result 4883 states and 8252 transitions. [2025-01-09 05:14:20,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:14:20,771 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 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 99 [2025-01-09 05:14:20,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:14:20,788 INFO L225 Difference]: With dead ends: 4883 [2025-01-09 05:14:20,788 INFO L226 Difference]: Without dead ends: 3949 [2025-01-09 05:14:20,790 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:14:20,791 INFO L435 NwaCegarLoop]: 4336 mSDtfsCounter, 4494 mSDsluCounter, 13001 mSDsCounter, 0 mSdLazyCounter, 620 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4507 SdHoareTripleChecker+Valid, 17337 SdHoareTripleChecker+Invalid, 645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 620 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 05:14:20,792 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4507 Valid, 17337 Invalid, 645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 620 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 05:14:20,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3949 states. [2025-01-09 05:14:20,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3949 to 3871. [2025-01-09 05:14:20,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3871 states, 3664 states have (on average 1.732532751091703) internal successors, (6348), 3686 states have internal predecessors, (6348), 131 states have call successors, (131), 54 states have call predecessors, (131), 74 states have return successors, (195), 138 states have call predecessors, (195), 131 states have call successors, (195) [2025-01-09 05:14:20,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3871 states to 3871 states and 6674 transitions. [2025-01-09 05:14:20,902 INFO L78 Accepts]: Start accepts. Automaton has 3871 states and 6674 transitions. Word has length 99 [2025-01-09 05:14:20,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:14:20,902 INFO L471 AbstractCegarLoop]: Abstraction has 3871 states and 6674 transitions. [2025-01-09 05:14:20,903 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 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:14:20,903 INFO L276 IsEmpty]: Start isEmpty. Operand 3871 states and 6674 transitions. [2025-01-09 05:14:20,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-01-09 05:14:20,906 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:14:20,906 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:14:20,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 05:14:20,906 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:14:20,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:14:20,906 INFO L85 PathProgramCache]: Analyzing trace with hash -481344247, now seen corresponding path program 1 times [2025-01-09 05:14:20,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:14:20,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921329739] [2025-01-09 05:14:20,907 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:14:20,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:14:20,915 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-01-09 05:14:20,920 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-01-09 05:14:20,921 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:14:20,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:14:21,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:14:21,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:14:21,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921329739] [2025-01-09 05:14:21,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921329739] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:14:21,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:14:21,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:14:21,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559456007] [2025-01-09 05:14:21,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:14:21,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:14:21,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:14:21,010 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:14:21,010 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:14:21,011 INFO L87 Difference]: Start difference. First operand 3871 states and 6674 transitions. Second operand has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 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:14:21,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:14:21,512 INFO L93 Difference]: Finished difference Result 7452 states and 12402 transitions. [2025-01-09 05:14:21,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:14:21,512 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 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 99 [2025-01-09 05:14:21,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:14:21,532 INFO L225 Difference]: With dead ends: 7452 [2025-01-09 05:14:21,532 INFO L226 Difference]: Without dead ends: 5715 [2025-01-09 05:14:21,537 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:14:21,539 INFO L435 NwaCegarLoop]: 4333 mSDtfsCounter, 4489 mSDsluCounter, 12992 mSDsCounter, 0 mSdLazyCounter, 620 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4502 SdHoareTripleChecker+Valid, 17325 SdHoareTripleChecker+Invalid, 645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 620 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 05:14:21,540 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4502 Valid, 17325 Invalid, 645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 620 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 05:14:21,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5715 states. [2025-01-09 05:14:21,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5715 to 5612. [2025-01-09 05:14:21,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5612 states, 5199 states have (on average 1.6864781688786306) internal successors, (8768), 5267 states have internal predecessors, (8768), 243 states have call successors, (243), 102 states have call predecessors, (243), 168 states have return successors, (499), 258 states have call predecessors, (499), 243 states have call successors, (499) [2025-01-09 05:14:21,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5612 states to 5612 states and 9510 transitions. [2025-01-09 05:14:21,792 INFO L78 Accepts]: Start accepts. Automaton has 5612 states and 9510 transitions. Word has length 99 [2025-01-09 05:14:21,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:14:21,792 INFO L471 AbstractCegarLoop]: Abstraction has 5612 states and 9510 transitions. [2025-01-09 05:14:21,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 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:14:21,792 INFO L276 IsEmpty]: Start isEmpty. Operand 5612 states and 9510 transitions. [2025-01-09 05:14:21,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-01-09 05:14:21,796 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:14:21,796 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] [2025-01-09 05:14:21,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 05:14:21,796 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:14:21,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:14:21,796 INFO L85 PathProgramCache]: Analyzing trace with hash 357689415, now seen corresponding path program 1 times [2025-01-09 05:14:21,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:14:21,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806150096] [2025-01-09 05:14:21,797 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:14:21,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:14:21,806 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-01-09 05:14:21,810 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-01-09 05:14:21,810 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:14:21,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:14:21,920 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:14:21,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:14:21,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806150096] [2025-01-09 05:14:21,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806150096] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:14:21,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:14:21,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:14:21,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322072050] [2025-01-09 05:14:21,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:14:21,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:14:21,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:14:21,922 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:14:21,922 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:14:21,923 INFO L87 Difference]: Start difference. First operand 5612 states and 9510 transitions. Second operand has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 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:14:22,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:14:22,518 INFO L93 Difference]: Finished difference Result 13711 states and 22877 transitions. [2025-01-09 05:14:22,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:14:22,519 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 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 99 [2025-01-09 05:14:22,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:14:22,574 INFO L225 Difference]: With dead ends: 13711 [2025-01-09 05:14:22,575 INFO L226 Difference]: Without dead ends: 10233 [2025-01-09 05:14:22,588 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:14:22,589 INFO L435 NwaCegarLoop]: 4200 mSDtfsCounter, 4673 mSDsluCounter, 12677 mSDsCounter, 0 mSdLazyCounter, 509 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4692 SdHoareTripleChecker+Valid, 16877 SdHoareTripleChecker+Invalid, 552 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 509 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 05:14:22,590 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4692 Valid, 16877 Invalid, 552 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 509 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 05:14:22,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10233 states. [2025-01-09 05:14:23,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10233 to 9397. [2025-01-09 05:14:23,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9397 states, 8534 states have (on average 1.6531520974923835) internal successors, (14108), 8748 states have internal predecessors, (14108), 451 states have call successors, (451), 198 states have call predecessors, (451), 410 states have return successors, (1475), 482 states have call predecessors, (1475), 451 states have call successors, (1475) [2025-01-09 05:14:23,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9397 states to 9397 states and 16034 transitions. [2025-01-09 05:14:23,183 INFO L78 Accepts]: Start accepts. Automaton has 9397 states and 16034 transitions. Word has length 99 [2025-01-09 05:14:23,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:14:23,184 INFO L471 AbstractCegarLoop]: Abstraction has 9397 states and 16034 transitions. [2025-01-09 05:14:23,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 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:14:23,186 INFO L276 IsEmpty]: Start isEmpty. Operand 9397 states and 16034 transitions. [2025-01-09 05:14:23,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-01-09 05:14:23,191 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:14:23,191 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] [2025-01-09 05:14:23,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 05:14:23,192 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:14:23,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:14:23,192 INFO L85 PathProgramCache]: Analyzing trace with hash 384755017, now seen corresponding path program 1 times [2025-01-09 05:14:23,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:14:23,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882700149] [2025-01-09 05:14:23,192 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:14:23,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:14:23,198 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-01-09 05:14:23,201 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-01-09 05:14:23,201 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:14:23,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:14:23,281 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:14:23,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:14:23,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882700149] [2025-01-09 05:14:23,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882700149] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:14:23,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:14:23,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:14:23,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469190547] [2025-01-09 05:14:23,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:14:23,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:14:23,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:14:23,283 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:14:23,283 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:14:23,285 INFO L87 Difference]: Start difference. First operand 9397 states and 16034 transitions. Second operand has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 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:14:24,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:14:24,098 INFO L93 Difference]: Finished difference Result 26418 states and 46011 transitions. [2025-01-09 05:14:24,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:14:24,098 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 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 99 [2025-01-09 05:14:24,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:14:24,171 INFO L225 Difference]: With dead ends: 26418 [2025-01-09 05:14:24,172 INFO L226 Difference]: Without dead ends: 19155 [2025-01-09 05:14:24,200 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:14:24,201 INFO L435 NwaCegarLoop]: 4324 mSDtfsCounter, 4521 mSDsluCounter, 12960 mSDsCounter, 0 mSdLazyCounter, 745 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4533 SdHoareTripleChecker+Valid, 17284 SdHoareTripleChecker+Invalid, 772 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 745 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 05:14:24,202 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4533 Valid, 17284 Invalid, 772 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 745 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 05:14:24,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19155 states. [2025-01-09 05:14:25,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19155 to 17682. [2025-01-09 05:14:25,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17682 states, 15773 states have (on average 1.6364673809674761) internal successors, (25812), 16441 states have internal predecessors, (25812), 851 states have call successors, (851), 390 states have call predecessors, (851), 1056 states have return successors, (4947), 914 states have call predecessors, (4947), 851 states have call successors, (4947) [2025-01-09 05:14:25,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17682 states to 17682 states and 31610 transitions. [2025-01-09 05:14:25,199 INFO L78 Accepts]: Start accepts. Automaton has 17682 states and 31610 transitions. Word has length 99 [2025-01-09 05:14:25,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:14:25,199 INFO L471 AbstractCegarLoop]: Abstraction has 17682 states and 31610 transitions. [2025-01-09 05:14:25,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 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:14:25,200 INFO L276 IsEmpty]: Start isEmpty. Operand 17682 states and 31610 transitions. [2025-01-09 05:14:25,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-01-09 05:14:25,209 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:14:25,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] [2025-01-09 05:14:25,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 05:14:25,209 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:14:25,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:14:25,210 INFO L85 PathProgramCache]: Analyzing trace with hash -1692581881, now seen corresponding path program 1 times [2025-01-09 05:14:25,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:14:25,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782155507] [2025-01-09 05:14:25,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:14:25,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:14:25,216 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-01-09 05:14:25,219 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-01-09 05:14:25,219 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:14:25,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:14:25,295 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:14:25,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:14:25,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782155507] [2025-01-09 05:14:25,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782155507] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:14:25,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:14:25,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:14:25,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162624208] [2025-01-09 05:14:25,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:14:25,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:14:25,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:14:25,297 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:14:25,297 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:14:25,297 INFO L87 Difference]: Start difference. First operand 17682 states and 31610 transitions. Second operand has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 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:14:26,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:14:26,901 INFO L93 Difference]: Finished difference Result 54225 states and 102961 transitions. [2025-01-09 05:14:26,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:14:26,901 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 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 99 [2025-01-09 05:14:26,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:14:27,086 INFO L225 Difference]: With dead ends: 54225 [2025-01-09 05:14:27,086 INFO L226 Difference]: Without dead ends: 38677 [2025-01-09 05:14:27,151 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:14:27,152 INFO L435 NwaCegarLoop]: 4322 mSDtfsCounter, 4578 mSDsluCounter, 12954 mSDsCounter, 0 mSdLazyCounter, 623 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4597 SdHoareTripleChecker+Valid, 17276 SdHoareTripleChecker+Invalid, 651 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 05:14:27,153 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4597 Valid, 17276 Invalid, 651 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 623 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 05:14:27,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38677 states. [2025-01-09 05:14:28,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38677 to 36471. [2025-01-09 05:14:28,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36471 states, 32016 states have (on average 1.6324337831084457) internal successors, (52264), 34078 states have internal predecessors, (52264), 1619 states have call successors, (1619), 774 states have call predecessors, (1619), 2834 states have return successors, (18003), 1746 states have call predecessors, (18003), 1619 states have call successors, (18003) [2025-01-09 05:14:28,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36471 states to 36471 states and 71886 transitions. [2025-01-09 05:14:28,811 INFO L78 Accepts]: Start accepts. Automaton has 36471 states and 71886 transitions. Word has length 99 [2025-01-09 05:14:28,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:14:28,811 INFO L471 AbstractCegarLoop]: Abstraction has 36471 states and 71886 transitions. [2025-01-09 05:14:28,811 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 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:14:28,812 INFO L276 IsEmpty]: Start isEmpty. Operand 36471 states and 71886 transitions. [2025-01-09 05:14:28,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-01-09 05:14:28,825 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:14:28,825 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] [2025-01-09 05:14:28,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 05:14:28,826 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:14:28,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:14:28,829 INFO L85 PathProgramCache]: Analyzing trace with hash 41522569, now seen corresponding path program 1 times [2025-01-09 05:14:28,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:14:28,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330252214] [2025-01-09 05:14:28,829 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:14:28,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:14:28,838 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-01-09 05:14:28,841 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-01-09 05:14:28,841 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:14:28,841 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:14:28,911 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:14:28,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:14:28,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330252214] [2025-01-09 05:14:28,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330252214] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:14:28,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:14:28,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:14:28,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151713813] [2025-01-09 05:14:28,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:14:28,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:14:28,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:14:28,913 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:14:28,913 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:14:28,913 INFO L87 Difference]: Start difference. First operand 36471 states and 71886 transitions. Second operand has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 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:14:32,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:14:32,329 INFO L93 Difference]: Finished difference Result 116652 states and 255663 transitions. [2025-01-09 05:14:32,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:14:32,330 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 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 99 [2025-01-09 05:14:32,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:14:32,749 INFO L225 Difference]: With dead ends: 116652 [2025-01-09 05:14:32,749 INFO L226 Difference]: Without dead ends: 82315 [2025-01-09 05:14:32,879 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:14:32,880 INFO L435 NwaCegarLoop]: 4319 mSDtfsCounter, 4543 mSDsluCounter, 12945 mSDsCounter, 0 mSdLazyCounter, 623 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4562 SdHoareTripleChecker+Valid, 17264 SdHoareTripleChecker+Invalid, 651 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 05:14:32,880 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4562 Valid, 17264 Invalid, 651 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 623 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 05:14:32,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82315 states. [2025-01-09 05:14:37,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82315 to 78960. [2025-01-09 05:14:38,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78960 states, 68019 states have (on average 1.6290742292594715) internal successors, (110808), 74327 states have internal predecessors, (110808), 3091 states have call successors, (3091), 1542 states have call predecessors, (3091), 7848 states have return successors, (68627), 3346 states have call predecessors, (68627), 3091 states have call successors, (68627) [2025-01-09 05:14:38,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78960 states to 78960 states and 182526 transitions. [2025-01-09 05:14:38,806 INFO L78 Accepts]: Start accepts. Automaton has 78960 states and 182526 transitions. Word has length 99 [2025-01-09 05:14:38,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:14:38,806 INFO L471 AbstractCegarLoop]: Abstraction has 78960 states and 182526 transitions. [2025-01-09 05:14:38,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 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:14:38,807 INFO L276 IsEmpty]: Start isEmpty. Operand 78960 states and 182526 transitions. [2025-01-09 05:14:38,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-01-09 05:14:38,996 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:14:38,997 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] [2025-01-09 05:14:38,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 05:14:38,997 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:14:38,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:14:38,998 INFO L85 PathProgramCache]: Analyzing trace with hash 928745415, now seen corresponding path program 1 times [2025-01-09 05:14:38,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:14:38,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296158927] [2025-01-09 05:14:38,998 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:14:38,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:14:39,004 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-01-09 05:14:39,007 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-01-09 05:14:39,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:14:39,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:14:39,097 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:14:39,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:14:39,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296158927] [2025-01-09 05:14:39,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296158927] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:14:39,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:14:39,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 05:14:39,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091372860] [2025-01-09 05:14:39,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:14:39,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 05:14:39,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:14:39,098 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 05:14:39,098 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 05:14:39,098 INFO L87 Difference]: Start difference. First operand 78960 states and 182526 transitions. Second operand has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 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:14:44,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:14:44,385 INFO L93 Difference]: Finished difference Result 168912 states and 433689 transitions. [2025-01-09 05:14:44,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 05:14:44,386 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 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 99 [2025-01-09 05:14:44,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:14:45,187 INFO L225 Difference]: With dead ends: 168912 [2025-01-09 05:14:45,187 INFO L226 Difference]: Without dead ends: 92086 [2025-01-09 05:14:45,360 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:14:45,362 INFO L435 NwaCegarLoop]: 4162 mSDtfsCounter, 4343 mSDsluCounter, 8237 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4356 SdHoareTripleChecker+Valid, 12399 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 05:14:45,362 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4356 Valid, 12399 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 05:14:45,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92086 states.