./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/systemc/token_ring.06.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/systemc/token_ring.06.cil-1.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4ff0d99c6257365cafb7459615c8e1194d53bcc0d71dc100705abd4bb2d65c37 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 04:16:34,774 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 04:16:34,828 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 04:16:34,834 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 04:16:34,834 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 04:16:34,851 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 04:16:34,852 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 04:16:34,852 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 04:16:34,853 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 04:16:34,853 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 04:16:34,853 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 04:16:34,853 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 04:16:34,853 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 04:16:34,854 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 04:16:34,854 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 04:16:34,854 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 04:16:34,854 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 04:16:34,854 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 04:16:34,854 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 04:16:34,854 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 04:16:34,854 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 04:16:34,854 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 04:16:34,854 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 04:16:34,854 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 04:16:34,854 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 04:16:34,854 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 04:16:34,854 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 04:16:34,855 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 04:16:34,855 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 04:16:34,855 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 04:16:34,855 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 04:16:34,855 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 04:16:34,855 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:16:34,855 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 04:16:34,855 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 04:16:34,855 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 04:16:34,855 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 04:16:34,855 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:16:34,855 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 04:16:34,855 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 04:16:34,855 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 04:16:34,856 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 04:16:34,857 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 04:16:34,857 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 04:16:34,857 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 04:16:34,857 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 04:16:34,857 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 04:16:34,857 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 04:16:34,857 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 -> 4ff0d99c6257365cafb7459615c8e1194d53bcc0d71dc100705abd4bb2d65c37 [2025-01-09 04:16:35,072 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 04:16:35,081 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 04:16:35,082 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 04:16:35,085 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 04:16:35,085 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 04:16:35,086 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/token_ring.06.cil-1.c [2025-01-09 04:16:36,178 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/29c70fe8a/cecc09e28b1c4cd381965c9e45a12e82/FLAG3b272034d [2025-01-09 04:16:36,462 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 04:16:36,462 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/systemc/token_ring.06.cil-1.c [2025-01-09 04:16:36,469 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/29c70fe8a/cecc09e28b1c4cd381965c9e45a12e82/FLAG3b272034d [2025-01-09 04:16:36,751 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/29c70fe8a/cecc09e28b1c4cd381965c9e45a12e82 [2025-01-09 04:16:36,753 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 04:16:36,754 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 04:16:36,755 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 04:16:36,755 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 04:16:36,758 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 04:16:36,758 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:16:36" (1/1) ... [2025-01-09 04:16:36,759 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d5ee1f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:16:36, skipping insertion in model container [2025-01-09 04:16:36,759 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:16:36" (1/1) ... [2025-01-09 04:16:36,777 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 04:16:36,882 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/systemc/token_ring.06.cil-1.c[671,684] [2025-01-09 04:16:36,963 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 04:16:36,976 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 04:16:36,985 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/systemc/token_ring.06.cil-1.c[671,684] [2025-01-09 04:16:37,024 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 04:16:37,035 INFO L204 MainTranslator]: Completed translation [2025-01-09 04:16:37,036 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:16:37 WrapperNode [2025-01-09 04:16:37,037 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 04:16:37,038 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 04:16:37,038 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 04:16:37,038 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 04:16:37,043 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:16:37" (1/1) ... [2025-01-09 04:16:37,054 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:16:37" (1/1) ... [2025-01-09 04:16:37,091 INFO L138 Inliner]: procedures = 40, calls = 50, calls flagged for inlining = 23, calls inlined = 23, statements flattened = 498 [2025-01-09 04:16:37,092 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 04:16:37,092 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 04:16:37,092 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 04:16:37,093 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 04:16:37,100 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:16:37" (1/1) ... [2025-01-09 04:16:37,101 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:16:37" (1/1) ... [2025-01-09 04:16:37,103 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:16:37" (1/1) ... [2025-01-09 04:16:37,112 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 04:16:37,112 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:16:37" (1/1) ... [2025-01-09 04:16:37,112 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:16:37" (1/1) ... [2025-01-09 04:16:37,117 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:16:37" (1/1) ... [2025-01-09 04:16:37,118 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:16:37" (1/1) ... [2025-01-09 04:16:37,128 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:16:37" (1/1) ... [2025-01-09 04:16:37,130 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:16:37" (1/1) ... [2025-01-09 04:16:37,130 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:16:37" (1/1) ... [2025-01-09 04:16:37,135 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 04:16:37,136 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 04:16:37,136 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 04:16:37,136 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 04:16:37,137 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:16:37" (1/1) ... [2025-01-09 04:16:37,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:16:37,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:16:37,163 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 04:16:37,168 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 04:16:37,182 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 04:16:37,182 INFO L130 BoogieDeclarations]: Found specification of procedure error [2025-01-09 04:16:37,182 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2025-01-09 04:16:37,182 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2025-01-09 04:16:37,183 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2025-01-09 04:16:37,183 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2025-01-09 04:16:37,183 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2025-01-09 04:16:37,183 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-01-09 04:16:37,183 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-01-09 04:16:37,183 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2025-01-09 04:16:37,183 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2025-01-09 04:16:37,183 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2025-01-09 04:16:37,183 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2025-01-09 04:16:37,184 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 04:16:37,184 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2025-01-09 04:16:37,184 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2025-01-09 04:16:37,184 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 04:16:37,184 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 04:16:37,266 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 04:16:37,268 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 04:16:37,721 INFO L? ?]: Removed 65 outVars from TransFormulas that were not future-live. [2025-01-09 04:16:37,721 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 04:16:37,736 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 04:16:37,736 INFO L312 CfgBuilder]: Removed 9 assume(true) statements. [2025-01-09 04:16:37,736 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:16:37 BoogieIcfgContainer [2025-01-09 04:16:37,736 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 04:16:37,740 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 04:16:37,740 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 04:16:37,743 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 04:16:37,743 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:16:36" (1/3) ... [2025-01-09 04:16:37,744 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e62afc9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:16:37, skipping insertion in model container [2025-01-09 04:16:37,744 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:16:37" (2/3) ... [2025-01-09 04:16:37,744 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e62afc9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:16:37, skipping insertion in model container [2025-01-09 04:16:37,744 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:16:37" (3/3) ... [2025-01-09 04:16:37,745 INFO L128 eAbstractionObserver]: Analyzing ICFG token_ring.06.cil-1.c [2025-01-09 04:16:37,756 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 04:16:37,759 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG token_ring.06.cil-1.c that has 8 procedures, 238 locations, 1 initial locations, 9 loop locations, and 1 error locations. [2025-01-09 04:16:37,806 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 04:16:37,814 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;@423ca6d4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 04:16:37,814 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 04:16:37,817 INFO L276 IsEmpty]: Start isEmpty. Operand has 238 states, 208 states have (on average 1.5961538461538463) internal successors, (332), 211 states have internal predecessors, (332), 22 states have call successors, (22), 7 states have call predecessors, (22), 7 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2025-01-09 04:16:37,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-01-09 04:16:37,824 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:16:37,824 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:16:37,824 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:16:37,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:16:37,829 INFO L85 PathProgramCache]: Analyzing trace with hash -1402825468, now seen corresponding path program 1 times [2025-01-09 04:16:37,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:16:37,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035487727] [2025-01-09 04:16:37,837 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:16:37,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:16:37,915 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-01-09 04:16:37,932 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-01-09 04:16:37,932 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:16:37,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:16:38,087 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 04:16:38,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:16:38,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035487727] [2025-01-09 04:16:38,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035487727] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:16:38,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:16:38,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:16:38,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116581849] [2025-01-09 04:16:38,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:16:38,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:16:38,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:16:38,110 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:16:38,110 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:16:38,114 INFO L87 Difference]: Start difference. First operand has 238 states, 208 states have (on average 1.5961538461538463) internal successors, (332), 211 states have internal predecessors, (332), 22 states have call successors, (22), 7 states have call predecessors, (22), 7 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 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 04:16:38,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:16:38,162 INFO L93 Difference]: Finished difference Result 468 states and 743 transitions. [2025-01-09 04:16:38,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:16:38,164 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 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 110 [2025-01-09 04:16:38,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:16:38,173 INFO L225 Difference]: With dead ends: 468 [2025-01-09 04:16:38,173 INFO L226 Difference]: Without dead ends: 232 [2025-01-09 04:16:38,176 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 04:16:38,178 INFO L435 NwaCegarLoop]: 361 mSDtfsCounter, 357 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 357 SdHoareTripleChecker+Valid, 361 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 04:16:38,178 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [357 Valid, 361 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:16:38,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2025-01-09 04:16:38,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 232. [2025-01-09 04:16:38,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 203 states have (on average 1.5566502463054188) internal successors, (316), 205 states have internal predecessors, (316), 22 states have call successors, (22), 7 states have call predecessors, (22), 6 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-01-09 04:16:38,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 358 transitions. [2025-01-09 04:16:38,228 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 358 transitions. Word has length 110 [2025-01-09 04:16:38,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:16:38,229 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 358 transitions. [2025-01-09 04:16:38,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 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 04:16:38,229 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 358 transitions. [2025-01-09 04:16:38,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-01-09 04:16:38,231 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:16:38,231 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:16:38,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 04:16:38,231 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:16:38,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:16:38,232 INFO L85 PathProgramCache]: Analyzing trace with hash 630568578, now seen corresponding path program 1 times [2025-01-09 04:16:38,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:16:38,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477167041] [2025-01-09 04:16:38,232 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:16:38,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:16:38,247 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-01-09 04:16:38,254 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-01-09 04:16:38,255 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:16:38,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:16:38,450 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 04:16:38,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:16:38,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477167041] [2025-01-09 04:16:38,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477167041] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:16:38,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:16:38,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:16:38,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350673958] [2025-01-09 04:16:38,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:16:38,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:16:38,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:16:38,454 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:16:38,455 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:16:38,455 INFO L87 Difference]: Start difference. First operand 232 states and 358 transitions. Second operand has 5 states, 5 states have (on average 19.8) internal successors, (99), 4 states have internal predecessors, (99), 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 04:16:38,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:16:38,869 INFO L93 Difference]: Finished difference Result 692 states and 1080 transitions. [2025-01-09 04:16:38,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 04:16:38,870 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 4 states have internal predecessors, (99), 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 110 [2025-01-09 04:16:38,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:16:38,874 INFO L225 Difference]: With dead ends: 692 [2025-01-09 04:16:38,874 INFO L226 Difference]: Without dead ends: 474 [2025-01-09 04:16:38,875 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 04:16:38,875 INFO L435 NwaCegarLoop]: 278 mSDtfsCounter, 653 mSDsluCounter, 697 mSDsCounter, 0 mSdLazyCounter, 391 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 667 SdHoareTripleChecker+Valid, 975 SdHoareTripleChecker+Invalid, 439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 04:16:38,876 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [667 Valid, 975 Invalid, 439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 391 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 04:16:38,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2025-01-09 04:16:38,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 455. [2025-01-09 04:16:38,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 455 states, 404 states have (on average 1.5693069306930694) internal successors, (634), 407 states have internal predecessors, (634), 37 states have call successors, (37), 13 states have call predecessors, (37), 13 states have return successors, (36), 35 states have call predecessors, (36), 35 states have call successors, (36) [2025-01-09 04:16:38,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 707 transitions. [2025-01-09 04:16:38,910 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 707 transitions. Word has length 110 [2025-01-09 04:16:38,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:16:38,911 INFO L471 AbstractCegarLoop]: Abstraction has 455 states and 707 transitions. [2025-01-09 04:16:38,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 4 states have internal predecessors, (99), 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 04:16:38,911 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 707 transitions. [2025-01-09 04:16:38,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-01-09 04:16:38,912 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:16:38,912 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:16:38,912 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 04:16:38,912 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:16:38,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:16:38,913 INFO L85 PathProgramCache]: Analyzing trace with hash -713646722, now seen corresponding path program 1 times [2025-01-09 04:16:38,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:16:38,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890703565] [2025-01-09 04:16:38,913 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:16:38,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:16:38,925 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-01-09 04:16:38,929 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-01-09 04:16:38,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:16:38,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:16:39,105 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 04:16:39,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:16:39,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890703565] [2025-01-09 04:16:39,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890703565] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:16:39,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:16:39,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:16:39,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956467474] [2025-01-09 04:16:39,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:16:39,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:16:39,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:16:39,107 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:16:39,107 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:16:39,107 INFO L87 Difference]: Start difference. First operand 455 states and 707 transitions. Second operand has 6 states, 6 states have (on average 16.5) internal successors, (99), 5 states have internal predecessors, (99), 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 04:16:39,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:16:39,609 INFO L93 Difference]: Finished difference Result 1179 states and 1851 transitions. [2025-01-09 04:16:39,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 04:16:39,609 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.5) internal successors, (99), 5 states have internal predecessors, (99), 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 110 [2025-01-09 04:16:39,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:16:39,614 INFO L225 Difference]: With dead ends: 1179 [2025-01-09 04:16:39,615 INFO L226 Difference]: Without dead ends: 738 [2025-01-09 04:16:39,616 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 04:16:39,618 INFO L435 NwaCegarLoop]: 466 mSDtfsCounter, 650 mSDsluCounter, 1397 mSDsCounter, 0 mSdLazyCounter, 701 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 664 SdHoareTripleChecker+Valid, 1863 SdHoareTripleChecker+Invalid, 729 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 701 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 04:16:39,619 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [664 Valid, 1863 Invalid, 729 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 701 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 04:16:39,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 738 states. [2025-01-09 04:16:39,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 738 to 663. [2025-01-09 04:16:39,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 663 states, 590 states have (on average 1.5627118644067797) internal successors, (922), 594 states have internal predecessors, (922), 52 states have call successors, (52), 19 states have call predecessors, (52), 20 states have return successors, (54), 51 states have call predecessors, (54), 50 states have call successors, (54) [2025-01-09 04:16:39,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 663 states to 663 states and 1028 transitions. [2025-01-09 04:16:39,655 INFO L78 Accepts]: Start accepts. Automaton has 663 states and 1028 transitions. Word has length 110 [2025-01-09 04:16:39,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:16:39,656 INFO L471 AbstractCegarLoop]: Abstraction has 663 states and 1028 transitions. [2025-01-09 04:16:39,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.5) internal successors, (99), 5 states have internal predecessors, (99), 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 04:16:39,656 INFO L276 IsEmpty]: Start isEmpty. Operand 663 states and 1028 transitions. [2025-01-09 04:16:39,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-01-09 04:16:39,657 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:16:39,658 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:16:39,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 04:16:39,658 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:16:39,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:16:39,659 INFO L85 PathProgramCache]: Analyzing trace with hash -1597155712, now seen corresponding path program 1 times [2025-01-09 04:16:39,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:16:39,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940489721] [2025-01-09 04:16:39,659 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:16:39,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:16:39,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-01-09 04:16:39,694 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-01-09 04:16:39,694 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:16:39,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:16:39,799 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 04:16:39,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:16:39,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940489721] [2025-01-09 04:16:39,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940489721] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:16:39,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:16:39,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:16:39,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980297951] [2025-01-09 04:16:39,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:16:39,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:16:39,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:16:39,802 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:16:39,802 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:16:39,802 INFO L87 Difference]: Start difference. First operand 663 states and 1028 transitions. Second operand has 6 states, 6 states have (on average 16.5) internal successors, (99), 5 states have internal predecessors, (99), 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 04:16:40,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:16:40,230 INFO L93 Difference]: Finished difference Result 1837 states and 2881 transitions. [2025-01-09 04:16:40,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 04:16:40,231 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.5) internal successors, (99), 5 states have internal predecessors, (99), 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 110 [2025-01-09 04:16:40,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:16:40,236 INFO L225 Difference]: With dead ends: 1837 [2025-01-09 04:16:40,236 INFO L226 Difference]: Without dead ends: 1188 [2025-01-09 04:16:40,238 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 04:16:40,238 INFO L435 NwaCegarLoop]: 296 mSDtfsCounter, 666 mSDsluCounter, 998 mSDsCounter, 0 mSdLazyCounter, 567 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 680 SdHoareTripleChecker+Valid, 1294 SdHoareTripleChecker+Invalid, 613 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 567 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 04:16:40,238 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [680 Valid, 1294 Invalid, 613 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 567 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 04:16:40,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1188 states. [2025-01-09 04:16:40,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1188 to 1104. [2025-01-09 04:16:40,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1104 states, 985 states have (on average 1.5644670050761422) internal successors, (1541), 993 states have internal predecessors, (1541), 82 states have call successors, (82), 31 states have call predecessors, (82), 36 states have return successors, (96), 83 states have call predecessors, (96), 80 states have call successors, (96) [2025-01-09 04:16:40,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1104 states to 1104 states and 1719 transitions. [2025-01-09 04:16:40,296 INFO L78 Accepts]: Start accepts. Automaton has 1104 states and 1719 transitions. Word has length 110 [2025-01-09 04:16:40,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:16:40,297 INFO L471 AbstractCegarLoop]: Abstraction has 1104 states and 1719 transitions. [2025-01-09 04:16:40,297 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.5) internal successors, (99), 5 states have internal predecessors, (99), 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 04:16:40,297 INFO L276 IsEmpty]: Start isEmpty. Operand 1104 states and 1719 transitions. [2025-01-09 04:16:40,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-01-09 04:16:40,298 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:16:40,298 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:16:40,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 04:16:40,299 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:16:40,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:16:40,299 INFO L85 PathProgramCache]: Analyzing trace with hash -1625656002, now seen corresponding path program 1 times [2025-01-09 04:16:40,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:16:40,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761693030] [2025-01-09 04:16:40,299 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:16:40,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:16:40,311 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-01-09 04:16:40,316 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-01-09 04:16:40,317 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:16:40,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:16:40,434 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 04:16:40,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:16:40,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761693030] [2025-01-09 04:16:40,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761693030] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:16:40,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:16:40,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:16:40,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511790045] [2025-01-09 04:16:40,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:16:40,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:16:40,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:16:40,437 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:16:40,437 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:16:40,437 INFO L87 Difference]: Start difference. First operand 1104 states and 1719 transitions. Second operand has 6 states, 6 states have (on average 16.5) internal successors, (99), 5 states have internal predecessors, (99), 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 04:16:40,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:16:40,995 INFO L93 Difference]: Finished difference Result 3232 states and 5102 transitions. [2025-01-09 04:16:40,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 04:16:40,995 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.5) internal successors, (99), 5 states have internal predecessors, (99), 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 110 [2025-01-09 04:16:40,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:16:41,008 INFO L225 Difference]: With dead ends: 3232 [2025-01-09 04:16:41,008 INFO L226 Difference]: Without dead ends: 2142 [2025-01-09 04:16:41,012 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 04:16:41,012 INFO L435 NwaCegarLoop]: 455 mSDtfsCounter, 637 mSDsluCounter, 1366 mSDsCounter, 0 mSdLazyCounter, 701 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 651 SdHoareTripleChecker+Valid, 1821 SdHoareTripleChecker+Invalid, 729 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 701 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 04:16:41,013 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [651 Valid, 1821 Invalid, 729 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 701 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 04:16:41,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2142 states. [2025-01-09 04:16:41,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2142 to 2046. [2025-01-09 04:16:41,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2046 states, 1829 states have (on average 1.5740841990158556) internal successors, (2879), 1851 states have internal predecessors, (2879), 142 states have call successors, (142), 55 states have call predecessors, (142), 74 states have return successors, (204), 147 states have call predecessors, (204), 140 states have call successors, (204) [2025-01-09 04:16:41,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2046 states to 2046 states and 3225 transitions. [2025-01-09 04:16:41,129 INFO L78 Accepts]: Start accepts. Automaton has 2046 states and 3225 transitions. Word has length 110 [2025-01-09 04:16:41,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:16:41,129 INFO L471 AbstractCegarLoop]: Abstraction has 2046 states and 3225 transitions. [2025-01-09 04:16:41,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.5) internal successors, (99), 5 states have internal predecessors, (99), 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 04:16:41,129 INFO L276 IsEmpty]: Start isEmpty. Operand 2046 states and 3225 transitions. [2025-01-09 04:16:41,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-01-09 04:16:41,130 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:16:41,131 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:16:41,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 04:16:41,131 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:16:41,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:16:41,132 INFO L85 PathProgramCache]: Analyzing trace with hash 251407228, now seen corresponding path program 1 times [2025-01-09 04:16:41,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:16:41,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206161563] [2025-01-09 04:16:41,132 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:16:41,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:16:41,139 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-01-09 04:16:41,141 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-01-09 04:16:41,141 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:16:41,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:16:41,214 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 04:16:41,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:16:41,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206161563] [2025-01-09 04:16:41,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206161563] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:16:41,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:16:41,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:16:41,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418837690] [2025-01-09 04:16:41,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:16:41,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:16:41,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:16:41,215 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:16:41,216 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:16:41,216 INFO L87 Difference]: Start difference. First operand 2046 states and 3225 transitions. Second operand has 6 states, 6 states have (on average 16.5) internal successors, (99), 5 states have internal predecessors, (99), 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 04:16:41,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:16:41,749 INFO L93 Difference]: Finished difference Result 6262 states and 10066 transitions. [2025-01-09 04:16:41,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 04:16:41,750 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.5) internal successors, (99), 5 states have internal predecessors, (99), 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 110 [2025-01-09 04:16:41,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:16:41,767 INFO L225 Difference]: With dead ends: 6262 [2025-01-09 04:16:41,767 INFO L226 Difference]: Without dead ends: 4230 [2025-01-09 04:16:41,772 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 04:16:41,772 INFO L435 NwaCegarLoop]: 452 mSDtfsCounter, 632 mSDsluCounter, 1357 mSDsCounter, 0 mSdLazyCounter, 701 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 646 SdHoareTripleChecker+Valid, 1809 SdHoareTripleChecker+Invalid, 729 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 701 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 04:16:41,773 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [646 Valid, 1809 Invalid, 729 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 701 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 04:16:41,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4230 states. [2025-01-09 04:16:41,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4230 to 4101. [2025-01-09 04:16:41,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4101 states, 3670 states have (on average 1.5910081743869209) internal successors, (5839), 3738 states have internal predecessors, (5839), 262 states have call successors, (262), 103 states have call predecessors, (262), 168 states have return successors, (516), 275 states have call predecessors, (516), 260 states have call successors, (516) [2025-01-09 04:16:41,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4101 states to 4101 states and 6617 transitions. [2025-01-09 04:16:41,949 INFO L78 Accepts]: Start accepts. Automaton has 4101 states and 6617 transitions. Word has length 110 [2025-01-09 04:16:41,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:16:41,949 INFO L471 AbstractCegarLoop]: Abstraction has 4101 states and 6617 transitions. [2025-01-09 04:16:41,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.5) internal successors, (99), 5 states have internal predecessors, (99), 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 04:16:41,949 INFO L276 IsEmpty]: Start isEmpty. Operand 4101 states and 6617 transitions. [2025-01-09 04:16:41,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-01-09 04:16:41,953 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:16:41,953 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:16:41,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 04:16:41,954 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:16:41,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:16:41,954 INFO L85 PathProgramCache]: Analyzing trace with hash -519326338, now seen corresponding path program 1 times [2025-01-09 04:16:41,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:16:41,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191943371] [2025-01-09 04:16:41,954 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:16:41,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:16:41,962 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-01-09 04:16:41,967 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-01-09 04:16:41,967 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:16:41,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:16:42,071 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 04:16:42,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:16:42,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191943371] [2025-01-09 04:16:42,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191943371] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:16:42,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:16:42,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:16:42,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068162374] [2025-01-09 04:16:42,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:16:42,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:16:42,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:16:42,073 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:16:42,073 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:16:42,073 INFO L87 Difference]: Start difference. First operand 4101 states and 6617 transitions. Second operand has 6 states, 6 states have (on average 16.5) internal successors, (99), 5 states have internal predecessors, (99), 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 04:16:42,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:16:42,694 INFO L93 Difference]: Finished difference Result 12947 states and 21496 transitions. [2025-01-09 04:16:42,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 04:16:42,695 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.5) internal successors, (99), 5 states have internal predecessors, (99), 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 110 [2025-01-09 04:16:42,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:16:42,743 INFO L225 Difference]: With dead ends: 12947 [2025-01-09 04:16:42,743 INFO L226 Difference]: Without dead ends: 8860 [2025-01-09 04:16:42,758 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 04:16:42,759 INFO L435 NwaCegarLoop]: 449 mSDtfsCounter, 627 mSDsluCounter, 1348 mSDsCounter, 0 mSdLazyCounter, 701 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 641 SdHoareTripleChecker+Valid, 1797 SdHoareTripleChecker+Invalid, 729 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 701 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 04:16:42,759 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [641 Valid, 1797 Invalid, 729 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 701 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 04:16:42,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8860 states. [2025-01-09 04:16:43,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8860 to 8670. [2025-01-09 04:16:43,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8670 states, 7757 states have (on average 1.6123501353616088) internal successors, (12507), 7971 states have internal predecessors, (12507), 502 states have call successors, (502), 199 states have call predecessors, (502), 410 states have return successors, (1524), 531 states have call predecessors, (1524), 500 states have call successors, (1524) [2025-01-09 04:16:43,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8670 states to 8670 states and 14533 transitions. [2025-01-09 04:16:43,153 INFO L78 Accepts]: Start accepts. Automaton has 8670 states and 14533 transitions. Word has length 110 [2025-01-09 04:16:43,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:16:43,154 INFO L471 AbstractCegarLoop]: Abstraction has 8670 states and 14533 transitions. [2025-01-09 04:16:43,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.5) internal successors, (99), 5 states have internal predecessors, (99), 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 04:16:43,154 INFO L276 IsEmpty]: Start isEmpty. Operand 8670 states and 14533 transitions. [2025-01-09 04:16:43,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-01-09 04:16:43,158 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:16:43,159 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:16:43,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 04:16:43,159 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:16:43,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:16:43,159 INFO L85 PathProgramCache]: Analyzing trace with hash -1514020036, now seen corresponding path program 1 times [2025-01-09 04:16:43,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:16:43,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908549874] [2025-01-09 04:16:43,160 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:16:43,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:16:43,166 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-01-09 04:16:43,168 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-01-09 04:16:43,168 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:16:43,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:16:43,240 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 04:16:43,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:16:43,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908549874] [2025-01-09 04:16:43,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908549874] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:16:43,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:16:43,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:16:43,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557599235] [2025-01-09 04:16:43,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:16:43,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:16:43,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:16:43,242 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:16:43,242 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:16:43,243 INFO L87 Difference]: Start difference. First operand 8670 states and 14533 transitions. Second operand has 6 states, 6 states have (on average 16.5) internal successors, (99), 5 states have internal predecessors, (99), 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 04:16:44,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:16:44,182 INFO L93 Difference]: Finished difference Result 29482 states and 51199 transitions. [2025-01-09 04:16:44,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 04:16:44,182 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.5) internal successors, (99), 5 states have internal predecessors, (99), 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 110 [2025-01-09 04:16:44,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:16:44,273 INFO L225 Difference]: With dead ends: 29482 [2025-01-09 04:16:44,273 INFO L226 Difference]: Without dead ends: 20826 [2025-01-09 04:16:44,301 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 04:16:44,302 INFO L435 NwaCegarLoop]: 444 mSDtfsCounter, 816 mSDsluCounter, 1328 mSDsCounter, 0 mSdLazyCounter, 704 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 837 SdHoareTripleChecker+Valid, 1772 SdHoareTripleChecker+Invalid, 735 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 704 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 04:16:44,303 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [837 Valid, 1772 Invalid, 735 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 704 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 04:16:44,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20826 states. [2025-01-09 04:16:45,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20826 to 18927. [2025-01-09 04:16:45,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18927 states, 16920 states have (on average 1.6375295508274232) internal successors, (27707), 17588 states have internal predecessors, (27707), 950 states have call successors, (950), 391 states have call predecessors, (950), 1056 states have return successors, (5044), 1011 states have call predecessors, (5044), 948 states have call successors, (5044) [2025-01-09 04:16:45,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18927 states to 18927 states and 33701 transitions. [2025-01-09 04:16:45,259 INFO L78 Accepts]: Start accepts. Automaton has 18927 states and 33701 transitions. Word has length 110 [2025-01-09 04:16:45,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:16:45,260 INFO L471 AbstractCegarLoop]: Abstraction has 18927 states and 33701 transitions. [2025-01-09 04:16:45,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.5) internal successors, (99), 5 states have internal predecessors, (99), 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 04:16:45,261 INFO L276 IsEmpty]: Start isEmpty. Operand 18927 states and 33701 transitions. [2025-01-09 04:16:45,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-01-09 04:16:45,271 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:16:45,271 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:16:45,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 04:16:45,271 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:16:45,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:16:45,272 INFO L85 PathProgramCache]: Analyzing trace with hash -2100296258, now seen corresponding path program 1 times [2025-01-09 04:16:45,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:16:45,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516437804] [2025-01-09 04:16:45,272 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:16:45,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:16:45,279 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-01-09 04:16:45,284 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-01-09 04:16:45,284 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:16:45,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:16:45,363 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 04:16:45,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:16:45,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516437804] [2025-01-09 04:16:45,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516437804] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:16:45,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:16:45,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:16:45,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944241400] [2025-01-09 04:16:45,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:16:45,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:16:45,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:16:45,365 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:16:45,366 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:16:45,366 INFO L87 Difference]: Start difference. First operand 18927 states and 33701 transitions. Second operand has 6 states, 6 states have (on average 16.5) internal successors, (99), 5 states have internal predecessors, (99), 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 04:16:47,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:16:47,137 INFO L93 Difference]: Finished difference Result 64593 states and 121589 transitions. [2025-01-09 04:16:47,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 04:16:47,137 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.5) internal successors, (99), 5 states have internal predecessors, (99), 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 110 [2025-01-09 04:16:47,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:16:47,432 INFO L225 Difference]: With dead ends: 64593 [2025-01-09 04:16:47,433 INFO L226 Difference]: Without dead ends: 45680 [2025-01-09 04:16:47,474 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 04:16:47,475 INFO L435 NwaCegarLoop]: 440 mSDtfsCounter, 669 mSDsluCounter, 1316 mSDsCounter, 0 mSdLazyCounter, 850 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 682 SdHoareTripleChecker+Valid, 1756 SdHoareTripleChecker+Invalid, 880 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 850 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 04:16:47,475 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [682 Valid, 1756 Invalid, 880 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 850 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 04:16:47,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45680 states. [2025-01-09 04:16:49,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45680 to 41928. [2025-01-09 04:16:49,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41928 states, 37279 states have (on average 1.6573137691461681) internal successors, (61783), 39341 states have internal predecessors, (61783), 1814 states have call successors, (1814), 775 states have call predecessors, (1814), 2834 states have return successors, (18196), 1939 states have call predecessors, (18196), 1812 states have call successors, (18196) [2025-01-09 04:16:49,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41928 states to 41928 states and 81793 transitions. [2025-01-09 04:16:49,329 INFO L78 Accepts]: Start accepts. Automaton has 41928 states and 81793 transitions. Word has length 110 [2025-01-09 04:16:49,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:16:49,330 INFO L471 AbstractCegarLoop]: Abstraction has 41928 states and 81793 transitions. [2025-01-09 04:16:49,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.5) internal successors, (99), 5 states have internal predecessors, (99), 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 04:16:49,330 INFO L276 IsEmpty]: Start isEmpty. Operand 41928 states and 81793 transitions. [2025-01-09 04:16:49,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-01-09 04:16:49,348 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:16:49,348 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:16:49,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 04:16:49,349 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:16:49,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:16:49,350 INFO L85 PathProgramCache]: Analyzing trace with hash 236096252, now seen corresponding path program 1 times [2025-01-09 04:16:49,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:16:49,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186826168] [2025-01-09 04:16:49,350 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:16:49,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:16:49,357 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-01-09 04:16:49,360 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-01-09 04:16:49,361 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:16:49,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:16:49,440 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 04:16:49,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:16:49,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186826168] [2025-01-09 04:16:49,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186826168] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:16:49,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:16:49,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:16:49,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793911753] [2025-01-09 04:16:49,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:16:49,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:16:49,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:16:49,441 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:16:49,441 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:16:49,442 INFO L87 Difference]: Start difference. First operand 41928 states and 81793 transitions. Second operand has 6 states, 6 states have (on average 16.5) internal successors, (99), 5 states have internal predecessors, (99), 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 04:16:53,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:16:53,024 INFO L93 Difference]: Finished difference Result 143660 states and 305267 transitions. [2025-01-09 04:16:53,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 04:16:53,024 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.5) internal successors, (99), 5 states have internal predecessors, (99), 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 110 [2025-01-09 04:16:53,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:16:53,620 INFO L225 Difference]: With dead ends: 143660 [2025-01-09 04:16:53,620 INFO L226 Difference]: Without dead ends: 101746 [2025-01-09 04:16:53,786 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 04:16:53,786 INFO L435 NwaCegarLoop]: 438 mSDtfsCounter, 746 mSDsluCounter, 1310 mSDsCounter, 0 mSdLazyCounter, 704 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 767 SdHoareTripleChecker+Valid, 1748 SdHoareTripleChecker+Invalid, 735 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 704 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 04:16:53,786 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [767 Valid, 1748 Invalid, 735 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 704 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 04:16:53,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101746 states. [2025-01-09 04:16:59,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101746 to 96333. [2025-01-09 04:16:59,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96333 states, 85006 states have (on average 1.676293438110251) internal successors, (142495), 91314 states have internal predecessors, (142495), 3478 states have call successors, (3478), 1543 states have call predecessors, (3478), 7848 states have return successors, (69012), 3731 states have call predecessors, (69012), 3476 states have call successors, (69012) [2025-01-09 04:17:00,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96333 states to 96333 states and 214985 transitions. [2025-01-09 04:17:00,226 INFO L78 Accepts]: Start accepts. Automaton has 96333 states and 214985 transitions. Word has length 110 [2025-01-09 04:17:00,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:17:00,226 INFO L471 AbstractCegarLoop]: Abstraction has 96333 states and 214985 transitions. [2025-01-09 04:17:00,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.5) internal successors, (99), 5 states have internal predecessors, (99), 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 04:17:00,227 INFO L276 IsEmpty]: Start isEmpty. Operand 96333 states and 214985 transitions. [2025-01-09 04:17:00,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-01-09 04:17:00,261 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:17:00,261 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:17:00,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 04:17:00,261 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:17:00,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:17:00,262 INFO L85 PathProgramCache]: Analyzing trace with hash 2112579070, now seen corresponding path program 1 times [2025-01-09 04:17:00,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:17:00,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105266143] [2025-01-09 04:17:00,262 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:17:00,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:17:00,268 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-01-09 04:17:00,272 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-01-09 04:17:00,272 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:17:00,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:17:00,351 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 04:17:00,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:17:00,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105266143] [2025-01-09 04:17:00,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105266143] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:17:00,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:17:00,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:17:00,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936660588] [2025-01-09 04:17:00,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:17:00,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:17:00,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:17:00,354 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:17:00,354 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:17:00,354 INFO L87 Difference]: Start difference. First operand 96333 states and 214985 transitions. Second operand has 6 states, 6 states have (on average 16.5) internal successors, (99), 5 states have internal predecessors, (99), 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 04:17:08,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:17:08,907 INFO L93 Difference]: Finished difference Result 329499 states and 833993 transitions. [2025-01-09 04:17:08,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 04:17:08,907 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.5) internal successors, (99), 5 states have internal predecessors, (99), 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 110 [2025-01-09 04:17:08,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted.