./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/systemc/token_ring.08.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/systemc/token_ring.08.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 19daebdfafed51668fa57cd9e9dbb1892c2070de71da48d425d8df389215d260 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 16:08:08,485 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 16:08:08,525 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 16:08:08,529 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 16:08:08,530 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 16:08:08,544 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 16:08:08,545 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 16:08:08,545 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 16:08:08,545 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 16:08:08,546 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 16:08:08,546 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 16:08:08,546 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 16:08:08,546 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 16:08:08,546 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 16:08:08,546 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 16:08:08,546 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 16:08:08,546 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 16:08:08,547 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 16:08:08,547 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 16:08:08,547 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 16:08:08,547 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 16:08:08,547 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 16:08:08,547 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 16:08:08,547 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 16:08:08,547 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 16:08:08,547 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 16:08:08,547 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 16:08:08,547 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 16:08:08,548 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 16:08:08,548 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 16:08:08,548 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 16:08:08,548 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 16:08:08,548 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 16:08:08,548 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 16:08:08,548 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 16:08:08,548 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 16:08:08,548 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 16:08:08,548 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 16:08:08,548 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 16:08:08,548 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 16:08:08,549 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 16:08:08,549 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 16:08:08,549 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 16:08:08,549 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 -> 19daebdfafed51668fa57cd9e9dbb1892c2070de71da48d425d8df389215d260 [2025-02-05 16:08:08,738 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 16:08:08,743 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 16:08:08,745 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 16:08:08,745 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 16:08:08,746 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 16:08:08,746 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/token_ring.08.cil-2.c [2025-02-05 16:08:09,919 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/81e350f8d/100eb184cc0a45ffbba8c4850777ccb2/FLAGc912d06c1 [2025-02-05 16:08:10,190 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 16:08:10,194 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/systemc/token_ring.08.cil-2.c [2025-02-05 16:08:10,207 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/81e350f8d/100eb184cc0a45ffbba8c4850777ccb2/FLAGc912d06c1 [2025-02-05 16:08:10,505 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/81e350f8d/100eb184cc0a45ffbba8c4850777ccb2 [2025-02-05 16:08:10,511 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 16:08:10,513 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 16:08:10,514 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 16:08:10,514 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 16:08:10,517 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 16:08:10,522 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 04:08:10" (1/1) ... [2025-02-05 16:08:10,523 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@705dd3b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:08:10, skipping insertion in model container [2025-02-05 16:08:10,524 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 04:08:10" (1/1) ... [2025-02-05 16:08:10,560 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 16:08:10,664 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/systemc/token_ring.08.cil-2.c[671,684] [2025-02-05 16:08:10,741 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 16:08:10,750 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 16:08:10,759 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/systemc/token_ring.08.cil-2.c[671,684] [2025-02-05 16:08:10,789 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 16:08:10,806 INFO L204 MainTranslator]: Completed translation [2025-02-05 16:08:10,806 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:08:10 WrapperNode [2025-02-05 16:08:10,807 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 16:08:10,807 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 16:08:10,807 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 16:08:10,807 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 16:08:10,811 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:08:10" (1/1) ... [2025-02-05 16:08:10,823 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:08:10" (1/1) ... [2025-02-05 16:08:10,853 INFO L138 Inliner]: procedures = 44, calls = 56, calls flagged for inlining = 27, calls inlined = 27, statements flattened = 612 [2025-02-05 16:08:10,854 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 16:08:10,855 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 16:08:10,855 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 16:08:10,855 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 16:08:10,861 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:08:10" (1/1) ... [2025-02-05 16:08:10,861 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:08:10" (1/1) ... [2025-02-05 16:08:10,867 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:08:10" (1/1) ... [2025-02-05 16:08:10,887 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-02-05 16:08:10,887 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:08:10" (1/1) ... [2025-02-05 16:08:10,887 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:08:10" (1/1) ... [2025-02-05 16:08:10,894 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:08:10" (1/1) ... [2025-02-05 16:08:10,895 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:08:10" (1/1) ... [2025-02-05 16:08:10,896 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:08:10" (1/1) ... [2025-02-05 16:08:10,897 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:08:10" (1/1) ... [2025-02-05 16:08:10,898 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 16:08:10,899 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 16:08:10,899 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 16:08:10,899 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 16:08:10,900 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:08:10" (1/1) ... [2025-02-05 16:08:10,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 16:08:10,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:08:10,922 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-02-05 16:08:10,924 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-02-05 16:08:10,942 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 16:08:10,942 INFO L130 BoogieDeclarations]: Found specification of procedure error [2025-02-05 16:08:10,943 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2025-02-05 16:08:10,943 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2025-02-05 16:08:10,943 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2025-02-05 16:08:10,943 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2025-02-05 16:08:10,943 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2025-02-05 16:08:10,943 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-02-05 16:08:10,943 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-02-05 16:08:10,943 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2025-02-05 16:08:10,944 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2025-02-05 16:08:10,944 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2025-02-05 16:08:10,944 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2025-02-05 16:08:10,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 16:08:10,944 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2025-02-05 16:08:10,944 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2025-02-05 16:08:10,944 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 16:08:10,944 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 16:08:11,011 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 16:08:11,013 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 16:08:11,551 INFO L? ?]: Removed 77 outVars from TransFormulas that were not future-live. [2025-02-05 16:08:11,551 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 16:08:11,576 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 16:08:11,576 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 16:08:11,577 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 04:08:11 BoogieIcfgContainer [2025-02-05 16:08:11,577 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 16:08:11,579 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 16:08:11,579 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 16:08:11,582 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 16:08:11,582 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 04:08:10" (1/3) ... [2025-02-05 16:08:11,583 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a95fbd2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 04:08:11, skipping insertion in model container [2025-02-05 16:08:11,583 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:08:10" (2/3) ... [2025-02-05 16:08:11,583 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a95fbd2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 04:08:11, skipping insertion in model container [2025-02-05 16:08:11,583 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 04:08:11" (3/3) ... [2025-02-05 16:08:11,584 INFO L128 eAbstractionObserver]: Analyzing ICFG token_ring.08.cil-2.c [2025-02-05 16:08:11,595 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 16:08:11,596 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG token_ring.08.cil-2.c that has 8 procedures, 308 locations, 1 initial locations, 11 loop locations, and 1 error locations. [2025-02-05 16:08:11,666 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 16:08:11,687 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;@42795efc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 16:08:11,687 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 16:08:11,695 INFO L276 IsEmpty]: Start isEmpty. Operand has 308 states, 275 states have (on average 1.5709090909090908) internal successors, (432), 279 states have internal predecessors, (432), 24 states have call successors, (24), 7 states have call predecessors, (24), 7 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2025-02-05 16:08:11,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-02-05 16:08:11,703 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:08:11,704 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:08:11,704 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:08:11,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:08:11,708 INFO L85 PathProgramCache]: Analyzing trace with hash -1394478799, now seen corresponding path program 1 times [2025-02-05 16:08:11,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:08:11,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684639419] [2025-02-05 16:08:11,714 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:08:11,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:08:11,776 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-02-05 16:08:11,800 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-02-05 16:08:11,800 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:08:11,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:08:12,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:08:12,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:08:12,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684639419] [2025-02-05 16:08:12,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684639419] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:08:12,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:08:12,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 16:08:12,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696724239] [2025-02-05 16:08:12,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:08:12,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:08:12,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:08:12,183 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:08:12,184 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:08:12,186 INFO L87 Difference]: Start difference. First operand has 308 states, 275 states have (on average 1.5709090909090908) internal successors, (432), 279 states have internal predecessors, (432), 24 states have call successors, (24), 7 states have call predecessors, (24), 7 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 5 states, 5 states have (on average 24.6) internal successors, (123), 4 states have internal predecessors, (123), 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-02-05 16:08:12,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:08:12,680 INFO L93 Difference]: Finished difference Result 920 states and 1450 transitions. [2025-02-05 16:08:12,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 16:08:12,682 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.6) internal successors, (123), 4 states have internal predecessors, (123), 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 134 [2025-02-05 16:08:12,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:08:12,690 INFO L225 Difference]: With dead ends: 920 [2025-02-05 16:08:12,691 INFO L226 Difference]: Without dead ends: 620 [2025-02-05 16:08:12,694 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-02-05 16:08:12,695 INFO L435 NwaCegarLoop]: 371 mSDtfsCounter, 848 mSDsluCounter, 947 mSDsCounter, 0 mSdLazyCounter, 473 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 864 SdHoareTripleChecker+Valid, 1318 SdHoareTripleChecker+Invalid, 525 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 473 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 16:08:12,696 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [864 Valid, 1318 Invalid, 525 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 473 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 16:08:12,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2025-02-05 16:08:12,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 597. [2025-02-05 16:08:12,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 597 states, 542 states have (on average 1.540590405904059) internal successors, (835), 545 states have internal predecessors, (835), 41 states have call successors, (41), 13 states have call predecessors, (41), 13 states have return successors, (40), 39 states have call predecessors, (40), 39 states have call successors, (40) [2025-02-05 16:08:12,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 916 transitions. [2025-02-05 16:08:12,747 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 916 transitions. Word has length 134 [2025-02-05 16:08:12,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:08:12,747 INFO L471 AbstractCegarLoop]: Abstraction has 597 states and 916 transitions. [2025-02-05 16:08:12,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.6) internal successors, (123), 4 states have internal predecessors, (123), 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-02-05 16:08:12,747 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 916 transitions. [2025-02-05 16:08:12,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-02-05 16:08:12,749 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:08:12,749 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:08:12,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 16:08:12,750 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:08:12,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:08:12,754 INFO L85 PathProgramCache]: Analyzing trace with hash -2075480017, now seen corresponding path program 1 times [2025-02-05 16:08:12,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:08:12,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889418858] [2025-02-05 16:08:12,754 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:08:12,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:08:12,770 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-02-05 16:08:12,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-02-05 16:08:12,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:08:12,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:08:12,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:08:12,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:08:12,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889418858] [2025-02-05 16:08:12,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889418858] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:08:12,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:08:12,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:08:12,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109878134] [2025-02-05 16:08:12,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:08:12,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 16:08:12,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:08:12,951 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 16:08:12,951 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:08:12,951 INFO L87 Difference]: Start difference. First operand 597 states and 916 transitions. Second operand has 6 states, 6 states have (on average 20.5) internal successors, (123), 5 states have internal predecessors, (123), 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-02-05 16:08:13,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:08:13,544 INFO L93 Difference]: Finished difference Result 1544 states and 2392 transitions. [2025-02-05 16:08:13,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 16:08:13,545 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.5) internal successors, (123), 5 states have internal predecessors, (123), 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 134 [2025-02-05 16:08:13,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:08:13,550 INFO L225 Difference]: With dead ends: 1544 [2025-02-05 16:08:13,550 INFO L226 Difference]: Without dead ends: 963 [2025-02-05 16:08:13,552 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-02-05 16:08:13,553 INFO L435 NwaCegarLoop]: 613 mSDtfsCounter, 842 mSDsluCounter, 1878 mSDsCounter, 0 mSdLazyCounter, 833 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 858 SdHoareTripleChecker+Valid, 2491 SdHoareTripleChecker+Invalid, 863 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 833 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 16:08:13,553 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [858 Valid, 2491 Invalid, 863 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 833 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 16:08:13,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 963 states. [2025-02-05 16:08:13,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 963 to 872. [2025-02-05 16:08:13,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 872 states, 793 states have (on average 1.532156368221942) internal successors, (1215), 797 states have internal predecessors, (1215), 58 states have call successors, (58), 19 states have call predecessors, (58), 20 states have return successors, (60), 57 states have call predecessors, (60), 56 states have call successors, (60) [2025-02-05 16:08:13,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 1333 transitions. [2025-02-05 16:08:13,594 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 1333 transitions. Word has length 134 [2025-02-05 16:08:13,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:08:13,594 INFO L471 AbstractCegarLoop]: Abstraction has 872 states and 1333 transitions. [2025-02-05 16:08:13,594 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.5) internal successors, (123), 5 states have internal predecessors, (123), 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-02-05 16:08:13,594 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1333 transitions. [2025-02-05 16:08:13,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-02-05 16:08:13,596 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:08:13,596 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:08:13,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 16:08:13,597 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:08:13,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:08:13,597 INFO L85 PathProgramCache]: Analyzing trace with hash 1072946766, now seen corresponding path program 1 times [2025-02-05 16:08:13,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:08:13,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444472138] [2025-02-05 16:08:13,597 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:08:13,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:08:13,609 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-02-05 16:08:13,614 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-02-05 16:08:13,614 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:08:13,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:08:13,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:08:13,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:08:13,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444472138] [2025-02-05 16:08:13,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444472138] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:08:13,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:08:13,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:08:13,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304958208] [2025-02-05 16:08:13,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:08:13,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 16:08:13,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:08:13,763 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 16:08:13,763 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:08:13,763 INFO L87 Difference]: Start difference. First operand 872 states and 1333 transitions. Second operand has 6 states, 6 states have (on average 20.5) internal successors, (123), 5 states have internal predecessors, (123), 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-02-05 16:08:14,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:08:14,358 INFO L93 Difference]: Finished difference Result 2412 states and 3728 transitions. [2025-02-05 16:08:14,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 16:08:14,358 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.5) internal successors, (123), 5 states have internal predecessors, (123), 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 134 [2025-02-05 16:08:14,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:08:14,364 INFO L225 Difference]: With dead ends: 2412 [2025-02-05 16:08:14,364 INFO L226 Difference]: Without dead ends: 1556 [2025-02-05 16:08:14,366 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-02-05 16:08:14,366 INFO L435 NwaCegarLoop]: 609 mSDtfsCounter, 837 mSDsluCounter, 1866 mSDsCounter, 0 mSdLazyCounter, 833 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 853 SdHoareTripleChecker+Valid, 2475 SdHoareTripleChecker+Invalid, 863 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 833 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 16:08:14,366 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [853 Valid, 2475 Invalid, 863 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 833 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 16:08:14,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1556 states. [2025-02-05 16:08:14,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1556 to 1453. [2025-02-05 16:08:14,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1453 states, 1324 states have (on average 1.5332326283987916) internal successors, (2030), 1332 states have internal predecessors, (2030), 92 states have call successors, (92), 31 states have call predecessors, (92), 36 states have return successors, (106), 93 states have call predecessors, (106), 90 states have call successors, (106) [2025-02-05 16:08:14,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1453 states to 1453 states and 2228 transitions. [2025-02-05 16:08:14,417 INFO L78 Accepts]: Start accepts. Automaton has 1453 states and 2228 transitions. Word has length 134 [2025-02-05 16:08:14,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:08:14,417 INFO L471 AbstractCegarLoop]: Abstraction has 1453 states and 2228 transitions. [2025-02-05 16:08:14,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.5) internal successors, (123), 5 states have internal predecessors, (123), 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-02-05 16:08:14,417 INFO L276 IsEmpty]: Start isEmpty. Operand 1453 states and 2228 transitions. [2025-02-05 16:08:14,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-02-05 16:08:14,419 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:08:14,419 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:08:14,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 16:08:14,419 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:08:14,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:08:14,420 INFO L85 PathProgramCache]: Analyzing trace with hash -210964401, now seen corresponding path program 1 times [2025-02-05 16:08:14,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:08:14,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103449417] [2025-02-05 16:08:14,420 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:08:14,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:08:14,429 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-02-05 16:08:14,431 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-02-05 16:08:14,432 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:08:14,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:08:14,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:08:14,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:08:14,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103449417] [2025-02-05 16:08:14,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103449417] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:08:14,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:08:14,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:08:14,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012479639] [2025-02-05 16:08:14,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:08:14,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 16:08:14,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:08:14,538 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 16:08:14,538 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:08:14,539 INFO L87 Difference]: Start difference. First operand 1453 states and 2228 transitions. Second operand has 6 states, 6 states have (on average 20.5) internal successors, (123), 5 states have internal predecessors, (123), 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-02-05 16:08:15,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:08:15,092 INFO L93 Difference]: Finished difference Result 4267 states and 6641 transitions. [2025-02-05 16:08:15,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 16:08:15,093 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.5) internal successors, (123), 5 states have internal predecessors, (123), 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 134 [2025-02-05 16:08:15,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:08:15,104 INFO L225 Difference]: With dead ends: 4267 [2025-02-05 16:08:15,104 INFO L226 Difference]: Without dead ends: 2830 [2025-02-05 16:08:15,107 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-02-05 16:08:15,108 INFO L435 NwaCegarLoop]: 385 mSDtfsCounter, 859 mSDsluCounter, 1323 mSDsCounter, 0 mSdLazyCounter, 677 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 875 SdHoareTripleChecker+Valid, 1708 SdHoareTripleChecker+Invalid, 727 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 677 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 16:08:15,108 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [875 Valid, 1708 Invalid, 727 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 677 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 16:08:15,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2830 states. [2025-02-05 16:08:15,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2830 to 2702. [2025-02-05 16:08:15,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2702 states, 2467 states have (on average 1.5460072963113092) internal successors, (3814), 2489 states have internal predecessors, (3814), 160 states have call successors, (160), 55 states have call predecessors, (160), 74 states have return successors, (222), 165 states have call predecessors, (222), 158 states have call successors, (222) [2025-02-05 16:08:15,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2702 states to 2702 states and 4196 transitions. [2025-02-05 16:08:15,224 INFO L78 Accepts]: Start accepts. Automaton has 2702 states and 4196 transitions. Word has length 134 [2025-02-05 16:08:15,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:08:15,224 INFO L471 AbstractCegarLoop]: Abstraction has 2702 states and 4196 transitions. [2025-02-05 16:08:15,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.5) internal successors, (123), 5 states have internal predecessors, (123), 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-02-05 16:08:15,224 INFO L276 IsEmpty]: Start isEmpty. Operand 2702 states and 4196 transitions. [2025-02-05 16:08:15,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-02-05 16:08:15,226 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:08:15,226 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:08:15,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 16:08:15,226 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:08:15,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:08:15,227 INFO L85 PathProgramCache]: Analyzing trace with hash 24713774, now seen corresponding path program 1 times [2025-02-05 16:08:15,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:08:15,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480760857] [2025-02-05 16:08:15,227 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:08:15,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:08:15,235 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-02-05 16:08:15,238 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-02-05 16:08:15,238 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:08:15,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:08:15,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:08:15,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:08:15,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480760857] [2025-02-05 16:08:15,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480760857] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:08:15,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:08:15,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:08:15,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746947648] [2025-02-05 16:08:15,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:08:15,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 16:08:15,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:08:15,329 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 16:08:15,329 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:08:15,330 INFO L87 Difference]: Start difference. First operand 2702 states and 4196 transitions. Second operand has 6 states, 6 states have (on average 20.5) internal successors, (123), 5 states have internal predecessors, (123), 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-02-05 16:08:16,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:08:16,007 INFO L93 Difference]: Finished difference Result 8306 states and 13167 transitions. [2025-02-05 16:08:16,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 16:08:16,008 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.5) internal successors, (123), 5 states have internal predecessors, (123), 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 134 [2025-02-05 16:08:16,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:08:16,029 INFO L225 Difference]: With dead ends: 8306 [2025-02-05 16:08:16,029 INFO L226 Difference]: Without dead ends: 5620 [2025-02-05 16:08:16,034 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-02-05 16:08:16,035 INFO L435 NwaCegarLoop]: 603 mSDtfsCounter, 827 mSDsluCounter, 1848 mSDsCounter, 0 mSdLazyCounter, 833 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 843 SdHoareTripleChecker+Valid, 2451 SdHoareTripleChecker+Invalid, 863 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 833 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 16:08:16,036 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [843 Valid, 2451 Invalid, 863 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 833 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 16:08:16,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5620 states. [2025-02-05 16:08:16,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5620 to 5443. [2025-02-05 16:08:16,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5443 states, 4978 states have (on average 1.568903173965448) internal successors, (7810), 5046 states have internal predecessors, (7810), 296 states have call successors, (296), 103 states have call predecessors, (296), 168 states have return successors, (550), 309 states have call predecessors, (550), 294 states have call successors, (550) [2025-02-05 16:08:16,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5443 states to 5443 states and 8656 transitions. [2025-02-05 16:08:16,234 INFO L78 Accepts]: Start accepts. Automaton has 5443 states and 8656 transitions. Word has length 134 [2025-02-05 16:08:16,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:08:16,234 INFO L471 AbstractCegarLoop]: Abstraction has 5443 states and 8656 transitions. [2025-02-05 16:08:16,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.5) internal successors, (123), 5 states have internal predecessors, (123), 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-02-05 16:08:16,235 INFO L276 IsEmpty]: Start isEmpty. Operand 5443 states and 8656 transitions. [2025-02-05 16:08:16,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-02-05 16:08:16,242 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:08:16,242 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:08:16,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 16:08:16,243 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:08:16,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:08:16,243 INFO L85 PathProgramCache]: Analyzing trace with hash -798967697, now seen corresponding path program 1 times [2025-02-05 16:08:16,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:08:16,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451147299] [2025-02-05 16:08:16,244 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:08:16,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:08:16,257 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-02-05 16:08:16,260 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-02-05 16:08:16,260 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:08:16,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:08:16,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:08:16,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:08:16,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451147299] [2025-02-05 16:08:16,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451147299] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:08:16,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:08:16,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:08:16,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19772991] [2025-02-05 16:08:16,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:08:16,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 16:08:16,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:08:16,370 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 16:08:16,370 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:08:16,370 INFO L87 Difference]: Start difference. First operand 5443 states and 8656 transitions. Second operand has 6 states, 6 states have (on average 20.5) internal successors, (123), 5 states have internal predecessors, (123), 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-02-05 16:08:17,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:08:17,230 INFO L93 Difference]: Finished difference Result 17297 states and 28297 transitions. [2025-02-05 16:08:17,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 16:08:17,231 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.5) internal successors, (123), 5 states have internal predecessors, (123), 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 134 [2025-02-05 16:08:17,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:08:17,279 INFO L225 Difference]: With dead ends: 17297 [2025-02-05 16:08:17,279 INFO L226 Difference]: Without dead ends: 11870 [2025-02-05 16:08:17,293 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-02-05 16:08:17,294 INFO L435 NwaCegarLoop]: 600 mSDtfsCounter, 822 mSDsluCounter, 1839 mSDsCounter, 0 mSdLazyCounter, 833 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 838 SdHoareTripleChecker+Valid, 2439 SdHoareTripleChecker+Invalid, 863 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 833 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 16:08:17,294 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [838 Valid, 2439 Invalid, 863 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 833 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 16:08:17,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11870 states. [2025-02-05 16:08:17,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11870 to 11600. [2025-02-05 16:08:17,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11600 states, 10621 states have (on average 1.5989078241220225) internal successors, (16982), 10835 states have internal predecessors, (16982), 568 states have call successors, (568), 199 states have call predecessors, (568), 410 states have return successors, (1590), 597 states have call predecessors, (1590), 566 states have call successors, (1590) [2025-02-05 16:08:17,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11600 states to 11600 states and 19140 transitions. [2025-02-05 16:08:17,742 INFO L78 Accepts]: Start accepts. Automaton has 11600 states and 19140 transitions. Word has length 134 [2025-02-05 16:08:17,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:08:17,743 INFO L471 AbstractCegarLoop]: Abstraction has 11600 states and 19140 transitions. [2025-02-05 16:08:17,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.5) internal successors, (123), 5 states have internal predecessors, (123), 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-02-05 16:08:17,743 INFO L276 IsEmpty]: Start isEmpty. Operand 11600 states and 19140 transitions. [2025-02-05 16:08:17,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-02-05 16:08:17,749 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:08:17,749 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:08:17,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 16:08:17,750 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:08:17,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:08:17,750 INFO L85 PathProgramCache]: Analyzing trace with hash 282840590, now seen corresponding path program 1 times [2025-02-05 16:08:17,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:08:17,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708098236] [2025-02-05 16:08:17,750 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:08:17,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:08:17,757 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-02-05 16:08:17,759 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-02-05 16:08:17,759 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:08:17,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:08:17,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:08:17,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:08:17,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708098236] [2025-02-05 16:08:17,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708098236] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:08:17,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:08:17,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:08:17,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871993101] [2025-02-05 16:08:17,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:08:17,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 16:08:17,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:08:17,852 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 16:08:17,852 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:08:17,852 INFO L87 Difference]: Start difference. First operand 11600 states and 19140 transitions. Second operand has 6 states, 6 states have (on average 20.5) internal successors, (123), 5 states have internal predecessors, (123), 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-02-05 16:08:18,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:08:18,779 INFO L93 Difference]: Finished difference Result 37804 states and 64855 transitions. [2025-02-05 16:08:18,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 16:08:18,779 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.5) internal successors, (123), 5 states have internal predecessors, (123), 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 134 [2025-02-05 16:08:18,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:08:18,877 INFO L225 Difference]: With dead ends: 37804 [2025-02-05 16:08:18,877 INFO L226 Difference]: Without dead ends: 26220 [2025-02-05 16:08:18,912 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-02-05 16:08:18,912 INFO L435 NwaCegarLoop]: 597 mSDtfsCounter, 817 mSDsluCounter, 1830 mSDsCounter, 0 mSdLazyCounter, 833 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 833 SdHoareTripleChecker+Valid, 2427 SdHoareTripleChecker+Invalid, 863 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 833 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 16:08:18,912 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [833 Valid, 2427 Invalid, 863 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 833 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 16:08:18,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26220 states. [2025-02-05 16:08:19,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26220 to 25777. [2025-02-05 16:08:19,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25777 states, 23608 states have (on average 1.6329210437139952) internal successors, (38550), 24276 states have internal predecessors, (38550), 1112 states have call successors, (1112), 391 states have call predecessors, (1112), 1056 states have return successors, (5206), 1173 states have call predecessors, (5206), 1110 states have call successors, (5206) [2025-02-05 16:08:20,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25777 states to 25777 states and 44868 transitions. [2025-02-05 16:08:20,085 INFO L78 Accepts]: Start accepts. Automaton has 25777 states and 44868 transitions. Word has length 134 [2025-02-05 16:08:20,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:08:20,085 INFO L471 AbstractCegarLoop]: Abstraction has 25777 states and 44868 transitions. [2025-02-05 16:08:20,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.5) internal successors, (123), 5 states have internal predecessors, (123), 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-02-05 16:08:20,086 INFO L276 IsEmpty]: Start isEmpty. Operand 25777 states and 44868 transitions. [2025-02-05 16:08:20,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-02-05 16:08:20,096 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:08:20,097 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:08:20,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 16:08:20,097 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:08:20,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:08:20,098 INFO L85 PathProgramCache]: Analyzing trace with hash -236451697, now seen corresponding path program 1 times [2025-02-05 16:08:20,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:08:20,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309067456] [2025-02-05 16:08:20,098 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:08:20,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:08:20,106 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-02-05 16:08:20,108 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-02-05 16:08:20,108 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:08:20,108 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:08:20,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:08:20,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:08:20,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309067456] [2025-02-05 16:08:20,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309067456] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:08:20,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:08:20,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:08:20,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310046099] [2025-02-05 16:08:20,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:08:20,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 16:08:20,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:08:20,203 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 16:08:20,203 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:08:20,203 INFO L87 Difference]: Start difference. First operand 25777 states and 44868 transitions. Second operand has 6 states, 6 states have (on average 20.5) internal successors, (123), 5 states have internal predecessors, (123), 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-02-05 16:08:21,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:08:21,663 INFO L93 Difference]: Finished difference Result 85755 states and 157533 transitions. [2025-02-05 16:08:21,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 16:08:21,663 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.5) internal successors, (123), 5 states have internal predecessors, (123), 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 134 [2025-02-05 16:08:21,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:08:21,897 INFO L225 Difference]: With dead ends: 85755 [2025-02-05 16:08:21,899 INFO L226 Difference]: Without dead ends: 59994 [2025-02-05 16:08:21,969 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-02-05 16:08:21,970 INFO L435 NwaCegarLoop]: 594 mSDtfsCounter, 812 mSDsluCounter, 1821 mSDsCounter, 0 mSdLazyCounter, 833 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 828 SdHoareTripleChecker+Valid, 2415 SdHoareTripleChecker+Invalid, 863 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 833 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 16:08:21,970 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [828 Valid, 2415 Invalid, 863 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 833 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 16:08:22,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59994 states. [2025-02-05 16:08:23,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59994 to 59234. [2025-02-05 16:08:24,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59234 states, 54199 states have (on average 1.6679643535858595) internal successors, (90402), 56261 states have internal predecessors, (90402), 2200 states have call successors, (2200), 775 states have call predecessors, (2200), 2834 states have return successors, (18582), 2325 states have call predecessors, (18582), 2198 states have call successors, (18582) [2025-02-05 16:08:24,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59234 states to 59234 states and 111184 transitions. [2025-02-05 16:08:24,252 INFO L78 Accepts]: Start accepts. Automaton has 59234 states and 111184 transitions. Word has length 134 [2025-02-05 16:08:24,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:08:24,253 INFO L471 AbstractCegarLoop]: Abstraction has 59234 states and 111184 transitions. [2025-02-05 16:08:24,254 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.5) internal successors, (123), 5 states have internal predecessors, (123), 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-02-05 16:08:24,255 INFO L276 IsEmpty]: Start isEmpty. Operand 59234 states and 111184 transitions. [2025-02-05 16:08:24,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-02-05 16:08:24,271 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:08:24,272 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:08:24,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 16:08:24,272 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:08:24,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:08:24,272 INFO L85 PathProgramCache]: Analyzing trace with hash -1223034386, now seen corresponding path program 1 times [2025-02-05 16:08:24,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:08:24,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111777912] [2025-02-05 16:08:24,273 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:08:24,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:08:24,282 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-02-05 16:08:24,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-02-05 16:08:24,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:08:24,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:08:24,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:08:24,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:08:24,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111777912] [2025-02-05 16:08:24,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111777912] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:08:24,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:08:24,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:08:24,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711043676] [2025-02-05 16:08:24,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:08:24,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 16:08:24,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:08:24,392 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 16:08:24,392 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:08:24,392 INFO L87 Difference]: Start difference. First operand 59234 states and 111184 transitions. Second operand has 6 states, 6 states have (on average 20.5) internal successors, (123), 5 states have internal predecessors, (123), 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-02-05 16:08:28,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:08:28,383 INFO L93 Difference]: Finished difference Result 205016 states and 411328 transitions. [2025-02-05 16:08:28,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 16:08:28,383 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.5) internal successors, (123), 5 states have internal predecessors, (123), 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 134 [2025-02-05 16:08:28,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:08:29,171 INFO L225 Difference]: With dead ends: 205016 [2025-02-05 16:08:29,171 INFO L226 Difference]: Without dead ends: 145798 [2025-02-05 16:08:29,382 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-02-05 16:08:29,383 INFO L435 NwaCegarLoop]: 584 mSDtfsCounter, 1027 mSDsluCounter, 1788 mSDsCounter, 0 mSdLazyCounter, 836 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1052 SdHoareTripleChecker+Valid, 2372 SdHoareTripleChecker+Invalid, 869 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 836 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 16:08:29,383 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1052 Valid, 2372 Invalid, 869 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 836 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 16:08:29,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145798 states. [2025-02-05 16:08:35,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145798 to 136020. [2025-02-05 16:08:35,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136020 states, 123923 states have (on average 1.6970860937840433) internal successors, (210308), 130231 states have internal predecessors, (210308), 4248 states have call successors, (4248), 1543 states have call predecessors, (4248), 7848 states have return successors, (69782), 4501 states have call predecessors, (69782), 4246 states have call successors, (69782) [2025-02-05 16:08:36,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136020 states to 136020 states and 284338 transitions. [2025-02-05 16:08:36,368 INFO L78 Accepts]: Start accepts. Automaton has 136020 states and 284338 transitions. Word has length 134 [2025-02-05 16:08:36,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:08:36,376 INFO L471 AbstractCegarLoop]: Abstraction has 136020 states and 284338 transitions. [2025-02-05 16:08:36,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.5) internal successors, (123), 5 states have internal predecessors, (123), 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-02-05 16:08:36,376 INFO L276 IsEmpty]: Start isEmpty. Operand 136020 states and 284338 transitions. [2025-02-05 16:08:36,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-02-05 16:08:36,482 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:08:36,485 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:08:36,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 16:08:36,486 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:08:36,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:08:36,486 INFO L85 PathProgramCache]: Analyzing trace with hash 612808461, now seen corresponding path program 1 times [2025-02-05 16:08:36,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:08:36,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242882660] [2025-02-05 16:08:36,486 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:08:36,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:08:36,516 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-02-05 16:08:36,523 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-02-05 16:08:36,524 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:08:36,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:08:36,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:08:36,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:08:36,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242882660] [2025-02-05 16:08:36,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242882660] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:08:36,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:08:36,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:08:36,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013275517] [2025-02-05 16:08:36,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:08:36,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 16:08:36,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:08:36,617 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 16:08:36,618 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:08:36,618 INFO L87 Difference]: Start difference. First operand 136020 states and 284338 transitions. Second operand has 6 states, 6 states have (on average 20.5) internal successors, (123), 5 states have internal predecessors, (123), 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)