./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.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.4.1.ufo.BOUNDED-8.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 308b0e1adc3ae7348985993203af7f0b3a83352e3d43ffbdb40ed727e63d4081 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 04:22:38,287 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 04:22:38,352 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:38,359 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 04:22:38,360 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 04:22:38,389 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 04:22:38,390 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 04:22:38,390 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 04:22:38,391 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 04:22:38,391 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 04:22:38,391 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 04:22:38,391 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 04:22:38,392 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 04:22:38,392 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 04:22:38,392 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 04:22:38,392 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 04:22:38,392 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 04:22:38,392 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 04:22:38,393 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 04:22:38,393 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 04:22:38,393 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 04:22:38,393 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 04:22:38,393 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 04:22:38,393 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 04:22:38,393 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 04:22:38,393 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 04:22:38,393 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 04:22:38,394 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 04:22:38,394 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 04:22:38,394 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 04:22:38,394 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 04:22:38,394 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 04:22:38,394 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:22:38,394 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 04:22:38,394 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 04:22:38,395 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 04:22:38,395 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 04:22:38,395 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:22:38,395 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 04:22:38,395 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 04:22:38,395 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 04:22:38,395 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 04:22:38,395 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 04:22:38,395 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 04:22:38,396 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 04:22:38,396 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 04:22:38,396 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 04:22:38,396 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 04:22:38,396 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 -> 308b0e1adc3ae7348985993203af7f0b3a83352e3d43ffbdb40ed727e63d4081 [2025-01-09 04:22:38,652 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 04:22:38,661 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 04:22:38,665 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 04:22:38,666 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 04:22:38,666 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 04:22:38,667 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.4.1.ufo.BOUNDED-8.pals.c [2025-01-09 04:22:40,066 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/dde72f867/2560a4dd59e84903825d07f7d6314d52/FLAGd55235bbb [2025-01-09 04:22:40,347 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 04:22:40,348 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c [2025-01-09 04:22:40,372 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/dde72f867/2560a4dd59e84903825d07f7d6314d52/FLAGd55235bbb [2025-01-09 04:22:40,392 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/dde72f867/2560a4dd59e84903825d07f7d6314d52 [2025-01-09 04:22:40,394 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 04:22:40,396 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 04:22:40,397 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 04:22:40,398 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 04:22:40,402 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 04:22:40,403 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:22:40" (1/1) ... [2025-01-09 04:22:40,404 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@558a3717 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:22:40, skipping insertion in model container [2025-01-09 04:22:40,404 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:22:40" (1/1) ... [2025-01-09 04:22:40,427 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 04:22:40,624 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.4.1.ufo.BOUNDED-8.pals.c[9433,9446] [2025-01-09 04:22:40,629 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 04:22:40,637 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 04:22:40,678 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.4.1.ufo.BOUNDED-8.pals.c[9433,9446] [2025-01-09 04:22:40,679 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 04:22:40,691 INFO L204 MainTranslator]: Completed translation [2025-01-09 04:22:40,692 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:22:40 WrapperNode [2025-01-09 04:22:40,693 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 04:22:40,694 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 04:22:40,694 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 04:22:40,694 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 04:22:40,700 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:40" (1/1) ... [2025-01-09 04:22:40,708 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:40" (1/1) ... [2025-01-09 04:22:40,735 INFO L138 Inliner]: procedures = 22, calls = 14, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 313 [2025-01-09 04:22:40,736 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 04:22:40,736 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 04:22:40,736 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 04:22:40,737 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 04:22:40,748 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:40" (1/1) ... [2025-01-09 04:22:40,749 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:40" (1/1) ... [2025-01-09 04:22:40,751 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:40" (1/1) ... [2025-01-09 04:22:40,764 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:40,765 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:40" (1/1) ... [2025-01-09 04:22:40,765 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:40" (1/1) ... [2025-01-09 04:22:40,774 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:40" (1/1) ... [2025-01-09 04:22:40,775 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:40" (1/1) ... [2025-01-09 04:22:40,784 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:40" (1/1) ... [2025-01-09 04:22:40,785 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:40" (1/1) ... [2025-01-09 04:22:40,786 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:40" (1/1) ... [2025-01-09 04:22:40,791 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 04:22:40,792 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 04:22:40,793 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 04:22:40,793 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 04:22:40,795 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:22:40" (1/1) ... [2025-01-09 04:22:40,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:22:40,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:22:40,820 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:40,823 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:40,842 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 04:22:40,842 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 04:22:40,843 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 04:22:40,843 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 04:22:40,916 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 04:22:40,918 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 04:22:41,342 INFO L? ?]: Removed 37 outVars from TransFormulas that were not future-live. [2025-01-09 04:22:41,342 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 04:22:41,354 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 04:22:41,354 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 04:22:41,356 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:22:41 BoogieIcfgContainer [2025-01-09 04:22:41,356 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 04:22:41,359 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 04:22:41,359 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 04:22:41,363 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 04:22:41,363 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:22:40" (1/3) ... [2025-01-09 04:22:41,364 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22c06165 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:22:41, skipping insertion in model container [2025-01-09 04:22:41,365 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:22:40" (2/3) ... [2025-01-09 04:22:41,365 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22c06165 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:22:41, skipping insertion in model container [2025-01-09 04:22:41,366 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:22:41" (3/3) ... [2025-01-09 04:22:41,367 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c [2025-01-09 04:22:41,377 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 04:22:41,380 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c that has 1 procedures, 83 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 04:22:41,427 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 04:22:41,436 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;@f4649fc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 04:22:41,436 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 04:22:41,440 INFO L276 IsEmpty]: Start isEmpty. Operand has 83 states, 81 states have (on average 1.728395061728395) internal successors, (140), 82 states have internal predecessors, (140), 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:41,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-01-09 04:22:41,445 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:22:41,445 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] [2025-01-09 04:22:41,445 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:22:41,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:22:41,449 INFO L85 PathProgramCache]: Analyzing trace with hash 1938082847, now seen corresponding path program 1 times [2025-01-09 04:22:41,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:22:41,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520040051] [2025-01-09 04:22:41,455 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:22:41,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:22:41,530 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-09 04:22:41,572 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-09 04:22:41,572 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:22:41,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:22:41,689 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:41,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:22:41,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520040051] [2025-01-09 04:22:41,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520040051] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:22:41,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:22:41,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 04:22:41,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451677884] [2025-01-09 04:22:41,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:22:41,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 04:22:41,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:22:41,709 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 04:22:41,709 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 04:22:41,711 INFO L87 Difference]: Start difference. First operand has 83 states, 81 states have (on average 1.728395061728395) internal successors, (140), 82 states have internal predecessors, (140), 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 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 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:41,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:22:41,726 INFO L93 Difference]: Finished difference Result 137 states and 226 transitions. [2025-01-09 04:22:41,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 04:22:41,728 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 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 29 [2025-01-09 04:22:41,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:22:41,733 INFO L225 Difference]: With dead ends: 137 [2025-01-09 04:22:41,733 INFO L226 Difference]: Without dead ends: 80 [2025-01-09 04:22:41,736 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 04:22:41,739 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:22:41,740 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:22:41,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2025-01-09 04:22:41,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2025-01-09 04:22:41,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 79 states have (on average 1.7088607594936709) internal successors, (135), 79 states have internal predecessors, (135), 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:41,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 135 transitions. [2025-01-09 04:22:41,783 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 135 transitions. Word has length 29 [2025-01-09 04:22:41,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:22:41,783 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 135 transitions. [2025-01-09 04:22:41,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 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:41,784 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 135 transitions. [2025-01-09 04:22:41,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-01-09 04:22:41,785 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:22:41,785 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] [2025-01-09 04:22:41,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 04:22:41,785 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:22:41,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:22:41,786 INFO L85 PathProgramCache]: Analyzing trace with hash 1804069341, now seen corresponding path program 1 times [2025-01-09 04:22:41,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:22:41,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776129751] [2025-01-09 04:22:41,787 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:22:41,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:22:41,802 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-09 04:22:41,830 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-09 04:22:41,830 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:22:41,830 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:22:42,025 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:42,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:22:42,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776129751] [2025-01-09 04:22:42,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776129751] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:22:42,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:22:42,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:22:42,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773116522] [2025-01-09 04:22:42,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:22:42,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:22:42,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:22:42,028 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:22:42,028 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:22:42,028 INFO L87 Difference]: Start difference. First operand 80 states and 135 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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:42,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:22:42,128 INFO L93 Difference]: Finished difference Result 184 states and 301 transitions. [2025-01-09 04:22:42,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:22:42,132 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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 29 [2025-01-09 04:22:42,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:22:42,134 INFO L225 Difference]: With dead ends: 184 [2025-01-09 04:22:42,134 INFO L226 Difference]: Without dead ends: 130 [2025-01-09 04:22:42,135 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:42,136 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 80 mSDsluCounter, 363 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:22:42,137 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 494 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:22:42,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2025-01-09 04:22:42,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 80. [2025-01-09 04:22:42,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 79 states have (on average 1.4050632911392404) internal successors, (111), 79 states have internal predecessors, (111), 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:42,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 111 transitions. [2025-01-09 04:22:42,145 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 111 transitions. Word has length 29 [2025-01-09 04:22:42,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:22:42,146 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 111 transitions. [2025-01-09 04:22:42,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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:42,146 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 111 transitions. [2025-01-09 04:22:42,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-01-09 04:22:42,147 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:22:42,147 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:22:42,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 04:22:42,148 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:22:42,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:22:42,148 INFO L85 PathProgramCache]: Analyzing trace with hash -1501861418, now seen corresponding path program 1 times [2025-01-09 04:22:42,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:22:42,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147538732] [2025-01-09 04:22:42,149 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:22:42,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:22:42,170 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-01-09 04:22:42,191 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-01-09 04:22:42,191 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:22:42,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:22:42,264 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:42,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:22:42,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147538732] [2025-01-09 04:22:42,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147538732] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:22:42,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:22:42,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:22:42,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812021575] [2025-01-09 04:22:42,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:22:42,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:22:42,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:22:42,265 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:22:42,265 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:22:42,265 INFO L87 Difference]: Start difference. First operand 80 states and 111 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 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:42,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:22:42,301 INFO L93 Difference]: Finished difference Result 172 states and 259 transitions. [2025-01-09 04:22:42,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:22:42,302 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 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 52 [2025-01-09 04:22:42,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:22:42,303 INFO L225 Difference]: With dead ends: 172 [2025-01-09 04:22:42,303 INFO L226 Difference]: Without dead ends: 122 [2025-01-09 04:22:42,304 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:42,304 INFO L435 NwaCegarLoop]: 174 mSDtfsCounter, 69 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 252 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:42,304 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 252 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:42,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2025-01-09 04:22:42,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 120. [2025-01-09 04:22:42,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 119 states have (on average 1.4789915966386555) internal successors, (176), 119 states have internal predecessors, (176), 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:42,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 176 transitions. [2025-01-09 04:22:42,312 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 176 transitions. Word has length 52 [2025-01-09 04:22:42,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:22:42,313 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 176 transitions. [2025-01-09 04:22:42,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 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:42,313 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 176 transitions. [2025-01-09 04:22:42,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-01-09 04:22:42,317 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:22:42,317 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:22:42,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 04:22:42,318 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:22:42,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:22:42,318 INFO L85 PathProgramCache]: Analyzing trace with hash -2101178857, now seen corresponding path program 1 times [2025-01-09 04:22:42,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:22:42,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926659190] [2025-01-09 04:22:42,318 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:22:42,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:22:42,340 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-01-09 04:22:42,356 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-01-09 04:22:42,356 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:22:42,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:22:42,534 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:42,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:22:42,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926659190] [2025-01-09 04:22:42,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926659190] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:22:42,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:22:42,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:22:42,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499335178] [2025-01-09 04:22:42,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:22:42,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:22:42,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:22:42,537 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:22:42,540 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:22:42,540 INFO L87 Difference]: Start difference. First operand 120 states and 176 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 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:42,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:22:42,685 INFO L93 Difference]: Finished difference Result 570 states and 906 transitions. [2025-01-09 04:22:42,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 04:22:42,686 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 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 52 [2025-01-09 04:22:42,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:22:42,689 INFO L225 Difference]: With dead ends: 570 [2025-01-09 04:22:42,692 INFO L226 Difference]: Without dead ends: 480 [2025-01-09 04:22:42,693 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:22:42,694 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 748 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 748 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:22:42,694 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [748 Valid, 483 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:22:42,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2025-01-09 04:22:42,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 208. [2025-01-09 04:22:42,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 207 states have (on average 1.5314009661835748) internal successors, (317), 207 states have internal predecessors, (317), 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:42,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 317 transitions. [2025-01-09 04:22:42,714 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 317 transitions. Word has length 52 [2025-01-09 04:22:42,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:22:42,714 INFO L471 AbstractCegarLoop]: Abstraction has 208 states and 317 transitions. [2025-01-09 04:22:42,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 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:42,715 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 317 transitions. [2025-01-09 04:22:42,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-01-09 04:22:42,715 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:22:42,716 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:22:42,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 04:22:42,716 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:22:42,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:22:42,717 INFO L85 PathProgramCache]: Analyzing trace with hash -1095358508, now seen corresponding path program 1 times [2025-01-09 04:22:42,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:22:42,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657408269] [2025-01-09 04:22:42,717 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:22:42,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:22:42,730 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-01-09 04:22:42,761 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-01-09 04:22:42,762 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:22:42,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:22:43,116 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:43,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:22:43,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657408269] [2025-01-09 04:22:43,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657408269] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:22:43,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:22:43,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:22:43,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99981613] [2025-01-09 04:22:43,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:22:43,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 04:22:43,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:22:43,118 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 04:22:43,118 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 04:22:43,118 INFO L87 Difference]: Start difference. First operand 208 states and 317 transitions. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 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:43,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:22:43,173 INFO L93 Difference]: Finished difference Result 222 states and 334 transitions. [2025-01-09 04:22:43,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 04:22:43,174 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 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 53 [2025-01-09 04:22:43,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:22:43,175 INFO L225 Difference]: With dead ends: 222 [2025-01-09 04:22:43,175 INFO L226 Difference]: Without dead ends: 220 [2025-01-09 04:22:43,176 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 04:22:43,177 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 0 mSDsluCounter, 615 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 720 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:22:43,178 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 720 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:22:43,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2025-01-09 04:22:43,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 220. [2025-01-09 04:22:43,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 219 states have (on average 1.5022831050228311) internal successors, (329), 219 states have internal predecessors, (329), 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:43,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 329 transitions. [2025-01-09 04:22:43,197 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 329 transitions. Word has length 53 [2025-01-09 04:22:43,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:22:43,197 INFO L471 AbstractCegarLoop]: Abstraction has 220 states and 329 transitions. [2025-01-09 04:22:43,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 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:43,197 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 329 transitions. [2025-01-09 04:22:43,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-01-09 04:22:43,202 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:22:43,202 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:22:43,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 04:22:43,202 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:22:43,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:22:43,203 INFO L85 PathProgramCache]: Analyzing trace with hash 456203151, now seen corresponding path program 1 times [2025-01-09 04:22:43,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:22:43,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469474044] [2025-01-09 04:22:43,203 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:22:43,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:22:43,221 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-01-09 04:22:43,235 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-01-09 04:22:43,236 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:22:43,236 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:22:43,300 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:43,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:22:43,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469474044] [2025-01-09 04:22:43,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469474044] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:22:43,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:22:43,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:22:43,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381044044] [2025-01-09 04:22:43,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:22:43,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:22:43,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:22:43,301 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:22:43,301 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:22:43,302 INFO L87 Difference]: Start difference. First operand 220 states and 329 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 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:43,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:22:43,328 INFO L93 Difference]: Finished difference Result 501 states and 770 transitions. [2025-01-09 04:22:43,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:22:43,329 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 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 54 [2025-01-09 04:22:43,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:22:43,330 INFO L225 Difference]: With dead ends: 501 [2025-01-09 04:22:43,331 INFO L226 Difference]: Without dead ends: 311 [2025-01-09 04:22:43,331 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:43,332 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 50 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:22:43,332 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 187 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:22:43,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2025-01-09 04:22:43,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 309. [2025-01-09 04:22:43,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 308 states have (on average 1.5194805194805194) internal successors, (468), 308 states have internal predecessors, (468), 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:43,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 468 transitions. [2025-01-09 04:22:43,351 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 468 transitions. Word has length 54 [2025-01-09 04:22:43,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:22:43,352 INFO L471 AbstractCegarLoop]: Abstraction has 309 states and 468 transitions. [2025-01-09 04:22:43,352 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 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:43,352 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 468 transitions. [2025-01-09 04:22:43,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-01-09 04:22:43,353 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:22:43,353 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:22:43,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 04:22:43,355 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:22:43,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:22:43,355 INFO L85 PathProgramCache]: Analyzing trace with hash 223285165, now seen corresponding path program 1 times [2025-01-09 04:22:43,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:22:43,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327024713] [2025-01-09 04:22:43,355 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:22:43,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:22:43,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-01-09 04:22:43,379 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-01-09 04:22:43,380 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:22:43,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:22:43,482 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:43,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:22:43,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327024713] [2025-01-09 04:22:43,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327024713] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:22:43,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:22:43,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:22:43,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189719051] [2025-01-09 04:22:43,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:22:43,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:22:43,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:22:43,484 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:22:43,485 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:22:43,485 INFO L87 Difference]: Start difference. First operand 309 states and 468 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 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:43,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:22:43,517 INFO L93 Difference]: Finished difference Result 815 states and 1256 transitions. [2025-01-09 04:22:43,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:22:43,517 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 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 55 [2025-01-09 04:22:43,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:22:43,520 INFO L225 Difference]: With dead ends: 815 [2025-01-09 04:22:43,521 INFO L226 Difference]: Without dead ends: 538 [2025-01-09 04:22:43,521 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:43,522 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 57 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 223 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:43,522 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 223 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:43,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2025-01-09 04:22:43,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 536. [2025-01-09 04:22:43,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 536 states, 535 states have (on average 1.519626168224299) internal successors, (813), 535 states have internal predecessors, (813), 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:43,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 813 transitions. [2025-01-09 04:22:43,546 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 813 transitions. Word has length 55 [2025-01-09 04:22:43,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:22:43,547 INFO L471 AbstractCegarLoop]: Abstraction has 536 states and 813 transitions. [2025-01-09 04:22:43,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 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:43,547 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 813 transitions. [2025-01-09 04:22:43,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-01-09 04:22:43,550 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:22:43,550 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:22:43,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 04:22:43,551 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:22:43,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:22:43,551 INFO L85 PathProgramCache]: Analyzing trace with hash -1577403763, now seen corresponding path program 1 times [2025-01-09 04:22:43,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:22:43,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608963146] [2025-01-09 04:22:43,551 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:22:43,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:22:43,566 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-01-09 04:22:43,577 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-01-09 04:22:43,577 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:22:43,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:22:43,628 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:43,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:22:43,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608963146] [2025-01-09 04:22:43,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608963146] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:22:43,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:22:43,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:22:43,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934688515] [2025-01-09 04:22:43,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:22:43,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:22:43,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:22:43,630 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:22:43,630 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:22:43,630 INFO L87 Difference]: Start difference. First operand 536 states and 813 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 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:43,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:22:43,663 INFO L93 Difference]: Finished difference Result 1448 states and 2207 transitions. [2025-01-09 04:22:43,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:22:43,663 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 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 55 [2025-01-09 04:22:43,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:22:43,667 INFO L225 Difference]: With dead ends: 1448 [2025-01-09 04:22:43,667 INFO L226 Difference]: Without dead ends: 944 [2025-01-09 04:22:43,668 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:43,669 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 61 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 236 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:43,669 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 236 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:43,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 944 states. [2025-01-09 04:22:43,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 944 to 942. [2025-01-09 04:22:43,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 942 states, 941 states have (on average 1.5015940488841657) internal successors, (1413), 941 states have internal predecessors, (1413), 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:43,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 942 states to 942 states and 1413 transitions. [2025-01-09 04:22:43,696 INFO L78 Accepts]: Start accepts. Automaton has 942 states and 1413 transitions. Word has length 55 [2025-01-09 04:22:43,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:22:43,696 INFO L471 AbstractCegarLoop]: Abstraction has 942 states and 1413 transitions. [2025-01-09 04:22:43,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 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:43,697 INFO L276 IsEmpty]: Start isEmpty. Operand 942 states and 1413 transitions. [2025-01-09 04:22:43,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-01-09 04:22:43,697 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:22:43,697 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:22:43,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 04:22:43,698 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:22:43,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:22:43,698 INFO L85 PathProgramCache]: Analyzing trace with hash 1360393581, now seen corresponding path program 1 times [2025-01-09 04:22:43,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:22:43,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892368483] [2025-01-09 04:22:43,699 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:22:43,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:22:43,708 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-01-09 04:22:43,715 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-01-09 04:22:43,716 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:22:43,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:22:43,755 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:43,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:22:43,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892368483] [2025-01-09 04:22:43,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892368483] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:22:43,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:22:43,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:22:43,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348612471] [2025-01-09 04:22:43,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:22:43,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:22:43,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:22:43,757 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:22:43,757 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:22:43,757 INFO L87 Difference]: Start difference. First operand 942 states and 1413 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 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:43,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:22:43,801 INFO L93 Difference]: Finished difference Result 2570 states and 3839 transitions. [2025-01-09 04:22:43,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:22:43,801 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 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 55 [2025-01-09 04:22:43,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:22:43,809 INFO L225 Difference]: With dead ends: 2570 [2025-01-09 04:22:43,809 INFO L226 Difference]: Without dead ends: 1660 [2025-01-09 04:22:43,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:43,811 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 65 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 249 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:43,811 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 249 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:43,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1660 states. [2025-01-09 04:22:43,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1660 to 1658. [2025-01-09 04:22:43,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1658 states, 1657 states have (on average 1.468316234158117) internal successors, (2433), 1657 states have internal predecessors, (2433), 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:43,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1658 states to 1658 states and 2433 transitions. [2025-01-09 04:22:43,883 INFO L78 Accepts]: Start accepts. Automaton has 1658 states and 2433 transitions. Word has length 55 [2025-01-09 04:22:43,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:22:43,884 INFO L471 AbstractCegarLoop]: Abstraction has 1658 states and 2433 transitions. [2025-01-09 04:22:43,884 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 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:43,884 INFO L276 IsEmpty]: Start isEmpty. Operand 1658 states and 2433 transitions. [2025-01-09 04:22:43,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-01-09 04:22:43,886 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:22:43,886 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:22:43,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 04:22:43,886 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:22:43,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:22:43,888 INFO L85 PathProgramCache]: Analyzing trace with hash -1736131337, now seen corresponding path program 1 times [2025-01-09 04:22:43,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:22:43,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113901539] [2025-01-09 04:22:43,888 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:22:43,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:22:43,902 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-01-09 04:22:43,929 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-01-09 04:22:43,930 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:22:43,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:22:44,034 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:22:44,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:22:44,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113901539] [2025-01-09 04:22:44,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113901539] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:22:44,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:22:44,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:22:44,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787641655] [2025-01-09 04:22:44,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:22:44,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:22:44,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:22:44,036 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:22:44,036 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:22:44,036 INFO L87 Difference]: Start difference. First operand 1658 states and 2433 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 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:44,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:22:44,088 INFO L93 Difference]: Finished difference Result 3286 states and 4835 transitions. [2025-01-09 04:22:44,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:22:44,089 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 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 77 [2025-01-09 04:22:44,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:22:44,096 INFO L225 Difference]: With dead ends: 3286 [2025-01-09 04:22:44,096 INFO L226 Difference]: Without dead ends: 1660 [2025-01-09 04:22:44,099 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:44,100 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 54 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 240 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:44,101 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 240 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:44,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1660 states. [2025-01-09 04:22:44,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1660 to 1658. [2025-01-09 04:22:44,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1658 states, 1657 states have (on average 1.4538322269161135) internal successors, (2409), 1657 states have internal predecessors, (2409), 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:44,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1658 states to 1658 states and 2409 transitions. [2025-01-09 04:22:44,168 INFO L78 Accepts]: Start accepts. Automaton has 1658 states and 2409 transitions. Word has length 77 [2025-01-09 04:22:44,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:22:44,169 INFO L471 AbstractCegarLoop]: Abstraction has 1658 states and 2409 transitions. [2025-01-09 04:22:44,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 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:44,170 INFO L276 IsEmpty]: Start isEmpty. Operand 1658 states and 2409 transitions. [2025-01-09 04:22:44,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-01-09 04:22:44,171 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:22:44,173 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:22:44,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 04:22:44,174 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:22:44,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:22:44,174 INFO L85 PathProgramCache]: Analyzing trace with hash -336626570, now seen corresponding path program 1 times [2025-01-09 04:22:44,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:22:44,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047705380] [2025-01-09 04:22:44,174 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:22:44,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:22:44,196 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-01-09 04:22:44,220 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-01-09 04:22:44,220 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:22:44,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:22:44,317 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:22:44,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:22:44,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047705380] [2025-01-09 04:22:44,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047705380] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:22:44,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:22:44,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:22:44,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144900199] [2025-01-09 04:22:44,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:22:44,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:22:44,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:22:44,319 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:22:44,319 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:22:44,320 INFO L87 Difference]: Start difference. First operand 1658 states and 2409 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 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:44,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:22:44,358 INFO L93 Difference]: Finished difference Result 2474 states and 3599 transitions. [2025-01-09 04:22:44,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:22:44,359 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 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 77 [2025-01-09 04:22:44,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:22:44,363 INFO L225 Difference]: With dead ends: 2474 [2025-01-09 04:22:44,363 INFO L226 Difference]: Without dead ends: 848 [2025-01-09 04:22:44,365 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:44,366 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 48 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 221 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:44,366 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 221 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:44,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 848 states. [2025-01-09 04:22:44,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 848 to 846. [2025-01-09 04:22:44,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 846 states, 845 states have (on average 1.4307692307692308) internal successors, (1209), 845 states have internal predecessors, (1209), 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:44,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 846 states to 846 states and 1209 transitions. [2025-01-09 04:22:44,398 INFO L78 Accepts]: Start accepts. Automaton has 846 states and 1209 transitions. Word has length 77 [2025-01-09 04:22:44,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:22:44,398 INFO L471 AbstractCegarLoop]: Abstraction has 846 states and 1209 transitions. [2025-01-09 04:22:44,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 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:44,398 INFO L276 IsEmpty]: Start isEmpty. Operand 846 states and 1209 transitions. [2025-01-09 04:22:44,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-01-09 04:22:44,399 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:22:44,400 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:22:44,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 04:22:44,400 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:22:44,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:22:44,400 INFO L85 PathProgramCache]: Analyzing trace with hash -1821650059, now seen corresponding path program 1 times [2025-01-09 04:22:44,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:22:44,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491704777] [2025-01-09 04:22:44,401 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:22:44,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:22:44,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-01-09 04:22:44,431 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-01-09 04:22:44,431 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:22:44,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:22:44,538 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:44,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:22:44,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491704777] [2025-01-09 04:22:44,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491704777] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:22:44,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:22:44,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:22:44,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968174692] [2025-01-09 04:22:44,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:22:44,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:22:44,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:22:44,540 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:22:44,540 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:22:44,540 INFO L87 Difference]: Start difference. First operand 846 states and 1209 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 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:44,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:22:44,564 INFO L93 Difference]: Finished difference Result 1256 states and 1799 transitions. [2025-01-09 04:22:44,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:22:44,564 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 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 77 [2025-01-09 04:22:44,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:22:44,566 INFO L225 Difference]: With dead ends: 1256 [2025-01-09 04:22:44,567 INFO L226 Difference]: Without dead ends: 442 [2025-01-09 04:22:44,568 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:44,568 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 42 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 202 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:44,568 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 202 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:44,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2025-01-09 04:22:44,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 440. [2025-01-09 04:22:44,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 440 states, 439 states have (on average 1.4009111617312073) internal successors, (615), 439 states have internal predecessors, (615), 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:44,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 615 transitions. [2025-01-09 04:22:44,582 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 615 transitions. Word has length 77 [2025-01-09 04:22:44,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:22:44,582 INFO L471 AbstractCegarLoop]: Abstraction has 440 states and 615 transitions. [2025-01-09 04:22:44,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 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:44,582 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 615 transitions. [2025-01-09 04:22:44,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-01-09 04:22:44,583 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:22:44,584 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:22:44,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 04:22:44,584 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:22:44,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:22:44,584 INFO L85 PathProgramCache]: Analyzing trace with hash -1435401740, now seen corresponding path program 1 times [2025-01-09 04:22:44,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:22:44,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375197705] [2025-01-09 04:22:44,585 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:22:44,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:22:44,597 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-01-09 04:22:44,615 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-01-09 04:22:44,617 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:22:44,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:22:47,353 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:22:47,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:22:47,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375197705] [2025-01-09 04:22:47,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375197705] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:22:47,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1389427289] [2025-01-09 04:22:47,354 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:22:47,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:22:47,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:22:47,358 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:47,360 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:47,432 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-01-09 04:22:47,491 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-01-09 04:22:47,491 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:22:47,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:22:47,499 INFO L256 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-01-09 04:22:47,508 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:22:48,135 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:22:48,135 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 04:22:48,836 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:22:48,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1389427289] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 04:22:48,836 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 04:22:48,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8, 7] total 24 [2025-01-09 04:22:48,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786105945] [2025-01-09 04:22:48,837 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 04:22:48,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-01-09 04:22:48,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:22:48,838 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-01-09 04:22:48,838 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=469, Unknown=0, NotChecked=0, Total=552 [2025-01-09 04:22:48,839 INFO L87 Difference]: Start difference. First operand 440 states and 615 transitions. Second operand has 24 states, 24 states have (on average 9.166666666666666) internal successors, (220), 24 states have internal predecessors, (220), 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,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:22:58,155 INFO L93 Difference]: Finished difference Result 3704 states and 5100 transitions. [2025-01-09 04:22:58,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2025-01-09 04:22:58,156 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 9.166666666666666) internal successors, (220), 24 states have internal predecessors, (220), 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 77 [2025-01-09 04:22:58,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:22:58,169 INFO L225 Difference]: With dead ends: 3704 [2025-01-09 04:22:58,169 INFO L226 Difference]: Without dead ends: 3296 [2025-01-09 04:22:58,177 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6264 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=2798, Invalid=14232, Unknown=0, NotChecked=0, Total=17030 [2025-01-09 04:22:58,178 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 7168 mSDsluCounter, 1024 mSDsCounter, 0 mSdLazyCounter, 1166 mSolverCounterSat, 188 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7168 SdHoareTripleChecker+Valid, 1094 SdHoareTripleChecker+Invalid, 1354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 188 IncrementalHoareTripleChecker+Valid, 1166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-01-09 04:22:58,178 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7168 Valid, 1094 Invalid, 1354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [188 Valid, 1166 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-01-09 04:22:58,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3296 states. [2025-01-09 04:22:58,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3296 to 2150. [2025-01-09 04:22:58,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2150 states, 2149 states have (on average 1.3922754769660308) internal successors, (2992), 2149 states have internal predecessors, (2992), 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,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2150 states to 2150 states and 2992 transitions. [2025-01-09 04:22:58,257 INFO L78 Accepts]: Start accepts. Automaton has 2150 states and 2992 transitions. Word has length 77 [2025-01-09 04:22:58,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:22:58,257 INFO L471 AbstractCegarLoop]: Abstraction has 2150 states and 2992 transitions. [2025-01-09 04:22:58,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 9.166666666666666) internal successors, (220), 24 states have internal predecessors, (220), 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,258 INFO L276 IsEmpty]: Start isEmpty. Operand 2150 states and 2992 transitions. [2025-01-09 04:22:58,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-01-09 04:22:58,259 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:22:58,259 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:22:58,269 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 04:22:58,459 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,SelfDestructingSolverStorable12 [2025-01-09 04:22:58,460 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:22:58,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:22:58,460 INFO L85 PathProgramCache]: Analyzing trace with hash -1146022847, now seen corresponding path program 1 times [2025-01-09 04:22:58,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:22:58,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115828681] [2025-01-09 04:22:58,460 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:22:58,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:22:58,473 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-01-09 04:22:58,483 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-01-09 04:22:58,484 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:22:58,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:22:58,582 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 04:22:58,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:22:58,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115828681] [2025-01-09 04:22:58,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115828681] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:22:58,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:22:58,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:22:58,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917238186] [2025-01-09 04:22:58,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:22:58,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:22:58,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:22:58,584 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:22:58,584 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:22:58,585 INFO L87 Difference]: Start difference. First operand 2150 states and 2992 transitions. Second operand has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 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,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:22:58,722 INFO L93 Difference]: Finished difference Result 6306 states and 8853 transitions. [2025-01-09 04:22:58,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 04:22:58,724 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 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 78 [2025-01-09 04:22:58,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:22:58,744 INFO L225 Difference]: With dead ends: 6306 [2025-01-09 04:22:58,744 INFO L226 Difference]: Without dead ends: 5262 [2025-01-09 04:22:58,748 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:22:58,748 INFO L435 NwaCegarLoop]: 186 mSDtfsCounter, 520 mSDsluCounter, 445 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 520 SdHoareTripleChecker+Valid, 631 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:22:58,749 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [520 Valid, 631 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:22:58,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5262 states. [2025-01-09 04:22:58,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5262 to 3159. [2025-01-09 04:22:58,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3159 states, 3158 states have (on average 1.389170360987967) internal successors, (4387), 3158 states have internal predecessors, (4387), 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,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3159 states to 3159 states and 4387 transitions. [2025-01-09 04:22:58,909 INFO L78 Accepts]: Start accepts. Automaton has 3159 states and 4387 transitions. Word has length 78 [2025-01-09 04:22:58,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:22:58,910 INFO L471 AbstractCegarLoop]: Abstraction has 3159 states and 4387 transitions. [2025-01-09 04:22:58,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 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,910 INFO L276 IsEmpty]: Start isEmpty. Operand 3159 states and 4387 transitions. [2025-01-09 04:22:58,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-01-09 04:22:58,911 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:22:58,911 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:22:58,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 04:22:58,911 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:22:58,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:22:58,912 INFO L85 PathProgramCache]: Analyzing trace with hash -1670687609, now seen corresponding path program 1 times [2025-01-09 04:22:58,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:22:58,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342806519] [2025-01-09 04:22:58,912 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:22:58,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:22:58,921 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-01-09 04:22:58,933 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-01-09 04:22:58,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:22:58,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:22:59,043 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-09 04:22:59,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:22:59,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342806519] [2025-01-09 04:22:59,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342806519] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:22:59,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:22:59,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:22:59,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471948369] [2025-01-09 04:22:59,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:22:59,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:22:59,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:22:59,046 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:22:59,046 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:22:59,047 INFO L87 Difference]: Start difference. First operand 3159 states and 4387 transitions. Second operand has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 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,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:22:59,221 INFO L93 Difference]: Finished difference Result 7315 states and 10248 transitions. [2025-01-09 04:22:59,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 04:22:59,222 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 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 78 [2025-01-09 04:22:59,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:22:59,243 INFO L225 Difference]: With dead ends: 7315 [2025-01-09 04:22:59,243 INFO L226 Difference]: Without dead ends: 6271 [2025-01-09 04:22:59,248 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:22:59,249 INFO L435 NwaCegarLoop]: 188 mSDtfsCounter, 462 mSDsluCounter, 474 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 462 SdHoareTripleChecker+Valid, 662 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:22:59,249 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [462 Valid, 662 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:22:59,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6271 states. [2025-01-09 04:22:59,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6271 to 4147. [2025-01-09 04:22:59,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4147 states, 4146 states have (on average 1.3866377231066087) internal successors, (5749), 4146 states have internal predecessors, (5749), 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,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4147 states to 4147 states and 5749 transitions. [2025-01-09 04:22:59,438 INFO L78 Accepts]: Start accepts. Automaton has 4147 states and 5749 transitions. Word has length 78 [2025-01-09 04:22:59,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:22:59,438 INFO L471 AbstractCegarLoop]: Abstraction has 4147 states and 5749 transitions. [2025-01-09 04:22:59,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 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,439 INFO L276 IsEmpty]: Start isEmpty. Operand 4147 states and 5749 transitions. [2025-01-09 04:22:59,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-01-09 04:22:59,439 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:22:59,440 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:22:59,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 04:22:59,440 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:22:59,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:22:59,440 INFO L85 PathProgramCache]: Analyzing trace with hash -826554712, now seen corresponding path program 1 times [2025-01-09 04:22:59,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:22:59,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913461339] [2025-01-09 04:22:59,441 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:22:59,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:22:59,451 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-01-09 04:22:59,460 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-01-09 04:22:59,461 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:22:59,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:22:59,501 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:59,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:22:59,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913461339] [2025-01-09 04:22:59,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913461339] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:22:59,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:22:59,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:22:59,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107743178] [2025-01-09 04:22:59,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:22:59,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:22:59,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:22:59,503 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:22:59,503 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:22:59,503 INFO L87 Difference]: Start difference. First operand 4147 states and 5749 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 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,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:22:59,642 INFO L93 Difference]: Finished difference Result 11133 states and 15390 transitions. [2025-01-09 04:22:59,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:22:59,643 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 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 79 [2025-01-09 04:22:59,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:22:59,676 INFO L225 Difference]: With dead ends: 11133 [2025-01-09 04:22:59,676 INFO L226 Difference]: Without dead ends: 7130 [2025-01-09 04:22:59,682 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:59,683 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 53 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 212 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:59,683 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 212 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:59,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7130 states. [2025-01-09 04:22:59,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7130 to 7128. [2025-01-09 04:22:59,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7128 states, 7127 states have (on average 1.365230812403536) internal successors, (9730), 7127 states have internal predecessors, (9730), 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,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7128 states to 7128 states and 9730 transitions. [2025-01-09 04:22:59,928 INFO L78 Accepts]: Start accepts. Automaton has 7128 states and 9730 transitions. Word has length 79 [2025-01-09 04:22:59,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:22:59,928 INFO L471 AbstractCegarLoop]: Abstraction has 7128 states and 9730 transitions. [2025-01-09 04:22:59,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 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,929 INFO L276 IsEmpty]: Start isEmpty. Operand 7128 states and 9730 transitions. [2025-01-09 04:22:59,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-01-09 04:22:59,931 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:22:59,931 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:22:59,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 04:22:59,931 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:22:59,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:22:59,933 INFO L85 PathProgramCache]: Analyzing trace with hash 871578070, now seen corresponding path program 1 times [2025-01-09 04:22:59,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:22:59,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548872628] [2025-01-09 04:22:59,933 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:22:59,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:22:59,941 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-01-09 04:22:59,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-01-09 04:22:59,953 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:22:59,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:22:59,986 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:59,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:22:59,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548872628] [2025-01-09 04:22:59,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548872628] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:22:59,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:22:59,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:22:59,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107494557] [2025-01-09 04:22:59,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:22:59,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:22:59,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:22:59,988 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:22:59,988 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:22:59,988 INFO L87 Difference]: Start difference. First operand 7128 states and 9730 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 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,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:23:00,231 INFO L93 Difference]: Finished difference Result 16443 states and 22444 transitions. [2025-01-09 04:23:00,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:23:00,231 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 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 79 [2025-01-09 04:23:00,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:23:00,259 INFO L225 Difference]: With dead ends: 16443 [2025-01-09 04:23:00,260 INFO L226 Difference]: Without dead ends: 9637 [2025-01-09 04:23:00,268 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:23:00,269 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 50 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 241 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:23:00,269 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 241 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:23:00,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9637 states. [2025-01-09 04:23:00,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9637 to 9635. [2025-01-09 04:23:00,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9635 states, 9634 states have (on average 1.344197633381773) internal successors, (12950), 9634 states have internal predecessors, (12950), 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,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9635 states to 9635 states and 12950 transitions. [2025-01-09 04:23:00,606 INFO L78 Accepts]: Start accepts. Automaton has 9635 states and 12950 transitions. Word has length 79 [2025-01-09 04:23:00,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:23:00,606 INFO L471 AbstractCegarLoop]: Abstraction has 9635 states and 12950 transitions. [2025-01-09 04:23:00,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 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,606 INFO L276 IsEmpty]: Start isEmpty. Operand 9635 states and 12950 transitions. [2025-01-09 04:23:00,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-01-09 04:23:00,609 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:23:00,609 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:23:00,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 04:23:00,609 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:23:00,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:23:00,610 INFO L85 PathProgramCache]: Analyzing trace with hash 1482251182, now seen corresponding path program 1 times [2025-01-09 04:23:00,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:23:00,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75781247] [2025-01-09 04:23:00,610 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:23:00,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:23:00,618 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-01-09 04:23:00,627 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-01-09 04:23:00,627 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:23:00,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:23:00,748 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 04:23:00,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:23:00,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75781247] [2025-01-09 04:23:00,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75781247] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:23:00,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:23:00,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:23:00,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704232963] [2025-01-09 04:23:00,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:23:00,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:23:00,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:23:00,750 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:23:00,750 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:23:00,750 INFO L87 Difference]: Start difference. First operand 9635 states and 12950 transitions. Second operand has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 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:01,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:23:01,088 INFO L93 Difference]: Finished difference Result 19037 states and 25790 transitions. [2025-01-09 04:23:01,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 04:23:01,118 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 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 79 [2025-01-09 04:23:01,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:23:01,157 INFO L225 Difference]: With dead ends: 19037 [2025-01-09 04:23:01,157 INFO L226 Difference]: Without dead ends: 16011 [2025-01-09 04:23:01,166 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:23:01,166 INFO L435 NwaCegarLoop]: 188 mSDtfsCounter, 477 mSDsluCounter, 489 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 477 SdHoareTripleChecker+Valid, 677 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:23:01,167 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [477 Valid, 677 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:23:01,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16011 states. [2025-01-09 04:23:01,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16011 to 12624. [2025-01-09 04:23:01,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12624 states, 12623 states have (on average 1.3423116533312207) internal successors, (16944), 12623 states have internal predecessors, (16944), 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:01,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12624 states to 12624 states and 16944 transitions. [2025-01-09 04:23:01,620 INFO L78 Accepts]: Start accepts. Automaton has 12624 states and 16944 transitions. Word has length 79 [2025-01-09 04:23:01,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:23:01,620 INFO L471 AbstractCegarLoop]: Abstraction has 12624 states and 16944 transitions. [2025-01-09 04:23:01,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 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:01,621 INFO L276 IsEmpty]: Start isEmpty. Operand 12624 states and 16944 transitions. [2025-01-09 04:23:01,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-01-09 04:23:01,623 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:23:01,623 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:23:01,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 04:23:01,624 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:23:01,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:23:01,624 INFO L85 PathProgramCache]: Analyzing trace with hash 1456948848, now seen corresponding path program 1 times [2025-01-09 04:23:01,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:23:01,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528711866] [2025-01-09 04:23:01,624 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:23:01,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:23:01,634 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-01-09 04:23:01,644 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-01-09 04:23:01,645 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:23:01,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:23:01,733 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-09 04:23:01,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:23:01,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528711866] [2025-01-09 04:23:01,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528711866] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:23:01,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:23:01,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:23:01,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010797218] [2025-01-09 04:23:01,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:23:01,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:23:01,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:23:01,735 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:23:01,735 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:23:01,735 INFO L87 Difference]: Start difference. First operand 12624 states and 16944 transitions. Second operand has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 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:02,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:23:02,220 INFO L93 Difference]: Finished difference Result 21961 states and 29700 transitions. [2025-01-09 04:23:02,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 04:23:02,220 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 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 79 [2025-01-09 04:23:02,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:23:02,265 INFO L225 Difference]: With dead ends: 21961 [2025-01-09 04:23:02,265 INFO L226 Difference]: Without dead ends: 18953 [2025-01-09 04:23:02,272 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:23:02,273 INFO L435 NwaCegarLoop]: 192 mSDtfsCounter, 501 mSDsluCounter, 492 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 501 SdHoareTripleChecker+Valid, 684 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:23:02,273 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [501 Valid, 684 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:23:02,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18953 states. [2025-01-09 04:23:02,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18953 to 15566. [2025-01-09 04:23:02,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15566 states, 15565 states have (on average 1.341471249598458) internal successors, (20880), 15565 states have internal predecessors, (20880), 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:02,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15566 states to 15566 states and 20880 transitions. [2025-01-09 04:23:02,907 INFO L78 Accepts]: Start accepts. Automaton has 15566 states and 20880 transitions. Word has length 79 [2025-01-09 04:23:02,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:23:02,908 INFO L471 AbstractCegarLoop]: Abstraction has 15566 states and 20880 transitions. [2025-01-09 04:23:02,908 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 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:02,908 INFO L276 IsEmpty]: Start isEmpty. Operand 15566 states and 20880 transitions. [2025-01-09 04:23:02,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-01-09 04:23:02,910 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:23:02,910 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:23:02,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 04:23:02,911 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:23:02,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:23:02,911 INFO L85 PathProgramCache]: Analyzing trace with hash -61195938, now seen corresponding path program 1 times [2025-01-09 04:23:02,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:23:02,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915017449] [2025-01-09 04:23:02,912 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:23:02,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:23:02,919 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-01-09 04:23:02,939 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-01-09 04:23:02,939 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:23:02,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:23:03,227 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:23:03,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:23:03,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915017449] [2025-01-09 04:23:03,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915017449] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:23:03,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [902746868] [2025-01-09 04:23:03,228 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:23:03,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:23:03,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:23:03,230 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:23:03,233 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:23:03,300 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-01-09 04:23:03,340 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-01-09 04:23:03,341 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:23:03,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:23:03,343 INFO L256 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-01-09 04:23:03,345 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:23:04,525 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:23:04,525 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 04:23:05,770 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:23:05,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [902746868] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 04:23:05,771 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 04:23:05,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 14, 12] total 31 [2025-01-09 04:23:05,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745743108] [2025-01-09 04:23:05,771 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 04:23:05,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-01-09 04:23:05,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:23:05,772 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-01-09 04:23:05,772 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=755, Unknown=0, NotChecked=0, Total=930 [2025-01-09 04:23:05,772 INFO L87 Difference]: Start difference. First operand 15566 states and 20880 transitions. Second operand has 31 states, 31 states have (on average 7.0) internal successors, (217), 31 states have internal predecessors, (217), 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:10,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:23:10,576 INFO L93 Difference]: Finished difference Result 140660 states and 188374 transitions. [2025-01-09 04:23:10,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2025-01-09 04:23:10,577 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 7.0) internal successors, (217), 31 states have internal predecessors, (217), 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 81 [2025-01-09 04:23:10,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:23:10,835 INFO L225 Difference]: With dead ends: 140660 [2025-01-09 04:23:10,836 INFO L226 Difference]: Without dead ends: 125138 [2025-01-09 04:23:10,871 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4027 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=2434, Invalid=9122, Unknown=0, NotChecked=0, Total=11556 [2025-01-09 04:23:10,874 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 3037 mSDsluCounter, 1509 mSDsCounter, 0 mSdLazyCounter, 1192 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3037 SdHoareTripleChecker+Valid, 1610 SdHoareTripleChecker+Invalid, 1304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 1192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 04:23:10,874 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3037 Valid, 1610 Invalid, 1304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 1192 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 04:23:10,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125138 states. [2025-01-09 04:23:13,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125138 to 62518. [2025-01-09 04:23:13,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62518 states, 62517 states have (on average 1.3297183166178799) internal successors, (83130), 62517 states have internal predecessors, (83130), 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:13,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62518 states to 62518 states and 83130 transitions. [2025-01-09 04:23:13,334 INFO L78 Accepts]: Start accepts. Automaton has 62518 states and 83130 transitions. Word has length 81 [2025-01-09 04:23:13,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:23:13,335 INFO L471 AbstractCegarLoop]: Abstraction has 62518 states and 83130 transitions. [2025-01-09 04:23:13,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 7.0) internal successors, (217), 31 states have internal predecessors, (217), 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:13,335 INFO L276 IsEmpty]: Start isEmpty. Operand 62518 states and 83130 transitions. [2025-01-09 04:23:13,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-01-09 04:23:13,340 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:23:13,340 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:23:13,348 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 04:23:13,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:23:13,541 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:23:13,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:23:13,541 INFO L85 PathProgramCache]: Analyzing trace with hash -86498272, now seen corresponding path program 1 times [2025-01-09 04:23:13,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:23:13,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44401312] [2025-01-09 04:23:13,541 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:23:13,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:23:13,548 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-01-09 04:23:13,567 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-01-09 04:23:13,567 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:23:13,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:23:14,928 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:23:14,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:23:14,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44401312] [2025-01-09 04:23:14,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44401312] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:23:14,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [364165710] [2025-01-09 04:23:14,928 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:23:14,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:23:14,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:23:14,930 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:14,931 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:15,002 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-01-09 04:23:15,048 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-01-09 04:23:15,049 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:23:15,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:23:15,051 INFO L256 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-01-09 04:23:15,054 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:23:15,615 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:23:15,615 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 04:23:16,547 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:23:16,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [364165710] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 04:23:16,548 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 04:23:16,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 13] total 34 [2025-01-09 04:23:16,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109665749] [2025-01-09 04:23:16,548 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 04:23:16,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-01-09 04:23:16,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:23:16,549 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-01-09 04:23:16,550 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=963, Unknown=0, NotChecked=0, Total=1122 [2025-01-09 04:23:16,550 INFO L87 Difference]: Start difference. First operand 62518 states and 83130 transitions. Second operand has 34 states, 34 states have (on average 6.382352941176471) internal successors, (217), 34 states have internal predecessors, (217), 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:23,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:23:23,331 INFO L93 Difference]: Finished difference Result 219829 states and 292121 transitions. [2025-01-09 04:23:23,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2025-01-09 04:23:23,332 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 6.382352941176471) internal successors, (217), 34 states have internal predecessors, (217), 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 81 [2025-01-09 04:23:23,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:23:23,742 INFO L225 Difference]: With dead ends: 219829 [2025-01-09 04:23:23,743 INFO L226 Difference]: Without dead ends: 157748 [2025-01-09 04:23:23,804 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3713 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=2024, Invalid=10186, Unknown=0, NotChecked=0, Total=12210 [2025-01-09 04:23:23,805 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 3674 mSDsluCounter, 2082 mSDsCounter, 0 mSdLazyCounter, 2689 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3674 SdHoareTripleChecker+Valid, 2231 SdHoareTripleChecker+Invalid, 2796 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 2689 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-01-09 04:23:23,805 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3674 Valid, 2231 Invalid, 2796 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 2689 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-01-09 04:23:23,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157748 states. [2025-01-09 04:23:28,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157748 to 135557. [2025-01-09 04:23:28,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135557 states, 135556 states have (on average 1.3136268405677358) internal successors, (178070), 135556 states have internal predecessors, (178070), 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:28,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135557 states to 135557 states and 178070 transitions. [2025-01-09 04:23:28,844 INFO L78 Accepts]: Start accepts. Automaton has 135557 states and 178070 transitions. Word has length 81 [2025-01-09 04:23:28,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:23:28,845 INFO L471 AbstractCegarLoop]: Abstraction has 135557 states and 178070 transitions. [2025-01-09 04:23:28,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 6.382352941176471) internal successors, (217), 34 states have internal predecessors, (217), 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:28,845 INFO L276 IsEmpty]: Start isEmpty. Operand 135557 states and 178070 transitions. [2025-01-09 04:23:28,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-01-09 04:23:28,853 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:23:28,853 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:23:28,862 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-09 04:23:29,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:23:29,054 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:23:29,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:23:29,055 INFO L85 PathProgramCache]: Analyzing trace with hash 179105069, now seen corresponding path program 1 times [2025-01-09 04:23:29,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:23:29,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029485627] [2025-01-09 04:23:29,055 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:23:29,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:23:29,067 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-01-09 04:23:29,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-01-09 04:23:29,076 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:23:29,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:23:29,115 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:23:29,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:23:29,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029485627] [2025-01-09 04:23:29,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029485627] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:23:29,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:23:29,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:23:29,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089391678] [2025-01-09 04:23:29,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:23:29,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:23:29,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:23:29,117 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:23:29,117 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:23:29,118 INFO L87 Difference]: Start difference. First operand 135557 states and 178070 transitions. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 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:34,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:23:34,390 INFO L93 Difference]: Finished difference Result 301457 states and 395522 transitions. [2025-01-09 04:23:34,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:23:34,391 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 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 82 [2025-01-09 04:23:34,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:23:34,680 INFO L225 Difference]: With dead ends: 301457 [2025-01-09 04:23:34,680 INFO L226 Difference]: Without dead ends: 168787 [2025-01-09 04:23:34,759 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:23:34,761 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 50 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 230 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:23:34,761 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 230 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:23:34,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168787 states.