./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/Problem05_label43+token_ring.07.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/Problem05_label43+token_ring.07.cil-2.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ece5e10278ff4277201bc584c9d4f272bab8d3b56dec5e2dfa257f3717fce473 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 05:18:33,175 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 05:18:33,232 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 05:18:33,235 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 05:18:33,235 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 05:18:33,251 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 05:18:33,251 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 05:18:33,252 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 05:18:33,252 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 05:18:33,252 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 05:18:33,252 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 05:18:33,252 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 05:18:33,252 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 05:18:33,252 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 05:18:33,252 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 05:18:33,252 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 05:18:33,252 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 05:18:33,252 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 05:18:33,252 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 05:18:33,252 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 05:18:33,253 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 05:18:33,253 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 05:18:33,253 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 05:18:33,253 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 05:18:33,253 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 05:18:33,253 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 05:18:33,253 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 05:18:33,253 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 05:18:33,253 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 05:18:33,253 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 05:18:33,253 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 05:18:33,253 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 05:18:33,253 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 05:18:33,253 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 05:18:33,253 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 05:18:33,253 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 05:18:33,253 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 05:18:33,253 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 05:18:33,253 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 05:18:33,253 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 05:18:33,253 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 05:18:33,253 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 05:18:33,253 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 05:18:33,254 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 05:18:33,254 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 05:18:33,254 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 05:18:33,254 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 05:18:33,254 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 05:18:33,254 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 -> ece5e10278ff4277201bc584c9d4f272bab8d3b56dec5e2dfa257f3717fce473 [2025-01-09 05:18:33,487 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 05:18:33,494 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 05:18:33,496 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 05:18:33,496 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 05:18:33,497 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 05:18:33,498 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/Problem05_label43+token_ring.07.cil-2.c [2025-01-09 05:18:34,637 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/47a0113f0/45a3d5cf208f4cebb023f5b2c93d7b6a/FLAG666dd94b1 [2025-01-09 05:18:35,154 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 05:18:35,155 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label43+token_ring.07.cil-2.c [2025-01-09 05:18:35,230 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/47a0113f0/45a3d5cf208f4cebb023f5b2c93d7b6a/FLAG666dd94b1 [2025-01-09 05:18:35,716 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/47a0113f0/45a3d5cf208f4cebb023f5b2c93d7b6a [2025-01-09 05:18:35,718 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 05:18:35,720 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 05:18:35,721 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 05:18:35,721 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 05:18:35,724 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 05:18:35,725 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 05:18:35" (1/1) ... [2025-01-09 05:18:35,725 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9be19f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:18:35, skipping insertion in model container [2025-01-09 05:18:35,725 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 05:18:35" (1/1) ... [2025-01-09 05:18:35,852 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 05:18:36,909 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label43+token_ring.07.cil-2.c[381679,381692] [2025-01-09 05:18:36,937 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label43+token_ring.07.cil-2.c[383339,383352] [2025-01-09 05:18:37,117 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 05:18:37,125 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 05:18:37,629 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label43+token_ring.07.cil-2.c[381679,381692] [2025-01-09 05:18:37,633 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label43+token_ring.07.cil-2.c[383339,383352] [2025-01-09 05:18:37,648 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 05:18:37,695 INFO L204 MainTranslator]: Completed translation [2025-01-09 05:18:37,697 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:18:37 WrapperNode [2025-01-09 05:18:37,697 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 05:18:37,698 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 05:18:37,698 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 05:18:37,698 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 05:18:37,705 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:18:37" (1/1) ... [2025-01-09 05:18:37,772 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:18:37" (1/1) ... [2025-01-09 05:18:38,091 INFO L138 Inliner]: procedures = 58, calls = 63, calls flagged for inlining = 35, calls inlined = 35, statements flattened = 12906 [2025-01-09 05:18:38,092 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 05:18:38,093 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 05:18:38,093 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 05:18:38,093 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 05:18:38,100 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:18:37" (1/1) ... [2025-01-09 05:18:38,100 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:18:37" (1/1) ... [2025-01-09 05:18:38,140 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:18:37" (1/1) ... [2025-01-09 05:18:38,214 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-09 05:18:38,215 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:18:37" (1/1) ... [2025-01-09 05:18:38,215 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:18:37" (1/1) ... [2025-01-09 05:18:38,337 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:18:37" (1/1) ... [2025-01-09 05:18:38,358 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:18:37" (1/1) ... [2025-01-09 05:18:38,413 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:18:37" (1/1) ... [2025-01-09 05:18:38,441 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:18:37" (1/1) ... [2025-01-09 05:18:38,465 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:18:37" (1/1) ... [2025-01-09 05:18:38,612 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 05:18:38,613 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 05:18:38,613 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 05:18:38,613 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 05:18:38,614 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:18:37" (1/1) ... [2025-01-09 05:18:38,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 05:18:38,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:18:38,639 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 05:18:38,644 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 05:18:38,657 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 05:18:38,658 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2025-01-09 05:18:38,658 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2025-01-09 05:18:38,658 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-01-09 05:18:38,658 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-01-09 05:18:38,658 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2025-01-09 05:18:38,658 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2025-01-09 05:18:38,658 INFO L130 BoogieDeclarations]: Found specification of procedure error [2025-01-09 05:18:38,658 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2025-01-09 05:18:38,658 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2025-01-09 05:18:38,658 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2025-01-09 05:18:38,658 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2025-01-09 05:18:38,658 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2025-01-09 05:18:38,658 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2025-01-09 05:18:38,658 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2025-01-09 05:18:38,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 05:18:38,658 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 05:18:38,658 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 05:18:38,749 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 05:18:38,751 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 05:18:44,731 INFO L? ?]: Removed 1729 outVars from TransFormulas that were not future-live. [2025-01-09 05:18:44,731 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 05:18:44,790 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 05:18:44,793 INFO L312 CfgBuilder]: Removed 11 assume(true) statements. [2025-01-09 05:18:44,794 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 05:18:44 BoogieIcfgContainer [2025-01-09 05:18:44,794 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 05:18:44,796 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 05:18:44,796 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 05:18:44,799 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 05:18:44,800 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 05:18:35" (1/3) ... [2025-01-09 05:18:44,801 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6efe3ccb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 05:18:44, skipping insertion in model container [2025-01-09 05:18:44,801 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:18:37" (2/3) ... [2025-01-09 05:18:44,801 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6efe3ccb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 05:18:44, skipping insertion in model container [2025-01-09 05:18:44,801 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 05:18:44" (3/3) ... [2025-01-09 05:18:44,802 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem05_label43+token_ring.07.cil-2.c [2025-01-09 05:18:44,812 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 05:18:44,816 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem05_label43+token_ring.07.cil-2.c that has 8 procedures, 2446 locations, 1 initial locations, 11 loop locations, and 2 error locations. [2025-01-09 05:18:44,935 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 05:18:44,956 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;@60d68b75, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 05:18:44,956 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-01-09 05:18:44,972 INFO L276 IsEmpty]: Start isEmpty. Operand has 2446 states, 2414 states have (on average 1.8454846727423364) internal successors, (4455), 2418 states have internal predecessors, (4455), 23 states have call successors, (23), 7 states have call predecessors, (23), 7 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2025-01-09 05:18:45,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-01-09 05:18:45,003 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:18:45,004 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:18:45,004 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:18:45,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:18:45,009 INFO L85 PathProgramCache]: Analyzing trace with hash -283220270, now seen corresponding path program 1 times [2025-01-09 05:18:45,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:18:45,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488741579] [2025-01-09 05:18:45,023 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:18:45,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:18:45,114 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-01-09 05:18:45,137 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-01-09 05:18:45,137 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:18:45,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:18:45,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:18:45,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:18:45,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488741579] [2025-01-09 05:18:45,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488741579] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:18:45,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:18:45,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:18:45,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494150598] [2025-01-09 05:18:45,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:18:45,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:18:45,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:18:45,332 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:18:45,333 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:18:45,338 INFO L87 Difference]: Start difference. First operand has 2446 states, 2414 states have (on average 1.8454846727423364) internal successors, (4455), 2418 states have internal predecessors, (4455), 23 states have call successors, (23), 7 states have call predecessors, (23), 7 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:18:45,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:18:45,484 INFO L93 Difference]: Finished difference Result 4886 states and 8993 transitions. [2025-01-09 05:18:45,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:18:45,486 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 122 [2025-01-09 05:18:45,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:18:45,509 INFO L225 Difference]: With dead ends: 4886 [2025-01-09 05:18:45,509 INFO L226 Difference]: Without dead ends: 2378 [2025-01-09 05:18:45,517 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:18:45,521 INFO L435 NwaCegarLoop]: 4425 mSDtfsCounter, 399 mSDsluCounter, 4022 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 399 SdHoareTripleChecker+Valid, 8447 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:18:45,523 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [399 Valid, 8447 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:18:45,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2378 states. [2025-01-09 05:18:45,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2378 to 2378. [2025-01-09 05:18:45,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2378 states, 2347 states have (on average 1.8376651043885812) internal successors, (4313), 2350 states have internal predecessors, (4313), 23 states have call successors, (23), 7 states have call predecessors, (23), 6 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-01-09 05:18:45,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2378 states to 2378 states and 4357 transitions. [2025-01-09 05:18:45,619 INFO L78 Accepts]: Start accepts. Automaton has 2378 states and 4357 transitions. Word has length 122 [2025-01-09 05:18:45,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:18:45,620 INFO L471 AbstractCegarLoop]: Abstraction has 2378 states and 4357 transitions. [2025-01-09 05:18:45,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:18:45,620 INFO L276 IsEmpty]: Start isEmpty. Operand 2378 states and 4357 transitions. [2025-01-09 05:18:45,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-01-09 05:18:45,624 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:18:45,624 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:18:45,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 05:18:45,625 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:18:45,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:18:45,625 INFO L85 PathProgramCache]: Analyzing trace with hash 2009860756, now seen corresponding path program 1 times [2025-01-09 05:18:45,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:18:45,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505243019] [2025-01-09 05:18:45,625 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:18:45,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:18:45,635 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-01-09 05:18:45,653 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-01-09 05:18:45,653 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:18:45,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:18:45,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:18:45,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:18:45,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505243019] [2025-01-09 05:18:45,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505243019] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:18:45,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:18:45,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 05:18:45,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297487547] [2025-01-09 05:18:45,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:18:45,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 05:18:45,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:18:45,865 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 05:18:45,866 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 05:18:45,866 INFO L87 Difference]: Start difference. First operand 2378 states and 4357 transitions. Second operand has 5 states, 5 states have (on average 22.2) internal successors, (111), 4 states have internal predecessors, (111), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:18:46,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:18:46,306 INFO L93 Difference]: Finished difference Result 2890 states and 5165 transitions. [2025-01-09 05:18:46,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 05:18:46,307 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 4 states have internal predecessors, (111), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 122 [2025-01-09 05:18:46,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:18:46,318 INFO L225 Difference]: With dead ends: 2890 [2025-01-09 05:18:46,319 INFO L226 Difference]: Without dead ends: 2648 [2025-01-09 05:18:46,321 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:18:46,321 INFO L435 NwaCegarLoop]: 4268 mSDtfsCounter, 4695 mSDsluCounter, 8697 mSDsCounter, 0 mSdLazyCounter, 432 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4710 SdHoareTripleChecker+Valid, 12965 SdHoareTripleChecker+Invalid, 482 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 432 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 05:18:46,322 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4710 Valid, 12965 Invalid, 482 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 432 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 05:18:46,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2648 states. [2025-01-09 05:18:46,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2648 to 2627. [2025-01-09 05:18:46,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2627 states, 2573 states have (on average 1.8157792460163233) internal successors, (4672), 2577 states have internal predecessors, (4672), 39 states have call successors, (39), 13 states have call predecessors, (39), 13 states have return successors, (38), 37 states have call predecessors, (38), 37 states have call successors, (38) [2025-01-09 05:18:46,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2627 states to 2627 states and 4749 transitions. [2025-01-09 05:18:46,379 INFO L78 Accepts]: Start accepts. Automaton has 2627 states and 4749 transitions. Word has length 122 [2025-01-09 05:18:46,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:18:46,379 INFO L471 AbstractCegarLoop]: Abstraction has 2627 states and 4749 transitions. [2025-01-09 05:18:46,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 4 states have internal predecessors, (111), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:18:46,379 INFO L276 IsEmpty]: Start isEmpty. Operand 2627 states and 4749 transitions. [2025-01-09 05:18:46,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-01-09 05:18:46,380 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:18:46,381 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:18:46,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 05:18:46,381 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:18:46,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:18:46,381 INFO L85 PathProgramCache]: Analyzing trace with hash 1155171472, now seen corresponding path program 1 times [2025-01-09 05:18:46,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:18:46,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896627354] [2025-01-09 05:18:46,385 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:18:46,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:18:46,398 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-01-09 05:18:46,406 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-01-09 05:18:46,406 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:18:46,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:18:46,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:18:46,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:18:46,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896627354] [2025-01-09 05:18:46,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896627354] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:18:46,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:18:46,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:18:46,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611067402] [2025-01-09 05:18:46,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:18:46,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:18:46,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:18:46,576 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:18:46,576 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:18:46,577 INFO L87 Difference]: Start difference. First operand 2627 states and 4749 transitions. Second operand has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:18:47,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:18:47,201 INFO L93 Difference]: Finished difference Result 3435 states and 6034 transitions. [2025-01-09 05:18:47,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:18:47,201 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 122 [2025-01-09 05:18:47,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:18:47,214 INFO L225 Difference]: With dead ends: 3435 [2025-01-09 05:18:47,215 INFO L226 Difference]: Without dead ends: 2944 [2025-01-09 05:18:47,217 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 05:18:47,219 INFO L435 NwaCegarLoop]: 4479 mSDtfsCounter, 4694 mSDsluCounter, 13445 mSDsCounter, 0 mSdLazyCounter, 767 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4709 SdHoareTripleChecker+Valid, 17924 SdHoareTripleChecker+Invalid, 796 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 767 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 05:18:47,219 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4709 Valid, 17924 Invalid, 796 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 767 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 05:18:47,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2944 states. [2025-01-09 05:18:47,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2944 to 2859. [2025-01-09 05:18:47,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2859 states, 2782 states have (on average 1.7961897915168943) internal successors, (4997), 2787 states have internal predecessors, (4997), 55 states have call successors, (55), 19 states have call predecessors, (55), 20 states have return successors, (57), 54 states have call predecessors, (57), 53 states have call successors, (57) [2025-01-09 05:18:47,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2859 states to 2859 states and 5109 transitions. [2025-01-09 05:18:47,294 INFO L78 Accepts]: Start accepts. Automaton has 2859 states and 5109 transitions. Word has length 122 [2025-01-09 05:18:47,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:18:47,294 INFO L471 AbstractCegarLoop]: Abstraction has 2859 states and 5109 transitions. [2025-01-09 05:18:47,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:18:47,294 INFO L276 IsEmpty]: Start isEmpty. Operand 2859 states and 5109 transitions. [2025-01-09 05:18:47,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-01-09 05:18:47,296 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:18:47,296 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:18:47,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 05:18:47,297 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:18:47,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:18:47,299 INFO L85 PathProgramCache]: Analyzing trace with hash -878222574, now seen corresponding path program 1 times [2025-01-09 05:18:47,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:18:47,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212661603] [2025-01-09 05:18:47,299 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:18:47,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:18:47,312 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-01-09 05:18:47,318 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-01-09 05:18:47,319 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:18:47,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:18:47,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:18:47,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:18:47,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212661603] [2025-01-09 05:18:47,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212661603] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:18:47,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:18:47,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:18:47,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420649427] [2025-01-09 05:18:47,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:18:47,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:18:47,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:18:47,475 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:18:47,476 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:18:47,476 INFO L87 Difference]: Start difference. First operand 2859 states and 5109 transitions. Second operand has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:18:48,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:18:48,001 INFO L93 Difference]: Finished difference Result 4171 states and 7193 transitions. [2025-01-09 05:18:48,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:18:48,002 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 122 [2025-01-09 05:18:48,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:18:48,014 INFO L225 Difference]: With dead ends: 4171 [2025-01-09 05:18:48,015 INFO L226 Difference]: Without dead ends: 3448 [2025-01-09 05:18:48,018 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 05:18:48,019 INFO L435 NwaCegarLoop]: 4475 mSDtfsCounter, 4689 mSDsluCounter, 13433 mSDsCounter, 0 mSdLazyCounter, 767 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4704 SdHoareTripleChecker+Valid, 17908 SdHoareTripleChecker+Invalid, 796 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 767 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 05:18:48,019 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4704 Valid, 17908 Invalid, 796 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 767 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 05:18:48,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3448 states. [2025-01-09 05:18:48,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3448 to 3352. [2025-01-09 05:18:48,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3352 states, 3227 states have (on average 1.7657266811279826) internal successors, (5698), 3236 states have internal predecessors, (5698), 87 states have call successors, (87), 31 states have call predecessors, (87), 36 states have return successors, (101), 88 states have call predecessors, (101), 85 states have call successors, (101) [2025-01-09 05:18:48,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3352 states to 3352 states and 5886 transitions. [2025-01-09 05:18:48,115 INFO L78 Accepts]: Start accepts. Automaton has 3352 states and 5886 transitions. Word has length 122 [2025-01-09 05:18:48,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:18:48,116 INFO L471 AbstractCegarLoop]: Abstraction has 3352 states and 5886 transitions. [2025-01-09 05:18:48,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:18:48,116 INFO L276 IsEmpty]: Start isEmpty. Operand 3352 states and 5886 transitions. [2025-01-09 05:18:48,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-01-09 05:18:48,118 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:18:48,118 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:18:48,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 05:18:48,119 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:18:48,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:18:48,120 INFO L85 PathProgramCache]: Analyzing trace with hash 1550036048, now seen corresponding path program 1 times [2025-01-09 05:18:48,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:18:48,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710574538] [2025-01-09 05:18:48,120 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:18:48,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:18:48,130 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-01-09 05:18:48,136 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-01-09 05:18:48,137 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:18:48,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:18:48,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:18:48,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:18:48,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710574538] [2025-01-09 05:18:48,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [710574538] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:18:48,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:18:48,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:18:48,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209699549] [2025-01-09 05:18:48,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:18:48,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:18:48,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:18:48,257 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:18:48,257 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:18:48,257 INFO L87 Difference]: Start difference. First operand 3352 states and 5886 transitions. Second operand has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:18:48,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:18:48,885 INFO L93 Difference]: Finished difference Result 5754 states and 9736 transitions. [2025-01-09 05:18:48,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:18:48,885 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 122 [2025-01-09 05:18:48,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:18:48,903 INFO L225 Difference]: With dead ends: 5754 [2025-01-09 05:18:48,904 INFO L226 Difference]: Without dead ends: 4538 [2025-01-09 05:18:48,909 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 05:18:48,910 INFO L435 NwaCegarLoop]: 4472 mSDtfsCounter, 4684 mSDsluCounter, 13424 mSDsCounter, 0 mSdLazyCounter, 767 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4699 SdHoareTripleChecker+Valid, 17896 SdHoareTripleChecker+Invalid, 796 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 767 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 05:18:48,910 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4699 Valid, 17896 Invalid, 796 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 767 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 05:18:48,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4538 states. [2025-01-09 05:18:49,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4538 to 4419. [2025-01-09 05:18:49,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4419 states, 4192 states have (on average 1.7275763358778626) internal successors, (7242), 4215 states have internal predecessors, (7242), 151 states have call successors, (151), 55 states have call predecessors, (151), 74 states have return successors, (213), 156 states have call predecessors, (213), 149 states have call successors, (213) [2025-01-09 05:18:49,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4419 states to 4419 states and 7606 transitions. [2025-01-09 05:18:49,058 INFO L78 Accepts]: Start accepts. Automaton has 4419 states and 7606 transitions. Word has length 122 [2025-01-09 05:18:49,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:18:49,059 INFO L471 AbstractCegarLoop]: Abstraction has 4419 states and 7606 transitions. [2025-01-09 05:18:49,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:18:49,059 INFO L276 IsEmpty]: Start isEmpty. Operand 4419 states and 7606 transitions. [2025-01-09 05:18:49,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-01-09 05:18:49,064 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:18:49,065 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:18:49,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 05:18:49,065 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:18:49,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:18:49,065 INFO L85 PathProgramCache]: Analyzing trace with hash 242893650, now seen corresponding path program 1 times [2025-01-09 05:18:49,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:18:49,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638661535] [2025-01-09 05:18:49,065 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:18:49,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:18:49,075 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-01-09 05:18:49,081 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-01-09 05:18:49,081 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:18:49,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:18:49,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:18:49,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:18:49,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638661535] [2025-01-09 05:18:49,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638661535] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:18:49,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:18:49,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:18:49,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303878932] [2025-01-09 05:18:49,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:18:49,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:18:49,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:18:49,181 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:18:49,182 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:18:49,182 INFO L87 Difference]: Start difference. First operand 4419 states and 7606 transitions. Second operand has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:18:49,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:18:49,734 INFO L93 Difference]: Finished difference Result 9225 states and 15474 transitions. [2025-01-09 05:18:49,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:18:49,734 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 122 [2025-01-09 05:18:49,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:18:49,759 INFO L225 Difference]: With dead ends: 9225 [2025-01-09 05:18:49,760 INFO L226 Difference]: Without dead ends: 6942 [2025-01-09 05:18:49,768 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 05:18:49,768 INFO L435 NwaCegarLoop]: 4469 mSDtfsCounter, 4679 mSDsluCounter, 13415 mSDsCounter, 0 mSdLazyCounter, 767 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4694 SdHoareTripleChecker+Valid, 17884 SdHoareTripleChecker+Invalid, 796 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 767 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 05:18:49,769 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4694 Valid, 17884 Invalid, 796 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 767 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 05:18:49,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6942 states. [2025-01-09 05:18:49,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6942 to 6778. [2025-01-09 05:18:49,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6778 states, 6329 states have (on average 1.6941064939168906) internal successors, (10722), 6398 states have internal predecessors, (10722), 279 states have call successors, (279), 103 states have call predecessors, (279), 168 states have return successors, (533), 292 states have call predecessors, (533), 277 states have call successors, (533) [2025-01-09 05:18:50,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6778 states to 6778 states and 11534 transitions. [2025-01-09 05:18:50,006 INFO L78 Accepts]: Start accepts. Automaton has 6778 states and 11534 transitions. Word has length 122 [2025-01-09 05:18:50,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:18:50,006 INFO L471 AbstractCegarLoop]: Abstraction has 6778 states and 11534 transitions. [2025-01-09 05:18:50,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:18:50,007 INFO L276 IsEmpty]: Start isEmpty. Operand 6778 states and 11534 transitions. [2025-01-09 05:18:50,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-01-09 05:18:50,010 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:18:50,010 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:18:50,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 05:18:50,011 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:18:50,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:18:50,011 INFO L85 PathProgramCache]: Analyzing trace with hash 2140390416, now seen corresponding path program 1 times [2025-01-09 05:18:50,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:18:50,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656279692] [2025-01-09 05:18:50,011 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:18:50,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:18:50,020 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-01-09 05:18:50,024 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-01-09 05:18:50,024 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:18:50,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:18:50,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:18:50,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:18:50,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656279692] [2025-01-09 05:18:50,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656279692] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:18:50,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:18:50,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:18:50,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803075281] [2025-01-09 05:18:50,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:18:50,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:18:50,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:18:50,128 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:18:50,128 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:18:50,128 INFO L87 Difference]: Start difference. First operand 6778 states and 11534 transitions. Second operand has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:18:50,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:18:50,782 INFO L93 Difference]: Finished difference Result 17008 states and 28884 transitions. [2025-01-09 05:18:50,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:18:50,782 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 122 [2025-01-09 05:18:50,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:18:50,893 INFO L225 Difference]: With dead ends: 17008 [2025-01-09 05:18:50,893 INFO L226 Difference]: Without dead ends: 12366 [2025-01-09 05:18:50,903 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 05:18:50,903 INFO L435 NwaCegarLoop]: 4466 mSDtfsCounter, 4674 mSDsluCounter, 13406 mSDsCounter, 0 mSdLazyCounter, 767 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4689 SdHoareTripleChecker+Valid, 17872 SdHoareTripleChecker+Invalid, 796 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 767 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 05:18:50,904 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4689 Valid, 17872 Invalid, 796 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 767 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 05:18:50,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12366 states. [2025-01-09 05:18:51,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12366 to 12117. [2025-01-09 05:18:51,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12117 states, 11170 states have (on average 1.678961504028648) internal successors, (18754), 11385 states have internal predecessors, (18754), 535 states have call successors, (535), 199 states have call predecessors, (535), 410 states have return successors, (1557), 564 states have call predecessors, (1557), 533 states have call successors, (1557) [2025-01-09 05:18:51,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12117 states to 12117 states and 20846 transitions. [2025-01-09 05:18:51,201 INFO L78 Accepts]: Start accepts. Automaton has 12117 states and 20846 transitions. Word has length 122 [2025-01-09 05:18:51,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:18:51,201 INFO L471 AbstractCegarLoop]: Abstraction has 12117 states and 20846 transitions. [2025-01-09 05:18:51,201 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:18:51,201 INFO L276 IsEmpty]: Start isEmpty. Operand 12117 states and 20846 transitions. [2025-01-09 05:18:51,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-01-09 05:18:51,207 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:18:51,207 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:18:51,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 05:18:51,208 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:18:51,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:18:51,208 INFO L85 PathProgramCache]: Analyzing trace with hash -1123535982, now seen corresponding path program 1 times [2025-01-09 05:18:51,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:18:51,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678071676] [2025-01-09 05:18:51,209 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:18:51,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:18:51,215 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-01-09 05:18:51,218 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-01-09 05:18:51,219 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:18:51,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:18:51,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:18:51,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:18:51,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678071676] [2025-01-09 05:18:51,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678071676] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:18:51,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:18:51,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 05:18:51,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671092936] [2025-01-09 05:18:51,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:18:51,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 05:18:51,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:18:51,313 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 05:18:51,313 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 05:18:51,313 INFO L87 Difference]: Start difference. First operand 12117 states and 20846 transitions. Second operand has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:18:51,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:18:51,904 INFO L93 Difference]: Finished difference Result 24548 states and 42967 transitions. [2025-01-09 05:18:51,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 05:18:51,908 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 122 [2025-01-09 05:18:51,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:18:51,978 INFO L225 Difference]: With dead ends: 24548 [2025-01-09 05:18:51,978 INFO L226 Difference]: Without dead ends: 14567 [2025-01-09 05:18:52,008 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:18:52,008 INFO L435 NwaCegarLoop]: 4245 mSDtfsCounter, 4480 mSDsluCounter, 8381 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4495 SdHoareTripleChecker+Valid, 12626 SdHoareTripleChecker+Invalid, 338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 05:18:52,009 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4495 Valid, 12626 Invalid, 338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 05:18:52,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14567 states. [2025-01-09 05:18:52,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14567 to 12117. [2025-01-09 05:18:52,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12117 states, 11170 states have (on average 1.6760071620411818) internal successors, (18721), 11385 states have internal predecessors, (18721), 535 states have call successors, (535), 199 states have call predecessors, (535), 410 states have return successors, (1557), 564 states have call predecessors, (1557), 533 states have call successors, (1557) [2025-01-09 05:18:52,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12117 states to 12117 states and 20813 transitions. [2025-01-09 05:18:52,443 INFO L78 Accepts]: Start accepts. Automaton has 12117 states and 20813 transitions. Word has length 122 [2025-01-09 05:18:52,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:18:52,443 INFO L471 AbstractCegarLoop]: Abstraction has 12117 states and 20813 transitions. [2025-01-09 05:18:52,445 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:18:52,445 INFO L276 IsEmpty]: Start isEmpty. Operand 12117 states and 20813 transitions. [2025-01-09 05:18:52,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-01-09 05:18:52,452 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:18:52,453 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:18:52,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 05:18:52,453 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:18:52,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:18:52,454 INFO L85 PathProgramCache]: Analyzing trace with hash 477535124, now seen corresponding path program 1 times [2025-01-09 05:18:52,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:18:52,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217692867] [2025-01-09 05:18:52,454 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:18:52,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:18:52,464 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-01-09 05:18:52,468 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-01-09 05:18:52,469 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:18:52,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:18:52,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:18:52,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:18:52,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217692867] [2025-01-09 05:18:52,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217692867] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:18:52,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:18:52,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:18:52,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299385782] [2025-01-09 05:18:52,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:18:52,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:18:52,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:18:52,561 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:18:52,561 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:18:52,561 INFO L87 Difference]: Start difference. First operand 12117 states and 20813 transitions. Second operand has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:18:53,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:18:53,738 INFO L93 Difference]: Finished difference Result 36055 states and 62984 transitions. [2025-01-09 05:18:53,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:18:53,739 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 122 [2025-01-09 05:18:53,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:18:53,850 INFO L225 Difference]: With dead ends: 36055 [2025-01-09 05:18:53,850 INFO L226 Difference]: Without dead ends: 26074 [2025-01-09 05:18:53,892 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 05:18:53,893 INFO L435 NwaCegarLoop]: 4452 mSDtfsCounter, 4882 mSDsluCounter, 13362 mSDsCounter, 0 mSdLazyCounter, 770 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4905 SdHoareTripleChecker+Valid, 17814 SdHoareTripleChecker+Invalid, 802 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 770 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 05:18:53,893 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4905 Valid, 17814 Invalid, 802 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 770 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 05:18:53,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26074 states. [2025-01-09 05:18:54,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26074 to 23914. [2025-01-09 05:18:54,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23914 states, 21841 states have (on average 1.676525800100728) internal successors, (36617), 22510 states have internal predecessors, (36617), 1015 states have call successors, (1015), 391 states have call predecessors, (1015), 1056 states have return successors, (5109), 1076 states have call predecessors, (5109), 1013 states have call successors, (5109) [2025-01-09 05:18:54,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23914 states to 23914 states and 42741 transitions. [2025-01-09 05:18:54,775 INFO L78 Accepts]: Start accepts. Automaton has 23914 states and 42741 transitions. Word has length 122 [2025-01-09 05:18:54,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:18:54,776 INFO L471 AbstractCegarLoop]: Abstraction has 23914 states and 42741 transitions. [2025-01-09 05:18:54,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:18:54,776 INFO L276 IsEmpty]: Start isEmpty. Operand 23914 states and 42741 transitions. [2025-01-09 05:18:54,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-01-09 05:18:54,786 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:18:54,786 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:18:54,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 05:18:54,786 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:18:54,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:18:54,787 INFO L85 PathProgramCache]: Analyzing trace with hash -579196078, now seen corresponding path program 1 times [2025-01-09 05:18:54,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:18:54,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767724371] [2025-01-09 05:18:54,787 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:18:54,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:18:54,795 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-01-09 05:18:54,802 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-01-09 05:18:54,802 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:18:54,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:18:54,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:18:54,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:18:54,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767724371] [2025-01-09 05:18:54,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1767724371] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:18:54,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:18:54,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:18:54,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639750689] [2025-01-09 05:18:54,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:18:54,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:18:54,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:18:54,903 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:18:54,903 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:18:54,903 INFO L87 Difference]: Start difference. First operand 23914 states and 42741 transitions. Second operand has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:18:56,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:18:56,501 INFO L93 Difference]: Finished difference Result 76528 states and 143042 transitions. [2025-01-09 05:18:56,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:18:56,501 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 122 [2025-01-09 05:18:56,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:18:56,748 INFO L225 Difference]: With dead ends: 76528 [2025-01-09 05:18:56,748 INFO L226 Difference]: Without dead ends: 54750 [2025-01-09 05:18:56,811 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 05:18:56,812 INFO L435 NwaCegarLoop]: 4448 mSDtfsCounter, 4715 mSDsluCounter, 13350 mSDsCounter, 0 mSdLazyCounter, 940 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4729 SdHoareTripleChecker+Valid, 17798 SdHoareTripleChecker+Invalid, 971 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 940 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 05:18:56,812 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4729 Valid, 17798 Invalid, 971 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 940 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 05:18:56,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54750 states. [2025-01-09 05:18:59,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54750 to 50481. [2025-01-09 05:18:59,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50481 states, 45702 states have (on average 1.6860750076583082) internal successors, (77057), 47765 states have internal predecessors, (77057), 1943 states have call successors, (1943), 775 states have call predecessors, (1943), 2834 states have return successors, (18325), 2068 states have call predecessors, (18325), 1941 states have call successors, (18325) [2025-01-09 05:18:59,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50481 states to 50481 states and 97325 transitions. [2025-01-09 05:18:59,692 INFO L78 Accepts]: Start accepts. Automaton has 50481 states and 97325 transitions. Word has length 122 [2025-01-09 05:18:59,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:18:59,692 INFO L471 AbstractCegarLoop]: Abstraction has 50481 states and 97325 transitions. [2025-01-09 05:18:59,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:18:59,693 INFO L276 IsEmpty]: Start isEmpty. Operand 50481 states and 97325 transitions. [2025-01-09 05:18:59,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-01-09 05:18:59,710 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:18:59,710 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:18:59,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 05:18:59,710 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:18:59,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:18:59,711 INFO L85 PathProgramCache]: Analyzing trace with hash 772189140, now seen corresponding path program 1 times [2025-01-09 05:18:59,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:18:59,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12227972] [2025-01-09 05:18:59,712 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:18:59,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:18:59,719 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-01-09 05:18:59,724 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-01-09 05:18:59,724 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:18:59,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:18:59,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:18:59,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:18:59,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12227972] [2025-01-09 05:18:59,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12227972] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:18:59,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:18:59,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:18:59,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491159800] [2025-01-09 05:18:59,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:18:59,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:18:59,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:18:59,806 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:18:59,806 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:18:59,806 INFO L87 Difference]: Start difference. First operand 50481 states and 97325 transitions. Second operand has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:19:03,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:19:03,385 INFO L93 Difference]: Finished difference Result 168263 states and 349944 transitions. [2025-01-09 05:19:03,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:19:03,386 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 122 [2025-01-09 05:19:03,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:19:04,114 INFO L225 Difference]: With dead ends: 168263 [2025-01-09 05:19:04,114 INFO L226 Difference]: Without dead ends: 119918 [2025-01-09 05:19:04,339 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 05:19:04,340 INFO L435 NwaCegarLoop]: 4446 mSDtfsCounter, 4812 mSDsluCounter, 13344 mSDsCounter, 0 mSdLazyCounter, 770 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4835 SdHoareTripleChecker+Valid, 17790 SdHoareTripleChecker+Invalid, 802 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 770 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 05:19:04,340 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4835 Valid, 17790 Invalid, 802 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 770 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 05:19:04,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119918 states. [2025-01-09 05:19:11,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119918 to 113476. [2025-01-09 05:19:11,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113476 states, 101891 states have (on average 1.701946197407033) internal successors, (173413), 108200 states have internal predecessors, (173413), 3735 states have call successors, (3735), 1543 states have call predecessors, (3735), 7848 states have return successors, (69269), 3988 states have call predecessors, (69269), 3733 states have call successors, (69269) [2025-01-09 05:19:12,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113476 states to 113476 states and 246417 transitions. [2025-01-09 05:19:12,072 INFO L78 Accepts]: Start accepts. Automaton has 113476 states and 246417 transitions. Word has length 122 [2025-01-09 05:19:12,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:19:12,072 INFO L471 AbstractCegarLoop]: Abstraction has 113476 states and 246417 transitions. [2025-01-09 05:19:12,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:19:12,073 INFO L276 IsEmpty]: Start isEmpty. Operand 113476 states and 246417 transitions. [2025-01-09 05:19:12,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-01-09 05:19:12,114 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:19:12,114 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:19:12,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 05:19:12,114 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:19:12,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:19:12,115 INFO L85 PathProgramCache]: Analyzing trace with hash -846785774, now seen corresponding path program 1 times [2025-01-09 05:19:12,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:19:12,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223396539] [2025-01-09 05:19:12,115 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:19:12,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:19:12,125 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-01-09 05:19:12,129 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-01-09 05:19:12,129 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:19:12,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:19:12,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:19:12,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:19:12,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223396539] [2025-01-09 05:19:12,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223396539] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:19:12,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:19:12,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:19:12,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664716280] [2025-01-09 05:19:12,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:19:12,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:19:12,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:19:12,243 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:19:12,243 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:19:12,243 INFO L87 Difference]: Start difference. First operand 113476 states and 246417 transitions. Second operand has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5)