./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/Problem05_label43+token_ring.04.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.04.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 2c5568751dd37ae3ac79e02a0fd7273b3ab2af9e94f13bec2f84e6a22bfe26f6 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 05:18:02,385 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 05:18:02,420 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:02,424 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 05:18:02,424 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 05:18:02,438 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 05:18:02,438 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 05:18:02,438 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 05:18:02,439 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 05:18:02,439 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 05:18:02,439 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 05:18:02,439 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 05:18:02,439 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 05:18:02,439 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 05:18:02,439 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 05:18:02,439 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 05:18:02,439 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 05:18:02,439 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 05:18:02,439 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 05:18:02,439 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 05:18:02,439 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 05:18:02,440 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 05:18:02,440 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 05:18:02,440 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 05:18:02,440 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 05:18:02,440 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 05:18:02,440 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 05:18:02,440 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 05:18:02,440 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 05:18:02,440 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 05:18:02,440 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 05:18:02,440 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 05:18:02,440 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 05:18:02,440 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 05:18:02,440 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 05:18:02,440 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 05:18:02,440 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 05:18:02,440 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 05:18:02,440 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 05:18:02,441 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 05:18:02,441 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 05:18:02,441 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 05:18:02,441 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 05:18:02,441 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 05:18:02,441 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 05:18:02,441 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 05:18:02,441 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 05:18:02,441 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 05:18:02,441 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 -> 2c5568751dd37ae3ac79e02a0fd7273b3ab2af9e94f13bec2f84e6a22bfe26f6 [2025-01-09 05:18:02,683 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 05:18:02,688 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 05:18:02,690 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 05:18:02,691 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 05:18:02,691 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 05:18:02,692 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.04.cil-2.c [2025-01-09 05:18:03,817 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/18a8b9f49/39153c2f922541b0b1e5be0c11ca2ce2/FLAGa22ed3f86 [2025-01-09 05:18:04,536 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 05:18:04,538 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label43+token_ring.04.cil-2.c [2025-01-09 05:18:04,586 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/18a8b9f49/39153c2f922541b0b1e5be0c11ca2ce2/FLAGa22ed3f86 [2025-01-09 05:18:04,604 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/18a8b9f49/39153c2f922541b0b1e5be0c11ca2ce2 [2025-01-09 05:18:04,611 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 05:18:04,612 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 05:18:04,613 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 05:18:04,613 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 05:18:04,617 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 05:18:04,618 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 05:18:04" (1/1) ... [2025-01-09 05:18:04,618 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63f915dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:18:04, skipping insertion in model container [2025-01-09 05:18:04,619 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 05:18:04" (1/1) ... [2025-01-09 05:18:04,778 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 05:18:05,883 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.04.cil-2.c[381679,381692] [2025-01-09 05:18:05,918 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.04.cil-2.c[383339,383352] [2025-01-09 05:18:06,116 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 05:18:06,126 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 05:18:06,651 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.04.cil-2.c[381679,381692] [2025-01-09 05:18:06,654 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.04.cil-2.c[383339,383352] [2025-01-09 05:18:06,664 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 05:18:06,704 INFO L204 MainTranslator]: Completed translation [2025-01-09 05:18:06,705 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:18:06 WrapperNode [2025-01-09 05:18:06,705 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 05:18:06,706 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 05:18:06,706 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 05:18:06,706 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 05:18:06,710 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:06" (1/1) ... [2025-01-09 05:18:06,768 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:06" (1/1) ... [2025-01-09 05:18:07,061 INFO L138 Inliner]: procedures = 52, calls = 54, calls flagged for inlining = 29, calls inlined = 29, statements flattened = 12735 [2025-01-09 05:18:07,062 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 05:18:07,062 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 05:18:07,062 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 05:18:07,062 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 05:18:07,069 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:06" (1/1) ... [2025-01-09 05:18:07,069 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:06" (1/1) ... [2025-01-09 05:18:07,103 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:06" (1/1) ... [2025-01-09 05:18:07,189 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:07,190 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:06" (1/1) ... [2025-01-09 05:18:07,190 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:06" (1/1) ... [2025-01-09 05:18:07,581 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:06" (1/1) ... [2025-01-09 05:18:07,608 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:06" (1/1) ... [2025-01-09 05:18:07,660 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:06" (1/1) ... [2025-01-09 05:18:07,687 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:06" (1/1) ... [2025-01-09 05:18:07,708 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:06" (1/1) ... [2025-01-09 05:18:07,751 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 05:18:07,753 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 05:18:07,754 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 05:18:07,754 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 05:18:07,755 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:18:06" (1/1) ... [2025-01-09 05:18:07,759 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 05:18:07,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:18:07,785 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:07,792 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:07,809 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 05:18:07,810 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2025-01-09 05:18:07,810 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2025-01-09 05:18:07,810 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-01-09 05:18:07,810 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-01-09 05:18:07,810 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2025-01-09 05:18:07,810 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2025-01-09 05:18:07,810 INFO L130 BoogieDeclarations]: Found specification of procedure error [2025-01-09 05:18:07,811 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2025-01-09 05:18:07,811 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2025-01-09 05:18:07,811 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2025-01-09 05:18:07,811 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2025-01-09 05:18:07,811 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2025-01-09 05:18:07,811 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2025-01-09 05:18:07,811 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2025-01-09 05:18:07,811 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 05:18:07,811 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 05:18:07,811 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 05:18:07,882 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 05:18:07,884 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 05:18:14,154 INFO L? ?]: Removed 1711 outVars from TransFormulas that were not future-live. [2025-01-09 05:18:14,154 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 05:18:14,188 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 05:18:14,189 INFO L312 CfgBuilder]: Removed 8 assume(true) statements. [2025-01-09 05:18:14,189 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 05:18:14 BoogieIcfgContainer [2025-01-09 05:18:14,189 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 05:18:14,191 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 05:18:14,191 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 05:18:14,194 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 05:18:14,194 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 05:18:04" (1/3) ... [2025-01-09 05:18:14,195 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b22edb6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 05:18:14, skipping insertion in model container [2025-01-09 05:18:14,195 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:18:06" (2/3) ... [2025-01-09 05:18:14,195 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b22edb6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 05:18:14, skipping insertion in model container [2025-01-09 05:18:14,195 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 05:18:14" (3/3) ... [2025-01-09 05:18:14,196 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem05_label43+token_ring.04.cil-2.c [2025-01-09 05:18:14,205 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 05:18:14,208 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem05_label43+token_ring.04.cil-2.c that has 8 procedures, 2371 locations, 1 initial locations, 8 loop locations, and 2 error locations. [2025-01-09 05:18:14,300 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 05:18:14,308 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;@50e48ec1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 05:18:14,308 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-01-09 05:18:14,317 INFO L276 IsEmpty]: Start isEmpty. Operand has 2371 states, 2342 states have (on average 1.8509820666097352) internal successors, (4335), 2346 states have internal predecessors, (4335), 20 states have call successors, (20), 7 states have call predecessors, (20), 7 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2025-01-09 05:18:14,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-01-09 05:18:14,325 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:18:14,326 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] [2025-01-09 05:18:14,326 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:18:14,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:18:14,330 INFO L85 PathProgramCache]: Analyzing trace with hash -175604625, now seen corresponding path program 1 times [2025-01-09 05:18:14,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:18:14,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950913199] [2025-01-09 05:18:14,336 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:18:14,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:18:14,391 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-01-09 05:18:14,404 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-01-09 05:18:14,405 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:18:14,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:18:14,513 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:14,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:18:14,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950913199] [2025-01-09 05:18:14,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950913199] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:18:14,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:18:14,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:18:14,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926298196] [2025-01-09 05:18:14,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:18:14,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:18:14,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:18:14,531 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:18:14,532 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:18:14,537 INFO L87 Difference]: Start difference. First operand has 2371 states, 2342 states have (on average 1.8509820666097352) internal successors, (4335), 2346 states have internal predecessors, (4335), 20 states have call successors, (20), 7 states have call predecessors, (20), 7 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 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:14,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:18:14,703 INFO L93 Difference]: Finished difference Result 4734 states and 8737 transitions. [2025-01-09 05:18:14,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:18:14,705 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 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 89 [2025-01-09 05:18:14,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:18:14,731 INFO L225 Difference]: With dead ends: 4734 [2025-01-09 05:18:14,731 INFO L226 Difference]: Without dead ends: 2303 [2025-01-09 05:18:14,742 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:14,743 INFO L435 NwaCegarLoop]: 4302 mSDtfsCounter, 274 mSDsluCounter, 4022 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 8324 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:14,744 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [274 Valid, 8324 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:14,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2303 states. [2025-01-09 05:18:14,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2303 to 2303. [2025-01-09 05:18:14,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2303 states, 2275 states have (on average 1.8443956043956045) internal successors, (4196), 2278 states have internal predecessors, (4196), 20 states have call successors, (20), 7 states have call predecessors, (20), 6 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-01-09 05:18:14,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2303 states to 2303 states and 4234 transitions. [2025-01-09 05:18:14,969 INFO L78 Accepts]: Start accepts. Automaton has 2303 states and 4234 transitions. Word has length 89 [2025-01-09 05:18:14,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:18:14,969 INFO L471 AbstractCegarLoop]: Abstraction has 2303 states and 4234 transitions. [2025-01-09 05:18:14,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 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:14,970 INFO L276 IsEmpty]: Start isEmpty. Operand 2303 states and 4234 transitions. [2025-01-09 05:18:14,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-01-09 05:18:14,973 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:18:14,973 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] [2025-01-09 05:18:14,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 05:18:14,973 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:18:14,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:18:14,974 INFO L85 PathProgramCache]: Analyzing trace with hash -415844371, now seen corresponding path program 1 times [2025-01-09 05:18:14,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:18:14,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938023996] [2025-01-09 05:18:14,974 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:18:14,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:18:14,990 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-01-09 05:18:15,007 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-01-09 05:18:15,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:18:15,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:18:15,224 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:15,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:18:15,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938023996] [2025-01-09 05:18:15,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938023996] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:18:15,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:18:15,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 05:18:15,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818594580] [2025-01-09 05:18:15,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:18:15,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 05:18:15,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:18:15,228 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 05:18:15,229 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 05:18:15,229 INFO L87 Difference]: Start difference. First operand 2303 states and 4234 transitions. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 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:15,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:18:15,628 INFO L93 Difference]: Finished difference Result 2659 states and 4784 transitions. [2025-01-09 05:18:15,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 05:18:15,628 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 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 89 [2025-01-09 05:18:15,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:18:15,641 INFO L225 Difference]: With dead ends: 2659 [2025-01-09 05:18:15,641 INFO L226 Difference]: Without dead ends: 2489 [2025-01-09 05:18:15,643 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:15,643 INFO L435 NwaCegarLoop]: 4172 mSDtfsCounter, 4440 mSDsluCounter, 8445 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4452 SdHoareTripleChecker+Valid, 12617 SdHoareTripleChecker+Invalid, 353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 05:18:15,644 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4452 Valid, 12617 Invalid, 353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 05:18:15,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2489 states. [2025-01-09 05:18:15,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2489 to 2474. [2025-01-09 05:18:15,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2474 states, 2426 states have (on average 1.8268755152514426) internal successors, (4432), 2430 states have internal predecessors, (4432), 33 states have call successors, (33), 13 states have call predecessors, (33), 13 states have return successors, (32), 31 states have call predecessors, (32), 31 states have call successors, (32) [2025-01-09 05:18:15,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2474 states to 2474 states and 4497 transitions. [2025-01-09 05:18:15,713 INFO L78 Accepts]: Start accepts. Automaton has 2474 states and 4497 transitions. Word has length 89 [2025-01-09 05:18:15,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:18:15,713 INFO L471 AbstractCegarLoop]: Abstraction has 2474 states and 4497 transitions. [2025-01-09 05:18:15,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 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:15,713 INFO L276 IsEmpty]: Start isEmpty. Operand 2474 states and 4497 transitions. [2025-01-09 05:18:15,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-01-09 05:18:15,716 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:18:15,716 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] [2025-01-09 05:18:15,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 05:18:15,716 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:18:15,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:18:15,717 INFO L85 PathProgramCache]: Analyzing trace with hash -38094615, now seen corresponding path program 1 times [2025-01-09 05:18:15,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:18:15,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015066015] [2025-01-09 05:18:15,717 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:18:15,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:18:15,724 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-01-09 05:18:15,729 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-01-09 05:18:15,729 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:18:15,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:18:15,840 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:15,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:18:15,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015066015] [2025-01-09 05:18:15,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015066015] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:18:15,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:18:15,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:18:15,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839969468] [2025-01-09 05:18:15,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:18:15,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:18:15,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:18:15,842 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:18:15,842 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:18:15,843 INFO L87 Difference]: Start difference. First operand 2474 states and 4497 transitions. Second operand has 6 states, 6 states have (on average 13.0) internal successors, (78), 5 states have internal predecessors, (78), 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:16,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:18:16,304 INFO L93 Difference]: Finished difference Result 3030 states and 5359 transitions. [2025-01-09 05:18:16,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:18:16,304 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 5 states have internal predecessors, (78), 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 89 [2025-01-09 05:18:16,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:18:16,314 INFO L225 Difference]: With dead ends: 3030 [2025-01-09 05:18:16,314 INFO L226 Difference]: Without dead ends: 2689 [2025-01-09 05:18:16,316 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:16,317 INFO L435 NwaCegarLoop]: 4314 mSDtfsCounter, 4433 mSDsluCounter, 12923 mSDsCounter, 0 mSdLazyCounter, 569 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4445 SdHoareTripleChecker+Valid, 17237 SdHoareTripleChecker+Invalid, 595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 569 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 05:18:16,317 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4445 Valid, 17237 Invalid, 595 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 569 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 05:18:16,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2689 states. [2025-01-09 05:18:16,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2689 to 2634. [2025-01-09 05:18:16,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2634 states, 2566 states have (on average 1.8106001558846454) internal successors, (4646), 2571 states have internal predecessors, (4646), 46 states have call successors, (46), 19 states have call predecessors, (46), 20 states have return successors, (48), 45 states have call predecessors, (48), 44 states have call successors, (48) [2025-01-09 05:18:16,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2634 states to 2634 states and 4740 transitions. [2025-01-09 05:18:16,386 INFO L78 Accepts]: Start accepts. Automaton has 2634 states and 4740 transitions. Word has length 89 [2025-01-09 05:18:16,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:18:16,386 INFO L471 AbstractCegarLoop]: Abstraction has 2634 states and 4740 transitions. [2025-01-09 05:18:16,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 5 states have internal predecessors, (78), 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:16,387 INFO L276 IsEmpty]: Start isEmpty. Operand 2634 states and 4740 transitions. [2025-01-09 05:18:16,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-01-09 05:18:16,388 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:18:16,388 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] [2025-01-09 05:18:16,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 05:18:16,388 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:18:16,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:18:16,389 INFO L85 PathProgramCache]: Analyzing trace with hash -1949137173, now seen corresponding path program 1 times [2025-01-09 05:18:16,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:18:16,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154352394] [2025-01-09 05:18:16,389 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:18:16,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:18:16,396 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-01-09 05:18:16,399 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-01-09 05:18:16,399 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:18:16,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:18:16,496 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:16,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:18:16,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154352394] [2025-01-09 05:18:16,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154352394] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:18:16,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:18:16,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:18:16,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150575880] [2025-01-09 05:18:16,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:18:16,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:18:16,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:18:16,498 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:18:16,498 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:18:16,498 INFO L87 Difference]: Start difference. First operand 2634 states and 4740 transitions. Second operand has 6 states, 6 states have (on average 13.0) internal successors, (78), 5 states have internal predecessors, (78), 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:16,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:18:16,914 INFO L93 Difference]: Finished difference Result 3532 states and 6131 transitions. [2025-01-09 05:18:16,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:18:16,915 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 5 states have internal predecessors, (78), 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 89 [2025-01-09 05:18:16,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:18:16,926 INFO L225 Difference]: With dead ends: 3532 [2025-01-09 05:18:16,926 INFO L226 Difference]: Without dead ends: 3031 [2025-01-09 05:18:16,928 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:16,929 INFO L435 NwaCegarLoop]: 4182 mSDtfsCounter, 4445 mSDsluCounter, 12618 mSDsCounter, 0 mSdLazyCounter, 457 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4457 SdHoareTripleChecker+Valid, 16800 SdHoareTripleChecker+Invalid, 499 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 457 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 05:18:16,929 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4457 Valid, 16800 Invalid, 499 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 457 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 05:18:16,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3031 states. [2025-01-09 05:18:16,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3031 to 2971. [2025-01-09 05:18:17,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2971 states, 2861 states have (on average 1.7829430269136666) internal successors, (5101), 2870 states have internal predecessors, (5101), 72 states have call successors, (72), 31 states have call predecessors, (72), 36 states have return successors, (86), 73 states have call predecessors, (86), 70 states have call successors, (86) [2025-01-09 05:18:17,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2971 states to 2971 states and 5259 transitions. [2025-01-09 05:18:17,013 INFO L78 Accepts]: Start accepts. Automaton has 2971 states and 5259 transitions. Word has length 89 [2025-01-09 05:18:17,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:18:17,014 INFO L471 AbstractCegarLoop]: Abstraction has 2971 states and 5259 transitions. [2025-01-09 05:18:17,014 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 5 states have internal predecessors, (78), 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:17,014 INFO L276 IsEmpty]: Start isEmpty. Operand 2971 states and 5259 transitions. [2025-01-09 05:18:17,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-01-09 05:18:17,015 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:18:17,015 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] [2025-01-09 05:18:17,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 05:18:17,016 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:18:17,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:18:17,016 INFO L85 PathProgramCache]: Analyzing trace with hash -1872236375, now seen corresponding path program 1 times [2025-01-09 05:18:17,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:18:17,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856014202] [2025-01-09 05:18:17,016 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:18:17,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:18:17,023 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-01-09 05:18:17,026 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-01-09 05:18:17,026 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:18:17,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:18:17,110 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:17,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:18:17,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856014202] [2025-01-09 05:18:17,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856014202] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:18:17,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:18:17,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:18:17,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422490660] [2025-01-09 05:18:17,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:18:17,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:18:17,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:18:17,112 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:18:17,112 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:18:17,112 INFO L87 Difference]: Start difference. First operand 2971 states and 5259 transitions. Second operand has 6 states, 6 states have (on average 13.0) internal successors, (78), 5 states have internal predecessors, (78), 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:17,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:18:17,581 INFO L93 Difference]: Finished difference Result 4599 states and 7804 transitions. [2025-01-09 05:18:17,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:18:17,581 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 5 states have internal predecessors, (78), 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 89 [2025-01-09 05:18:17,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:18:17,604 INFO L225 Difference]: With dead ends: 4599 [2025-01-09 05:18:17,604 INFO L226 Difference]: Without dead ends: 3761 [2025-01-09 05:18:17,611 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:17,612 INFO L435 NwaCegarLoop]: 4307 mSDtfsCounter, 4423 mSDsluCounter, 12902 mSDsCounter, 0 mSdLazyCounter, 569 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4435 SdHoareTripleChecker+Valid, 17209 SdHoareTripleChecker+Invalid, 595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 569 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 05:18:17,612 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4435 Valid, 17209 Invalid, 595 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 569 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 05:18:17,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3761 states. [2025-01-09 05:18:17,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3761 to 3690. [2025-01-09 05:18:17,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3690 states, 3490 states have (on average 1.742406876790831) internal successors, (6081), 3513 states have internal predecessors, (6081), 124 states have call successors, (124), 55 states have call predecessors, (124), 74 states have return successors, (186), 129 states have call predecessors, (186), 122 states have call successors, (186) [2025-01-09 05:18:17,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3690 states to 3690 states and 6391 transitions. [2025-01-09 05:18:17,731 INFO L78 Accepts]: Start accepts. Automaton has 3690 states and 6391 transitions. Word has length 89 [2025-01-09 05:18:17,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:18:17,732 INFO L471 AbstractCegarLoop]: Abstraction has 3690 states and 6391 transitions. [2025-01-09 05:18:17,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 5 states have internal predecessors, (78), 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:17,732 INFO L276 IsEmpty]: Start isEmpty. Operand 3690 states and 6391 transitions. [2025-01-09 05:18:17,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-01-09 05:18:17,734 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:18:17,734 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] [2025-01-09 05:18:17,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 05:18:17,734 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:18:17,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:18:17,735 INFO L85 PathProgramCache]: Analyzing trace with hash 1455380267, now seen corresponding path program 1 times [2025-01-09 05:18:17,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:18:17,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912176183] [2025-01-09 05:18:17,735 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:18:17,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:18:17,741 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-01-09 05:18:17,744 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-01-09 05:18:17,744 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:18:17,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:18:17,859 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:17,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:18:17,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912176183] [2025-01-09 05:18:17,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912176183] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:18:17,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:18:17,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:18:17,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727015398] [2025-01-09 05:18:17,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:18:17,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:18:17,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:18:17,860 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:18:17,861 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:18:17,861 INFO L87 Difference]: Start difference. First operand 3690 states and 6391 transitions. Second operand has 6 states, 6 states have (on average 13.0) internal successors, (78), 5 states have internal predecessors, (78), 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:18,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:18:18,333 INFO L93 Difference]: Finished difference Result 7120 states and 11831 transitions. [2025-01-09 05:18:18,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:18:18,334 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 5 states have internal predecessors, (78), 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 89 [2025-01-09 05:18:18,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:18:18,356 INFO L225 Difference]: With dead ends: 7120 [2025-01-09 05:18:18,357 INFO L226 Difference]: Without dead ends: 5563 [2025-01-09 05:18:18,364 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:18,364 INFO L435 NwaCegarLoop]: 4298 mSDtfsCounter, 4549 mSDsluCounter, 12872 mSDsCounter, 0 mSdLazyCounter, 572 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4566 SdHoareTripleChecker+Valid, 17170 SdHoareTripleChecker+Invalid, 601 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 572 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 05:18:18,365 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4566 Valid, 17170 Invalid, 601 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 572 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 05:18:18,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5563 states. [2025-01-09 05:18:18,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5563 to 5194. [2025-01-09 05:18:18,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5194 states, 4804 states have (on average 1.6958784346378017) internal successors, (8147), 4873 states have internal predecessors, (8147), 220 states have call successors, (220), 103 states have call predecessors, (220), 168 states have return successors, (474), 233 states have call predecessors, (474), 218 states have call successors, (474) [2025-01-09 05:18:18,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5194 states to 5194 states and 8841 transitions. [2025-01-09 05:18:18,513 INFO L78 Accepts]: Start accepts. Automaton has 5194 states and 8841 transitions. Word has length 89 [2025-01-09 05:18:18,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:18:18,513 INFO L471 AbstractCegarLoop]: Abstraction has 5194 states and 8841 transitions. [2025-01-09 05:18:18,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 5 states have internal predecessors, (78), 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:18,513 INFO L276 IsEmpty]: Start isEmpty. Operand 5194 states and 8841 transitions. [2025-01-09 05:18:18,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-01-09 05:18:18,516 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:18:18,516 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] [2025-01-09 05:18:18,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 05:18:18,517 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:18:18,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:18:18,517 INFO L85 PathProgramCache]: Analyzing trace with hash 962754093, now seen corresponding path program 1 times [2025-01-09 05:18:18,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:18:18,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727825799] [2025-01-09 05:18:18,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:18:18,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:18:18,523 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-01-09 05:18:18,525 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-01-09 05:18:18,526 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:18:18,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:18:18,595 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:18,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:18:18,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727825799] [2025-01-09 05:18:18,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727825799] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:18:18,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:18:18,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:18:18,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254956744] [2025-01-09 05:18:18,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:18:18,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:18:18,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:18:18,596 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:18:18,596 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:18:18,596 INFO L87 Difference]: Start difference. First operand 5194 states and 8841 transitions. Second operand has 6 states, 6 states have (on average 13.0) internal successors, (78), 5 states have internal predecessors, (78), 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:19,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:18:19,179 INFO L93 Difference]: Finished difference Result 12040 states and 20147 transitions. [2025-01-09 05:18:19,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:18:19,179 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 5 states have internal predecessors, (78), 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 89 [2025-01-09 05:18:19,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:18:19,216 INFO L225 Difference]: With dead ends: 12040 [2025-01-09 05:18:19,216 INFO L226 Difference]: Without dead ends: 8979 [2025-01-09 05:18:19,229 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:19,229 INFO L435 NwaCegarLoop]: 4294 mSDtfsCounter, 4442 mSDsluCounter, 12860 mSDsCounter, 0 mSdLazyCounter, 670 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4453 SdHoareTripleChecker+Valid, 17154 SdHoareTripleChecker+Invalid, 698 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 670 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 05:18:19,230 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4453 Valid, 17154 Invalid, 698 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 670 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 05:18:19,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8979 states. [2025-01-09 05:18:19,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8979 to 8277. [2025-01-09 05:18:19,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8277 states, 7461 states have (on average 1.6495107894384131) internal successors, (12307), 7676 states have internal predecessors, (12307), 404 states have call successors, (404), 199 states have call predecessors, (404), 410 states have return successors, (1426), 433 states have call predecessors, (1426), 402 states have call successors, (1426) [2025-01-09 05:18:19,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8277 states to 8277 states and 14137 transitions. [2025-01-09 05:18:19,610 INFO L78 Accepts]: Start accepts. Automaton has 8277 states and 14137 transitions. Word has length 89 [2025-01-09 05:18:19,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:18:19,611 INFO L471 AbstractCegarLoop]: Abstraction has 8277 states and 14137 transitions. [2025-01-09 05:18:19,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 5 states have internal predecessors, (78), 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:19,612 INFO L276 IsEmpty]: Start isEmpty. Operand 8277 states and 14137 transitions. [2025-01-09 05:18:19,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-01-09 05:18:19,617 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:18:19,617 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] [2025-01-09 05:18:19,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 05:18:19,617 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:18:19,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:18:19,618 INFO L85 PathProgramCache]: Analyzing trace with hash 1916694251, now seen corresponding path program 1 times [2025-01-09 05:18:19,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:18:19,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066257807] [2025-01-09 05:18:19,618 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:18:19,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:18:19,624 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-01-09 05:18:19,627 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-01-09 05:18:19,627 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:18:19,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:18:19,703 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:19,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:18:19,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066257807] [2025-01-09 05:18:19,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066257807] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:18:19,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:18:19,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:18:19,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496689418] [2025-01-09 05:18:19,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:18:19,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:18:19,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:18:19,705 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:18:19,705 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:18:19,705 INFO L87 Difference]: Start difference. First operand 8277 states and 14137 transitions. Second operand has 6 states, 6 states have (on average 13.0) internal successors, (78), 5 states have internal predecessors, (78), 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:20,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:18:20,482 INFO L93 Difference]: Finished difference Result 22109 states and 38589 transitions. [2025-01-09 05:18:20,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:18:20,482 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 5 states have internal predecessors, (78), 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 89 [2025-01-09 05:18:20,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:18:20,545 INFO L225 Difference]: With dead ends: 22109 [2025-01-09 05:18:20,545 INFO L226 Difference]: Without dead ends: 15965 [2025-01-09 05:18:20,575 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:20,576 INFO L435 NwaCegarLoop]: 4292 mSDtfsCounter, 4479 mSDsluCounter, 12854 mSDsCounter, 0 mSdLazyCounter, 572 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4496 SdHoareTripleChecker+Valid, 17146 SdHoareTripleChecker+Invalid, 601 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 572 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 05:18:20,576 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4496 Valid, 17146 Invalid, 601 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 572 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 05:18:20,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15965 states. [2025-01-09 05:18:21,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15965 to 15106. [2025-01-09 05:18:21,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15106 states, 13292 states have (on average 1.617439061089377) internal successors, (21499), 13961 states have internal predecessors, (21499), 756 states have call successors, (756), 391 states have call predecessors, (756), 1056 states have return successors, (4850), 817 states have call predecessors, (4850), 754 states have call successors, (4850) [2025-01-09 05:18:21,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15106 states to 15106 states and 27105 transitions. [2025-01-09 05:18:21,102 INFO L78 Accepts]: Start accepts. Automaton has 15106 states and 27105 transitions. Word has length 89 [2025-01-09 05:18:21,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:18:21,102 INFO L471 AbstractCegarLoop]: Abstraction has 15106 states and 27105 transitions. [2025-01-09 05:18:21,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 5 states have internal predecessors, (78), 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:21,102 INFO L276 IsEmpty]: Start isEmpty. Operand 15106 states and 27105 transitions. [2025-01-09 05:18:21,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-01-09 05:18:21,110 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:18:21,110 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] [2025-01-09 05:18:21,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 05:18:21,110 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:18:21,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:18:21,111 INFO L85 PathProgramCache]: Analyzing trace with hash 700540525, now seen corresponding path program 1 times [2025-01-09 05:18:21,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:18:21,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266332624] [2025-01-09 05:18:21,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:18:21,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:18:21,116 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-01-09 05:18:21,118 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-01-09 05:18:21,118 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:18:21,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:18:21,204 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:21,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:18:21,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266332624] [2025-01-09 05:18:21,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266332624] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:18:21,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:18:21,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:18:21,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969824033] [2025-01-09 05:18:21,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:18:21,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:18:21,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:18:21,205 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:18:21,205 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:18:21,205 INFO L87 Difference]: Start difference. First operand 15106 states and 27105 transitions. Second operand has 6 states, 6 states have (on average 13.0) internal successors, (78), 5 states have internal predecessors, (78), 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:22,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:18:22,374 INFO L93 Difference]: Finished difference Result 44032 states and 84923 transitions. [2025-01-09 05:18:22,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:18:22,374 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 5 states have internal predecessors, (78), 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 89 [2025-01-09 05:18:22,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:18:22,619 INFO L225 Difference]: With dead ends: 44032 [2025-01-09 05:18:22,619 INFO L226 Difference]: Without dead ends: 31059 [2025-01-09 05:18:22,651 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:22,651 INFO L435 NwaCegarLoop]: 4289 mSDtfsCounter, 4444 mSDsluCounter, 12845 mSDsCounter, 0 mSdLazyCounter, 572 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4461 SdHoareTripleChecker+Valid, 17134 SdHoareTripleChecker+Invalid, 601 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 572 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 05:18:22,652 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4461 Valid, 17134 Invalid, 601 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 572 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 05:18:22,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31059 states. [2025-01-09 05:18:24,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31059 to 29883. [2025-01-09 05:18:24,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29883 states, 25619 states have (on average 1.590967641203794) internal successors, (40759), 27682 states have internal predecessors, (40759), 1428 states have call successors, (1428), 775 states have call predecessors, (1428), 2834 states have return successors, (17810), 1553 states have call predecessors, (17810), 1426 states have call successors, (17810) [2025-01-09 05:18:24,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29883 states to 29883 states and 59997 transitions. [2025-01-09 05:18:24,364 INFO L78 Accepts]: Start accepts. Automaton has 29883 states and 59997 transitions. Word has length 89 [2025-01-09 05:18:24,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:18:24,364 INFO L471 AbstractCegarLoop]: Abstraction has 29883 states and 59997 transitions. [2025-01-09 05:18:24,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 5 states have internal predecessors, (78), 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:24,365 INFO L276 IsEmpty]: Start isEmpty. Operand 29883 states and 59997 transitions. [2025-01-09 05:18:24,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-01-09 05:18:24,379 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:18:24,379 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] [2025-01-09 05:18:24,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 05:18:24,379 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:18:24,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:18:24,380 INFO L85 PathProgramCache]: Analyzing trace with hash -31426901, now seen corresponding path program 1 times [2025-01-09 05:18:24,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:18:24,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976177854] [2025-01-09 05:18:24,380 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:18:24,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:18:24,388 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-01-09 05:18:24,392 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-01-09 05:18:24,392 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:18:24,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:18:24,455 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:24,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:18:24,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976177854] [2025-01-09 05:18:24,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976177854] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:18:24,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:18:24,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:18:24,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990724077] [2025-01-09 05:18:24,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:18:24,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:18:24,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:18:24,456 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:18:24,457 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:18:24,457 INFO L87 Difference]: Start difference. First operand 29883 states and 59997 transitions. Second operand has 6 states, 6 states have (on average 13.0) internal successors, (78), 5 states have internal predecessors, (78), 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:27,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:18:27,182 INFO L93 Difference]: Finished difference Result 90443 states and 207969 transitions. [2025-01-09 05:18:27,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:18:27,183 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 5 states have internal predecessors, (78), 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 89 [2025-01-09 05:18:27,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:18:27,550 INFO L225 Difference]: With dead ends: 90443 [2025-01-09 05:18:27,551 INFO L226 Difference]: Without dead ends: 62693 [2025-01-09 05:18:27,649 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:27,649 INFO L435 NwaCegarLoop]: 4284 mSDtfsCounter, 4398 mSDsluCounter, 12838 mSDsCounter, 0 mSdLazyCounter, 603 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4409 SdHoareTripleChecker+Valid, 17122 SdHoareTripleChecker+Invalid, 632 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 603 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 05:18:27,650 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4409 Valid, 17122 Invalid, 632 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 603 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 05:18:27,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62693 states. [2025-01-09 05:18:32,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62693 to 61408. [2025-01-09 05:18:32,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61408 states, 50866 states have (on average 1.5546534030590178) internal successors, (79079), 57175 states have internal predecessors, (79079), 2700 states have call successors, (2700), 1535 states have call predecessors, (2700), 7840 states have return successors, (68234), 2953 states have call predecessors, (68234), 2698 states have call successors, (68234) [2025-01-09 05:18:33,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61408 states to 61408 states and 150013 transitions. [2025-01-09 05:18:33,124 INFO L78 Accepts]: Start accepts. Automaton has 61408 states and 150013 transitions. Word has length 89 [2025-01-09 05:18:33,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:18:33,124 INFO L471 AbstractCegarLoop]: Abstraction has 61408 states and 150013 transitions. [2025-01-09 05:18:33,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 5 states have internal predecessors, (78), 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:33,124 INFO L276 IsEmpty]: Start isEmpty. Operand 61408 states and 150013 transitions. [2025-01-09 05:18:33,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-01-09 05:18:33,151 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:18:33,151 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] [2025-01-09 05:18:33,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 05:18:33,151 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:18:33,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:18:33,152 INFO L85 PathProgramCache]: Analyzing trace with hash -1717606739, now seen corresponding path program 1 times [2025-01-09 05:18:33,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:18:33,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873469159] [2025-01-09 05:18:33,152 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:18:33,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:18:33,157 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-01-09 05:18:33,160 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-01-09 05:18:33,160 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:18:33,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:18:33,209 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:33,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:18:33,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873469159] [2025-01-09 05:18:33,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873469159] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:18:33,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:18:33,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 05:18:33,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327035914] [2025-01-09 05:18:33,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:18:33,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 05:18:33,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:18:33,210 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 05:18:33,210 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 05:18:33,211 INFO L87 Difference]: Start difference. First operand 61408 states and 150013 transitions. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (6), 2 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:37,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:18:37,767 INFO L93 Difference]: Finished difference Result 153626 states and 374024 transitions. [2025-01-09 05:18:37,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 05:18:37,768 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (6), 2 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 89 [2025-01-09 05:18:37,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:18:38,294 INFO L225 Difference]: With dead ends: 153626 [2025-01-09 05:18:38,294 INFO L226 Difference]: Without dead ends: 94352 [2025-01-09 05:18:38,625 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 05:18:38,626 INFO L435 NwaCegarLoop]: 4458 mSDtfsCounter, 4418 mSDsluCounter, 4389 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4418 SdHoareTripleChecker+Valid, 8847 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 05:18:38,626 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4418 Valid, 8847 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 05:18:38,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94352 states.