./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/systemc/token_ring.03.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/systemc/token_ring.03.cil-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 e96a4dadf08c19b3d92d901d7f9116f0323f4fb1660ac2537112df0afe321751 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 05:53:25,831 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 05:53:25,881 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 05:53:25,885 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 05:53:25,885 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 05:53:25,901 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 05:53:25,902 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 05:53:25,902 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 05:53:25,902 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 05:53:25,902 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 05:53:25,903 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 05:53:25,903 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 05:53:25,903 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 05:53:25,903 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 05:53:25,904 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 05:53:25,904 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 05:53:25,904 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 05:53:25,904 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 05:53:25,904 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 05:53:25,904 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 05:53:25,905 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 05:53:25,905 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 05:53:25,905 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 05:53:25,905 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 05:53:25,905 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 05:53:25,905 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 05:53:25,905 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 05:53:25,905 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 05:53:25,905 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 05:53:25,905 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 05:53:25,905 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 05:53:25,906 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 05:53:25,906 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 05:53:25,906 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 05:53:25,906 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 05:53:25,906 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 05:53:25,906 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 05:53:25,907 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 05:53:25,907 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 05:53:25,907 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 05:53:25,907 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 05:53:25,907 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 05:53:25,907 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 05:53:25,907 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/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 -> e96a4dadf08c19b3d92d901d7f9116f0323f4fb1660ac2537112df0afe321751 [2025-03-08 05:53:26,167 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 05:53:26,175 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 05:53:26,178 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 05:53:26,179 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 05:53:26,179 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 05:53:26,180 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/token_ring.03.cil-1.c [2025-03-08 05:53:27,407 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c6464a630/7d7c04a0a8a94264858ea44ca760cf39/FLAGd3a44884a [2025-03-08 05:53:27,645 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 05:53:27,646 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/token_ring.03.cil-1.c [2025-03-08 05:53:27,658 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c6464a630/7d7c04a0a8a94264858ea44ca760cf39/FLAGd3a44884a [2025-03-08 05:53:27,674 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c6464a630/7d7c04a0a8a94264858ea44ca760cf39 [2025-03-08 05:53:27,676 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 05:53:27,678 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 05:53:27,679 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 05:53:27,679 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 05:53:27,682 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 05:53:27,683 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:53:27" (1/1) ... [2025-03-08 05:53:27,683 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@186025c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:53:27, skipping insertion in model container [2025-03-08 05:53:27,683 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:53:27" (1/1) ... [2025-03-08 05:53:27,705 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 05:53:27,831 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/token_ring.03.cil-1.c[671,684] [2025-03-08 05:53:27,913 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 05:53:27,929 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 05:53:27,937 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/token_ring.03.cil-1.c[671,684] [2025-03-08 05:53:27,968 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 05:53:27,981 INFO L204 MainTranslator]: Completed translation [2025-03-08 05:53:27,981 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:53:27 WrapperNode [2025-03-08 05:53:27,981 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 05:53:27,982 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 05:53:27,982 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 05:53:27,982 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 05:53:27,987 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:53:27" (1/1) ... [2025-03-08 05:53:27,993 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:53:27" (1/1) ... [2025-03-08 05:53:28,015 INFO L138 Inliner]: procedures = 34, calls = 41, calls flagged for inlining = 17, calls inlined = 17, statements flattened = 327 [2025-03-08 05:53:28,015 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 05:53:28,018 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 05:53:28,018 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 05:53:28,018 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 05:53:28,025 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:53:27" (1/1) ... [2025-03-08 05:53:28,025 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:53:27" (1/1) ... [2025-03-08 05:53:28,031 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:53:27" (1/1) ... [2025-03-08 05:53:28,051 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-03-08 05:53:28,051 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:53:27" (1/1) ... [2025-03-08 05:53:28,051 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:53:27" (1/1) ... [2025-03-08 05:53:28,056 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:53:27" (1/1) ... [2025-03-08 05:53:28,060 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:53:27" (1/1) ... [2025-03-08 05:53:28,065 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:53:27" (1/1) ... [2025-03-08 05:53:28,065 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:53:27" (1/1) ... [2025-03-08 05:53:28,067 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 05:53:28,068 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 05:53:28,071 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 05:53:28,072 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 05:53:28,072 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:53:27" (1/1) ... [2025-03-08 05:53:28,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 05:53:28,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:53:28,097 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 05:53:28,106 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 05:53:28,120 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 05:53:28,120 INFO L130 BoogieDeclarations]: Found specification of procedure error [2025-03-08 05:53:28,120 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2025-03-08 05:53:28,120 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2025-03-08 05:53:28,120 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2025-03-08 05:53:28,120 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2025-03-08 05:53:28,120 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2025-03-08 05:53:28,120 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-03-08 05:53:28,120 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-03-08 05:53:28,120 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2025-03-08 05:53:28,120 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2025-03-08 05:53:28,120 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2025-03-08 05:53:28,120 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2025-03-08 05:53:28,120 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 05:53:28,120 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2025-03-08 05:53:28,120 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2025-03-08 05:53:28,120 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 05:53:28,120 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 05:53:28,177 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 05:53:28,179 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 05:53:28,537 INFO L? ?]: Removed 47 outVars from TransFormulas that were not future-live. [2025-03-08 05:53:28,537 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 05:53:28,550 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 05:53:28,552 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 05:53:28,552 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:53:28 BoogieIcfgContainer [2025-03-08 05:53:28,553 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 05:53:28,554 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 05:53:28,555 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 05:53:28,559 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 05:53:28,559 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 05:53:27" (1/3) ... [2025-03-08 05:53:28,560 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@548e30c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:53:28, skipping insertion in model container [2025-03-08 05:53:28,560 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:53:27" (2/3) ... [2025-03-08 05:53:28,560 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@548e30c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:53:28, skipping insertion in model container [2025-03-08 05:53:28,561 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:53:28" (3/3) ... [2025-03-08 05:53:28,562 INFO L128 eAbstractionObserver]: Analyzing ICFG token_ring.03.cil-1.c [2025-03-08 05:53:28,577 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 05:53:28,578 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG token_ring.03.cil-1.c that has 8 procedures, 163 locations, 1 initial locations, 6 loop locations, and 1 error locations. [2025-03-08 05:53:28,619 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 05:53:28,629 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;@71ef3130, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 05:53:28,629 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 05:53:28,632 INFO L276 IsEmpty]: Start isEmpty. Operand has 163 states, 136 states have (on average 1.5588235294117647) internal successors, (212), 139 states have internal predecessors, (212), 19 states have call successors, (19), 7 states have call predecessors, (19), 7 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-08 05:53:28,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-08 05:53:28,641 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:53:28,642 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] [2025-03-08 05:53:28,642 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:53:28,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:53:28,646 INFO L85 PathProgramCache]: Analyzing trace with hash -2119136646, now seen corresponding path program 1 times [2025-03-08 05:53:28,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:53:28,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020693213] [2025-03-08 05:53:28,655 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:53:28,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:53:28,728 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-08 05:53:28,747 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-08 05:53:28,748 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:53:28,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:53:29,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:53:29,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:53:29,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020693213] [2025-03-08 05:53:29,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020693213] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:53:29,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:53:29,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:53:29,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139487549] [2025-03-08 05:53:29,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:53:29,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:53:29,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:53:29,050 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:53:29,051 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:53:29,053 INFO L87 Difference]: Start difference. First operand has 163 states, 136 states have (on average 1.5588235294117647) internal successors, (212), 139 states have internal predecessors, (212), 19 states have call successors, (19), 7 states have call predecessors, (19), 7 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 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-03-08 05:53:29,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:53:29,403 INFO L93 Difference]: Finished difference Result 475 states and 740 transitions. [2025-03-08 05:53:29,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 05:53:29,406 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 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 77 [2025-03-08 05:53:29,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:53:29,415 INFO L225 Difference]: With dead ends: 475 [2025-03-08 05:53:29,415 INFO L226 Difference]: Without dead ends: 315 [2025-03-08 05:53:29,418 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-03-08 05:53:29,423 INFO L435 NwaCegarLoop]: 191 mSDtfsCounter, 403 mSDsluCounter, 467 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 414 SdHoareTripleChecker+Valid, 658 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 05:53:29,426 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [414 Valid, 658 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 05:53:29,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2025-03-08 05:53:29,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 302. [2025-03-08 05:53:29,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 257 states have (on average 1.5369649805447472) internal successors, (395), 260 states have internal predecessors, (395), 31 states have call successors, (31), 13 states have call predecessors, (31), 13 states have return successors, (30), 29 states have call predecessors, (30), 29 states have call successors, (30) [2025-03-08 05:53:29,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 456 transitions. [2025-03-08 05:53:29,478 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 456 transitions. Word has length 77 [2025-03-08 05:53:29,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:53:29,478 INFO L471 AbstractCegarLoop]: Abstraction has 302 states and 456 transitions. [2025-03-08 05:53:29,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 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-03-08 05:53:29,479 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 456 transitions. [2025-03-08 05:53:29,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-08 05:53:29,481 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:53:29,481 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] [2025-03-08 05:53:29,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 05:53:29,482 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:53:29,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:53:29,482 INFO L85 PathProgramCache]: Analyzing trace with hash 32170360, now seen corresponding path program 1 times [2025-03-08 05:53:29,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:53:29,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993952838] [2025-03-08 05:53:29,482 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:53:29,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:53:29,494 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-08 05:53:29,498 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-08 05:53:29,498 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:53:29,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:53:29,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:53:29,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:53:29,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993952838] [2025-03-08 05:53:29,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993952838] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:53:29,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:53:29,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:53:29,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963045841] [2025-03-08 05:53:29,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:53:29,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:53:29,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:53:29,665 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:53:29,665 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:53:29,665 INFO L87 Difference]: Start difference. First operand 302 states and 456 transitions. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 5 states have internal predecessors, (66), 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-03-08 05:53:30,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:53:30,088 INFO L93 Difference]: Finished difference Result 774 states and 1177 transitions. [2025-03-08 05:53:30,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 05:53:30,088 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 5 states have internal predecessors, (66), 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 77 [2025-03-08 05:53:30,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:53:30,091 INFO L225 Difference]: With dead ends: 774 [2025-03-08 05:53:30,091 INFO L226 Difference]: Without dead ends: 483 [2025-03-08 05:53:30,093 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-03-08 05:53:30,094 INFO L435 NwaCegarLoop]: 302 mSDtfsCounter, 390 mSDsluCounter, 878 mSDsCounter, 0 mSdLazyCounter, 503 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 401 SdHoareTripleChecker+Valid, 1180 SdHoareTripleChecker+Invalid, 528 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 503 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 05:53:30,094 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [401 Valid, 1180 Invalid, 528 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 503 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 05:53:30,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2025-03-08 05:53:30,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 438. [2025-03-08 05:53:30,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 438 states, 374 states have (on average 1.5294117647058822) internal successors, (572), 378 states have internal predecessors, (572), 43 states have call successors, (43), 19 states have call predecessors, (43), 20 states have return successors, (45), 42 states have call predecessors, (45), 41 states have call successors, (45) [2025-03-08 05:53:30,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 660 transitions. [2025-03-08 05:53:30,122 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 660 transitions. Word has length 77 [2025-03-08 05:53:30,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:53:30,122 INFO L471 AbstractCegarLoop]: Abstraction has 438 states and 660 transitions. [2025-03-08 05:53:30,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 5 states have internal predecessors, (66), 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-03-08 05:53:30,122 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 660 transitions. [2025-03-08 05:53:30,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-08 05:53:30,124 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:53:30,124 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] [2025-03-08 05:53:30,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 05:53:30,124 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:53:30,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:53:30,125 INFO L85 PathProgramCache]: Analyzing trace with hash -176527943, now seen corresponding path program 1 times [2025-03-08 05:53:30,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:53:30,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286613392] [2025-03-08 05:53:30,125 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:53:30,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:53:30,133 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-08 05:53:30,136 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-08 05:53:30,136 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:53:30,136 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:53:30,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:53:30,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:53:30,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286613392] [2025-03-08 05:53:30,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286613392] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:53:30,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:53:30,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:53:30,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525174722] [2025-03-08 05:53:30,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:53:30,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:53:30,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:53:30,265 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:53:30,265 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:53:30,265 INFO L87 Difference]: Start difference. First operand 438 states and 660 transitions. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 5 states have internal predecessors, (66), 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-03-08 05:53:30,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:53:30,641 INFO L93 Difference]: Finished difference Result 1198 states and 1820 transitions. [2025-03-08 05:53:30,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 05:53:30,645 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 5 states have internal predecessors, (66), 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 77 [2025-03-08 05:53:30,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:53:30,649 INFO L225 Difference]: With dead ends: 1198 [2025-03-08 05:53:30,649 INFO L226 Difference]: Without dead ends: 771 [2025-03-08 05:53:30,651 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-03-08 05:53:30,651 INFO L435 NwaCegarLoop]: 298 mSDtfsCounter, 385 mSDsluCounter, 866 mSDsCounter, 0 mSdLazyCounter, 503 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 396 SdHoareTripleChecker+Valid, 1164 SdHoareTripleChecker+Invalid, 528 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 503 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 05:53:30,651 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [396 Valid, 1164 Invalid, 528 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 503 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 05:53:30,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 771 states. [2025-03-08 05:53:30,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 771 to 723. [2025-03-08 05:53:30,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 723 states, 619 states have (on average 1.5266558966074313) internal successors, (945), 627 states have internal predecessors, (945), 67 states have call successors, (67), 31 states have call predecessors, (67), 36 states have return successors, (81), 68 states have call predecessors, (81), 65 states have call successors, (81) [2025-03-08 05:53:30,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 723 states to 723 states and 1093 transitions. [2025-03-08 05:53:30,702 INFO L78 Accepts]: Start accepts. Automaton has 723 states and 1093 transitions. Word has length 77 [2025-03-08 05:53:30,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:53:30,702 INFO L471 AbstractCegarLoop]: Abstraction has 723 states and 1093 transitions. [2025-03-08 05:53:30,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 5 states have internal predecessors, (66), 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-03-08 05:53:30,702 INFO L276 IsEmpty]: Start isEmpty. Operand 723 states and 1093 transitions. [2025-03-08 05:53:30,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-08 05:53:30,705 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:53:30,706 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] [2025-03-08 05:53:30,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 05:53:30,706 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:53:30,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:53:30,706 INFO L85 PathProgramCache]: Analyzing trace with hash -1984375464, now seen corresponding path program 1 times [2025-03-08 05:53:30,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:53:30,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415142965] [2025-03-08 05:53:30,707 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:53:30,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:53:30,717 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-08 05:53:30,721 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-08 05:53:30,721 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:53:30,721 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:53:30,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:53:30,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:53:30,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415142965] [2025-03-08 05:53:30,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415142965] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:53:30,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:53:30,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:53:30,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52941970] [2025-03-08 05:53:30,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:53:30,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:53:30,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:53:30,836 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:53:30,836 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:53:30,836 INFO L87 Difference]: Start difference. First operand 723 states and 1093 transitions. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 5 states have internal predecessors, (66), 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-03-08 05:53:31,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:53:31,233 INFO L93 Difference]: Finished difference Result 2093 states and 3203 transitions. [2025-03-08 05:53:31,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 05:53:31,234 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 5 states have internal predecessors, (66), 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 77 [2025-03-08 05:53:31,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:53:31,240 INFO L225 Difference]: With dead ends: 2093 [2025-03-08 05:53:31,240 INFO L226 Difference]: Without dead ends: 1381 [2025-03-08 05:53:31,243 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-03-08 05:53:31,243 INFO L435 NwaCegarLoop]: 295 mSDtfsCounter, 380 mSDsluCounter, 857 mSDsCounter, 0 mSdLazyCounter, 503 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 391 SdHoareTripleChecker+Valid, 1152 SdHoareTripleChecker+Invalid, 528 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 503 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 05:53:31,244 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [391 Valid, 1152 Invalid, 528 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 503 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 05:53:31,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1381 states. [2025-03-08 05:53:31,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1381 to 1326. [2025-03-08 05:53:31,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1326 states, 1136 states have (on average 1.529049295774648) internal successors, (1737), 1158 states have internal predecessors, (1737), 115 states have call successors, (115), 55 states have call predecessors, (115), 74 states have return successors, (177), 120 states have call predecessors, (177), 113 states have call successors, (177) [2025-03-08 05:53:31,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1326 states to 1326 states and 2029 transitions. [2025-03-08 05:53:31,334 INFO L78 Accepts]: Start accepts. Automaton has 1326 states and 2029 transitions. Word has length 77 [2025-03-08 05:53:31,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:53:31,335 INFO L471 AbstractCegarLoop]: Abstraction has 1326 states and 2029 transitions. [2025-03-08 05:53:31,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 5 states have internal predecessors, (66), 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-03-08 05:53:31,335 INFO L276 IsEmpty]: Start isEmpty. Operand 1326 states and 2029 transitions. [2025-03-08 05:53:31,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-08 05:53:31,337 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:53:31,338 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] [2025-03-08 05:53:31,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 05:53:31,338 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:53:31,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:53:31,339 INFO L85 PathProgramCache]: Analyzing trace with hash 1143895513, now seen corresponding path program 1 times [2025-03-08 05:53:31,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:53:31,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921727712] [2025-03-08 05:53:31,339 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:53:31,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:53:31,346 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-08 05:53:31,350 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-08 05:53:31,350 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:53:31,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:53:31,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:53:31,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:53:31,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921727712] [2025-03-08 05:53:31,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921727712] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:53:31,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:53:31,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:53:31,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139384030] [2025-03-08 05:53:31,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:53:31,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:53:31,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:53:31,439 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:53:31,439 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:53:31,439 INFO L87 Difference]: Start difference. First operand 1326 states and 2029 transitions. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 5 states have internal predecessors, (66), 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-03-08 05:53:31,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:53:31,901 INFO L93 Difference]: Finished difference Result 4204 states and 6542 transitions. [2025-03-08 05:53:31,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 05:53:31,901 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 5 states have internal predecessors, (66), 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 77 [2025-03-08 05:53:31,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:53:31,916 INFO L225 Difference]: With dead ends: 4204 [2025-03-08 05:53:31,916 INFO L226 Difference]: Without dead ends: 2889 [2025-03-08 05:53:31,921 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-03-08 05:53:31,922 INFO L435 NwaCegarLoop]: 290 mSDtfsCounter, 479 mSDsluCounter, 837 mSDsCounter, 0 mSdLazyCounter, 506 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 494 SdHoareTripleChecker+Valid, 1127 SdHoareTripleChecker+Invalid, 534 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 506 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 05:53:31,922 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [494 Valid, 1127 Invalid, 534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 506 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 05:53:31,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2889 states. [2025-03-08 05:53:32,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2889 to 2589. [2025-03-08 05:53:32,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2589 states, 2217 states have (on average 1.53766350924673) internal successors, (3409), 2285 states have internal predecessors, (3409), 203 states have call successors, (203), 103 states have call predecessors, (203), 168 states have return successors, (457), 216 states have call predecessors, (457), 201 states have call successors, (457) [2025-03-08 05:53:32,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2589 states to 2589 states and 4069 transitions. [2025-03-08 05:53:32,066 INFO L78 Accepts]: Start accepts. Automaton has 2589 states and 4069 transitions. Word has length 77 [2025-03-08 05:53:32,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:53:32,066 INFO L471 AbstractCegarLoop]: Abstraction has 2589 states and 4069 transitions. [2025-03-08 05:53:32,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 5 states have internal predecessors, (66), 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-03-08 05:53:32,066 INFO L276 IsEmpty]: Start isEmpty. Operand 2589 states and 4069 transitions. [2025-03-08 05:53:32,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-08 05:53:32,069 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:53:32,069 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] [2025-03-08 05:53:32,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 05:53:32,069 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:53:32,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:53:32,070 INFO L85 PathProgramCache]: Analyzing trace with hash 1244807480, now seen corresponding path program 1 times [2025-03-08 05:53:32,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:53:32,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817718320] [2025-03-08 05:53:32,070 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:53:32,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:53:32,077 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-08 05:53:32,081 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-08 05:53:32,081 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:53:32,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:53:32,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:53:32,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:53:32,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817718320] [2025-03-08 05:53:32,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817718320] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:53:32,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:53:32,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:53:32,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685244819] [2025-03-08 05:53:32,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:53:32,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:53:32,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:53:32,171 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:53:32,171 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:53:32,171 INFO L87 Difference]: Start difference. First operand 2589 states and 4069 transitions. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 5 states have internal predecessors, (66), 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-03-08 05:53:32,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:53:32,708 INFO L93 Difference]: Finished difference Result 8283 states and 13416 transitions. [2025-03-08 05:53:32,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 05:53:32,708 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 5 states have internal predecessors, (66), 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 77 [2025-03-08 05:53:32,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:53:32,739 INFO L225 Difference]: With dead ends: 8283 [2025-03-08 05:53:32,740 INFO L226 Difference]: Without dead ends: 5705 [2025-03-08 05:53:32,748 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-03-08 05:53:32,750 INFO L435 NwaCegarLoop]: 286 mSDtfsCounter, 443 mSDsluCounter, 825 mSDsCounter, 0 mSdLazyCounter, 506 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 458 SdHoareTripleChecker+Valid, 1111 SdHoareTripleChecker+Invalid, 534 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 506 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 05:53:32,750 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [458 Valid, 1111 Invalid, 534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 506 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 05:53:32,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5705 states. [2025-03-08 05:53:33,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5705 to 5136. [2025-03-08 05:53:33,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5136 states, 4354 states have (on average 1.5326136885622417) internal successors, (6673), 4568 states have internal predecessors, (6673), 371 states have call successors, (371), 199 states have call predecessors, (371), 410 states have return successors, (1393), 400 states have call predecessors, (1393), 369 states have call successors, (1393) [2025-03-08 05:53:33,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5136 states to 5136 states and 8437 transitions. [2025-03-08 05:53:33,080 INFO L78 Accepts]: Start accepts. Automaton has 5136 states and 8437 transitions. Word has length 77 [2025-03-08 05:53:33,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:53:33,081 INFO L471 AbstractCegarLoop]: Abstraction has 5136 states and 8437 transitions. [2025-03-08 05:53:33,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 5 states have internal predecessors, (66), 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-03-08 05:53:33,081 INFO L276 IsEmpty]: Start isEmpty. Operand 5136 states and 8437 transitions. [2025-03-08 05:53:33,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-08 05:53:33,090 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:53:33,090 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] [2025-03-08 05:53:33,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 05:53:33,090 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:53:33,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:53:33,091 INFO L85 PathProgramCache]: Analyzing trace with hash 1525157369, now seen corresponding path program 1 times [2025-03-08 05:53:33,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:53:33,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238464627] [2025-03-08 05:53:33,091 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:53:33,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:53:33,100 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-08 05:53:33,102 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-08 05:53:33,102 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:53:33,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:53:33,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:53:33,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:53:33,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238464627] [2025-03-08 05:53:33,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238464627] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:53:33,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:53:33,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:53:33,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824944659] [2025-03-08 05:53:33,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:53:33,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:53:33,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:53:33,173 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:53:33,173 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:53:33,174 INFO L87 Difference]: Start difference. First operand 5136 states and 8437 transitions. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 5 states have internal predecessors, (66), 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-03-08 05:53:33,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:53:33,897 INFO L93 Difference]: Finished difference Result 16454 states and 28542 transitions. [2025-03-08 05:53:33,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 05:53:33,898 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 5 states have internal predecessors, (66), 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 77 [2025-03-08 05:53:33,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:53:33,975 INFO L225 Difference]: With dead ends: 16454 [2025-03-08 05:53:33,977 INFO L226 Difference]: Without dead ends: 11329 [2025-03-08 05:53:33,997 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-03-08 05:53:33,998 INFO L435 NwaCegarLoop]: 284 mSDtfsCounter, 409 mSDsluCounter, 819 mSDsCounter, 0 mSdLazyCounter, 506 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 424 SdHoareTripleChecker+Valid, 1103 SdHoareTripleChecker+Invalid, 534 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 506 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 05:53:33,998 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [424 Valid, 1103 Invalid, 534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 506 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 05:53:34,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11329 states. [2025-03-08 05:53:34,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11329 to 10731. [2025-03-08 05:53:34,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10731 states, 8983 states have (on average 1.5305577201380385) internal successors, (13749), 9651 states have internal predecessors, (13749), 691 states have call successors, (691), 391 states have call predecessors, (691), 1056 states have return successors, (4785), 752 states have call predecessors, (4785), 689 states have call successors, (4785) [2025-03-08 05:53:34,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10731 states to 10731 states and 19225 transitions. [2025-03-08 05:53:34,716 INFO L78 Accepts]: Start accepts. Automaton has 10731 states and 19225 transitions. Word has length 77 [2025-03-08 05:53:34,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:53:34,717 INFO L471 AbstractCegarLoop]: Abstraction has 10731 states and 19225 transitions. [2025-03-08 05:53:34,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 5 states have internal predecessors, (66), 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-03-08 05:53:34,717 INFO L276 IsEmpty]: Start isEmpty. Operand 10731 states and 19225 transitions. [2025-03-08 05:53:34,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-08 05:53:34,726 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:53:34,726 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] [2025-03-08 05:53:34,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 05:53:34,727 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:53:34,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:53:34,727 INFO L85 PathProgramCache]: Analyzing trace with hash -405461736, now seen corresponding path program 1 times [2025-03-08 05:53:34,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:53:34,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555694192] [2025-03-08 05:53:34,727 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:53:34,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:53:34,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-08 05:53:34,737 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-08 05:53:34,738 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:53:34,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:53:34,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:53:34,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:53:34,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555694192] [2025-03-08 05:53:34,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555694192] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:53:34,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:53:34,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:53:34,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877818019] [2025-03-08 05:53:34,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:53:34,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:53:34,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:53:34,807 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:53:34,808 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:53:34,808 INFO L87 Difference]: Start difference. First operand 10731 states and 19225 transitions. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 5 states have internal predecessors, (66), 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-03-08 05:53:36,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:53:36,150 INFO L93 Difference]: Finished difference Result 33893 states and 66908 transitions. [2025-03-08 05:53:36,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 05:53:36,151 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 5 states have internal predecessors, (66), 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 77 [2025-03-08 05:53:36,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:53:36,297 INFO L225 Difference]: With dead ends: 33893 [2025-03-08 05:53:36,297 INFO L226 Difference]: Without dead ends: 23173 [2025-03-08 05:53:36,344 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-03-08 05:53:36,345 INFO L435 NwaCegarLoop]: 279 mSDtfsCounter, 374 mSDsluCounter, 812 mSDsCounter, 0 mSdLazyCounter, 499 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 389 SdHoareTripleChecker+Valid, 1091 SdHoareTripleChecker+Invalid, 528 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 499 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 05:53:36,345 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [389 Valid, 1091 Invalid, 528 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 499 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 05:53:36,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23173 states. [2025-03-08 05:53:38,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23173 to 22530. [2025-03-08 05:53:38,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22530 states, 18412 states have (on average 1.5097219204866392) internal successors, (27797), 20474 states have internal predecessors, (27797), 1291 states have call successors, (1291), 767 states have call predecessors, (1291), 2826 states have return successors, (17673), 1416 states have call predecessors, (17673), 1289 states have call successors, (17673) [2025-03-08 05:53:38,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22530 states to 22530 states and 46761 transitions. [2025-03-08 05:53:38,219 INFO L78 Accepts]: Start accepts. Automaton has 22530 states and 46761 transitions. Word has length 77 [2025-03-08 05:53:38,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:53:38,222 INFO L471 AbstractCegarLoop]: Abstraction has 22530 states and 46761 transitions. [2025-03-08 05:53:38,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 5 states have internal predecessors, (66), 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-03-08 05:53:38,223 INFO L276 IsEmpty]: Start isEmpty. Operand 22530 states and 46761 transitions. [2025-03-08 05:53:38,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-08 05:53:38,238 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:53:38,238 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] [2025-03-08 05:53:38,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 05:53:38,238 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:53:38,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:53:38,239 INFO L85 PathProgramCache]: Analyzing trace with hash 224996889, now seen corresponding path program 1 times [2025-03-08 05:53:38,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:53:38,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110555906] [2025-03-08 05:53:38,239 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:53:38,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:53:38,246 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-08 05:53:38,251 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-08 05:53:38,252 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:53:38,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:53:38,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:53:38,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:53:38,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110555906] [2025-03-08 05:53:38,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110555906] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:53:38,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:53:38,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:53:38,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87991292] [2025-03-08 05:53:38,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:53:38,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:53:38,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:53:38,298 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:53:38,298 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:53:38,299 INFO L87 Difference]: Start difference. First operand 22530 states and 46761 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 05:53:39,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:53:39,782 INFO L93 Difference]: Finished difference Result 57264 states and 118394 transitions. [2025-03-08 05:53:39,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 05:53:39,783 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 77 [2025-03-08 05:53:39,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:53:40,059 INFO L225 Difference]: With dead ends: 57264 [2025-03-08 05:53:40,060 INFO L226 Difference]: Without dead ends: 34746 [2025-03-08 05:53:40,118 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:53:40,118 INFO L435 NwaCegarLoop]: 421 mSDtfsCounter, 389 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 389 SdHoareTripleChecker+Valid, 777 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:53:40,118 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [389 Valid, 777 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:53:40,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34746 states. [2025-03-08 05:53:41,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34746 to 32413. [2025-03-08 05:53:41,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32413 states, 26554 states have (on average 1.4905099043458612) internal successors, (39579), 29347 states have internal predecessors, (39579), 1976 states have call successors, (1976), 1157 states have call predecessors, (1976), 3882 states have return successors, (22391), 2036 states have call predecessors, (22391), 1974 states have call successors, (22391) [2025-03-08 05:53:42,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32413 states to 32413 states and 63946 transitions. [2025-03-08 05:53:42,173 INFO L78 Accepts]: Start accepts. Automaton has 32413 states and 63946 transitions. Word has length 77 [2025-03-08 05:53:42,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:53:42,174 INFO L471 AbstractCegarLoop]: Abstraction has 32413 states and 63946 transitions. [2025-03-08 05:53:42,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 05:53:42,174 INFO L276 IsEmpty]: Start isEmpty. Operand 32413 states and 63946 transitions. [2025-03-08 05:53:42,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-08 05:53:42,321 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:53:42,322 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 05:53:42,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 05:53:42,322 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:53:42,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:53:42,322 INFO L85 PathProgramCache]: Analyzing trace with hash 1496211101, now seen corresponding path program 1 times [2025-03-08 05:53:42,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:53:42,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961870372] [2025-03-08 05:53:42,323 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:53:42,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:53:42,333 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-08 05:53:42,339 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-08 05:53:42,340 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:53:42,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:53:42,408 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-08 05:53:42,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:53:42,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961870372] [2025-03-08 05:53:42,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961870372] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:53:42,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [766528435] [2025-03-08 05:53:42,409 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:53:42,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:53:42,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:53:42,411 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:53:42,413 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 05:53:42,463 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-08 05:53:42,508 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-08 05:53:42,509 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:53:42,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:53:42,512 INFO L256 TraceCheckSpWp]: Trace formula consists of 467 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 05:53:42,517 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:53:42,569 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2025-03-08 05:53:42,569 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:53:42,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [766528435] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:53:42,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:53:42,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-03-08 05:53:42,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561548749] [2025-03-08 05:53:42,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:53:42,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:53:42,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:53:42,570 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:53:42,570 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:53:42,570 INFO L87 Difference]: Start difference. First operand 32413 states and 63946 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 2 states have internal predecessors, (83), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-08 05:53:45,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:53:45,377 INFO L93 Difference]: Finished difference Result 96508 states and 191374 transitions. [2025-03-08 05:53:45,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:53:45,377 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 2 states have internal predecessors, (83), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 125 [2025-03-08 05:53:45,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:53:45,708 INFO L225 Difference]: With dead ends: 96508 [2025-03-08 05:53:45,709 INFO L226 Difference]: Without dead ends: 64107 [2025-03-08 05:53:45,801 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:53:45,802 INFO L435 NwaCegarLoop]: 231 mSDtfsCounter, 194 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:53:45,802 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 438 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:53:45,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64107 states. [2025-03-08 05:53:50,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64107 to 63909. [2025-03-08 05:53:50,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63909 states, 52312 states have (on average 1.4867716776265485) internal successors, (77776), 57896 states have internal predecessors, (77776), 3840 states have call successors, (3840), 2305 states have call predecessors, (3840), 7756 states have return successors, (44545), 3835 states have call predecessors, (44545), 3838 states have call successors, (44545) [2025-03-08 05:53:50,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63909 states to 63909 states and 126161 transitions. [2025-03-08 05:53:50,855 INFO L78 Accepts]: Start accepts. Automaton has 63909 states and 126161 transitions. Word has length 125 [2025-03-08 05:53:50,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:53:50,855 INFO L471 AbstractCegarLoop]: Abstraction has 63909 states and 126161 transitions. [2025-03-08 05:53:50,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 2 states have internal predecessors, (83), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-08 05:53:50,856 INFO L276 IsEmpty]: Start isEmpty. Operand 63909 states and 126161 transitions. [2025-03-08 05:53:50,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-08 05:53:50,986 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:53:50,986 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 05:53:50,993 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 05:53:51,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-08 05:53:51,187 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:53:51,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:53:51,188 INFO L85 PathProgramCache]: Analyzing trace with hash 1270659159, now seen corresponding path program 1 times [2025-03-08 05:53:51,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:53:51,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64711079] [2025-03-08 05:53:51,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:53:51,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:53:51,195 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-08 05:53:51,198 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-08 05:53:51,199 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:53:51,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:53:51,253 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-08 05:53:51,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:53:51,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64711079] [2025-03-08 05:53:51,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64711079] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:53:51,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1663461640] [2025-03-08 05:53:51,255 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:53:51,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:53:51,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:53:51,257 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:53:51,258 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 05:53:51,298 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-08 05:53:51,341 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-08 05:53:51,341 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:53:51,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:53:51,343 INFO L256 TraceCheckSpWp]: Trace formula consists of 461 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 05:53:51,348 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:53:51,402 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-08 05:53:51,402 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:53:51,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1663461640] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:53:51,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:53:51,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-03-08 05:53:51,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814627568] [2025-03-08 05:53:51,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:53:51,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:53:51,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:53:51,403 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:53:51,403 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:53:51,403 INFO L87 Difference]: Start difference. First operand 63909 states and 126161 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 2 states have internal predecessors, (89), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-08 05:53:55,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:53:55,853 INFO L93 Difference]: Finished difference Result 190266 states and 377583 transitions. [2025-03-08 05:53:55,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:53:55,854 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 2 states have internal predecessors, (89), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 125 [2025-03-08 05:53:55,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:53:56,782 INFO L225 Difference]: With dead ends: 190266 [2025-03-08 05:53:56,783 INFO L226 Difference]: Without dead ends: 126369 [2025-03-08 05:53:56,928 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:53:56,929 INFO L435 NwaCegarLoop]: 231 mSDtfsCounter, 188 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:53:56,929 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 438 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:53:57,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126369 states.