./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/Problem05_label42+token_ring.05.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/Problem05_label42+token_ring.05.cil-2.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 52ae6c88c77f2a2d1ba84720becde4fbcf955211b08c092cae514b34c6358b12 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 05:16:19,349 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 05:16:19,427 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 05:16:19,433 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 05:16:19,433 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 05:16:19,461 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 05:16:19,462 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 05:16:19,462 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 05:16:19,463 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 05:16:19,463 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 05:16:19,463 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 05:16:19,463 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 05:16:19,463 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 05:16:19,464 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 05:16:19,464 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 05:16:19,464 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 05:16:19,464 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 05:16:19,465 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 05:16:19,465 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 05:16:19,465 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 05:16:19,465 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 05:16:19,465 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 05:16:19,465 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 05:16:19,465 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 05:16:19,465 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 05:16:19,465 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 05:16:19,465 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 05:16:19,465 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 05:16:19,465 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 05:16:19,466 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 05:16:19,466 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 05:16:19,466 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 05:16:19,466 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 05:16:19,466 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 05:16:19,466 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 05:16:19,466 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 05:16:19,466 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 05:16:19,466 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 05:16:19,466 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 05:16:19,466 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 05:16:19,466 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 05:16:19,466 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 05:16:19,466 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 05:16:19,466 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 05:16:19,466 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 05:16:19,466 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 05:16:19,466 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 05:16:19,466 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 05:16:19,466 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 -> 52ae6c88c77f2a2d1ba84720becde4fbcf955211b08c092cae514b34c6358b12 [2025-01-09 05:16:19,662 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 05:16:19,667 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 05:16:19,668 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 05:16:19,669 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 05:16:19,669 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 05:16:19,669 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/Problem05_label42+token_ring.05.cil-2.c [2025-01-09 05:16:20,753 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6431c4e0c/fbb586cec7464f3f8d1c5a6e095bf9b9/FLAG83da91fb6 [2025-01-09 05:16:21,343 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 05:16:21,344 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label42+token_ring.05.cil-2.c [2025-01-09 05:16:21,387 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6431c4e0c/fbb586cec7464f3f8d1c5a6e095bf9b9/FLAG83da91fb6 [2025-01-09 05:16:21,833 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6431c4e0c/fbb586cec7464f3f8d1c5a6e095bf9b9 [2025-01-09 05:16:21,835 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 05:16:21,836 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 05:16:21,837 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 05:16:21,837 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 05:16:21,840 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 05:16:21,840 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 05:16:21" (1/1) ... [2025-01-09 05:16:21,841 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a5d3808 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:16:21, skipping insertion in model container [2025-01-09 05:16:21,841 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 05:16:21" (1/1) ... [2025-01-09 05:16:21,955 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 05:16:23,090 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label42+token_ring.05.cil-2.c[378560,378573] [2025-01-09 05:16:23,118 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label42+token_ring.05.cil-2.c[383339,383352] [2025-01-09 05:16:23,332 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 05:16:23,340 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 05:16:23,839 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label42+token_ring.05.cil-2.c[378560,378573] [2025-01-09 05:16:23,845 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label42+token_ring.05.cil-2.c[383339,383352] [2025-01-09 05:16:23,862 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 05:16:23,911 INFO L204 MainTranslator]: Completed translation [2025-01-09 05:16:23,911 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:16:23 WrapperNode [2025-01-09 05:16:23,912 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 05:16:23,912 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 05:16:23,913 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 05:16:23,913 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 05:16:23,921 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:16:23" (1/1) ... [2025-01-09 05:16:24,001 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:16:23" (1/1) ... [2025-01-09 05:16:24,305 INFO L138 Inliner]: procedures = 54, calls = 57, calls flagged for inlining = 31, calls inlined = 31, statements flattened = 12792 [2025-01-09 05:16:24,306 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 05:16:24,306 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 05:16:24,307 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 05:16:24,307 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 05:16:24,314 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:16:23" (1/1) ... [2025-01-09 05:16:24,314 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:16:23" (1/1) ... [2025-01-09 05:16:24,354 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:16:23" (1/1) ... [2025-01-09 05:16:24,466 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-09 05:16:24,467 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:16:23" (1/1) ... [2025-01-09 05:16:24,467 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:16:23" (1/1) ... [2025-01-09 05:16:24,778 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:16:23" (1/1) ... [2025-01-09 05:16:24,797 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:16:23" (1/1) ... [2025-01-09 05:16:24,846 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:16:23" (1/1) ... [2025-01-09 05:16:24,879 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:16:23" (1/1) ... [2025-01-09 05:16:24,902 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:16:23" (1/1) ... [2025-01-09 05:16:24,945 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 05:16:24,947 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 05:16:24,947 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 05:16:24,947 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 05:16:24,948 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:16:23" (1/1) ... [2025-01-09 05:16:24,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 05:16:24,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:16:24,975 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 05:16:24,987 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 05:16:25,003 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 05:16:25,003 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2025-01-09 05:16:25,003 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2025-01-09 05:16:25,003 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-01-09 05:16:25,003 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-01-09 05:16:25,004 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2025-01-09 05:16:25,004 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2025-01-09 05:16:25,004 INFO L130 BoogieDeclarations]: Found specification of procedure error [2025-01-09 05:16:25,004 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2025-01-09 05:16:25,004 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2025-01-09 05:16:25,004 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2025-01-09 05:16:25,004 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2025-01-09 05:16:25,005 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2025-01-09 05:16:25,005 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2025-01-09 05:16:25,005 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2025-01-09 05:16:25,005 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 05:16:25,005 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 05:16:25,005 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 05:16:25,104 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 05:16:25,105 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 05:16:31,455 INFO L? ?]: Removed 1717 outVars from TransFormulas that were not future-live. [2025-01-09 05:16:31,455 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 05:16:31,505 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 05:16:31,505 INFO L312 CfgBuilder]: Removed 9 assume(true) statements. [2025-01-09 05:16:31,506 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 05:16:31 BoogieIcfgContainer [2025-01-09 05:16:31,506 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 05:16:31,507 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 05:16:31,507 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 05:16:31,511 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 05:16:31,511 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 05:16:21" (1/3) ... [2025-01-09 05:16:31,512 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3dbac83b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 05:16:31, skipping insertion in model container [2025-01-09 05:16:31,512 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:16:23" (2/3) ... [2025-01-09 05:16:31,512 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3dbac83b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 05:16:31, skipping insertion in model container [2025-01-09 05:16:31,512 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 05:16:31" (3/3) ... [2025-01-09 05:16:31,513 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem05_label42+token_ring.05.cil-2.c [2025-01-09 05:16:31,524 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 05:16:31,527 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem05_label42+token_ring.05.cil-2.c that has 8 procedures, 2396 locations, 1 initial locations, 9 loop locations, and 2 error locations. [2025-01-09 05:16:31,606 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 05:16:31,613 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;@50d817df, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 05:16:31,613 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-01-09 05:16:31,620 INFO L276 IsEmpty]: Start isEmpty. Operand has 2396 states, 2366 states have (on average 1.849112426035503) internal successors, (4375), 2370 states have internal predecessors, (4375), 21 states have call successors, (21), 7 states have call predecessors, (21), 7 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2025-01-09 05:16:31,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-01-09 05:16:31,631 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:16:31,631 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] [2025-01-09 05:16:31,632 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:16:31,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:16:31,640 INFO L85 PathProgramCache]: Analyzing trace with hash -1308118319, now seen corresponding path program 1 times [2025-01-09 05:16:31,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:16:31,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744110435] [2025-01-09 05:16:31,645 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:16:31,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:16:31,712 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-01-09 05:16:31,731 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-01-09 05:16:31,732 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:16:31,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:16:31,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:16:31,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:16:31,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744110435] [2025-01-09 05:16:31,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744110435] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:16:31,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:16:31,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:16:31,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619130104] [2025-01-09 05:16:31,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:16:31,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:16:31,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:16:31,897 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:16:31,897 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:16:31,907 INFO L87 Difference]: Start difference. First operand has 2396 states, 2366 states have (on average 1.849112426035503) internal successors, (4375), 2370 states have internal predecessors, (4375), 21 states have call successors, (21), 7 states have call predecessors, (21), 7 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:16:32,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:16:32,080 INFO L93 Difference]: Finished difference Result 4782 states and 8817 transitions. [2025-01-09 05:16:32,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:16:32,090 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (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 100 [2025-01-09 05:16:32,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:16:32,113 INFO L225 Difference]: With dead ends: 4782 [2025-01-09 05:16:32,114 INFO L226 Difference]: Without dead ends: 2328 [2025-01-09 05:16:32,125 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:16:32,132 INFO L435 NwaCegarLoop]: 4343 mSDtfsCounter, 313 mSDsluCounter, 4022 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 313 SdHoareTripleChecker+Valid, 8365 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:16:32,136 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [313 Valid, 8365 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:16:32,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2328 states. [2025-01-09 05:16:32,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2328 to 2328. [2025-01-09 05:16:32,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2328 states, 2299 states have (on average 1.8421052631578947) internal successors, (4235), 2302 states have internal predecessors, (4235), 21 states have call successors, (21), 7 states have call predecessors, (21), 6 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-01-09 05:16:32,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2328 states to 2328 states and 4275 transitions. [2025-01-09 05:16:32,247 INFO L78 Accepts]: Start accepts. Automaton has 2328 states and 4275 transitions. Word has length 100 [2025-01-09 05:16:32,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:16:32,248 INFO L471 AbstractCegarLoop]: Abstraction has 2328 states and 4275 transitions. [2025-01-09 05:16:32,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:16:32,249 INFO L276 IsEmpty]: Start isEmpty. Operand 2328 states and 4275 transitions. [2025-01-09 05:16:32,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-01-09 05:16:32,252 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:16:32,252 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] [2025-01-09 05:16:32,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 05:16:32,252 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:16:32,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:16:32,253 INFO L85 PathProgramCache]: Analyzing trace with hash -313424621, now seen corresponding path program 1 times [2025-01-09 05:16:32,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:16:32,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935500153] [2025-01-09 05:16:32,253 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:16:32,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:16:32,262 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-01-09 05:16:32,271 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-01-09 05:16:32,272 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:16:32,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:16:32,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:16:32,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:16:32,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935500153] [2025-01-09 05:16:32,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935500153] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:16:32,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:16:32,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 05:16:32,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202817065] [2025-01-09 05:16:32,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:16:32,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 05:16:32,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:16:32,455 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 05:16:32,455 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 05:16:32,455 INFO L87 Difference]: Start difference. First operand 2328 states and 4275 transitions. Second operand has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:16:33,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:16:33,036 INFO L93 Difference]: Finished difference Result 2736 states and 4911 transitions. [2025-01-09 05:16:33,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 05:16:33,036 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 2 states have call successors, (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 100 [2025-01-09 05:16:33,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:16:33,051 INFO L225 Difference]: With dead ends: 2736 [2025-01-09 05:16:33,051 INFO L226 Difference]: Without dead ends: 2542 [2025-01-09 05:16:33,054 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:16:33,055 INFO L435 NwaCegarLoop]: 4204 mSDtfsCounter, 4525 mSDsluCounter, 8529 mSDsCounter, 0 mSdLazyCounter, 350 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4538 SdHoareTripleChecker+Valid, 12733 SdHoareTripleChecker+Invalid, 396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 05:16:33,055 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4538 Valid, 12733 Invalid, 396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 350 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 05:16:33,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2542 states. [2025-01-09 05:16:33,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2542 to 2525. [2025-01-09 05:16:33,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2525 states, 2475 states have (on average 1.823030303030303) internal successors, (4512), 2479 states have internal predecessors, (4512), 35 states have call successors, (35), 13 states have call predecessors, (35), 13 states have return successors, (34), 33 states have call predecessors, (34), 33 states have call successors, (34) [2025-01-09 05:16:33,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2525 states to 2525 states and 4581 transitions. [2025-01-09 05:16:33,127 INFO L78 Accepts]: Start accepts. Automaton has 2525 states and 4581 transitions. Word has length 100 [2025-01-09 05:16:33,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:16:33,127 INFO L471 AbstractCegarLoop]: Abstraction has 2525 states and 4581 transitions. [2025-01-09 05:16:33,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:16:33,127 INFO L276 IsEmpty]: Start isEmpty. Operand 2525 states and 4581 transitions. [2025-01-09 05:16:33,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-01-09 05:16:33,129 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:16:33,129 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] [2025-01-09 05:16:33,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 05:16:33,132 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:16:33,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:16:33,132 INFO L85 PathProgramCache]: Analyzing trace with hash 2125043983, now seen corresponding path program 1 times [2025-01-09 05:16:33,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:16:33,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629718155] [2025-01-09 05:16:33,136 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:16:33,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:16:33,147 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-01-09 05:16:33,157 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-01-09 05:16:33,160 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:16:33,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:16:33,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:16:33,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:16:33,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629718155] [2025-01-09 05:16:33,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629718155] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:16:33,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:16:33,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:16:33,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141154410] [2025-01-09 05:16:33,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:16:33,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:16:33,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:16:33,347 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:16:33,347 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:16:33,347 INFO L87 Difference]: Start difference. First operand 2525 states and 4581 transitions. Second operand has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:16:33,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:16:33,841 INFO L93 Difference]: Finished difference Result 3165 states and 5584 transitions. [2025-01-09 05:16:33,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:16:33,842 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 2 states have call successors, (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 100 [2025-01-09 05:16:33,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:16:33,853 INFO L225 Difference]: With dead ends: 3165 [2025-01-09 05:16:33,854 INFO L226 Difference]: Without dead ends: 2774 [2025-01-09 05:16:33,856 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 05:16:33,859 INFO L435 NwaCegarLoop]: 4369 mSDtfsCounter, 4520 mSDsluCounter, 13097 mSDsCounter, 0 mSdLazyCounter, 635 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4533 SdHoareTripleChecker+Valid, 17466 SdHoareTripleChecker+Invalid, 662 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 635 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 05:16:33,859 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4533 Valid, 17466 Invalid, 662 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 635 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 05:16:33,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2774 states. [2025-01-09 05:16:33,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2774 to 2709. [2025-01-09 05:16:33,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2709 states, 2638 states have (on average 1.8055344958301744) internal successors, (4763), 2643 states have internal predecessors, (4763), 49 states have call successors, (49), 19 states have call predecessors, (49), 20 states have return successors, (51), 48 states have call predecessors, (51), 47 states have call successors, (51) [2025-01-09 05:16:33,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2709 states to 2709 states and 4863 transitions. [2025-01-09 05:16:33,938 INFO L78 Accepts]: Start accepts. Automaton has 2709 states and 4863 transitions. Word has length 100 [2025-01-09 05:16:33,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:16:33,939 INFO L471 AbstractCegarLoop]: Abstraction has 2709 states and 4863 transitions. [2025-01-09 05:16:33,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:16:33,940 INFO L276 IsEmpty]: Start isEmpty. Operand 2709 states and 4863 transitions. [2025-01-09 05:16:33,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-01-09 05:16:33,942 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:16:33,942 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] [2025-01-09 05:16:33,942 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 05:16:33,942 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:16:33,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:16:33,945 INFO L85 PathProgramCache]: Analyzing trace with hash -845067119, now seen corresponding path program 1 times [2025-01-09 05:16:33,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:16:33,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793435767] [2025-01-09 05:16:33,945 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:16:33,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:16:33,955 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-01-09 05:16:33,962 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-01-09 05:16:33,965 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:16:33,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:16:34,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:16:34,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:16:34,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793435767] [2025-01-09 05:16:34,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793435767] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:16:34,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:16:34,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:16:34,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284613551] [2025-01-09 05:16:34,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:16:34,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:16:34,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:16:34,112 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:16:34,112 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:16:34,112 INFO L87 Difference]: Start difference. First operand 2709 states and 4863 transitions. Second operand has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:16:34,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:16:34,551 INFO L93 Difference]: Finished difference Result 3737 states and 6469 transitions. [2025-01-09 05:16:34,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:16:34,551 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 2 states have call successors, (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 100 [2025-01-09 05:16:34,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:16:34,563 INFO L225 Difference]: With dead ends: 3737 [2025-01-09 05:16:34,563 INFO L226 Difference]: Without dead ends: 3162 [2025-01-09 05:16:34,566 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 05:16:34,566 INFO L435 NwaCegarLoop]: 4361 mSDtfsCounter, 4512 mSDsluCounter, 13075 mSDsCounter, 0 mSdLazyCounter, 635 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4525 SdHoareTripleChecker+Valid, 17436 SdHoareTripleChecker+Invalid, 662 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 635 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 05:16:34,567 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4525 Valid, 17436 Invalid, 662 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 635 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 05:16:34,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3162 states. [2025-01-09 05:16:34,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3162 to 3095. [2025-01-09 05:16:34,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3095 states, 2980 states have (on average 1.7765100671140939) internal successors, (5294), 2989 states have internal predecessors, (5294), 77 states have call successors, (77), 31 states have call predecessors, (77), 36 states have return successors, (91), 78 states have call predecessors, (91), 75 states have call successors, (91) [2025-01-09 05:16:34,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3095 states to 3095 states and 5462 transitions. [2025-01-09 05:16:34,644 INFO L78 Accepts]: Start accepts. Automaton has 3095 states and 5462 transitions. Word has length 100 [2025-01-09 05:16:34,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:16:34,644 INFO L471 AbstractCegarLoop]: Abstraction has 3095 states and 5462 transitions. [2025-01-09 05:16:34,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:16:34,644 INFO L276 IsEmpty]: Start isEmpty. Operand 3095 states and 5462 transitions. [2025-01-09 05:16:34,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-01-09 05:16:34,646 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:16:34,646 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] [2025-01-09 05:16:34,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 05:16:34,646 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:16:34,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:16:34,647 INFO L85 PathProgramCache]: Analyzing trace with hash -1902905197, now seen corresponding path program 1 times [2025-01-09 05:16:34,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:16:34,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811269990] [2025-01-09 05:16:34,647 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:16:34,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:16:34,653 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-01-09 05:16:34,656 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-01-09 05:16:34,656 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:16:34,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:16:34,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:16:34,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:16:34,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811269990] [2025-01-09 05:16:34,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811269990] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:16:34,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:16:34,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:16:34,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566551472] [2025-01-09 05:16:34,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:16:34,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:16:34,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:16:34,745 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:16:34,745 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:16:34,745 INFO L87 Difference]: Start difference. First operand 3095 states and 5462 transitions. Second operand has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:16:35,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:16:35,342 INFO L93 Difference]: Finished difference Result 4959 states and 8398 transitions. [2025-01-09 05:16:35,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:16:35,342 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 2 states have call successors, (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 100 [2025-01-09 05:16:35,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:16:35,361 INFO L225 Difference]: With dead ends: 4959 [2025-01-09 05:16:35,361 INFO L226 Difference]: Without dead ends: 3998 [2025-01-09 05:16:35,364 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 05:16:35,365 INFO L435 NwaCegarLoop]: 4358 mSDtfsCounter, 4507 mSDsluCounter, 13066 mSDsCounter, 0 mSdLazyCounter, 635 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4520 SdHoareTripleChecker+Valid, 17424 SdHoareTripleChecker+Invalid, 662 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 635 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 05:16:35,365 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4520 Valid, 17424 Invalid, 662 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 635 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 05:16:35,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3998 states. [2025-01-09 05:16:35,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3998 to 3918. [2025-01-09 05:16:35,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3918 states, 3709 states have (on average 1.7357778376921003) internal successors, (6438), 3732 states have internal predecessors, (6438), 133 states have call successors, (133), 55 states have call predecessors, (133), 74 states have return successors, (195), 138 states have call predecessors, (195), 131 states have call successors, (195) [2025-01-09 05:16:35,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3918 states to 3918 states and 6766 transitions. [2025-01-09 05:16:35,519 INFO L78 Accepts]: Start accepts. Automaton has 3918 states and 6766 transitions. Word has length 100 [2025-01-09 05:16:35,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:16:35,520 INFO L471 AbstractCegarLoop]: Abstraction has 3918 states and 6766 transitions. [2025-01-09 05:16:35,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:16:35,520 INFO L276 IsEmpty]: Start isEmpty. Operand 3918 states and 6766 transitions. [2025-01-09 05:16:35,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-01-09 05:16:35,522 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:16:35,522 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] [2025-01-09 05:16:35,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 05:16:35,523 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:16:35,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:16:35,523 INFO L85 PathProgramCache]: Analyzing trace with hash 1249559633, now seen corresponding path program 1 times [2025-01-09 05:16:35,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:16:35,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892100101] [2025-01-09 05:16:35,523 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:16:35,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:16:35,536 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-01-09 05:16:35,542 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-01-09 05:16:35,542 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:16:35,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:16:35,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:16:35,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:16:35,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892100101] [2025-01-09 05:16:35,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892100101] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:16:35,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:16:35,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:16:35,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951684804] [2025-01-09 05:16:35,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:16:35,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:16:35,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:16:35,672 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:16:35,673 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:16:35,673 INFO L87 Difference]: Start difference. First operand 3918 states and 6766 transitions. Second operand has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:16:36,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:16:36,252 INFO L93 Difference]: Finished difference Result 7588 states and 12668 transitions. [2025-01-09 05:16:36,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:16:36,252 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 2 states have call successors, (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 100 [2025-01-09 05:16:36,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:16:36,278 INFO L225 Difference]: With dead ends: 7588 [2025-01-09 05:16:36,278 INFO L226 Difference]: Without dead ends: 5804 [2025-01-09 05:16:36,288 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 05:16:36,288 INFO L435 NwaCegarLoop]: 4355 mSDtfsCounter, 4502 mSDsluCounter, 13057 mSDsCounter, 0 mSdLazyCounter, 635 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4515 SdHoareTripleChecker+Valid, 17412 SdHoareTripleChecker+Invalid, 662 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 635 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 05:16:36,290 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4515 Valid, 17412 Invalid, 662 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 635 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 05:16:36,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5804 states. [2025-01-09 05:16:36,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5804 to 5699. [2025-01-09 05:16:36,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5699 states, 5284 states have (on average 1.6915215745647236) internal successors, (8938), 5353 states have internal predecessors, (8938), 245 states have call successors, (245), 103 states have call predecessors, (245), 168 states have return successors, (499), 258 states have call predecessors, (499), 243 states have call successors, (499) [2025-01-09 05:16:36,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5699 states to 5699 states and 9682 transitions. [2025-01-09 05:16:36,534 INFO L78 Accepts]: Start accepts. Automaton has 5699 states and 9682 transitions. Word has length 100 [2025-01-09 05:16:36,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:16:36,534 INFO L471 AbstractCegarLoop]: Abstraction has 5699 states and 9682 transitions. [2025-01-09 05:16:36,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:16:36,535 INFO L276 IsEmpty]: Start isEmpty. Operand 5699 states and 9682 transitions. [2025-01-09 05:16:36,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-01-09 05:16:36,539 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:16:36,540 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] [2025-01-09 05:16:36,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 05:16:36,540 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:16:36,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:16:36,541 INFO L85 PathProgramCache]: Analyzing trace with hash 1489799379, now seen corresponding path program 1 times [2025-01-09 05:16:36,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:16:36,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678091832] [2025-01-09 05:16:36,541 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:16:36,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:16:36,551 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-01-09 05:16:36,554 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-01-09 05:16:36,557 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:16:36,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:16:36,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:16:36,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:16:36,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678091832] [2025-01-09 05:16:36,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678091832] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:16:36,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:16:36,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:16:36,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796651370] [2025-01-09 05:16:36,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:16:36,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:16:36,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:16:36,662 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:16:36,662 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:16:36,662 INFO L87 Difference]: Start difference. First operand 5699 states and 9682 transitions. Second operand has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:16:37,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:16:37,348 INFO L93 Difference]: Finished difference Result 13967 states and 23383 transitions. [2025-01-09 05:16:37,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:16:37,348 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 2 states have call successors, (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 100 [2025-01-09 05:16:37,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:16:37,405 INFO L225 Difference]: With dead ends: 13967 [2025-01-09 05:16:37,405 INFO L226 Difference]: Without dead ends: 10402 [2025-01-09 05:16:37,419 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 05:16:37,421 INFO L435 NwaCegarLoop]: 4211 mSDtfsCounter, 4687 mSDsluCounter, 12715 mSDsCounter, 0 mSdLazyCounter, 517 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4706 SdHoareTripleChecker+Valid, 16926 SdHoareTripleChecker+Invalid, 564 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 517 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 05:16:37,421 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4706 Valid, 16926 Invalid, 564 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 517 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 05:16:37,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10402 states. [2025-01-09 05:16:37,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10402 to 9564. [2025-01-09 05:16:37,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9564 states, 8699 states have (on average 1.659731003563628) internal successors, (14438), 8914 states have internal predecessors, (14438), 453 states have call successors, (453), 199 states have call predecessors, (453), 410 states have return successors, (1475), 482 states have call predecessors, (1475), 451 states have call successors, (1475) [2025-01-09 05:16:37,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9564 states to 9564 states and 16366 transitions. [2025-01-09 05:16:37,844 INFO L78 Accepts]: Start accepts. Automaton has 9564 states and 16366 transitions. Word has length 100 [2025-01-09 05:16:37,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:16:37,845 INFO L471 AbstractCegarLoop]: Abstraction has 9564 states and 16366 transitions. [2025-01-09 05:16:37,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:16:37,846 INFO L276 IsEmpty]: Start isEmpty. Operand 9564 states and 16366 transitions. [2025-01-09 05:16:37,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-01-09 05:16:37,852 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:16:37,852 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] [2025-01-09 05:16:37,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 05:16:37,852 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:16:37,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:16:37,853 INFO L85 PathProgramCache]: Analyzing trace with hash -1966134255, now seen corresponding path program 1 times [2025-01-09 05:16:37,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:16:37,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398125797] [2025-01-09 05:16:37,853 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:16:37,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:16:37,859 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-01-09 05:16:37,862 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-01-09 05:16:37,862 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:16:37,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:16:37,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:16:37,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:16:37,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398125797] [2025-01-09 05:16:37,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398125797] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:16:37,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:16:37,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:16:37,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162268582] [2025-01-09 05:16:37,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:16:37,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:16:37,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:16:37,976 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:16:37,976 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:16:37,976 INFO L87 Difference]: Start difference. First operand 9564 states and 16366 transitions. Second operand has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:16:38,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:16:38,794 INFO L93 Difference]: Finished difference Result 26914 states and 46997 transitions. [2025-01-09 05:16:38,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:16:38,794 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 2 states have call successors, (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 100 [2025-01-09 05:16:38,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:16:38,876 INFO L225 Difference]: With dead ends: 26914 [2025-01-09 05:16:38,877 INFO L226 Difference]: Without dead ends: 19484 [2025-01-09 05:16:38,909 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 05:16:38,909 INFO L435 NwaCegarLoop]: 4346 mSDtfsCounter, 4534 mSDsluCounter, 13025 mSDsCounter, 0 mSdLazyCounter, 760 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4546 SdHoareTripleChecker+Valid, 17371 SdHoareTripleChecker+Invalid, 789 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 760 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 05:16:38,909 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4546 Valid, 17371 Invalid, 789 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 760 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 05:16:38,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19484 states. [2025-01-09 05:16:39,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19484 to 17849. [2025-01-09 05:16:39,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17849 states, 15938 states have (on average 1.6402308947170285) internal successors, (26142), 16607 states have internal predecessors, (26142), 853 states have call successors, (853), 391 states have call predecessors, (853), 1056 states have return successors, (4947), 914 states have call predecessors, (4947), 851 states have call successors, (4947) [2025-01-09 05:16:39,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17849 states to 17849 states and 31942 transitions. [2025-01-09 05:16:39,512 INFO L78 Accepts]: Start accepts. Automaton has 17849 states and 31942 transitions. Word has length 100 [2025-01-09 05:16:39,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:16:39,513 INFO L471 AbstractCegarLoop]: Abstraction has 17849 states and 31942 transitions. [2025-01-09 05:16:39,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:16:39,513 INFO L276 IsEmpty]: Start isEmpty. Operand 17849 states and 31942 transitions. [2025-01-09 05:16:39,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-01-09 05:16:39,521 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:16:39,521 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] [2025-01-09 05:16:39,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 05:16:39,522 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:16:39,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:16:39,522 INFO L85 PathProgramCache]: Analyzing trace with hash -1939068653, now seen corresponding path program 1 times [2025-01-09 05:16:39,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:16:39,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074304218] [2025-01-09 05:16:39,522 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:16:39,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:16:39,527 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-01-09 05:16:39,530 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-01-09 05:16:39,530 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:16:39,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:16:39,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:16:39,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:16:39,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074304218] [2025-01-09 05:16:39,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074304218] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:16:39,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:16:39,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:16:39,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010802630] [2025-01-09 05:16:39,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:16:39,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:16:39,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:16:39,604 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:16:39,604 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:16:39,604 INFO L87 Difference]: Start difference. First operand 17849 states and 31942 transitions. Second operand has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:16:40,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:16:40,767 INFO L93 Difference]: Finished difference Result 54721 states and 103947 transitions. [2025-01-09 05:16:40,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:16:40,768 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 2 states have call successors, (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 100 [2025-01-09 05:16:40,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:16:40,924 INFO L225 Difference]: With dead ends: 54721 [2025-01-09 05:16:40,924 INFO L226 Difference]: Without dead ends: 39006 [2025-01-09 05:16:40,995 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 05:16:40,996 INFO L435 NwaCegarLoop]: 4344 mSDtfsCounter, 4591 mSDsluCounter, 13019 mSDsCounter, 0 mSdLazyCounter, 638 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4610 SdHoareTripleChecker+Valid, 17363 SdHoareTripleChecker+Invalid, 668 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 638 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 05:16:40,996 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4610 Valid, 17363 Invalid, 668 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 638 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 05:16:41,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39006 states. [2025-01-09 05:16:42,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39006 to 36798. [2025-01-09 05:16:42,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36798 states, 32341 states have (on average 1.636127516155963) internal successors, (52914), 34404 states have internal predecessors, (52914), 1621 states have call successors, (1621), 775 states have call predecessors, (1621), 2834 states have return successors, (18003), 1746 states have call predecessors, (18003), 1619 states have call successors, (18003) [2025-01-09 05:16:42,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36798 states to 36798 states and 72538 transitions. [2025-01-09 05:16:42,959 INFO L78 Accepts]: Start accepts. Automaton has 36798 states and 72538 transitions. Word has length 100 [2025-01-09 05:16:42,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:16:42,960 INFO L471 AbstractCegarLoop]: Abstraction has 36798 states and 72538 transitions. [2025-01-09 05:16:42,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:16:42,960 INFO L276 IsEmpty]: Start isEmpty. Operand 36798 states and 72538 transitions. [2025-01-09 05:16:42,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-01-09 05:16:42,980 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:16:42,980 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] [2025-01-09 05:16:42,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 05:16:42,980 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:16:42,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:16:42,982 INFO L85 PathProgramCache]: Analyzing trace with hash 278561745, now seen corresponding path program 1 times [2025-01-09 05:16:42,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:16:42,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000890392] [2025-01-09 05:16:42,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:16:42,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:16:42,991 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-01-09 05:16:42,997 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-01-09 05:16:42,997 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:16:42,997 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:16:43,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:16:43,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:16:43,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000890392] [2025-01-09 05:16:43,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000890392] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:16:43,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:16:43,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:16:43,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452894667] [2025-01-09 05:16:43,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:16:43,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:16:43,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:16:43,075 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:16:43,076 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:16:43,076 INFO L87 Difference]: Start difference. First operand 36798 states and 72538 transitions. Second operand has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:16:46,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:16:46,627 INFO L93 Difference]: Finished difference Result 117628 states and 257609 transitions. [2025-01-09 05:16:46,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:16:46,627 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 2 states have call successors, (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 100 [2025-01-09 05:16:46,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:16:47,363 INFO L225 Difference]: With dead ends: 117628 [2025-01-09 05:16:47,366 INFO L226 Difference]: Without dead ends: 82964 [2025-01-09 05:16:47,484 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 05:16:47,484 INFO L435 NwaCegarLoop]: 4341 mSDtfsCounter, 4556 mSDsluCounter, 13010 mSDsCounter, 0 mSdLazyCounter, 638 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4575 SdHoareTripleChecker+Valid, 17351 SdHoareTripleChecker+Invalid, 668 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 638 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 05:16:47,485 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4575 Valid, 17351 Invalid, 668 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 638 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 05:16:47,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82964 states. [2025-01-09 05:16:52,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82964 to 79607. [2025-01-09 05:16:52,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79607 states, 68664 states have (on average 1.63255854596295) internal successors, (112098), 74973 states have internal predecessors, (112098), 3093 states have call successors, (3093), 1543 states have call predecessors, (3093), 7848 states have return successors, (68627), 3346 states have call predecessors, (68627), 3091 states have call successors, (68627) [2025-01-09 05:16:53,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79607 states to 79607 states and 183818 transitions. [2025-01-09 05:16:53,146 INFO L78 Accepts]: Start accepts. Automaton has 79607 states and 183818 transitions. Word has length 100 [2025-01-09 05:16:53,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:16:53,147 INFO L471 AbstractCegarLoop]: Abstraction has 79607 states and 183818 transitions. [2025-01-09 05:16:53,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:16:53,147 INFO L276 IsEmpty]: Start isEmpty. Operand 79607 states and 183818 transitions. [2025-01-09 05:16:53,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-01-09 05:16:53,186 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:16:53,186 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] [2025-01-09 05:16:53,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 05:16:53,187 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:16:53,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:16:53,188 INFO L85 PathProgramCache]: Analyzing trace with hash 2012666195, now seen corresponding path program 1 times [2025-01-09 05:16:53,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:16:53,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58671784] [2025-01-09 05:16:53,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:16:53,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:16:53,197 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-01-09 05:16:53,201 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-01-09 05:16:53,202 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:16:53,202 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:16:53,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:16:53,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:16:53,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58671784] [2025-01-09 05:16:53,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58671784] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:16:53,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:16:53,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 05:16:53,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097090128] [2025-01-09 05:16:53,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:16:53,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 05:16:53,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:16:53,313 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 05:16:53,313 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 05:16:53,313 INFO L87 Difference]: Start difference. First operand 79607 states and 183818 transitions. Second operand has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:16:59,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:16:59,021 INFO L93 Difference]: Finished difference Result 170206 states and 436273 transitions. [2025-01-09 05:16:59,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 05:16:59,021 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 2 states have call successors, (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 100 [2025-01-09 05:16:59,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:17:00,008 INFO L225 Difference]: With dead ends: 170206 [2025-01-09 05:17:00,008 INFO L226 Difference]: Without dead ends: 92733 [2025-01-09 05:17:00,196 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:17:00,197 INFO L435 NwaCegarLoop]: 4173 mSDtfsCounter, 4356 mSDsluCounter, 8255 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4369 SdHoareTripleChecker+Valid, 12428 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 05:17:00,197 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4369 Valid, 12428 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 05:17:00,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92733 states.