./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.ufo.UNBOUNDED.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.ufo.UNBOUNDED.pals.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 e3fe12f9ba7a27693660ab3b9c436489448c0880075d8a5a83d98427fc7a74d3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 04:22:34,691 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 04:22:34,749 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 04:22:34,757 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 04:22:34,757 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 04:22:34,778 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 04:22:34,779 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 04:22:34,779 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 04:22:34,779 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 04:22:34,779 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 04:22:34,780 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 04:22:34,780 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 04:22:34,780 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 04:22:34,780 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 04:22:34,781 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 04:22:34,781 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 04:22:34,781 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 04:22:34,781 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 04:22:34,781 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 04:22:34,781 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 04:22:34,781 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 04:22:34,782 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 04:22:34,782 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 04:22:34,782 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 04:22:34,782 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 04:22:34,782 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 04:22:34,782 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 04:22:34,782 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 04:22:34,782 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 04:22:34,782 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 04:22:34,782 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 04:22:34,782 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 04:22:34,782 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:22:34,783 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 04:22:34,783 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 04:22:34,783 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 04:22:34,783 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 04:22:34,783 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:22:34,783 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 04:22:34,783 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 04:22:34,784 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 04:22:34,784 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 04:22:34,784 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 04:22:34,784 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 04:22:34,784 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 04:22:34,784 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 04:22:34,784 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 04:22:34,784 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 04:22:34,784 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 -> e3fe12f9ba7a27693660ab3b9c436489448c0880075d8a5a83d98427fc7a74d3 [2025-01-09 04:22:35,005 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 04:22:35,014 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 04:22:35,016 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 04:22:35,016 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 04:22:35,019 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 04:22:35,020 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.ufo.UNBOUNDED.pals.c [2025-01-09 04:22:36,166 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b8749b990/3a1c5e63ca35422e8fc04c434351b398/FLAGd5a381d30 [2025-01-09 04:22:36,383 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 04:22:36,383 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.ufo.UNBOUNDED.pals.c [2025-01-09 04:22:36,389 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b8749b990/3a1c5e63ca35422e8fc04c434351b398/FLAGd5a381d30 [2025-01-09 04:22:36,737 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b8749b990/3a1c5e63ca35422e8fc04c434351b398 [2025-01-09 04:22:36,739 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 04:22:36,740 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 04:22:36,741 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 04:22:36,741 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 04:22:36,745 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 04:22:36,745 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:22:36" (1/1) ... [2025-01-09 04:22:36,746 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45a8244e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:22:36, skipping insertion in model container [2025-01-09 04:22:36,746 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:22:36" (1/1) ... [2025-01-09 04:22:36,759 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 04:22:36,927 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/seq-mthreaded/pals_lcr-var-start-time.3.ufo.UNBOUNDED.pals.c[6899,6912] [2025-01-09 04:22:36,930 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 04:22:36,943 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 04:22:36,985 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.ufo.UNBOUNDED.pals.c[6899,6912] [2025-01-09 04:22:36,989 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 04:22:37,001 INFO L204 MainTranslator]: Completed translation [2025-01-09 04:22:37,001 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:22:37 WrapperNode [2025-01-09 04:22:37,001 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 04:22:37,002 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 04:22:37,002 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 04:22:37,002 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 04:22:37,006 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:22:37" (1/1) ... [2025-01-09 04:22:37,012 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:22:37" (1/1) ... [2025-01-09 04:22:37,032 INFO L138 Inliner]: procedures = 23, calls = 14, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 246 [2025-01-09 04:22:37,033 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 04:22:37,033 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 04:22:37,033 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 04:22:37,033 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 04:22:37,040 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:22:37" (1/1) ... [2025-01-09 04:22:37,040 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:22:37" (1/1) ... [2025-01-09 04:22:37,041 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:22:37" (1/1) ... [2025-01-09 04:22:37,051 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-09 04:22:37,051 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:22:37" (1/1) ... [2025-01-09 04:22:37,051 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:22:37" (1/1) ... [2025-01-09 04:22:37,055 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:22:37" (1/1) ... [2025-01-09 04:22:37,055 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:22:37" (1/1) ... [2025-01-09 04:22:37,058 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:22:37" (1/1) ... [2025-01-09 04:22:37,059 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:22:37" (1/1) ... [2025-01-09 04:22:37,061 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:22:37" (1/1) ... [2025-01-09 04:22:37,062 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 04:22:37,063 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 04:22:37,063 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 04:22:37,063 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 04:22:37,067 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:22:37" (1/1) ... [2025-01-09 04:22:37,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:22:37,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:22:37,095 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 04:22:37,097 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 04:22:37,112 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 04:22:37,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 04:22:37,112 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 04:22:37,112 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 04:22:37,164 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 04:22:37,166 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 04:22:37,430 INFO L? ?]: Removed 33 outVars from TransFormulas that were not future-live. [2025-01-09 04:22:37,430 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 04:22:37,438 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 04:22:37,438 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 04:22:37,439 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:22:37 BoogieIcfgContainer [2025-01-09 04:22:37,439 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 04:22:37,440 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 04:22:37,440 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 04:22:37,443 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 04:22:37,443 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:22:36" (1/3) ... [2025-01-09 04:22:37,443 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34ad7d33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:22:37, skipping insertion in model container [2025-01-09 04:22:37,444 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:22:37" (2/3) ... [2025-01-09 04:22:37,444 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34ad7d33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:22:37, skipping insertion in model container [2025-01-09 04:22:37,444 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:22:37" (3/3) ... [2025-01-09 04:22:37,444 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.ufo.UNBOUNDED.pals.c [2025-01-09 04:22:37,453 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 04:22:37,455 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr-var-start-time.3.ufo.UNBOUNDED.pals.c that has 1 procedures, 68 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 04:22:37,491 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 04:22:37,498 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;@2a07fa98, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 04:22:37,498 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 04:22:37,501 INFO L276 IsEmpty]: Start isEmpty. Operand has 68 states, 66 states have (on average 1.696969696969697) internal successors, (112), 67 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:22:37,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-01-09 04:22:37,505 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:22:37,505 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] [2025-01-09 04:22:37,505 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:22:37,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:22:37,508 INFO L85 PathProgramCache]: Analyzing trace with hash -954764075, now seen corresponding path program 1 times [2025-01-09 04:22:37,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:22:37,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342277248] [2025-01-09 04:22:37,515 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:22:37,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:22:37,579 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-09 04:22:37,619 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-09 04:22:37,620 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:22:37,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:22:37,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:22:37,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:22:37,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342277248] [2025-01-09 04:22:37,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342277248] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:22:37,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:22:37,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:22:37,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930074323] [2025-01-09 04:22:37,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:22:37,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:22:37,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:22:37,841 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:22:37,842 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:22:37,844 INFO L87 Difference]: Start difference. First operand has 68 states, 66 states have (on average 1.696969696969697) internal successors, (112), 67 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:22:37,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:22:37,908 INFO L93 Difference]: Finished difference Result 114 states and 186 transitions. [2025-01-09 04:22:37,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:22:37,910 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-01-09 04:22:37,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:22:37,914 INFO L225 Difference]: With dead ends: 114 [2025-01-09 04:22:37,915 INFO L226 Difference]: Without dead ends: 65 [2025-01-09 04:22:37,916 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-01-09 04:22:37,918 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 0 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:22:37,919 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 398 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:22:37,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2025-01-09 04:22:37,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2025-01-09 04:22:37,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 64 states have (on average 1.40625) internal successors, (90), 64 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:22:37,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 90 transitions. [2025-01-09 04:22:37,942 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 90 transitions. Word has length 25 [2025-01-09 04:22:37,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:22:37,943 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 90 transitions. [2025-01-09 04:22:37,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:22:37,943 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 90 transitions. [2025-01-09 04:22:37,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-01-09 04:22:37,945 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:22:37,946 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] [2025-01-09 04:22:37,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 04:22:37,946 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:22:37,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:22:37,946 INFO L85 PathProgramCache]: Analyzing trace with hash -1006437365, now seen corresponding path program 1 times [2025-01-09 04:22:37,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:22:37,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876001911] [2025-01-09 04:22:37,947 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:22:37,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:22:37,962 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-01-09 04:22:37,974 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-01-09 04:22:37,974 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:22:37,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:22:38,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:22:38,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:22:38,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876001911] [2025-01-09 04:22:38,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876001911] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:22:38,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:22:38,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:22:38,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328125333] [2025-01-09 04:22:38,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:22:38,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:22:38,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:22:38,096 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:22:38,097 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:22:38,097 INFO L87 Difference]: Start difference. First operand 65 states and 90 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:22:38,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:22:38,188 INFO L93 Difference]: Finished difference Result 233 states and 358 transitions. [2025-01-09 04:22:38,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:22:38,190 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2025-01-09 04:22:38,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:22:38,191 INFO L225 Difference]: With dead ends: 233 [2025-01-09 04:22:38,191 INFO L226 Difference]: Without dead ends: 191 [2025-01-09 04:22:38,191 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:22:38,191 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 380 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 380 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:22:38,192 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [380 Valid, 335 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:22:38,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2025-01-09 04:22:38,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 105. [2025-01-09 04:22:38,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 104 states have (on average 1.4807692307692308) internal successors, (154), 104 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:22:38,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 154 transitions. [2025-01-09 04:22:38,205 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 154 transitions. Word has length 41 [2025-01-09 04:22:38,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:22:38,205 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 154 transitions. [2025-01-09 04:22:38,205 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:22:38,205 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 154 transitions. [2025-01-09 04:22:38,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-01-09 04:22:38,206 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:22:38,206 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] [2025-01-09 04:22:38,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 04:22:38,206 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:22:38,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:22:38,207 INFO L85 PathProgramCache]: Analyzing trace with hash -1518110703, now seen corresponding path program 1 times [2025-01-09 04:22:38,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:22:38,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716968453] [2025-01-09 04:22:38,207 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:22:38,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:22:38,217 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-01-09 04:22:38,239 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-01-09 04:22:38,239 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:22:38,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:22:38,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:22:38,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:22:38,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716968453] [2025-01-09 04:22:38,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716968453] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:22:38,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:22:38,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:22:38,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953680109] [2025-01-09 04:22:38,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:22:38,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:22:38,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:22:38,422 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:22:38,422 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:22:38,423 INFO L87 Difference]: Start difference. First operand 105 states and 154 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:22:38,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:22:38,446 INFO L93 Difference]: Finished difference Result 113 states and 163 transitions. [2025-01-09 04:22:38,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:22:38,447 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2025-01-09 04:22:38,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:22:38,448 INFO L225 Difference]: With dead ends: 113 [2025-01-09 04:22:38,448 INFO L226 Difference]: Without dead ends: 111 [2025-01-09 04:22:38,450 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-01-09 04:22:38,450 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 0 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:22:38,450 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 340 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:22:38,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2025-01-09 04:22:38,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2025-01-09 04:22:38,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 110 states have (on average 1.4545454545454546) internal successors, (160), 110 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:22:38,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 160 transitions. [2025-01-09 04:22:38,460 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 160 transitions. Word has length 42 [2025-01-09 04:22:38,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:22:38,461 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 160 transitions. [2025-01-09 04:22:38,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:22:38,461 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 160 transitions. [2025-01-09 04:22:38,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-01-09 04:22:38,464 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:22:38,464 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] [2025-01-09 04:22:38,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 04:22:38,464 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:22:38,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:22:38,465 INFO L85 PathProgramCache]: Analyzing trace with hash 235786915, now seen corresponding path program 1 times [2025-01-09 04:22:38,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:22:38,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800091984] [2025-01-09 04:22:38,465 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:22:38,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:22:38,475 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-01-09 04:22:38,482 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-01-09 04:22:38,483 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:22:38,483 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:22:38,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:22:38,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:22:38,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800091984] [2025-01-09 04:22:38,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800091984] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:22:38,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:22:38,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:22:38,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417986303] [2025-01-09 04:22:38,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:22:38,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:22:38,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:22:38,537 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:22:38,537 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:22:38,537 INFO L87 Difference]: Start difference. First operand 111 states and 160 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:22:38,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:22:38,557 INFO L93 Difference]: Finished difference Result 272 states and 409 transitions. [2025-01-09 04:22:38,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:22:38,558 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2025-01-09 04:22:38,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:22:38,559 INFO L225 Difference]: With dead ends: 272 [2025-01-09 04:22:38,559 INFO L226 Difference]: Without dead ends: 184 [2025-01-09 04:22:38,560 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:22:38,561 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 39 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:22:38,561 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 149 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:22:38,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2025-01-09 04:22:38,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 180. [2025-01-09 04:22:38,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 179 states have (on average 1.4804469273743017) internal successors, (265), 179 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:22:38,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 265 transitions. [2025-01-09 04:22:38,572 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 265 transitions. Word has length 43 [2025-01-09 04:22:38,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:22:38,572 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 265 transitions. [2025-01-09 04:22:38,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:22:38,573 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 265 transitions. [2025-01-09 04:22:38,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-01-09 04:22:38,574 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:22:38,574 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] [2025-01-09 04:22:38,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 04:22:38,574 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:22:38,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:22:38,574 INFO L85 PathProgramCache]: Analyzing trace with hash 1980316362, now seen corresponding path program 1 times [2025-01-09 04:22:38,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:22:38,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781349498] [2025-01-09 04:22:38,575 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:22:38,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:22:38,584 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-01-09 04:22:38,595 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-01-09 04:22:38,597 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:22:38,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:22:38,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:22:38,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:22:38,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781349498] [2025-01-09 04:22:38,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781349498] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:22:38,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:22:38,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:22:38,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29567767] [2025-01-09 04:22:38,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:22:38,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:22:38,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:22:38,634 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:22:38,634 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:22:38,634 INFO L87 Difference]: Start difference. First operand 180 states and 265 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:22:38,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:22:38,665 INFO L93 Difference]: Finished difference Result 462 states and 693 transitions. [2025-01-09 04:22:38,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:22:38,667 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2025-01-09 04:22:38,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:22:38,668 INFO L225 Difference]: With dead ends: 462 [2025-01-09 04:22:38,668 INFO L226 Difference]: Without dead ends: 305 [2025-01-09 04:22:38,669 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:22:38,669 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 47 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:22:38,669 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 175 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:22:38,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2025-01-09 04:22:38,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 303. [2025-01-09 04:22:38,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 302 states have (on average 1.4768211920529801) internal successors, (446), 302 states have internal predecessors, (446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:22:38,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 446 transitions. [2025-01-09 04:22:38,679 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 446 transitions. Word has length 44 [2025-01-09 04:22:38,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:22:38,679 INFO L471 AbstractCegarLoop]: Abstraction has 303 states and 446 transitions. [2025-01-09 04:22:38,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:22:38,679 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 446 transitions. [2025-01-09 04:22:38,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-01-09 04:22:38,680 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:22:38,680 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] [2025-01-09 04:22:38,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 04:22:38,680 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:22:38,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:22:38,681 INFO L85 PathProgramCache]: Analyzing trace with hash 179627434, now seen corresponding path program 1 times [2025-01-09 04:22:38,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:22:38,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195331106] [2025-01-09 04:22:38,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:22:38,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:22:38,691 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-01-09 04:22:38,696 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-01-09 04:22:38,696 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:22:38,696 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:22:38,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:22:38,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:22:38,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195331106] [2025-01-09 04:22:38,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195331106] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:22:38,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:22:38,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:22:38,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666026508] [2025-01-09 04:22:38,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:22:38,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:22:38,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:22:38,740 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:22:38,740 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:22:38,740 INFO L87 Difference]: Start difference. First operand 303 states and 446 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:22:38,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:22:38,765 INFO L93 Difference]: Finished difference Result 799 states and 1180 transitions. [2025-01-09 04:22:38,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:22:38,765 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2025-01-09 04:22:38,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:22:38,767 INFO L225 Difference]: With dead ends: 799 [2025-01-09 04:22:38,767 INFO L226 Difference]: Without dead ends: 519 [2025-01-09 04:22:38,767 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:22:38,768 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 51 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:22:38,768 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 188 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:22:38,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2025-01-09 04:22:38,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 517. [2025-01-09 04:22:38,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 517 states, 516 states have (on average 1.449612403100775) internal successors, (748), 516 states have internal predecessors, (748), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:22:38,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 748 transitions. [2025-01-09 04:22:38,789 INFO L78 Accepts]: Start accepts. Automaton has 517 states and 748 transitions. Word has length 44 [2025-01-09 04:22:38,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:22:38,789 INFO L471 AbstractCegarLoop]: Abstraction has 517 states and 748 transitions. [2025-01-09 04:22:38,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:22:38,790 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 748 transitions. [2025-01-09 04:22:38,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-01-09 04:22:38,790 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:22:38,790 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] [2025-01-09 04:22:38,790 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 04:22:38,791 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:22:38,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:22:38,791 INFO L85 PathProgramCache]: Analyzing trace with hash 1781396701, now seen corresponding path program 1 times [2025-01-09 04:22:38,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:22:38,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120021289] [2025-01-09 04:22:38,791 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:22:38,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:22:38,798 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-01-09 04:22:38,802 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-01-09 04:22:38,802 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:22:38,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:22:38,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:22:38,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:22:38,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120021289] [2025-01-09 04:22:38,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120021289] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:22:38,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:22:38,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:22:38,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719693778] [2025-01-09 04:22:38,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:22:38,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:22:38,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:22:38,840 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:22:38,840 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:22:38,840 INFO L87 Difference]: Start difference. First operand 517 states and 748 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:22:38,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:22:38,864 INFO L93 Difference]: Finished difference Result 1004 states and 1466 transitions. [2025-01-09 04:22:38,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:22:38,865 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2025-01-09 04:22:38,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:22:38,868 INFO L225 Difference]: With dead ends: 1004 [2025-01-09 04:22:38,868 INFO L226 Difference]: Without dead ends: 721 [2025-01-09 04:22:38,869 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:22:38,869 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 52 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:22:38,869 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 197 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:22:38,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 721 states. [2025-01-09 04:22:38,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 721 to 719. [2025-01-09 04:22:38,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 719 states, 718 states have (on average 1.434540389972145) internal successors, (1030), 718 states have internal predecessors, (1030), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:22:38,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 719 states to 719 states and 1030 transitions. [2025-01-09 04:22:38,897 INFO L78 Accepts]: Start accepts. Automaton has 719 states and 1030 transitions. Word has length 45 [2025-01-09 04:22:38,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:22:38,897 INFO L471 AbstractCegarLoop]: Abstraction has 719 states and 1030 transitions. [2025-01-09 04:22:38,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:22:38,898 INFO L276 IsEmpty]: Start isEmpty. Operand 719 states and 1030 transitions. [2025-01-09 04:22:38,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-01-09 04:22:38,899 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:22:38,899 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 04:22:38,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 04:22:38,902 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:22:38,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:22:38,903 INFO L85 PathProgramCache]: Analyzing trace with hash 1234319959, now seen corresponding path program 1 times [2025-01-09 04:22:38,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:22:38,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375426250] [2025-01-09 04:22:38,903 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:22:38,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:22:38,912 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-01-09 04:22:38,921 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-01-09 04:22:38,922 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:22:38,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:22:39,014 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-09 04:22:39,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:22:39,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375426250] [2025-01-09 04:22:39,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375426250] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:22:39,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:22:39,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:22:39,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945488811] [2025-01-09 04:22:39,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:22:39,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:22:39,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:22:39,017 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:22:39,017 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:22:39,017 INFO L87 Difference]: Start difference. First operand 719 states and 1030 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:22:39,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:22:39,084 INFO L93 Difference]: Finished difference Result 1659 states and 2418 transitions. [2025-01-09 04:22:39,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:22:39,085 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2025-01-09 04:22:39,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:22:39,090 INFO L225 Difference]: With dead ends: 1659 [2025-01-09 04:22:39,090 INFO L226 Difference]: Without dead ends: 1305 [2025-01-09 04:22:39,091 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:22:39,091 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 243 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:22:39,092 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 382 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:22:39,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1305 states. [2025-01-09 04:22:39,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1305 to 1059. [2025-01-09 04:22:39,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1059 states, 1058 states have (on average 1.438563327032136) internal successors, (1522), 1058 states have internal predecessors, (1522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:22:39,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1059 states to 1059 states and 1522 transitions. [2025-01-09 04:22:39,129 INFO L78 Accepts]: Start accepts. Automaton has 1059 states and 1522 transitions. Word has length 63 [2025-01-09 04:22:39,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:22:39,129 INFO L471 AbstractCegarLoop]: Abstraction has 1059 states and 1522 transitions. [2025-01-09 04:22:39,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:22:39,129 INFO L276 IsEmpty]: Start isEmpty. Operand 1059 states and 1522 transitions. [2025-01-09 04:22:39,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-01-09 04:22:39,130 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:22:39,131 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 04:22:39,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 04:22:39,132 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:22:39,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:22:39,132 INFO L85 PathProgramCache]: Analyzing trace with hash -566368969, now seen corresponding path program 1 times [2025-01-09 04:22:39,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:22:39,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584602369] [2025-01-09 04:22:39,134 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:22:39,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:22:39,148 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-01-09 04:22:39,173 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-01-09 04:22:39,173 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:22:39,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:22:39,253 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-09 04:22:39,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:22:39,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584602369] [2025-01-09 04:22:39,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [584602369] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:22:39,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:22:39,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:22:39,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803810646] [2025-01-09 04:22:39,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:22:39,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:22:39,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:22:39,254 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:22:39,254 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:22:39,254 INFO L87 Difference]: Start difference. First operand 1059 states and 1522 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:22:39,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:22:39,324 INFO L93 Difference]: Finished difference Result 1999 states and 2910 transitions. [2025-01-09 04:22:39,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:22:39,324 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2025-01-09 04:22:39,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:22:39,329 INFO L225 Difference]: With dead ends: 1999 [2025-01-09 04:22:39,330 INFO L226 Difference]: Without dead ends: 1645 [2025-01-09 04:22:39,330 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:22:39,331 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 236 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:22:39,331 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 402 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:22:39,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1645 states. [2025-01-09 04:22:39,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1645 to 1399. [2025-01-09 04:22:39,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1399 states, 1398 states have (on average 1.4406294706723892) internal successors, (2014), 1398 states have internal predecessors, (2014), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:22:39,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1399 states to 1399 states and 2014 transitions. [2025-01-09 04:22:39,365 INFO L78 Accepts]: Start accepts. Automaton has 1399 states and 2014 transitions. Word has length 63 [2025-01-09 04:22:39,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:22:39,365 INFO L471 AbstractCegarLoop]: Abstraction has 1399 states and 2014 transitions. [2025-01-09 04:22:39,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:22:39,365 INFO L276 IsEmpty]: Start isEmpty. Operand 1399 states and 2014 transitions. [2025-01-09 04:22:39,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-01-09 04:22:39,366 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:22:39,366 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] [2025-01-09 04:22:39,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 04:22:39,366 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:22:39,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:22:39,367 INFO L85 PathProgramCache]: Analyzing trace with hash 130344688, now seen corresponding path program 1 times [2025-01-09 04:22:39,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:22:39,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537719586] [2025-01-09 04:22:39,367 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:22:39,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:22:39,376 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-01-09 04:22:39,387 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-01-09 04:22:39,387 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:22:39,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:22:39,449 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:22:39,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:22:39,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537719586] [2025-01-09 04:22:39,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537719586] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:22:39,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:22:39,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:22:39,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098843210] [2025-01-09 04:22:39,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:22:39,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:22:39,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:22:39,450 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:22:39,450 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:22:39,450 INFO L87 Difference]: Start difference. First operand 1399 states and 2014 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:22:39,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:22:39,479 INFO L93 Difference]: Finished difference Result 2775 states and 4004 transitions. [2025-01-09 04:22:39,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:22:39,480 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2025-01-09 04:22:39,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:22:39,485 INFO L225 Difference]: With dead ends: 2775 [2025-01-09 04:22:39,485 INFO L226 Difference]: Without dead ends: 1401 [2025-01-09 04:22:39,487 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:22:39,488 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 42 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 188 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-01-09 04:22:39,488 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 188 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:22:39,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1401 states. [2025-01-09 04:22:39,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1401 to 1399. [2025-01-09 04:22:39,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1399 states, 1398 states have (on average 1.4234620886981402) internal successors, (1990), 1398 states have internal predecessors, (1990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:22:39,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1399 states to 1399 states and 1990 transitions. [2025-01-09 04:22:39,534 INFO L78 Accepts]: Start accepts. Automaton has 1399 states and 1990 transitions. Word has length 64 [2025-01-09 04:22:39,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:22:39,535 INFO L471 AbstractCegarLoop]: Abstraction has 1399 states and 1990 transitions. [2025-01-09 04:22:39,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:22:39,535 INFO L276 IsEmpty]: Start isEmpty. Operand 1399 states and 1990 transitions. [2025-01-09 04:22:39,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-01-09 04:22:39,535 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:22:39,536 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 04:22:39,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 04:22:39,536 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:22:39,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:22:39,536 INFO L85 PathProgramCache]: Analyzing trace with hash -1354678801, now seen corresponding path program 1 times [2025-01-09 04:22:39,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:22:39,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784884663] [2025-01-09 04:22:39,536 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:22:39,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:22:39,545 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-01-09 04:22:39,559 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-01-09 04:22:39,559 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:22:39,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:22:39,613 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:22:39,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:22:39,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784884663] [2025-01-09 04:22:39,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784884663] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:22:39,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:22:39,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:22:39,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799770619] [2025-01-09 04:22:39,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:22:39,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:22:39,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:22:39,614 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:22:39,615 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:22:39,615 INFO L87 Difference]: Start difference. First operand 1399 states and 1990 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:22:39,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:22:39,636 INFO L93 Difference]: Finished difference Result 2089 states and 2974 transitions. [2025-01-09 04:22:39,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:22:39,636 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2025-01-09 04:22:39,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:22:39,638 INFO L225 Difference]: With dead ends: 2089 [2025-01-09 04:22:39,638 INFO L226 Difference]: Without dead ends: 715 [2025-01-09 04:22:39,640 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:22:39,640 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 36 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 169 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-01-09 04:22:39,640 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 169 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:22:39,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 715 states. [2025-01-09 04:22:39,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 715 to 713. [2025-01-09 04:22:39,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 713 states, 712 states have (on average 1.398876404494382) internal successors, (996), 712 states have internal predecessors, (996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:22:39,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 713 states to 713 states and 996 transitions. [2025-01-09 04:22:39,655 INFO L78 Accepts]: Start accepts. Automaton has 713 states and 996 transitions. Word has length 64 [2025-01-09 04:22:39,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:22:39,655 INFO L471 AbstractCegarLoop]: Abstraction has 713 states and 996 transitions. [2025-01-09 04:22:39,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:22:39,655 INFO L276 IsEmpty]: Start isEmpty. Operand 713 states and 996 transitions. [2025-01-09 04:22:39,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-01-09 04:22:39,656 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:22:39,656 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 04:22:39,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 04:22:39,656 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:22:39,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:22:39,656 INFO L85 PathProgramCache]: Analyzing trace with hash -968430482, now seen corresponding path program 1 times [2025-01-09 04:22:39,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:22:39,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657959877] [2025-01-09 04:22:39,657 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:22:39,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:22:39,664 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-01-09 04:22:39,675 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-01-09 04:22:39,675 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:22:39,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:22:40,819 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:22:40,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:22:40,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657959877] [2025-01-09 04:22:40,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657959877] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:22:40,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1417546479] [2025-01-09 04:22:40,820 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:22:40,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:22:40,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:22:40,823 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-01-09 04:22:40,824 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-01-09 04:22:40,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-01-09 04:22:40,909 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-01-09 04:22:40,909 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:22:40,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:22:40,913 INFO L256 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-09 04:22:40,917 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:22:41,328 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:22:41,328 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 04:22:41,986 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:22:41,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1417546479] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 04:22:41,986 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 04:22:41,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 27 [2025-01-09 04:22:41,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828541641] [2025-01-09 04:22:41,986 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 04:22:41,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-01-09 04:22:41,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:22:41,987 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-01-09 04:22:41,988 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=672, Unknown=0, NotChecked=0, Total=756 [2025-01-09 04:22:41,988 INFO L87 Difference]: Start difference. First operand 713 states and 996 transitions. Second operand has 28 states, 28 states have (on average 6.035714285714286) internal successors, (169), 27 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:22:52,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:22:52,078 INFO L93 Difference]: Finished difference Result 13505 states and 18903 transitions. [2025-01-09 04:22:52,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 212 states. [2025-01-09 04:22:52,078 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 6.035714285714286) internal successors, (169), 27 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2025-01-09 04:22:52,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:22:52,109 INFO L225 Difference]: With dead ends: 13505 [2025-01-09 04:22:52,109 INFO L226 Difference]: Without dead ends: 12817 [2025-01-09 04:22:52,125 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 347 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 235 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22403 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=6872, Invalid=49060, Unknown=0, NotChecked=0, Total=55932 [2025-01-09 04:22:52,126 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 5236 mSDsluCounter, 1410 mSDsCounter, 0 mSdLazyCounter, 1965 mSolverCounterSat, 219 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5236 SdHoareTripleChecker+Valid, 1517 SdHoareTripleChecker+Invalid, 2184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 219 IncrementalHoareTripleChecker+Valid, 1965 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-01-09 04:22:52,126 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5236 Valid, 1517 Invalid, 2184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [219 Valid, 1965 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-01-09 04:22:52,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12817 states. [2025-01-09 04:22:52,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12817 to 3539. [2025-01-09 04:22:52,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3539 states, 3538 states have (on average 1.3934426229508197) internal successors, (4930), 3538 states have internal predecessors, (4930), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:22:52,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3539 states to 3539 states and 4930 transitions. [2025-01-09 04:22:52,261 INFO L78 Accepts]: Start accepts. Automaton has 3539 states and 4930 transitions. Word has length 64 [2025-01-09 04:22:52,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:22:52,261 INFO L471 AbstractCegarLoop]: Abstraction has 3539 states and 4930 transitions. [2025-01-09 04:22:52,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 6.035714285714286) internal successors, (169), 27 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:22:52,262 INFO L276 IsEmpty]: Start isEmpty. Operand 3539 states and 4930 transitions. [2025-01-09 04:22:52,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-01-09 04:22:52,265 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:22:52,265 INFO L218 NwaCegarLoop]: trace histogram [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-01-09 04:22:52,272 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 04:22:52,470 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,SelfDestructingSolverStorable11 [2025-01-09 04:22:52,471 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:22:52,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:22:52,471 INFO L85 PathProgramCache]: Analyzing trace with hash -2142144208, now seen corresponding path program 1 times [2025-01-09 04:22:52,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:22:52,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189820058] [2025-01-09 04:22:52,472 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:22:52,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:22:52,479 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-01-09 04:22:52,484 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-01-09 04:22:52,484 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:22:52,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:22:52,506 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:22:52,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:22:52,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189820058] [2025-01-09 04:22:52,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189820058] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:22:52,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:22:52,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:22:52,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264788005] [2025-01-09 04:22:52,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:22:52,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:22:52,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:22:52,508 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:22:52,508 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:22:52,508 INFO L87 Difference]: Start difference. First operand 3539 states and 4930 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:22:52,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:22:52,571 INFO L93 Difference]: Finished difference Result 9822 states and 13653 transitions. [2025-01-09 04:22:52,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:22:52,572 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2025-01-09 04:22:52,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:22:52,588 INFO L225 Difference]: With dead ends: 9822 [2025-01-09 04:22:52,588 INFO L226 Difference]: Without dead ends: 6308 [2025-01-09 04:22:52,592 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:22:52,593 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 41 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:22:52,593 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 170 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:22:52,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6308 states. [2025-01-09 04:22:52,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6308 to 6306. [2025-01-09 04:22:52,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6306 states, 6305 states have (on average 1.3733544805709754) internal successors, (8659), 6305 states have internal predecessors, (8659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:22:52,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6306 states to 6306 states and 8659 transitions. [2025-01-09 04:22:52,731 INFO L78 Accepts]: Start accepts. Automaton has 6306 states and 8659 transitions. Word has length 66 [2025-01-09 04:22:52,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:22:52,732 INFO L471 AbstractCegarLoop]: Abstraction has 6306 states and 8659 transitions. [2025-01-09 04:22:52,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:22:52,732 INFO L276 IsEmpty]: Start isEmpty. Operand 6306 states and 8659 transitions. [2025-01-09 04:22:52,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-01-09 04:22:52,733 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:22:52,734 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 04:22:52,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 04:22:52,734 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:22:52,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:22:52,734 INFO L85 PathProgramCache]: Analyzing trace with hash -1867500306, now seen corresponding path program 1 times [2025-01-09 04:22:52,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:22:52,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227852223] [2025-01-09 04:22:52,734 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:22:52,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:22:52,741 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-01-09 04:22:52,747 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-01-09 04:22:52,747 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:22:52,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:22:52,772 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:22:52,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:22:52,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227852223] [2025-01-09 04:22:52,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227852223] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:22:52,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:22:52,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:22:52,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367694059] [2025-01-09 04:22:52,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:22:52,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:22:52,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:22:52,774 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:22:52,774 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:22:52,774 INFO L87 Difference]: Start difference. First operand 6306 states and 8659 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:22:52,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:22:52,908 INFO L93 Difference]: Finished difference Result 15877 states and 21628 transitions. [2025-01-09 04:22:52,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:22:52,910 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2025-01-09 04:22:52,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:22:52,933 INFO L225 Difference]: With dead ends: 15877 [2025-01-09 04:22:52,933 INFO L226 Difference]: Without dead ends: 9596 [2025-01-09 04:22:52,939 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:22:52,939 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 38 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:22:52,939 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 179 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:22:52,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9596 states. [2025-01-09 04:22:53,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9596 to 9594. [2025-01-09 04:22:53,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9594 states, 9593 states have (on average 1.3273220056291046) internal successors, (12733), 9593 states have internal predecessors, (12733), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:22:53,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9594 states to 9594 states and 12733 transitions. [2025-01-09 04:22:53,161 INFO L78 Accepts]: Start accepts. Automaton has 9594 states and 12733 transitions. Word has length 66 [2025-01-09 04:22:53,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:22:53,162 INFO L471 AbstractCegarLoop]: Abstraction has 9594 states and 12733 transitions. [2025-01-09 04:22:53,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:22:53,162 INFO L276 IsEmpty]: Start isEmpty. Operand 9594 states and 12733 transitions. [2025-01-09 04:22:53,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-01-09 04:22:53,166 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:22:53,166 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 04:22:53,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 04:22:53,166 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:22:53,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:22:53,166 INFO L85 PathProgramCache]: Analyzing trace with hash -477253090, now seen corresponding path program 1 times [2025-01-09 04:22:53,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:22:53,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517747685] [2025-01-09 04:22:53,167 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:22:53,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:22:53,173 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-01-09 04:22:53,181 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-01-09 04:22:53,182 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:22:53,182 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:22:53,231 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:22:53,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:22:53,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517747685] [2025-01-09 04:22:53,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517747685] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:22:53,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:22:53,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:22:53,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47231607] [2025-01-09 04:22:53,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:22:53,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:22:53,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:22:53,233 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:22:53,233 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:22:53,233 INFO L87 Difference]: Start difference. First operand 9594 states and 12733 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:22:53,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:22:53,326 INFO L93 Difference]: Finished difference Result 14388 states and 19109 transitions. [2025-01-09 04:22:53,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:22:53,327 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2025-01-09 04:22:53,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:22:53,335 INFO L225 Difference]: With dead ends: 14388 [2025-01-09 04:22:53,336 INFO L226 Difference]: Without dead ends: 4819 [2025-01-09 04:22:53,344 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:22:53,345 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 24 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 156 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-01-09 04:22:53,345 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 156 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:22:53,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4819 states. [2025-01-09 04:22:53,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4819 to 4817. [2025-01-09 04:22:53,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4817 states, 4816 states have (on average 1.3064784053156147) internal successors, (6292), 4816 states have internal predecessors, (6292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:22:53,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4817 states to 4817 states and 6292 transitions. [2025-01-09 04:22:53,468 INFO L78 Accepts]: Start accepts. Automaton has 4817 states and 6292 transitions. Word has length 66 [2025-01-09 04:22:53,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:22:53,468 INFO L471 AbstractCegarLoop]: Abstraction has 4817 states and 6292 transitions. [2025-01-09 04:22:53,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:22:53,468 INFO L276 IsEmpty]: Start isEmpty. Operand 4817 states and 6292 transitions. [2025-01-09 04:22:53,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-01-09 04:22:53,470 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:22:53,470 INFO L218 NwaCegarLoop]: trace histogram [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-01-09 04:22:53,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 04:22:53,470 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:22:53,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:22:53,471 INFO L85 PathProgramCache]: Analyzing trace with hash 1094297406, now seen corresponding path program 1 times [2025-01-09 04:22:53,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:22:53,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209476794] [2025-01-09 04:22:53,471 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:22:53,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:22:53,479 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-01-09 04:22:53,493 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-01-09 04:22:53,493 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:22:53,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:22:53,806 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:22:53,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:22:53,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209476794] [2025-01-09 04:22:53,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209476794] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:22:53,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1111625124] [2025-01-09 04:22:53,806 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:22:53,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:22:53,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:22:53,809 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-01-09 04:22:53,809 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-01-09 04:22:53,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-01-09 04:22:53,878 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-01-09 04:22:53,878 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:22:53,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:22:53,882 INFO L256 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-01-09 04:22:53,884 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:22:54,051 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:22:54,051 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 04:22:54,256 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:22:54,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1111625124] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 04:22:54,256 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 04:22:54,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 8] total 20 [2025-01-09 04:22:54,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459520537] [2025-01-09 04:22:54,256 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 04:22:54,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-01-09 04:22:54,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:22:54,257 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-01-09 04:22:54,257 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=330, Unknown=0, NotChecked=0, Total=380 [2025-01-09 04:22:54,257 INFO L87 Difference]: Start difference. First operand 4817 states and 6292 transitions. Second operand has 20 states, 20 states have (on average 9.55) internal successors, (191), 20 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:22:57,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:22:57,630 INFO L93 Difference]: Finished difference Result 34773 states and 44500 transitions. [2025-01-09 04:22:57,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2025-01-09 04:22:57,631 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 9.55) internal successors, (191), 20 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2025-01-09 04:22:57,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:22:57,674 INFO L225 Difference]: With dead ends: 34773 [2025-01-09 04:22:57,674 INFO L226 Difference]: Without dead ends: 30175 [2025-01-09 04:22:57,682 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4554 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=2047, Invalid=10835, Unknown=0, NotChecked=0, Total=12882 [2025-01-09 04:22:57,683 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 2109 mSDsluCounter, 748 mSDsCounter, 0 mSdLazyCounter, 877 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2109 SdHoareTripleChecker+Valid, 822 SdHoareTripleChecker+Invalid, 943 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 877 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 04:22:57,683 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2109 Valid, 822 Invalid, 943 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 877 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 04:22:57,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30175 states. [2025-01-09 04:22:58,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30175 to 24210. [2025-01-09 04:22:58,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24210 states, 24209 states have (on average 1.2453632946424884) internal successors, (30149), 24209 states have internal predecessors, (30149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:22:58,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24210 states to 24210 states and 30149 transitions. [2025-01-09 04:22:58,205 INFO L78 Accepts]: Start accepts. Automaton has 24210 states and 30149 transitions. Word has length 66 [2025-01-09 04:22:58,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:22:58,205 INFO L471 AbstractCegarLoop]: Abstraction has 24210 states and 30149 transitions. [2025-01-09 04:22:58,205 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 9.55) internal successors, (191), 20 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:22:58,205 INFO L276 IsEmpty]: Start isEmpty. Operand 24210 states and 30149 transitions. [2025-01-09 04:22:58,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-01-09 04:22:58,207 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:22:58,207 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 04:22:58,213 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 04:22:58,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-01-09 04:22:58,411 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:22:58,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:22:58,411 INFO L85 PathProgramCache]: Analyzing trace with hash 253034222, now seen corresponding path program 1 times [2025-01-09 04:22:58,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:22:58,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127440072] [2025-01-09 04:22:58,411 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:22:58,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:22:58,417 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-01-09 04:22:58,422 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-01-09 04:22:58,423 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:22:58,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:22:58,447 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:22:58,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:22:58,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127440072] [2025-01-09 04:22:58,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127440072] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:22:58,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:22:58,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:22:58,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856902436] [2025-01-09 04:22:58,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:22:58,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:22:58,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:22:58,449 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:22:58,449 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:22:58,449 INFO L87 Difference]: Start difference. First operand 24210 states and 30149 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:22:58,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:22:58,772 INFO L93 Difference]: Finished difference Result 32489 states and 40408 transitions. [2025-01-09 04:22:58,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:22:58,772 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2025-01-09 04:22:58,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:22:58,799 INFO L225 Difference]: With dead ends: 32489 [2025-01-09 04:22:58,799 INFO L226 Difference]: Without dead ends: 20771 [2025-01-09 04:22:58,810 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:22:58,811 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 38 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:22:58,811 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 215 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:22:58,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20771 states. [2025-01-09 04:22:59,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20771 to 20260. [2025-01-09 04:22:59,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20260 states, 20259 states have (on average 1.230416111357915) internal successors, (24927), 20259 states have internal predecessors, (24927), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:22:59,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20260 states to 20260 states and 24927 transitions. [2025-01-09 04:22:59,241 INFO L78 Accepts]: Start accepts. Automaton has 20260 states and 24927 transitions. Word has length 66 [2025-01-09 04:22:59,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:22:59,241 INFO L471 AbstractCegarLoop]: Abstraction has 20260 states and 24927 transitions. [2025-01-09 04:22:59,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:22:59,242 INFO L276 IsEmpty]: Start isEmpty. Operand 20260 states and 24927 transitions. [2025-01-09 04:22:59,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-01-09 04:22:59,243 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:22:59,243 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:22:59,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 04:22:59,243 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:22:59,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:22:59,244 INFO L85 PathProgramCache]: Analyzing trace with hash 149008970, now seen corresponding path program 1 times [2025-01-09 04:22:59,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:22:59,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232524734] [2025-01-09 04:22:59,244 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:22:59,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:22:59,250 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-01-09 04:22:59,254 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-01-09 04:22:59,255 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:22:59,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:22:59,305 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 04:22:59,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:22:59,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232524734] [2025-01-09 04:22:59,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232524734] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:22:59,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:22:59,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:22:59,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953862184] [2025-01-09 04:22:59,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:22:59,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:22:59,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:22:59,307 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:22:59,307 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:22:59,307 INFO L87 Difference]: Start difference. First operand 20260 states and 24927 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:22:59,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:22:59,876 INFO L93 Difference]: Finished difference Result 25972 states and 32202 transitions. [2025-01-09 04:22:59,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:22:59,876 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2025-01-09 04:22:59,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:22:59,909 INFO L225 Difference]: With dead ends: 25972 [2025-01-09 04:22:59,909 INFO L226 Difference]: Without dead ends: 23612 [2025-01-09 04:22:59,917 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:22:59,918 INFO L435 NwaCegarLoop]: 153 mSDtfsCounter, 223 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:22:59,919 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 415 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:22:59,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23612 states. [2025-01-09 04:23:00,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23612 to 22495. [2025-01-09 04:23:00,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22495 states, 22494 states have (on average 1.2304170000889125) internal successors, (27677), 22494 states have internal predecessors, (27677), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:23:00,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22495 states to 22495 states and 27677 transitions. [2025-01-09 04:23:00,558 INFO L78 Accepts]: Start accepts. Automaton has 22495 states and 27677 transitions. Word has length 67 [2025-01-09 04:23:00,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:23:00,558 INFO L471 AbstractCegarLoop]: Abstraction has 22495 states and 27677 transitions. [2025-01-09 04:23:00,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:23:00,558 INFO L276 IsEmpty]: Start isEmpty. Operand 22495 states and 27677 transitions. [2025-01-09 04:23:00,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-01-09 04:23:00,560 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:23:00,560 INFO L218 NwaCegarLoop]: trace histogram [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-01-09 04:23:00,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 04:23:00,560 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:23:00,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:23:00,560 INFO L85 PathProgramCache]: Analyzing trace with hash -1224377128, now seen corresponding path program 1 times [2025-01-09 04:23:00,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:23:00,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627613489] [2025-01-09 04:23:00,561 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:23:00,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:23:00,567 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-01-09 04:23:00,581 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-01-09 04:23:00,582 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:23:00,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:23:00,753 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:23:00,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:23:00,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627613489] [2025-01-09 04:23:00,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1627613489] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:23:00,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1347065552] [2025-01-09 04:23:00,754 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:23:00,754 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:23:00,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:23:00,756 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 04:23:00,758 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 04:23:00,801 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-01-09 04:23:00,829 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-01-09 04:23:00,829 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:23:00,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:23:00,830 INFO L256 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-01-09 04:23:00,832 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:23:01,710 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:23:01,710 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 04:23:03,850 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:23:03,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1347065552] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 04:23:03,850 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 04:23:03,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 18, 19] total 43 [2025-01-09 04:23:03,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062918406] [2025-01-09 04:23:03,851 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 04:23:03,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2025-01-09 04:23:03,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:23:03,851 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2025-01-09 04:23:03,851 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=206, Invalid=1600, Unknown=0, NotChecked=0, Total=1806 [2025-01-09 04:23:03,852 INFO L87 Difference]: Start difference. First operand 22495 states and 27677 transitions. Second operand has 43 states, 43 states have (on average 4.3023255813953485) internal successors, (185), 43 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)