./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/systemc/kundu2.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/systemc/kundu2.cil.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 87760fc84dfa44e1b5109b35af0fae7e5f68f814afbb1ba90e7b46e4e9e3b4bf --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 16:06:41,075 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 16:06:41,132 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 16:06:41,136 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 16:06:41,136 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 16:06:41,158 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 16:06:41,158 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 16:06:41,158 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 16:06:41,160 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 16:06:41,160 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 16:06:41,161 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 16:06:41,161 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 16:06:41,161 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 16:06:41,161 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 16:06:41,162 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 16:06:41,162 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 16:06:41,162 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 16:06:41,162 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 16:06:41,163 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 16:06:41,163 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 16:06:41,163 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 16:06:41,163 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 16:06:41,163 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 16:06:41,163 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 16:06:41,163 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 16:06:41,163 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 16:06:41,163 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 16:06:41,163 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 16:06:41,164 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 16:06:41,164 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 16:06:41,164 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 16:06:41,165 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 16:06:41,165 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 16:06:41,165 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 16:06:41,165 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 16:06:41,165 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 16:06:41,165 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 16:06:41,165 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 16:06:41,165 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 16:06:41,165 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 16:06:41,166 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 16:06:41,166 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 16:06:41,166 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 16:06:41,166 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 87760fc84dfa44e1b5109b35af0fae7e5f68f814afbb1ba90e7b46e4e9e3b4bf [2025-02-05 16:06:41,419 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 16:06:41,427 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 16:06:41,432 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 16:06:41,433 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 16:06:41,435 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 16:06:41,436 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/kundu2.cil.c [2025-02-05 16:06:42,769 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/63beb4d99/e3bb078792e14d16ae3c30f92d49269c/FLAG7e216e6c7 [2025-02-05 16:06:43,124 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 16:06:43,125 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/systemc/kundu2.cil.c [2025-02-05 16:06:43,137 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/63beb4d99/e3bb078792e14d16ae3c30f92d49269c/FLAG7e216e6c7 [2025-02-05 16:06:43,348 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/63beb4d99/e3bb078792e14d16ae3c30f92d49269c [2025-02-05 16:06:43,350 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 16:06:43,351 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 16:06:43,352 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 16:06:43,352 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 16:06:43,355 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 16:06:43,356 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 04:06:43" (1/1) ... [2025-02-05 16:06:43,357 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63c70731 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:06:43, skipping insertion in model container [2025-02-05 16:06:43,357 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 04:06:43" (1/1) ... [2025-02-05 16:06:43,388 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 16:06:43,515 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/systemc/kundu2.cil.c[636,649] [2025-02-05 16:06:43,590 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 16:06:43,602 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 16:06:43,611 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/systemc/kundu2.cil.c[636,649] [2025-02-05 16:06:43,646 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 16:06:43,668 INFO L204 MainTranslator]: Completed translation [2025-02-05 16:06:43,669 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:06:43 WrapperNode [2025-02-05 16:06:43,669 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 16:06:43,670 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 16:06:43,670 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 16:06:43,670 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 16:06:43,676 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:06:43" (1/1) ... [2025-02-05 16:06:43,685 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:06:43" (1/1) ... [2025-02-05 16:06:43,716 INFO L138 Inliner]: procedures = 34, calls = 40, calls flagged for inlining = 17, calls inlined = 17, statements flattened = 297 [2025-02-05 16:06:43,717 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 16:06:43,717 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 16:06:43,717 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 16:06:43,717 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 16:06:43,726 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:06:43" (1/1) ... [2025-02-05 16:06:43,726 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:06:43" (1/1) ... [2025-02-05 16:06:43,729 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:06:43" (1/1) ... [2025-02-05 16:06:43,746 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-05 16:06:43,746 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:06:43" (1/1) ... [2025-02-05 16:06:43,746 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:06:43" (1/1) ... [2025-02-05 16:06:43,751 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:06:43" (1/1) ... [2025-02-05 16:06:43,752 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:06:43" (1/1) ... [2025-02-05 16:06:43,753 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:06:43" (1/1) ... [2025-02-05 16:06:43,753 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:06:43" (1/1) ... [2025-02-05 16:06:43,755 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 16:06:43,756 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 16:06:43,756 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 16:06:43,756 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 16:06:43,757 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:06:43" (1/1) ... [2025-02-05 16:06:43,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 16:06:43,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:06:43,786 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 16:06:43,790 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 16:06:43,808 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 16:06:43,808 INFO L130 BoogieDeclarations]: Found specification of procedure write_data [2025-02-05 16:06:43,808 INFO L138 BoogieDeclarations]: Found implementation of procedure write_data [2025-02-05 16:06:43,808 INFO L130 BoogieDeclarations]: Found specification of procedure error [2025-02-05 16:06:43,808 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2025-02-05 16:06:43,808 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2025-02-05 16:06:43,808 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2025-02-05 16:06:43,808 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2025-02-05 16:06:43,808 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2025-02-05 16:06:43,808 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2025-02-05 16:06:43,808 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2025-02-05 16:06:43,808 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2025-02-05 16:06:43,808 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2025-02-05 16:06:43,808 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 16:06:43,808 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2025-02-05 16:06:43,809 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2025-02-05 16:06:43,809 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 16:06:43,809 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 16:06:43,873 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 16:06:43,875 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 16:06:44,226 INFO L? ?]: Removed 51 outVars from TransFormulas that were not future-live. [2025-02-05 16:06:44,226 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 16:06:44,242 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 16:06:44,242 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 16:06:44,243 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 04:06:44 BoogieIcfgContainer [2025-02-05 16:06:44,243 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 16:06:44,245 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 16:06:44,245 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 16:06:44,249 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 16:06:44,249 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 04:06:43" (1/3) ... [2025-02-05 16:06:44,250 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69bc4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 04:06:44, skipping insertion in model container [2025-02-05 16:06:44,250 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:06:43" (2/3) ... [2025-02-05 16:06:44,250 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69bc4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 04:06:44, skipping insertion in model container [2025-02-05 16:06:44,251 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 04:06:44" (3/3) ... [2025-02-05 16:06:44,252 INFO L128 eAbstractionObserver]: Analyzing ICFG kundu2.cil.c [2025-02-05 16:06:44,267 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 16:06:44,268 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG kundu2.cil.c that has 8 procedures, 140 locations, 1 initial locations, 5 loop locations, and 1 error locations. [2025-02-05 16:06:44,322 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 16:06:44,334 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;@7cfecbc4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 16:06:44,334 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 16:06:44,344 INFO L276 IsEmpty]: Start isEmpty. Operand has 141 states, 113 states have (on average 1.4424778761061947) internal successors, (163), 118 states have internal predecessors, (163), 18 states have call successors, (18), 7 states have call predecessors, (18), 7 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-02-05 16:06:44,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-02-05 16:06:44,352 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:06:44,352 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] [2025-02-05 16:06:44,352 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:06:44,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:06:44,358 INFO L85 PathProgramCache]: Analyzing trace with hash 840221144, now seen corresponding path program 1 times [2025-02-05 16:06:44,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:06:44,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951877097] [2025-02-05 16:06:44,369 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:06:44,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:06:44,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-02-05 16:06:44,459 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-02-05 16:06:44,459 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:06:44,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:06:44,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:06:44,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:06:44,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951877097] [2025-02-05 16:06:44,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951877097] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:06:44,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:06:44,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:06:44,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350381460] [2025-02-05 16:06:44,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:06:44,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 16:06:44,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:06:44,684 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 16:06:44,685 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 16:06:44,688 INFO L87 Difference]: Start difference. First operand has 141 states, 113 states have (on average 1.4424778761061947) internal successors, (163), 118 states have internal predecessors, (163), 18 states have call successors, (18), 7 states have call predecessors, (18), 7 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 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-02-05 16:06:44,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:06:44,934 INFO L93 Difference]: Finished difference Result 390 states and 562 transitions. [2025-02-05 16:06:44,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 16:06:44,937 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 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 59 [2025-02-05 16:06:44,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:06:44,945 INFO L225 Difference]: With dead ends: 390 [2025-02-05 16:06:44,947 INFO L226 Difference]: Without dead ends: 250 [2025-02-05 16:06:44,953 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-02-05 16:06:44,957 INFO L435 NwaCegarLoop]: 347 mSDtfsCounter, 322 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 322 SdHoareTripleChecker+Valid, 632 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:06:44,960 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [322 Valid, 632 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:06:44,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2025-02-05 16:06:45,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 244. [2025-02-05 16:06:45,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 202 states have (on average 1.396039603960396) internal successors, (282), 206 states have internal predecessors, (282), 29 states have call successors, (29), 13 states have call predecessors, (29), 12 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2025-02-05 16:06:45,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 337 transitions. [2025-02-05 16:06:45,030 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 337 transitions. Word has length 59 [2025-02-05 16:06:45,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:06:45,032 INFO L471 AbstractCegarLoop]: Abstraction has 244 states and 337 transitions. [2025-02-05 16:06:45,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 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-02-05 16:06:45,033 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 337 transitions. [2025-02-05 16:06:45,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-02-05 16:06:45,037 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:06:45,037 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] [2025-02-05 16:06:45,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 16:06:45,037 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:06:45,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:06:45,039 INFO L85 PathProgramCache]: Analyzing trace with hash 143378011, now seen corresponding path program 1 times [2025-02-05 16:06:45,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:06:45,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376211340] [2025-02-05 16:06:45,039 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:06:45,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:06:45,052 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-02-05 16:06:45,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-02-05 16:06:45,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:06:45,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:06:45,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-02-05 16:06:45,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:06:45,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376211340] [2025-02-05 16:06:45,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376211340] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:06:45,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:06:45,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 16:06:45,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668130044] [2025-02-05 16:06:45,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:06:45,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:06:45,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:06:45,173 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:06:45,174 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:06:45,174 INFO L87 Difference]: Start difference. First operand 244 states and 337 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 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-02-05 16:06:45,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:06:45,221 INFO L93 Difference]: Finished difference Result 480 states and 668 transitions. [2025-02-05 16:06:45,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:06:45,223 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 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 59 [2025-02-05 16:06:45,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:06:45,226 INFO L225 Difference]: With dead ends: 480 [2025-02-05 16:06:45,226 INFO L226 Difference]: Without dead ends: 247 [2025-02-05 16:06:45,227 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:06:45,227 INFO L435 NwaCegarLoop]: 182 mSDtfsCounter, 0 mSDsluCounter, 540 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 722 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:06:45,228 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 722 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:06:45,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2025-02-05 16:06:45,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 247. [2025-02-05 16:06:45,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 205 states have (on average 1.3853658536585365) internal successors, (284), 209 states have internal predecessors, (284), 29 states have call successors, (29), 13 states have call predecessors, (29), 12 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2025-02-05 16:06:45,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 339 transitions. [2025-02-05 16:06:45,246 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 339 transitions. Word has length 59 [2025-02-05 16:06:45,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:06:45,247 INFO L471 AbstractCegarLoop]: Abstraction has 247 states and 339 transitions. [2025-02-05 16:06:45,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 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-02-05 16:06:45,247 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 339 transitions. [2025-02-05 16:06:45,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-02-05 16:06:45,248 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:06:45,249 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] [2025-02-05 16:06:45,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 16:06:45,249 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:06:45,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:06:45,250 INFO L85 PathProgramCache]: Analyzing trace with hash -779305572, now seen corresponding path program 1 times [2025-02-05 16:06:45,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:06:45,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380711533] [2025-02-05 16:06:45,251 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:06:45,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:06:45,261 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-02-05 16:06:45,271 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-02-05 16:06:45,271 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:06:45,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:06:45,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:06:45,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:06:45,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380711533] [2025-02-05 16:06:45,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380711533] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:06:45,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:06:45,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 16:06:45,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248268471] [2025-02-05 16:06:45,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:06:45,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:06:45,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:06:45,361 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:06:45,361 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:06:45,361 INFO L87 Difference]: Start difference. First operand 247 states and 339 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 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-02-05 16:06:45,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:06:45,704 INFO L93 Difference]: Finished difference Result 828 states and 1133 transitions. [2025-02-05 16:06:45,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:06:45,704 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 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 59 [2025-02-05 16:06:45,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:06:45,710 INFO L225 Difference]: With dead ends: 828 [2025-02-05 16:06:45,710 INFO L226 Difference]: Without dead ends: 576 [2025-02-05 16:06:45,711 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:06:45,713 INFO L435 NwaCegarLoop]: 411 mSDtfsCounter, 576 mSDsluCounter, 533 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 579 SdHoareTripleChecker+Valid, 944 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 16:06:45,714 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [579 Valid, 944 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 16:06:45,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2025-02-05 16:06:45,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 555. [2025-02-05 16:06:45,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 555 states, 470 states have (on average 1.3872340425531915) internal successors, (652), 475 states have internal predecessors, (652), 56 states have call successors, (56), 28 states have call predecessors, (56), 28 states have return successors, (56), 52 states have call predecessors, (56), 53 states have call successors, (56) [2025-02-05 16:06:45,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 764 transitions. [2025-02-05 16:06:45,770 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 764 transitions. Word has length 59 [2025-02-05 16:06:45,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:06:45,770 INFO L471 AbstractCegarLoop]: Abstraction has 555 states and 764 transitions. [2025-02-05 16:06:45,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 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-02-05 16:06:45,771 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 764 transitions. [2025-02-05 16:06:45,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-02-05 16:06:45,772 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:06:45,772 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] [2025-02-05 16:06:45,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 16:06:45,772 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:06:45,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:06:45,773 INFO L85 PathProgramCache]: Analyzing trace with hash -55173025, now seen corresponding path program 1 times [2025-02-05 16:06:45,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:06:45,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996361170] [2025-02-05 16:06:45,773 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:06:45,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:06:45,788 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-02-05 16:06:45,798 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-02-05 16:06:45,798 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:06:45,798 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:06:45,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:06:45,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:06:45,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996361170] [2025-02-05 16:06:45,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996361170] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:06:45,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:06:45,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 16:06:45,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571806245] [2025-02-05 16:06:45,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:06:45,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:06:45,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:06:45,895 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:06:45,895 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:06:45,895 INFO L87 Difference]: Start difference. First operand 555 states and 764 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 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-02-05 16:06:45,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:06:45,945 INFO L93 Difference]: Finished difference Result 1108 states and 1539 transitions. [2025-02-05 16:06:45,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:06:45,946 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 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 59 [2025-02-05 16:06:45,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:06:45,952 INFO L225 Difference]: With dead ends: 1108 [2025-02-05 16:06:45,952 INFO L226 Difference]: Without dead ends: 564 [2025-02-05 16:06:45,954 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:06:45,955 INFO L435 NwaCegarLoop]: 182 mSDtfsCounter, 0 mSDsluCounter, 540 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 722 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:06:45,956 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 722 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:06:45,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2025-02-05 16:06:45,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 564. [2025-02-05 16:06:45,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 564 states, 479 states have (on average 1.3757828810020878) internal successors, (659), 484 states have internal predecessors, (659), 56 states have call successors, (56), 28 states have call predecessors, (56), 28 states have return successors, (56), 52 states have call predecessors, (56), 53 states have call successors, (56) [2025-02-05 16:06:45,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 564 states and 771 transitions. [2025-02-05 16:06:45,994 INFO L78 Accepts]: Start accepts. Automaton has 564 states and 771 transitions. Word has length 59 [2025-02-05 16:06:45,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:06:45,994 INFO L471 AbstractCegarLoop]: Abstraction has 564 states and 771 transitions. [2025-02-05 16:06:45,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 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-02-05 16:06:45,994 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 771 transitions. [2025-02-05 16:06:45,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-02-05 16:06:46,000 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:06:46,000 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] [2025-02-05 16:06:46,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 16:06:46,000 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:06:46,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:06:46,001 INFO L85 PathProgramCache]: Analyzing trace with hash 2056117344, now seen corresponding path program 1 times [2025-02-05 16:06:46,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:06:46,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212451484] [2025-02-05 16:06:46,001 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:06:46,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:06:46,008 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-02-05 16:06:46,016 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-02-05 16:06:46,017 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:06:46,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:06:46,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:06:46,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:06:46,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212451484] [2025-02-05 16:06:46,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212451484] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:06:46,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:06:46,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 16:06:46,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118012706] [2025-02-05 16:06:46,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:06:46,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:06:46,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:06:46,078 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:06:46,079 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:06:46,079 INFO L87 Difference]: Start difference. First operand 564 states and 771 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 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-02-05 16:06:46,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:06:46,446 INFO L93 Difference]: Finished difference Result 2267 states and 3113 transitions. [2025-02-05 16:06:46,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 16:06:46,447 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 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 59 [2025-02-05 16:06:46,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:06:46,456 INFO L225 Difference]: With dead ends: 2267 [2025-02-05 16:06:46,456 INFO L226 Difference]: Without dead ends: 1654 [2025-02-05 16:06:46,459 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:06:46,460 INFO L435 NwaCegarLoop]: 364 mSDtfsCounter, 695 mSDsluCounter, 482 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 700 SdHoareTripleChecker+Valid, 846 SdHoareTripleChecker+Invalid, 312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 16:06:46,460 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [700 Valid, 846 Invalid, 312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 16:06:46,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1654 states. [2025-02-05 16:06:46,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1654 to 1195. [2025-02-05 16:06:46,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1195 states, 1019 states have (on average 1.3748773307163886) internal successors, (1401), 1025 states have internal predecessors, (1401), 112 states have call successors, (112), 60 states have call predecessors, (112), 63 states have return successors, (121), 110 states have call predecessors, (121), 109 states have call successors, (121) [2025-02-05 16:06:46,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1195 states to 1195 states and 1634 transitions. [2025-02-05 16:06:46,528 INFO L78 Accepts]: Start accepts. Automaton has 1195 states and 1634 transitions. Word has length 59 [2025-02-05 16:06:46,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:06:46,529 INFO L471 AbstractCegarLoop]: Abstraction has 1195 states and 1634 transitions. [2025-02-05 16:06:46,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 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-02-05 16:06:46,529 INFO L276 IsEmpty]: Start isEmpty. Operand 1195 states and 1634 transitions. [2025-02-05 16:06:46,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-02-05 16:06:46,532 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:06:46,532 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] [2025-02-05 16:06:46,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 16:06:46,533 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:06:46,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:06:46,533 INFO L85 PathProgramCache]: Analyzing trace with hash -1138471853, now seen corresponding path program 1 times [2025-02-05 16:06:46,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:06:46,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288968704] [2025-02-05 16:06:46,534 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:06:46,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:06:46,543 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-02-05 16:06:46,550 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-02-05 16:06:46,551 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:06:46,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:06:46,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:06:46,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:06:46,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288968704] [2025-02-05 16:06:46,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288968704] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:06:46,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:06:46,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:06:46,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720093375] [2025-02-05 16:06:46,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:06:46,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 16:06:46,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:06:46,614 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 16:06:46,614 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 16:06:46,615 INFO L87 Difference]: Start difference. First operand 1195 states and 1634 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 16:06:46,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:06:46,876 INFO L93 Difference]: Finished difference Result 3215 states and 4426 transitions. [2025-02-05 16:06:46,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 16:06:46,877 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 61 [2025-02-05 16:06:46,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:06:46,890 INFO L225 Difference]: With dead ends: 3215 [2025-02-05 16:06:46,891 INFO L226 Difference]: Without dead ends: 2031 [2025-02-05 16:06:46,895 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-02-05 16:06:46,896 INFO L435 NwaCegarLoop]: 356 mSDtfsCounter, 289 mSDsluCounter, 436 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 792 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:06:46,897 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [289 Valid, 792 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:06:46,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2031 states. [2025-02-05 16:06:46,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2031 to 1628. [2025-02-05 16:06:46,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1628 states, 1372 states have (on average 1.3330903790087463) internal successors, (1829), 1383 states have internal predecessors, (1829), 165 states have call successors, (165), 88 states have call predecessors, (165), 90 states have return successors, (186), 157 states have call predecessors, (186), 162 states have call successors, (186) [2025-02-05 16:06:47,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1628 states to 1628 states and 2180 transitions. [2025-02-05 16:06:47,012 INFO L78 Accepts]: Start accepts. Automaton has 1628 states and 2180 transitions. Word has length 61 [2025-02-05 16:06:47,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:06:47,013 INFO L471 AbstractCegarLoop]: Abstraction has 1628 states and 2180 transitions. [2025-02-05 16:06:47,014 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 16:06:47,014 INFO L276 IsEmpty]: Start isEmpty. Operand 1628 states and 2180 transitions. [2025-02-05 16:06:47,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-02-05 16:06:47,015 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:06:47,015 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:06:47,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 16:06:47,015 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:06:47,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:06:47,015 INFO L85 PathProgramCache]: Analyzing trace with hash 444791728, now seen corresponding path program 1 times [2025-02-05 16:06:47,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:06:47,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740139891] [2025-02-05 16:06:47,016 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:06:47,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:06:47,045 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-02-05 16:06:47,052 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-02-05 16:06:47,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:06:47,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:06:47,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:06:47,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:06:47,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740139891] [2025-02-05 16:06:47,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740139891] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:06:47,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:06:47,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 16:06:47,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30568027] [2025-02-05 16:06:47,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:06:47,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:06:47,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:06:47,114 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:06:47,114 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:06:47,114 INFO L87 Difference]: Start difference. First operand 1628 states and 2180 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 16:06:47,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:06:47,237 INFO L93 Difference]: Finished difference Result 3275 states and 4447 transitions. [2025-02-05 16:06:47,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:06:47,237 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 61 [2025-02-05 16:06:47,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:06:47,252 INFO L225 Difference]: With dead ends: 3275 [2025-02-05 16:06:47,252 INFO L226 Difference]: Without dead ends: 1658 [2025-02-05 16:06:47,257 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:06:47,258 INFO L435 NwaCegarLoop]: 182 mSDtfsCounter, 0 mSDsluCounter, 539 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 721 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:06:47,258 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 721 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:06:47,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1658 states. [2025-02-05 16:06:47,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1658 to 1658. [2025-02-05 16:06:47,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1658 states, 1402 states have (on average 1.3216833095577747) internal successors, (1853), 1413 states have internal predecessors, (1853), 165 states have call successors, (165), 88 states have call predecessors, (165), 90 states have return successors, (186), 157 states have call predecessors, (186), 162 states have call successors, (186) [2025-02-05 16:06:47,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1658 states to 1658 states and 2204 transitions. [2025-02-05 16:06:47,383 INFO L78 Accepts]: Start accepts. Automaton has 1658 states and 2204 transitions. Word has length 61 [2025-02-05 16:06:47,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:06:47,384 INFO L471 AbstractCegarLoop]: Abstraction has 1658 states and 2204 transitions. [2025-02-05 16:06:47,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 16:06:47,384 INFO L276 IsEmpty]: Start isEmpty. Operand 1658 states and 2204 transitions. [2025-02-05 16:06:47,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-02-05 16:06:47,385 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:06:47,385 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] [2025-02-05 16:06:47,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 16:06:47,386 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:06:47,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:06:47,386 INFO L85 PathProgramCache]: Analyzing trace with hash 190055183, now seen corresponding path program 1 times [2025-02-05 16:06:47,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:06:47,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660636648] [2025-02-05 16:06:47,386 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:06:47,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:06:47,393 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-02-05 16:06:47,399 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-02-05 16:06:47,399 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:06:47,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:06:47,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:06:47,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:06:47,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660636648] [2025-02-05 16:06:47,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660636648] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:06:47,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:06:47,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 16:06:47,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282349444] [2025-02-05 16:06:47,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:06:47,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:06:47,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:06:47,457 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:06:47,457 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:06:47,457 INFO L87 Difference]: Start difference. First operand 1658 states and 2204 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-02-05 16:06:47,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:06:47,675 INFO L93 Difference]: Finished difference Result 4347 states and 5741 transitions. [2025-02-05 16:06:47,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:06:47,676 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 61 [2025-02-05 16:06:47,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:06:47,697 INFO L225 Difference]: With dead ends: 4347 [2025-02-05 16:06:47,700 INFO L226 Difference]: Without dead ends: 2985 [2025-02-05 16:06:47,707 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:06:47,708 INFO L435 NwaCegarLoop]: 190 mSDtfsCounter, 138 mSDsluCounter, 531 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 721 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:06:47,709 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 721 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:06:47,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2985 states. [2025-02-05 16:06:47,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2985 to 2929. [2025-02-05 16:06:47,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2929 states, 2488 states have (on average 1.310289389067524) internal successors, (3260), 2517 states have internal predecessors, (3260), 277 states have call successors, (277), 158 states have call predecessors, (277), 163 states have return successors, (312), 254 states have call predecessors, (312), 274 states have call successors, (312) [2025-02-05 16:06:47,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2929 states to 2929 states and 3849 transitions. [2025-02-05 16:06:47,902 INFO L78 Accepts]: Start accepts. Automaton has 2929 states and 3849 transitions. Word has length 61 [2025-02-05 16:06:47,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:06:47,903 INFO L471 AbstractCegarLoop]: Abstraction has 2929 states and 3849 transitions. [2025-02-05 16:06:47,903 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-02-05 16:06:47,904 INFO L276 IsEmpty]: Start isEmpty. Operand 2929 states and 3849 transitions. [2025-02-05 16:06:47,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-02-05 16:06:47,905 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:06:47,905 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:06:47,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 16:06:47,905 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:06:47,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:06:47,905 INFO L85 PathProgramCache]: Analyzing trace with hash -535368337, now seen corresponding path program 1 times [2025-02-05 16:06:47,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:06:47,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177956520] [2025-02-05 16:06:47,906 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:06:47,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:06:47,915 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-02-05 16:06:47,925 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-02-05 16:06:47,927 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:06:47,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:06:48,035 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:06:48,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:06:48,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177956520] [2025-02-05 16:06:48,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177956520] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:06:48,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:06:48,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:06:48,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759553856] [2025-02-05 16:06:48,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:06:48,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 16:06:48,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:06:48,037 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 16:06:48,037 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:06:48,038 INFO L87 Difference]: Start difference. First operand 2929 states and 3849 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 5 states have internal predecessors, (59), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-02-05 16:06:48,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:06:48,330 INFO L93 Difference]: Finished difference Result 6628 states and 8724 transitions. [2025-02-05 16:06:48,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 16:06:48,331 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 5 states have internal predecessors, (59), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 73 [2025-02-05 16:06:48,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:06:48,375 INFO L225 Difference]: With dead ends: 6628 [2025-02-05 16:06:48,375 INFO L226 Difference]: Without dead ends: 4423 [2025-02-05 16:06:48,380 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-02-05 16:06:48,383 INFO L435 NwaCegarLoop]: 333 mSDtfsCounter, 293 mSDsluCounter, 965 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 1298 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:06:48,384 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [295 Valid, 1298 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:06:48,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4423 states. [2025-02-05 16:06:48,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4423 to 4398. [2025-02-05 16:06:48,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4398 states, 3756 states have (on average 1.301650692225772) internal successors, (4889), 3793 states have internal predecessors, (4889), 401 states have call successors, (401), 231 states have call predecessors, (401), 240 states have return successors, (451), 374 states have call predecessors, (451), 398 states have call successors, (451) [2025-02-05 16:06:48,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4398 states to 4398 states and 5741 transitions. [2025-02-05 16:06:48,577 INFO L78 Accepts]: Start accepts. Automaton has 4398 states and 5741 transitions. Word has length 73 [2025-02-05 16:06:48,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:06:48,578 INFO L471 AbstractCegarLoop]: Abstraction has 4398 states and 5741 transitions. [2025-02-05 16:06:48,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 5 states have internal predecessors, (59), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-02-05 16:06:48,578 INFO L276 IsEmpty]: Start isEmpty. Operand 4398 states and 5741 transitions. [2025-02-05 16:06:48,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-02-05 16:06:48,581 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:06:48,581 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 16:06:48,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 16:06:48,582 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:06:48,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:06:48,582 INFO L85 PathProgramCache]: Analyzing trace with hash -1470148395, now seen corresponding path program 1 times [2025-02-05 16:06:48,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:06:48,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952924400] [2025-02-05 16:06:48,582 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:06:48,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:06:48,589 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-02-05 16:06:48,593 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-02-05 16:06:48,593 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:06:48,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:06:48,647 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-05 16:06:48,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:06:48,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952924400] [2025-02-05 16:06:48,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952924400] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:06:48,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:06:48,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:06:48,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481623657] [2025-02-05 16:06:48,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:06:48,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 16:06:48,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:06:48,649 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 16:06:48,649 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 16:06:48,649 INFO L87 Difference]: Start difference. First operand 4398 states and 5741 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-02-05 16:06:49,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:06:49,091 INFO L93 Difference]: Finished difference Result 13416 states and 17682 transitions. [2025-02-05 16:06:49,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:06:49,091 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 78 [2025-02-05 16:06:49,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:06:49,143 INFO L225 Difference]: With dead ends: 13416 [2025-02-05 16:06:49,143 INFO L226 Difference]: Without dead ends: 9030 [2025-02-05 16:06:49,160 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:06:49,161 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 212 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:06:49,161 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 421 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:06:49,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9030 states. [2025-02-05 16:06:49,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9030 to 9025. [2025-02-05 16:06:49,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9025 states, 7748 states have (on average 1.277103768714507) internal successors, (9895), 7828 states have internal predecessors, (9895), 766 states have call successors, (766), 461 states have call predecessors, (766), 510 states have return successors, (1084), 737 states have call predecessors, (1084), 763 states have call successors, (1084) [2025-02-05 16:06:49,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9025 states to 9025 states and 11745 transitions. [2025-02-05 16:06:49,676 INFO L78 Accepts]: Start accepts. Automaton has 9025 states and 11745 transitions. Word has length 78 [2025-02-05 16:06:49,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:06:49,677 INFO L471 AbstractCegarLoop]: Abstraction has 9025 states and 11745 transitions. [2025-02-05 16:06:49,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-02-05 16:06:49,677 INFO L276 IsEmpty]: Start isEmpty. Operand 9025 states and 11745 transitions. [2025-02-05 16:06:49,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-02-05 16:06:49,679 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:06:49,679 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 16:06:49,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 16:06:49,680 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:06:49,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:06:49,680 INFO L85 PathProgramCache]: Analyzing trace with hash -91531127, now seen corresponding path program 1 times [2025-02-05 16:06:49,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:06:49,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233208305] [2025-02-05 16:06:49,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:06:49,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:06:49,688 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-02-05 16:06:49,694 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-02-05 16:06:49,694 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:06:49,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:06:49,740 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-05 16:06:49,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:06:49,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233208305] [2025-02-05 16:06:49,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233208305] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:06:49,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:06:49,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:06:49,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499783121] [2025-02-05 16:06:49,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:06:49,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 16:06:49,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:06:49,742 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 16:06:49,742 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 16:06:49,742 INFO L87 Difference]: Start difference. First operand 9025 states and 11745 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-02-05 16:06:50,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:06:50,428 INFO L93 Difference]: Finished difference Result 26408 states and 34503 transitions. [2025-02-05 16:06:50,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:06:50,428 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 80 [2025-02-05 16:06:50,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:06:50,520 INFO L225 Difference]: With dead ends: 26408 [2025-02-05 16:06:50,520 INFO L226 Difference]: Without dead ends: 17401 [2025-02-05 16:06:50,551 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:06:50,552 INFO L435 NwaCegarLoop]: 234 mSDtfsCounter, 199 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 524 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:06:50,553 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 524 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:06:50,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17401 states. [2025-02-05 16:06:51,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17401 to 17168. [2025-02-05 16:06:51,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17168 states, 14779 states have (on average 1.2561743013735707) internal successors, (18565), 14949 states have internal predecessors, (18565), 1382 states have call successors, (1382), 841 states have call predecessors, (1382), 1006 states have return successors, (2340), 1381 states have call predecessors, (2340), 1379 states have call successors, (2340) [2025-02-05 16:06:51,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17168 states to 17168 states and 22287 transitions. [2025-02-05 16:06:51,435 INFO L78 Accepts]: Start accepts. Automaton has 17168 states and 22287 transitions. Word has length 80 [2025-02-05 16:06:51,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:06:51,435 INFO L471 AbstractCegarLoop]: Abstraction has 17168 states and 22287 transitions. [2025-02-05 16:06:51,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-02-05 16:06:51,436 INFO L276 IsEmpty]: Start isEmpty. Operand 17168 states and 22287 transitions. [2025-02-05 16:06:51,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-02-05 16:06:51,443 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:06:51,443 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 16:06:51,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 16:06:51,443 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:06:51,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:06:51,444 INFO L85 PathProgramCache]: Analyzing trace with hash 2094402920, now seen corresponding path program 1 times [2025-02-05 16:06:51,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:06:51,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460665976] [2025-02-05 16:06:51,444 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:06:51,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:06:51,452 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-02-05 16:06:51,455 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-02-05 16:06:51,455 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:06:51,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:06:51,478 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-05 16:06:51,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:06:51,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460665976] [2025-02-05 16:06:51,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460665976] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:06:51,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:06:51,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:06:51,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083996659] [2025-02-05 16:06:51,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:06:51,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:06:51,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:06:51,480 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:06:51,480 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:06:51,480 INFO L87 Difference]: Start difference. First operand 17168 states and 22287 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 16:06:52,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:06:52,271 INFO L93 Difference]: Finished difference Result 34308 states and 44526 transitions. [2025-02-05 16:06:52,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:06:52,272 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 80 [2025-02-05 16:06:52,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:06:52,358 INFO L225 Difference]: With dead ends: 34308 [2025-02-05 16:06:52,359 INFO L226 Difference]: Without dead ends: 17158 [2025-02-05 16:06:52,407 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:06:52,408 INFO L435 NwaCegarLoop]: 183 mSDtfsCounter, 178 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:06:52,409 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 183 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:06:52,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17158 states. [2025-02-05 16:06:53,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17158 to 17158. [2025-02-05 16:06:53,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17158 states, 14775 states have (on average 1.2559729272419629) internal successors, (18557), 14943 states have internal predecessors, (18557), 1376 states have call successors, (1376), 841 states have call predecessors, (1376), 1006 states have return successors, (2334), 1375 states have call predecessors, (2334), 1373 states have call successors, (2334) [2025-02-05 16:06:53,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17158 states to 17158 states and 22267 transitions. [2025-02-05 16:06:53,250 INFO L78 Accepts]: Start accepts. Automaton has 17158 states and 22267 transitions. Word has length 80 [2025-02-05 16:06:53,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:06:53,251 INFO L471 AbstractCegarLoop]: Abstraction has 17158 states and 22267 transitions. [2025-02-05 16:06:53,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 16:06:53,251 INFO L276 IsEmpty]: Start isEmpty. Operand 17158 states and 22267 transitions. [2025-02-05 16:06:53,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-02-05 16:06:53,255 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:06:53,255 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 16:06:53,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 16:06:53,255 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:06:53,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:06:53,256 INFO L85 PathProgramCache]: Analyzing trace with hash -102742407, now seen corresponding path program 1 times [2025-02-05 16:06:53,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:06:53,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493038656] [2025-02-05 16:06:53,256 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:06:53,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:06:53,263 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-02-05 16:06:53,269 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-02-05 16:06:53,269 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:06:53,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:06:53,319 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-05 16:06:53,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:06:53,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493038656] [2025-02-05 16:06:53,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493038656] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:06:53,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:06:53,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 16:06:53,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145189877] [2025-02-05 16:06:53,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:06:53,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:06:53,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:06:53,322 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:06:53,322 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:06:53,322 INFO L87 Difference]: Start difference. First operand 17158 states and 22267 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-02-05 16:06:54,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:06:54,308 INFO L93 Difference]: Finished difference Result 43036 states and 56528 transitions. [2025-02-05 16:06:54,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 16:06:54,308 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 82 [2025-02-05 16:06:54,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:06:54,429 INFO L225 Difference]: With dead ends: 43036 [2025-02-05 16:06:54,429 INFO L226 Difference]: Without dead ends: 25896 [2025-02-05 16:06:54,472 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:06:54,473 INFO L435 NwaCegarLoop]: 317 mSDtfsCounter, 849 mSDsluCounter, 497 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 134 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 849 SdHoareTripleChecker+Valid, 814 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 134 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 16:06:54,473 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [849 Valid, 814 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [134 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 16:06:54,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25896 states. [2025-02-05 16:06:55,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25896 to 25739. [2025-02-05 16:06:55,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25739 states, 22037 states have (on average 1.2381449380587195) internal successors, (27285), 22297 states have internal predecessors, (27285), 2133 states have call successors, (2133), 1310 states have call predecessors, (2133), 1568 states have return successors, (3778), 2135 states have call predecessors, (3778), 2130 states have call successors, (3778) [2025-02-05 16:06:56,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25739 states to 25739 states and 33196 transitions. [2025-02-05 16:06:56,055 INFO L78 Accepts]: Start accepts. Automaton has 25739 states and 33196 transitions. Word has length 82 [2025-02-05 16:06:56,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:06:56,055 INFO L471 AbstractCegarLoop]: Abstraction has 25739 states and 33196 transitions. [2025-02-05 16:06:56,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-02-05 16:06:56,056 INFO L276 IsEmpty]: Start isEmpty. Operand 25739 states and 33196 transitions. [2025-02-05 16:06:56,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-02-05 16:06:56,066 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:06:56,066 INFO L218 NwaCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:06:56,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 16:06:56,067 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:06:56,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:06:56,068 INFO L85 PathProgramCache]: Analyzing trace with hash 455995122, now seen corresponding path program 1 times [2025-02-05 16:06:56,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:06:56,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244878654] [2025-02-05 16:06:56,068 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:06:56,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:06:56,076 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-02-05 16:06:56,084 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-02-05 16:06:56,084 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:06:56,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:06:56,154 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-05 16:06:56,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:06:56,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244878654] [2025-02-05 16:06:56,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244878654] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:06:56,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:06:56,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:06:56,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927113871] [2025-02-05 16:06:56,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:06:56,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 16:06:56,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:06:56,157 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 16:06:56,157 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 16:06:56,157 INFO L87 Difference]: Start difference. First operand 25739 states and 33196 transitions. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-02-05 16:06:57,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:06:57,269 INFO L93 Difference]: Finished difference Result 49424 states and 63533 transitions. [2025-02-05 16:06:57,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:06:57,270 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 99 [2025-02-05 16:06:57,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:06:57,388 INFO L225 Difference]: With dead ends: 49424 [2025-02-05 16:06:57,388 INFO L226 Difference]: Without dead ends: 26086 [2025-02-05 16:06:57,443 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:06:57,443 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 174 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:06:57,444 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 391 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:06:57,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26086 states. [2025-02-05 16:06:58,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26086 to 25618. [2025-02-05 16:06:58,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25618 states, 21812 states have (on average 1.2294150009169265) internal successors, (26816), 22262 states have internal predecessors, (26816), 2091 states have call successors, (2091), 1284 states have call predecessors, (2091), 1714 states have return successors, (3628), 2075 states have call predecessors, (3628), 2088 states have call successors, (3628) [2025-02-05 16:06:58,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25618 states to 25618 states and 32535 transitions. [2025-02-05 16:06:58,551 INFO L78 Accepts]: Start accepts. Automaton has 25618 states and 32535 transitions. Word has length 99 [2025-02-05 16:06:58,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:06:58,551 INFO L471 AbstractCegarLoop]: Abstraction has 25618 states and 32535 transitions. [2025-02-05 16:06:58,552 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-02-05 16:06:58,552 INFO L276 IsEmpty]: Start isEmpty. Operand 25618 states and 32535 transitions. [2025-02-05 16:06:58,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-02-05 16:06:58,559 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:06:58,559 INFO L218 NwaCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:06:58,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 16:06:58,560 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:06:58,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:06:58,560 INFO L85 PathProgramCache]: Analyzing trace with hash 1394526737, now seen corresponding path program 1 times [2025-02-05 16:06:58,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:06:58,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111039601] [2025-02-05 16:06:58,561 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:06:58,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:06:58,568 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-02-05 16:06:58,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-02-05 16:06:58,570 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:06:58,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:06:58,596 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-02-05 16:06:58,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:06:58,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111039601] [2025-02-05 16:06:58,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111039601] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:06:58,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:06:58,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:06:58,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884794122] [2025-02-05 16:06:58,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:06:58,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:06:58,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:06:58,598 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:06:58,598 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:06:58,598 INFO L87 Difference]: Start difference. First operand 25618 states and 32535 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-02-05 16:06:59,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:06:59,498 INFO L93 Difference]: Finished difference Result 27924 states and 35370 transitions. [2025-02-05 16:06:59,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:06:59,499 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 99 [2025-02-05 16:06:59,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:06:59,600 INFO L225 Difference]: With dead ends: 27924 [2025-02-05 16:06:59,601 INFO L226 Difference]: Without dead ends: 25610 [2025-02-05 16:06:59,616 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:06:59,616 INFO L435 NwaCegarLoop]: 182 mSDtfsCounter, 176 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:06:59,617 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 182 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:06:59,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25610 states. [2025-02-05 16:07:00,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25610 to 25309. [2025-02-05 16:07:01,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25309 states, 21561 states have (on average 1.2299058485227958) internal successors, (26518), 22009 states have internal predecessors, (26518), 2053 states have call successors, (2053), 1264 states have call predecessors, (2053), 1694 states have return successors, (3581), 2037 states have call predecessors, (3581), 2050 states have call successors, (3581) [2025-02-05 16:07:01,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25309 states to 25309 states and 32152 transitions. [2025-02-05 16:07:01,123 INFO L78 Accepts]: Start accepts. Automaton has 25309 states and 32152 transitions. Word has length 99 [2025-02-05 16:07:01,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:07:01,124 INFO L471 AbstractCegarLoop]: Abstraction has 25309 states and 32152 transitions. [2025-02-05 16:07:01,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-02-05 16:07:01,124 INFO L276 IsEmpty]: Start isEmpty. Operand 25309 states and 32152 transitions. [2025-02-05 16:07:01,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-02-05 16:07:01,131 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:07:01,132 INFO L218 NwaCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:07:01,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 16:07:01,132 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:07:01,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:07:01,133 INFO L85 PathProgramCache]: Analyzing trace with hash 1288883201, now seen corresponding path program 1 times [2025-02-05 16:07:01,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:07:01,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626725642] [2025-02-05 16:07:01,133 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:07:01,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:07:01,140 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-02-05 16:07:01,148 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-02-05 16:07:01,149 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:07:01,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:07:01,218 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-05 16:07:01,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:07:01,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626725642] [2025-02-05 16:07:01,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626725642] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:07:01,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:07:01,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:07:01,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570399480] [2025-02-05 16:07:01,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:07:01,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 16:07:01,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:07:01,222 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 16:07:01,222 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:07:01,222 INFO L87 Difference]: Start difference. First operand 25309 states and 32152 transitions. Second operand has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 4 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2025-02-05 16:07:02,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:07:02,828 INFO L93 Difference]: Finished difference Result 51122 states and 64921 transitions. [2025-02-05 16:07:02,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 16:07:02,829 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 4 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) Word has length 100 [2025-02-05 16:07:02,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:07:02,950 INFO L225 Difference]: With dead ends: 51122 [2025-02-05 16:07:02,950 INFO L226 Difference]: Without dead ends: 25831 [2025-02-05 16:07:03,008 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-02-05 16:07:03,010 INFO L435 NwaCegarLoop]: 379 mSDtfsCounter, 1254 mSDsluCounter, 774 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 266 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1254 SdHoareTripleChecker+Valid, 1153 SdHoareTripleChecker+Invalid, 491 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 266 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 16:07:03,010 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1254 Valid, 1153 Invalid, 491 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [266 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 16:07:03,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25831 states. [2025-02-05 16:07:04,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25831 to 25309. [2025-02-05 16:07:04,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25309 states, 21561 states have (on average 1.2180325587866982) internal successors, (26262), 22009 states have internal predecessors, (26262), 2053 states have call successors, (2053), 1264 states have call predecessors, (2053), 1694 states have return successors, (3217), 2037 states have call predecessors, (3217), 2050 states have call successors, (3217) [2025-02-05 16:07:04,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25309 states to 25309 states and 31532 transitions. [2025-02-05 16:07:04,292 INFO L78 Accepts]: Start accepts. Automaton has 25309 states and 31532 transitions. Word has length 100 [2025-02-05 16:07:04,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:07:04,293 INFO L471 AbstractCegarLoop]: Abstraction has 25309 states and 31532 transitions. [2025-02-05 16:07:04,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 4 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2025-02-05 16:07:04,293 INFO L276 IsEmpty]: Start isEmpty. Operand 25309 states and 31532 transitions. [2025-02-05 16:07:04,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-02-05 16:07:04,298 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:07:04,299 INFO L218 NwaCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:07:04,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 16:07:04,299 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:07:04,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:07:04,300 INFO L85 PathProgramCache]: Analyzing trace with hash 1288462267, now seen corresponding path program 1 times [2025-02-05 16:07:04,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:07:04,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27567570] [2025-02-05 16:07:04,301 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:07:04,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:07:04,307 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-02-05 16:07:04,317 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-02-05 16:07:04,318 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:07:04,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:07:04,375 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-05 16:07:04,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:07:04,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27567570] [2025-02-05 16:07:04,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27567570] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:07:04,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:07:04,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:07:04,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598340652] [2025-02-05 16:07:04,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:07:04,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 16:07:04,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:07:04,377 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 16:07:04,377 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:07:04,377 INFO L87 Difference]: Start difference. First operand 25309 states and 31532 transitions. Second operand has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 states have internal predecessors, (80), 4 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-02-05 16:07:05,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:07:05,391 INFO L93 Difference]: Finished difference Result 51120 states and 63605 transitions. [2025-02-05 16:07:05,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 16:07:05,392 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 states have internal predecessors, (80), 4 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 101 [2025-02-05 16:07:05,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:07:05,511 INFO L225 Difference]: With dead ends: 51120 [2025-02-05 16:07:05,511 INFO L226 Difference]: Without dead ends: 23090 [2025-02-05 16:07:05,583 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-02-05 16:07:05,583 INFO L435 NwaCegarLoop]: 371 mSDtfsCounter, 1254 mSDsluCounter, 773 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 248 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1254 SdHoareTripleChecker+Valid, 1144 SdHoareTripleChecker+Invalid, 458 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 248 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 16:07:05,584 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1254 Valid, 1144 Invalid, 458 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [248 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 16:07:05,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23090 states. [2025-02-05 16:07:06,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23090 to 22636. [2025-02-05 16:07:06,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22636 states, 19209 states have (on average 1.2077151335311573) internal successors, (23199), 19628 states have internal predecessors, (23199), 1908 states have call successors, (1908), 1170 states have call predecessors, (1908), 1518 states have return successors, (2715), 1839 states have call predecessors, (2715), 1904 states have call successors, (2715) [2025-02-05 16:07:06,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22636 states to 22636 states and 27822 transitions. [2025-02-05 16:07:06,747 INFO L78 Accepts]: Start accepts. Automaton has 22636 states and 27822 transitions. Word has length 101 [2025-02-05 16:07:06,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:07:06,748 INFO L471 AbstractCegarLoop]: Abstraction has 22636 states and 27822 transitions. [2025-02-05 16:07:06,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 states have internal predecessors, (80), 4 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-02-05 16:07:06,748 INFO L276 IsEmpty]: Start isEmpty. Operand 22636 states and 27822 transitions. [2025-02-05 16:07:06,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-02-05 16:07:06,756 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:07:06,756 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:07:06,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-05 16:07:06,756 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:07:06,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:07:06,757 INFO L85 PathProgramCache]: Analyzing trace with hash 394338322, now seen corresponding path program 1 times [2025-02-05 16:07:06,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:07:06,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378096437] [2025-02-05 16:07:06,757 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:07:06,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:07:06,766 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-02-05 16:07:06,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-02-05 16:07:06,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:07:06,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:07:06,916 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-02-05 16:07:06,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:07:06,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378096437] [2025-02-05 16:07:06,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378096437] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:07:06,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1408958625] [2025-02-05 16:07:06,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:07:06,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:07:06,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:07:06,921 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 16:07:06,922 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 16:07:06,983 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-02-05 16:07:07,035 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-02-05 16:07:07,035 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:07:07,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:07:07,038 INFO L256 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-05 16:07:07,046 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:07:07,270 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-02-05 16:07:07,270 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 16:07:07,458 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-02-05 16:07:07,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1408958625] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 16:07:07,458 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 16:07:07,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 10 [2025-02-05 16:07:07,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089728895] [2025-02-05 16:07:07,459 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 16:07:07,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 16:07:07,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:07:07,460 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 16:07:07,460 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-02-05 16:07:07,462 INFO L87 Difference]: Start difference. First operand 22636 states and 27822 transitions. Second operand has 10 states, 10 states have (on average 19.2) internal successors, (192), 10 states have internal predecessors, (192), 5 states have call successors, (22), 4 states have call predecessors, (22), 3 states have return successors, (21), 4 states have call predecessors, (21), 4 states have call successors, (21) [2025-02-05 16:07:09,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:07:09,457 INFO L93 Difference]: Finished difference Result 53537 states and 65941 transitions. [2025-02-05 16:07:09,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-05 16:07:09,458 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 19.2) internal successors, (192), 10 states have internal predecessors, (192), 5 states have call successors, (22), 4 states have call predecessors, (22), 3 states have return successors, (21), 4 states have call predecessors, (21), 4 states have call successors, (21) Word has length 119 [2025-02-05 16:07:09,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:07:09,611 INFO L225 Difference]: With dead ends: 53537 [2025-02-05 16:07:09,612 INFO L226 Difference]: Without dead ends: 32537 [2025-02-05 16:07:09,672 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 231 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2025-02-05 16:07:09,672 INFO L435 NwaCegarLoop]: 200 mSDtfsCounter, 607 mSDsluCounter, 951 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 607 SdHoareTripleChecker+Valid, 1151 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:07:09,672 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [607 Valid, 1151 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:07:09,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32537 states. [2025-02-05 16:07:10,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32537 to 27513. [2025-02-05 16:07:10,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27513 states, 23408 states have (on average 1.207365003417635) internal successors, (28262), 23915 states have internal predecessors, (28262), 2268 states have call successors, (2268), 1396 states have call predecessors, (2268), 1836 states have return successors, (3260), 2203 states have call predecessors, (3260), 2264 states have call successors, (3260) [2025-02-05 16:07:11,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27513 states to 27513 states and 33790 transitions. [2025-02-05 16:07:11,028 INFO L78 Accepts]: Start accepts. Automaton has 27513 states and 33790 transitions. Word has length 119 [2025-02-05 16:07:11,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:07:11,029 INFO L471 AbstractCegarLoop]: Abstraction has 27513 states and 33790 transitions. [2025-02-05 16:07:11,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 19.2) internal successors, (192), 10 states have internal predecessors, (192), 5 states have call successors, (22), 4 states have call predecessors, (22), 3 states have return successors, (21), 4 states have call predecessors, (21), 4 states have call successors, (21) [2025-02-05 16:07:11,029 INFO L276 IsEmpty]: Start isEmpty. Operand 27513 states and 33790 transitions. [2025-02-05 16:07:11,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-02-05 16:07:11,036 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:07:11,036 INFO L218 NwaCegarLoop]: trace histogram [3, 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, 1] [2025-02-05 16:07:11,045 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-05 16:07:11,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-02-05 16:07:11,237 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:07:11,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:07:11,237 INFO L85 PathProgramCache]: Analyzing trace with hash 408366080, now seen corresponding path program 1 times [2025-02-05 16:07:11,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:07:11,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734566900] [2025-02-05 16:07:11,237 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:07:11,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:07:11,245 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-02-05 16:07:11,251 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-02-05 16:07:11,252 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:07:11,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:07:11,284 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2025-02-05 16:07:11,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:07:11,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734566900] [2025-02-05 16:07:11,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734566900] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:07:11,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:07:11,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:07:11,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441779487] [2025-02-05 16:07:11,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:07:11,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:07:11,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:07:11,286 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:07:11,287 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:07:11,287 INFO L87 Difference]: Start difference. First operand 27513 states and 33790 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-02-05 16:07:12,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:07:12,479 INFO L93 Difference]: Finished difference Result 52993 states and 65254 transitions. [2025-02-05 16:07:12,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:07:12,479 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 123 [2025-02-05 16:07:12,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:07:12,636 INFO L225 Difference]: With dead ends: 52993 [2025-02-05 16:07:12,636 INFO L226 Difference]: Without dead ends: 34876 [2025-02-05 16:07:12,914 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:07:12,915 INFO L435 NwaCegarLoop]: 219 mSDtfsCounter, 148 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:07:12,915 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 378 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:07:12,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34876 states. [2025-02-05 16:07:14,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34876 to 32340. [2025-02-05 16:07:14,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32340 states, 27533 states have (on average 1.2101841426651654) internal successors, (33320), 28130 states have internal predecessors, (33320), 2638 states have call successors, (2638), 1650 states have call predecessors, (2638), 2168 states have return successors, (3740), 2561 states have call predecessors, (3740), 2634 states have call successors, (3740) [2025-02-05 16:07:14,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32340 states to 32340 states and 39698 transitions. [2025-02-05 16:07:14,271 INFO L78 Accepts]: Start accepts. Automaton has 32340 states and 39698 transitions. Word has length 123 [2025-02-05 16:07:14,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:07:14,272 INFO L471 AbstractCegarLoop]: Abstraction has 32340 states and 39698 transitions. [2025-02-05 16:07:14,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-02-05 16:07:14,272 INFO L276 IsEmpty]: Start isEmpty. Operand 32340 states and 39698 transitions. [2025-02-05 16:07:14,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-02-05 16:07:14,277 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:07:14,277 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:07:14,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-05 16:07:14,277 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:07:14,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:07:14,278 INFO L85 PathProgramCache]: Analyzing trace with hash 1210355089, now seen corresponding path program 1 times [2025-02-05 16:07:14,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:07:14,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963946268] [2025-02-05 16:07:14,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:07:14,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:07:14,285 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-02-05 16:07:14,290 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-02-05 16:07:14,290 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:07:14,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:07:14,340 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-02-05 16:07:14,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:07:14,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963946268] [2025-02-05 16:07:14,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963946268] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:07:14,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:07:14,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:07:14,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908412488] [2025-02-05 16:07:14,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:07:14,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 16:07:14,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:07:14,342 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 16:07:14,342 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 16:07:14,342 INFO L87 Difference]: Start difference. First operand 32340 states and 39698 transitions. Second operand has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2025-02-05 16:07:16,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:07:16,655 INFO L93 Difference]: Finished difference Result 71066 states and 86904 transitions. [2025-02-05 16:07:16,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 16:07:16,656 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) Word has length 127 [2025-02-05 16:07:16,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:07:16,831 INFO L225 Difference]: With dead ends: 71066 [2025-02-05 16:07:16,832 INFO L226 Difference]: Without dead ends: 49215 [2025-02-05 16:07:16,892 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-02-05 16:07:16,893 INFO L435 NwaCegarLoop]: 328 mSDtfsCounter, 270 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 597 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:07:16,893 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 597 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:07:16,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49215 states. [2025-02-05 16:07:19,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49215 to 48991. [2025-02-05 16:07:19,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48991 states, 41474 states have (on average 1.1976418961276944) internal successors, (49671), 42304 states have internal predecessors, (49671), 4104 states have call successors, (4104), 2701 states have call predecessors, (4104), 3412 states have return successors, (5435), 3987 states have call predecessors, (5435), 4100 states have call successors, (5435) [2025-02-05 16:07:19,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48991 states to 48991 states and 59210 transitions. [2025-02-05 16:07:19,351 INFO L78 Accepts]: Start accepts. Automaton has 48991 states and 59210 transitions. Word has length 127 [2025-02-05 16:07:19,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:07:19,351 INFO L471 AbstractCegarLoop]: Abstraction has 48991 states and 59210 transitions. [2025-02-05 16:07:19,352 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2025-02-05 16:07:19,352 INFO L276 IsEmpty]: Start isEmpty. Operand 48991 states and 59210 transitions. [2025-02-05 16:07:19,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-02-05 16:07:19,356 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:07:19,356 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:07:19,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-05 16:07:19,357 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:07:19,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:07:19,357 INFO L85 PathProgramCache]: Analyzing trace with hash 1611626065, now seen corresponding path program 1 times [2025-02-05 16:07:19,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:07:19,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992043912] [2025-02-05 16:07:19,357 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:07:19,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:07:19,364 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-02-05 16:07:19,369 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-02-05 16:07:19,369 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:07:19,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:07:19,425 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 3 proven. 16 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-02-05 16:07:19,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:07:19,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992043912] [2025-02-05 16:07:19,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992043912] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:07:19,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1224194224] [2025-02-05 16:07:19,426 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:07:19,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:07:19,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:07:19,429 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 16:07:19,431 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-05 16:07:19,476 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-02-05 16:07:19,514 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-02-05 16:07:19,515 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:07:19,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:07:19,517 INFO L256 TraceCheckSpWp]: Trace formula consists of 407 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 16:07:19,519 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:07:19,644 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-02-05 16:07:19,644 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 16:07:19,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1224194224] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:07:19,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 16:07:19,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 7 [2025-02-05 16:07:19,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841899638] [2025-02-05 16:07:19,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:07:19,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:07:19,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:07:19,647 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:07:19,647 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:07:19,647 INFO L87 Difference]: Start difference. First operand 48991 states and 59210 transitions. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 2 states have internal predecessors, (92), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2025-02-05 16:07:21,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:07:21,018 INFO L93 Difference]: Finished difference Result 76113 states and 92584 transitions. [2025-02-05 16:07:21,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:07:21,018 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 2 states have internal predecessors, (92), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) Word has length 128 [2025-02-05 16:07:21,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:07:21,216 INFO L225 Difference]: With dead ends: 76113 [2025-02-05 16:07:21,216 INFO L226 Difference]: Without dead ends: 40741 [2025-02-05 16:07:21,294 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:07:21,295 INFO L435 NwaCegarLoop]: 193 mSDtfsCounter, 76 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:07:21,295 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 354 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:07:21,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40741 states.