./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/heap-manipulation/dancing.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 48c9605d 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/heap-manipulation/dancing.i -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 c2e0266b63b958a771d0226973905d5a39a7a28d05d194ae66381394d9ab520a --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-07 20:05:28,362 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-07 20:05:28,440 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-07 20:05:28,446 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-07 20:05:28,446 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-07 20:05:28,469 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-07 20:05:28,470 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-07 20:05:28,470 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-07 20:05:28,471 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-07 20:05:28,471 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-07 20:05:28,471 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-07 20:05:28,472 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-07 20:05:28,472 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-07 20:05:28,472 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-07 20:05:28,472 INFO L153 SettingsManager]: * Use SBE=true [2025-02-07 20:05:28,473 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-07 20:05:28,473 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-07 20:05:28,473 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-07 20:05:28,473 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-07 20:05:28,474 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-07 20:05:28,474 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-07 20:05:28,474 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-07 20:05:28,474 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-07 20:05:28,474 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-07 20:05:28,474 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-07 20:05:28,474 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-07 20:05:28,474 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-07 20:05:28,474 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-07 20:05:28,475 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-07 20:05:28,475 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-07 20:05:28,475 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-07 20:05:28,475 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-07 20:05:28,475 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 20:05:28,475 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-07 20:05:28,475 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-07 20:05:28,475 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-07 20:05:28,475 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-07 20:05:28,475 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-07 20:05:28,475 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-07 20:05:28,475 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-07 20:05:28,475 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-07 20:05:28,475 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-07 20:05:28,476 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-07 20:05:28,476 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 -> c2e0266b63b958a771d0226973905d5a39a7a28d05d194ae66381394d9ab520a [2025-02-07 20:05:28,759 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-07 20:05:28,769 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-07 20:05:28,773 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-07 20:05:28,774 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-07 20:05:28,775 INFO L274 PluginConnector]: CDTParser initialized [2025-02-07 20:05:28,777 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/heap-manipulation/dancing.i [2025-02-07 20:05:30,067 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f212757bc/00821732cc2b40bca8be81398d23dce6/FLAGd555fbdca [2025-02-07 20:05:30,432 INFO L384 CDTParser]: Found 1 translation units. [2025-02-07 20:05:30,432 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/heap-manipulation/dancing.i [2025-02-07 20:05:30,451 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f212757bc/00821732cc2b40bca8be81398d23dce6/FLAGd555fbdca [2025-02-07 20:05:30,480 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f212757bc/00821732cc2b40bca8be81398d23dce6 [2025-02-07 20:05:30,483 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-07 20:05:30,484 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-07 20:05:30,485 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-07 20:05:30,487 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-07 20:05:30,491 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-07 20:05:30,492 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 08:05:30" (1/1) ... [2025-02-07 20:05:30,492 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2fcf0b6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:05:30, skipping insertion in model container [2025-02-07 20:05:30,493 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 08:05:30" (1/1) ... [2025-02-07 20:05:30,525 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-07 20:05:30,679 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/heap-manipulation/dancing.i[938,951] [2025-02-07 20:05:30,782 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 20:05:30,789 INFO L200 MainTranslator]: Completed pre-run [2025-02-07 20:05:30,797 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/heap-manipulation/dancing.i[938,951] [2025-02-07 20:05:30,827 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 20:05:30,850 INFO L204 MainTranslator]: Completed translation [2025-02-07 20:05:30,851 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:05:30 WrapperNode [2025-02-07 20:05:30,851 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-07 20:05:30,852 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-07 20:05:30,852 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-07 20:05:30,852 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-07 20:05:30,858 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:05:30" (1/1) ... [2025-02-07 20:05:30,870 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:05:30" (1/1) ... [2025-02-07 20:05:30,889 INFO L138 Inliner]: procedures = 124, calls = 40, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 87 [2025-02-07 20:05:30,890 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-07 20:05:30,891 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-07 20:05:30,891 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-07 20:05:30,891 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-07 20:05:30,899 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:05:30" (1/1) ... [2025-02-07 20:05:30,899 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:05:30" (1/1) ... [2025-02-07 20:05:30,906 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:05:30" (1/1) ... [2025-02-07 20:05:30,920 INFO L175 MemorySlicer]: Split 23 memory accesses to 2 slices as follows [2, 21]. 91 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 9 writes are split as follows [0, 9]. [2025-02-07 20:05:30,920 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:05:30" (1/1) ... [2025-02-07 20:05:30,921 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:05:30" (1/1) ... [2025-02-07 20:05:30,927 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:05:30" (1/1) ... [2025-02-07 20:05:30,928 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:05:30" (1/1) ... [2025-02-07 20:05:30,930 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:05:30" (1/1) ... [2025-02-07 20:05:30,931 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:05:30" (1/1) ... [2025-02-07 20:05:30,933 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-07 20:05:30,934 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-07 20:05:30,934 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-07 20:05:30,934 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-07 20:05:30,942 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:05:30" (1/1) ... [2025-02-07 20:05:30,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 20:05:30,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:05:30,974 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-07 20:05:30,977 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-07 20:05:30,993 INFO L130 BoogieDeclarations]: Found specification of procedure is_list_containing_x [2025-02-07 20:05:30,993 INFO L138 BoogieDeclarations]: Found implementation of procedure is_list_containing_x [2025-02-07 20:05:30,993 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-02-07 20:05:30,993 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-02-07 20:05:30,993 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-07 20:05:30,993 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-07 20:05:30,993 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-07 20:05:30,993 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-07 20:05:30,994 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-07 20:05:30,994 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-07 20:05:30,994 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-07 20:05:30,994 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-07 20:05:30,994 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-07 20:05:30,994 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-07 20:05:30,994 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-07 20:05:30,994 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-07 20:05:31,092 INFO L257 CfgBuilder]: Building ICFG [2025-02-07 20:05:31,094 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-07 20:05:31,302 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L603: call ULTIMATE.dealloc(main_~#list~0#1.base, main_~#list~0#1.offset);havoc main_~#list~0#1.base, main_~#list~0#1.offset; [2025-02-07 20:05:31,331 INFO L? ?]: Removed 39 outVars from TransFormulas that were not future-live. [2025-02-07 20:05:31,332 INFO L308 CfgBuilder]: Performing block encoding [2025-02-07 20:05:31,339 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-07 20:05:31,341 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-07 20:05:31,341 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 08:05:31 BoogieIcfgContainer [2025-02-07 20:05:31,342 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-07 20:05:31,344 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-07 20:05:31,345 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-07 20:05:31,349 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-07 20:05:31,350 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 08:05:30" (1/3) ... [2025-02-07 20:05:31,350 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c493fbd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 08:05:31, skipping insertion in model container [2025-02-07 20:05:31,351 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:05:30" (2/3) ... [2025-02-07 20:05:31,351 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c493fbd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 08:05:31, skipping insertion in model container [2025-02-07 20:05:31,351 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 08:05:31" (3/3) ... [2025-02-07 20:05:31,352 INFO L128 eAbstractionObserver]: Analyzing ICFG dancing.i [2025-02-07 20:05:31,369 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-07 20:05:31,370 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG dancing.i that has 3 procedures, 42 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-07 20:05:31,415 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-07 20:05:31,424 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;@3aee8c6c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-07 20:05:31,424 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-07 20:05:31,428 INFO L276 IsEmpty]: Start isEmpty. Operand has 42 states, 32 states have (on average 1.4375) internal successors, (46), 33 states have internal predecessors, (46), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-07 20:05:31,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-02-07 20:05:31,435 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:05:31,435 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:05:31,436 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:05:31,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:05:31,441 INFO L85 PathProgramCache]: Analyzing trace with hash -1705610733, now seen corresponding path program 1 times [2025-02-07 20:05:31,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:05:31,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022857745] [2025-02-07 20:05:31,449 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:05:31,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:05:31,544 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-07 20:05:31,561 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-07 20:05:31,562 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:05:31,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:05:31,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:05:31,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:05:31,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022857745] [2025-02-07 20:05:31,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022857745] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:05:31,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:05:31,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-07 20:05:31,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508791468] [2025-02-07 20:05:31,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:05:31,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-07 20:05:31,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:05:31,661 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-07 20:05:31,661 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-07 20:05:31,663 INFO L87 Difference]: Start difference. First operand has 42 states, 32 states have (on average 1.4375) internal successors, (46), 33 states have internal predecessors, (46), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-07 20:05:31,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:05:31,683 INFO L93 Difference]: Finished difference Result 78 states and 108 transitions. [2025-02-07 20:05:31,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-07 20:05:31,685 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2025-02-07 20:05:31,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:05:31,690 INFO L225 Difference]: With dead ends: 78 [2025-02-07 20:05:31,691 INFO L226 Difference]: Without dead ends: 38 [2025-02-07 20:05:31,695 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-02-07 20:05:31,700 INFO L435 NwaCegarLoop]: 55 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, 55 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-02-07 20:05:31,701 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 20:05:31,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2025-02-07 20:05:31,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2025-02-07 20:05:31,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 30 states have internal predecessors, (40), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-07 20:05:31,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 51 transitions. [2025-02-07 20:05:31,735 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 51 transitions. Word has length 19 [2025-02-07 20:05:31,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:05:31,736 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 51 transitions. [2025-02-07 20:05:31,736 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-07 20:05:31,737 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 51 transitions. [2025-02-07 20:05:31,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-02-07 20:05:31,738 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:05:31,738 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] [2025-02-07 20:05:31,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-07 20:05:31,739 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:05:31,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:05:31,739 INFO L85 PathProgramCache]: Analyzing trace with hash 1196102177, now seen corresponding path program 1 times [2025-02-07 20:05:31,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:05:31,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570994384] [2025-02-07 20:05:31,740 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:05:31,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:05:31,763 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-07 20:05:31,783 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-07 20:05:31,783 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:05:31,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:05:32,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:05:32,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:05:32,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570994384] [2025-02-07 20:05:32,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570994384] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:05:32,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:05:32,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 20:05:32,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657858996] [2025-02-07 20:05:32,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:05:32,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 20:05:32,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:05:32,019 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 20:05:32,021 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 20:05:32,022 INFO L87 Difference]: Start difference. First operand 38 states and 51 transitions. Second operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-07 20:05:32,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:05:32,083 INFO L93 Difference]: Finished difference Result 46 states and 59 transitions. [2025-02-07 20:05:32,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 20:05:32,084 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2025-02-07 20:05:32,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:05:32,085 INFO L225 Difference]: With dead ends: 46 [2025-02-07 20:05:32,086 INFO L226 Difference]: Without dead ends: 44 [2025-02-07 20:05:32,086 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-07 20:05:32,088 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 3 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 20:05:32,089 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 185 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 20:05:32,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2025-02-07 20:05:32,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2025-02-07 20:05:32,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 32 states have (on average 1.34375) internal successors, (43), 34 states have internal predecessors, (43), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-07 20:05:32,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 56 transitions. [2025-02-07 20:05:32,100 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 56 transitions. Word has length 20 [2025-02-07 20:05:32,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:05:32,102 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 56 transitions. [2025-02-07 20:05:32,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-07 20:05:32,102 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 56 transitions. [2025-02-07 20:05:32,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-02-07 20:05:32,104 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:05:32,104 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:05:32,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-07 20:05:32,105 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:05:32,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:05:32,105 INFO L85 PathProgramCache]: Analyzing trace with hash 880332541, now seen corresponding path program 1 times [2025-02-07 20:05:32,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:05:32,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125369446] [2025-02-07 20:05:32,105 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:05:32,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:05:32,127 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-07 20:05:32,144 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-07 20:05:32,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:05:32,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:05:32,258 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-07 20:05:32,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:05:32,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125369446] [2025-02-07 20:05:32,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125369446] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:05:32,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:05:32,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 20:05:32,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802253298] [2025-02-07 20:05:32,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:05:32,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 20:05:32,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:05:32,260 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 20:05:32,261 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 20:05:32,262 INFO L87 Difference]: Start difference. First operand 43 states and 56 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-07 20:05:32,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:05:32,313 INFO L93 Difference]: Finished difference Result 89 states and 119 transitions. [2025-02-07 20:05:32,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 20:05:32,314 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 26 [2025-02-07 20:05:32,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:05:32,315 INFO L225 Difference]: With dead ends: 89 [2025-02-07 20:05:32,315 INFO L226 Difference]: Without dead ends: 66 [2025-02-07 20:05:32,316 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-07 20:05:32,316 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 17 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 20:05:32,317 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 139 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 20:05:32,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2025-02-07 20:05:32,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 57. [2025-02-07 20:05:32,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 45 states have (on average 1.3555555555555556) internal successors, (61), 47 states have internal predecessors, (61), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2025-02-07 20:05:32,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 76 transitions. [2025-02-07 20:05:32,329 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 76 transitions. Word has length 26 [2025-02-07 20:05:32,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:05:32,330 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 76 transitions. [2025-02-07 20:05:32,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-07 20:05:32,330 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 76 transitions. [2025-02-07 20:05:32,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-02-07 20:05:32,332 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:05:32,332 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-07 20:05:32,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-07 20:05:32,332 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:05:32,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:05:32,333 INFO L85 PathProgramCache]: Analyzing trace with hash -804028584, now seen corresponding path program 1 times [2025-02-07 20:05:32,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:05:32,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342991599] [2025-02-07 20:05:32,333 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:05:32,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:05:32,355 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-07 20:05:32,367 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-07 20:05:32,370 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:05:32,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:05:32,619 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-07 20:05:32,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:05:32,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342991599] [2025-02-07 20:05:32,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342991599] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 20:05:32,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [110598751] [2025-02-07 20:05:32,621 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:05:32,621 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:05:32,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:05:32,625 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 20:05:32,628 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-07 20:05:32,710 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-07 20:05:32,784 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-07 20:05:32,785 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:05:32,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:05:32,787 INFO L256 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-07 20:05:32,793 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:05:32,922 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:05:32,922 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 20:05:33,109 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-07 20:05:33,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [110598751] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 20:05:33,109 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 20:05:33,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2025-02-07 20:05:33,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884314036] [2025-02-07 20:05:33,109 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 20:05:33,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-07 20:05:33,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:05:33,111 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-07 20:05:33,111 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2025-02-07 20:05:33,111 INFO L87 Difference]: Start difference. First operand 57 states and 76 transitions. Second operand has 16 states, 16 states have (on average 3.125) internal successors, (50), 16 states have internal predecessors, (50), 4 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (5), 1 states have call predecessors, (5), 4 states have call successors, (5) [2025-02-07 20:05:33,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:05:33,421 INFO L93 Difference]: Finished difference Result 106 states and 148 transitions. [2025-02-07 20:05:33,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-07 20:05:33,421 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.125) internal successors, (50), 16 states have internal predecessors, (50), 4 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (5), 1 states have call predecessors, (5), 4 states have call successors, (5) Word has length 31 [2025-02-07 20:05:33,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:05:33,423 INFO L225 Difference]: With dead ends: 106 [2025-02-07 20:05:33,424 INFO L226 Difference]: Without dead ends: 70 [2025-02-07 20:05:33,424 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2025-02-07 20:05:33,425 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 134 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 20:05:33,425 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 392 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 20:05:33,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2025-02-07 20:05:33,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 66. [2025-02-07 20:05:33,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 51 states have (on average 1.3529411764705883) internal successors, (69), 55 states have internal predecessors, (69), 10 states have call successors, (10), 3 states have call predecessors, (10), 4 states have return successors, (12), 7 states have call predecessors, (12), 9 states have call successors, (12) [2025-02-07 20:05:33,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 91 transitions. [2025-02-07 20:05:33,443 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 91 transitions. Word has length 31 [2025-02-07 20:05:33,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:05:33,444 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 91 transitions. [2025-02-07 20:05:33,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.125) internal successors, (50), 16 states have internal predecessors, (50), 4 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (5), 1 states have call predecessors, (5), 4 states have call successors, (5) [2025-02-07 20:05:33,444 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 91 transitions. [2025-02-07 20:05:33,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-02-07 20:05:33,445 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:05:33,445 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-07 20:05:33,455 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-07 20:05:33,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:05:33,646 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:05:33,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:05:33,646 INFO L85 PathProgramCache]: Analyzing trace with hash -1562017690, now seen corresponding path program 1 times [2025-02-07 20:05:33,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:05:33,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038429720] [2025-02-07 20:05:33,647 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:05:33,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:05:33,664 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-02-07 20:05:33,676 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-07 20:05:33,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:05:33,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:05:33,852 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-07 20:05:33,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:05:33,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038429720] [2025-02-07 20:05:33,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038429720] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:05:33,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:05:33,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-07 20:05:33,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557042792] [2025-02-07 20:05:33,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:05:33,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-07 20:05:33,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:05:33,854 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-07 20:05:33,854 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-07 20:05:33,854 INFO L87 Difference]: Start difference. First operand 66 states and 91 transitions. Second operand has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-07 20:05:33,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:05:33,903 INFO L93 Difference]: Finished difference Result 77 states and 107 transitions. [2025-02-07 20:05:33,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-07 20:05:33,903 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 33 [2025-02-07 20:05:33,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:05:33,905 INFO L225 Difference]: With dead ends: 77 [2025-02-07 20:05:33,906 INFO L226 Difference]: Without dead ends: 75 [2025-02-07 20:05:33,906 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-07 20:05:33,906 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 3 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 20:05:33,906 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 294 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 20:05:33,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-02-07 20:05:33,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 74. [2025-02-07 20:05:33,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 56 states have (on average 1.3214285714285714) internal successors, (74), 61 states have internal predecessors, (74), 11 states have call successors, (11), 4 states have call predecessors, (11), 6 states have return successors, (19), 8 states have call predecessors, (19), 10 states have call successors, (19) [2025-02-07 20:05:33,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 104 transitions. [2025-02-07 20:05:33,923 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 104 transitions. Word has length 33 [2025-02-07 20:05:33,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:05:33,923 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 104 transitions. [2025-02-07 20:05:33,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-07 20:05:33,923 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 104 transitions. [2025-02-07 20:05:33,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-02-07 20:05:33,924 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:05:33,924 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-07 20:05:33,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-07 20:05:33,924 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:05:33,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:05:33,925 INFO L85 PathProgramCache]: Analyzing trace with hash -1763445859, now seen corresponding path program 1 times [2025-02-07 20:05:33,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:05:33,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449008834] [2025-02-07 20:05:33,925 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:05:33,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:05:33,943 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-07 20:05:33,959 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-07 20:05:33,960 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:05:33,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:05:34,092 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-07 20:05:34,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:05:34,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449008834] [2025-02-07 20:05:34,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449008834] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:05:34,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:05:34,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 20:05:34,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559029386] [2025-02-07 20:05:34,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:05:34,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 20:05:34,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:05:34,095 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 20:05:34,095 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-07 20:05:34,096 INFO L87 Difference]: Start difference. First operand 74 states and 104 transitions. Second operand has 6 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 20:05:34,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:05:34,148 INFO L93 Difference]: Finished difference Result 81 states and 110 transitions. [2025-02-07 20:05:34,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 20:05:34,149 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 35 [2025-02-07 20:05:34,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:05:34,151 INFO L225 Difference]: With dead ends: 81 [2025-02-07 20:05:34,152 INFO L226 Difference]: Without dead ends: 74 [2025-02-07 20:05:34,152 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-07 20:05:34,153 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 3 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 20:05:34,154 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 249 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 20:05:34,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2025-02-07 20:05:34,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 62. [2025-02-07 20:05:34,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 48 states have (on average 1.3333333333333333) internal successors, (64), 51 states have internal predecessors, (64), 8 states have call successors, (8), 3 states have call predecessors, (8), 5 states have return successors, (14), 7 states have call predecessors, (14), 7 states have call successors, (14) [2025-02-07 20:05:34,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 86 transitions. [2025-02-07 20:05:34,169 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 86 transitions. Word has length 35 [2025-02-07 20:05:34,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:05:34,169 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 86 transitions. [2025-02-07 20:05:34,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 20:05:34,170 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 86 transitions. [2025-02-07 20:05:34,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-02-07 20:05:34,172 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:05:34,172 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-07 20:05:34,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-07 20:05:34,172 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:05:34,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:05:34,173 INFO L85 PathProgramCache]: Analyzing trace with hash 2022978380, now seen corresponding path program 1 times [2025-02-07 20:05:34,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:05:34,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483194752] [2025-02-07 20:05:34,173 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:05:34,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:05:34,191 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-02-07 20:05:34,198 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-02-07 20:05:34,198 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:05:34,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:05:34,378 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-07 20:05:34,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:05:34,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483194752] [2025-02-07 20:05:34,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483194752] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:05:34,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:05:34,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 20:05:34,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560332671] [2025-02-07 20:05:34,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:05:34,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 20:05:34,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:05:34,379 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 20:05:34,379 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 20:05:34,380 INFO L87 Difference]: Start difference. First operand 62 states and 86 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 20:05:34,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:05:34,490 INFO L93 Difference]: Finished difference Result 106 states and 142 transitions. [2025-02-07 20:05:34,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 20:05:34,491 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), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 36 [2025-02-07 20:05:34,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:05:34,492 INFO L225 Difference]: With dead ends: 106 [2025-02-07 20:05:34,492 INFO L226 Difference]: Without dead ends: 53 [2025-02-07 20:05:34,493 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-07 20:05:34,493 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 14 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 20:05:34,493 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 159 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 20:05:34,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2025-02-07 20:05:34,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2025-02-07 20:05:34,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 40 states have (on average 1.3) internal successors, (52), 43 states have internal predecessors, (52), 7 states have call successors, (7), 3 states have call predecessors, (7), 5 states have return successors, (11), 6 states have call predecessors, (11), 6 states have call successors, (11) [2025-02-07 20:05:34,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 70 transitions. [2025-02-07 20:05:34,508 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 70 transitions. Word has length 36 [2025-02-07 20:05:34,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:05:34,508 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 70 transitions. [2025-02-07 20:05:34,508 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), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 20:05:34,508 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 70 transitions. [2025-02-07 20:05:34,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-02-07 20:05:34,511 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:05:34,512 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 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] [2025-02-07 20:05:34,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-07 20:05:34,512 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:05:34,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:05:34,512 INFO L85 PathProgramCache]: Analyzing trace with hash 1664740118, now seen corresponding path program 1 times [2025-02-07 20:05:34,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:05:34,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229021693] [2025-02-07 20:05:34,514 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:05:34,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:05:34,532 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-02-07 20:05:34,558 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-02-07 20:05:34,561 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:05:34,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:05:35,002 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-02-07 20:05:35,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:05:35,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229021693] [2025-02-07 20:05:35,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229021693] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 20:05:35,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1486035280] [2025-02-07 20:05:35,005 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:05:35,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:05:35,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:05:35,008 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 20:05:35,011 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-07 20:05:35,095 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-02-07 20:05:35,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-02-07 20:05:35,141 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:05:35,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:05:35,145 INFO L256 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-02-07 20:05:35,148 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:05:35,222 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2025-02-07 20:05:35,232 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2025-02-07 20:05:35,243 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 20:05:35,245 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-02-07 20:05:35,250 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 20:05:35,251 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-02-07 20:05:35,476 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-02-07 20:05:35,479 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-02-07 20:05:35,498 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-07 20:05:35,498 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 20:05:35,556 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2025-02-07 20:05:35,650 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:05:35,651 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 31 [2025-02-07 20:05:35,656 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2025-02-07 20:05:35,667 INFO L349 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2025-02-07 20:05:35,668 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 1 [2025-02-07 20:05:35,706 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-02-07 20:05:35,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1486035280] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 20:05:35,706 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 20:05:35,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 16 [2025-02-07 20:05:35,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086167361] [2025-02-07 20:05:35,706 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 20:05:35,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-07 20:05:35,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:05:35,707 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-07 20:05:35,707 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2025-02-07 20:05:35,708 INFO L87 Difference]: Start difference. First operand 53 states and 70 transitions. Second operand has 16 states, 16 states have (on average 3.4375) internal successors, (55), 16 states have internal predecessors, (55), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2025-02-07 20:05:36,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:05:36,278 INFO L93 Difference]: Finished difference Result 141 states and 184 transitions. [2025-02-07 20:05:36,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-07 20:05:36,279 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.4375) internal successors, (55), 16 states have internal predecessors, (55), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 39 [2025-02-07 20:05:36,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:05:36,281 INFO L225 Difference]: With dead ends: 141 [2025-02-07 20:05:36,281 INFO L226 Difference]: Without dead ends: 104 [2025-02-07 20:05:36,282 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 70 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=152, Invalid=498, Unknown=0, NotChecked=0, Total=650 [2025-02-07 20:05:36,283 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 100 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 437 SdHoareTripleChecker+Invalid, 304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-07 20:05:36,283 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 437 Invalid, 304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 295 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-07 20:05:36,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2025-02-07 20:05:36,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 99. [2025-02-07 20:05:36,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 74 states have (on average 1.2837837837837838) internal successors, (95), 80 states have internal predecessors, (95), 14 states have call successors, (14), 6 states have call predecessors, (14), 10 states have return successors, (22), 12 states have call predecessors, (22), 12 states have call successors, (22) [2025-02-07 20:05:36,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 131 transitions. [2025-02-07 20:05:36,308 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 131 transitions. Word has length 39 [2025-02-07 20:05:36,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:05:36,308 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 131 transitions. [2025-02-07 20:05:36,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.4375) internal successors, (55), 16 states have internal predecessors, (55), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2025-02-07 20:05:36,310 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 131 transitions. [2025-02-07 20:05:36,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-02-07 20:05:36,314 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:05:36,314 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 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] [2025-02-07 20:05:36,323 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-02-07 20:05:36,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:05:36,515 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:05:36,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:05:36,516 INFO L85 PathProgramCache]: Analyzing trace with hash 35508054, now seen corresponding path program 1 times [2025-02-07 20:05:36,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:05:36,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606036193] [2025-02-07 20:05:36,516 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:05:36,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:05:36,530 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-02-07 20:05:36,552 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-02-07 20:05:36,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:05:36,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:05:36,674 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-02-07 20:05:36,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:05:36,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606036193] [2025-02-07 20:05:36,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606036193] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 20:05:36,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1905554545] [2025-02-07 20:05:36,675 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:05:36,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:05:36,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:05:36,678 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-02-07 20:05:36,681 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-02-07 20:05:36,759 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-02-07 20:05:36,798 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-02-07 20:05:36,798 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:05:36,798 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:05:36,801 INFO L256 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 71 conjuncts are in the unsatisfiable core [2025-02-07 20:05:36,805 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:05:36,872 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2025-02-07 20:05:36,876 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 20:05:36,877 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 18 [2025-02-07 20:05:36,886 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2025-02-07 20:05:36,892 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 20:05:36,893 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-02-07 20:05:37,343 INFO L349 Elim1Store]: treesize reduction 50, result has 25.4 percent of original size [2025-02-07 20:05:37,343 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 33 [2025-02-07 20:05:37,350 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2025-02-07 20:05:37,863 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-07 20:05:37,863 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 20:05:38,356 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:05:38,356 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 139 treesize of output 92 [2025-02-07 20:05:38,367 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:05:38,368 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 60 treesize of output 66 [2025-02-07 20:05:38,407 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:05:38,408 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 711 treesize of output 707 [2025-02-07 20:05:38,463 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 449 treesize of output 415 [2025-02-07 20:05:38,518 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:05:38,519 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 363 treesize of output 331 [2025-02-07 20:05:38,535 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 264 treesize of output 252 [2025-02-07 20:05:39,212 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:05:39,213 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 9 [2025-02-07 20:05:39,217 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 9 [2025-02-07 20:05:39,229 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:05:39,230 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 9 [2025-02-07 20:05:39,240 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-02-07 20:05:39,246 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2025-02-07 20:05:39,267 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2025-02-07 20:05:39,283 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-02-07 20:05:39,288 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-02-07 20:05:39,292 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-02-07 20:05:39,644 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2025-02-07 20:05:39,649 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:05:39,649 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 9 [2025-02-07 20:05:39,658 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:05:39,658 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 9 [2025-02-07 20:05:39,667 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:05:39,667 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 9 [2025-02-07 20:05:39,684 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-02-07 20:05:39,688 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2025-02-07 20:05:39,703 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-02-07 20:05:39,707 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2025-02-07 20:05:39,740 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-02-07 20:05:39,759 INFO L349 Elim1Store]: treesize reduction 5, result has 73.7 percent of original size [2025-02-07 20:05:39,759 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 26 [2025-02-07 20:05:39,783 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:05:39,783 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 75 treesize of output 91 [2025-02-07 20:05:39,816 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-02-07 20:05:39,905 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-07 20:05:39,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1905554545] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 20:05:39,905 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 20:05:39,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 15, 14] total 31 [2025-02-07 20:05:39,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14425265] [2025-02-07 20:05:39,905 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 20:05:39,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-02-07 20:05:39,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:05:39,907 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-02-07 20:05:39,907 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=838, Unknown=0, NotChecked=0, Total=930 [2025-02-07 20:05:39,907 INFO L87 Difference]: Start difference. First operand 99 states and 131 transitions. Second operand has 31 states, 29 states have (on average 2.7586206896551726) internal successors, (80), 29 states have internal predecessors, (80), 8 states have call successors, (10), 4 states have call predecessors, (10), 7 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) [2025-02-07 20:05:42,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:05:42,279 INFO L93 Difference]: Finished difference Result 241 states and 319 transitions. [2025-02-07 20:05:42,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2025-02-07 20:05:42,280 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 29 states have (on average 2.7586206896551726) internal successors, (80), 29 states have internal predecessors, (80), 8 states have call successors, (10), 4 states have call predecessors, (10), 7 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) Word has length 39 [2025-02-07 20:05:42,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:05:42,282 INFO L225 Difference]: With dead ends: 241 [2025-02-07 20:05:42,282 INFO L226 Difference]: Without dead ends: 153 [2025-02-07 20:05:42,284 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 708 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=352, Invalid=3188, Unknown=0, NotChecked=0, Total=3540 [2025-02-07 20:05:42,285 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 153 mSDsluCounter, 728 mSDsCounter, 0 mSdLazyCounter, 1005 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 773 SdHoareTripleChecker+Invalid, 1065 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 1005 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-02-07 20:05:42,285 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 773 Invalid, 1065 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 1005 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-02-07 20:05:42,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2025-02-07 20:05:42,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 134. [2025-02-07 20:05:42,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 97 states have (on average 1.2577319587628866) internal successors, (122), 106 states have internal predecessors, (122), 20 states have call successors, (20), 9 states have call predecessors, (20), 16 states have return successors, (30), 18 states have call predecessors, (30), 17 states have call successors, (30) [2025-02-07 20:05:42,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 172 transitions. [2025-02-07 20:05:42,315 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 172 transitions. Word has length 39 [2025-02-07 20:05:42,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:05:42,316 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 172 transitions. [2025-02-07 20:05:42,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 29 states have (on average 2.7586206896551726) internal successors, (80), 29 states have internal predecessors, (80), 8 states have call successors, (10), 4 states have call predecessors, (10), 7 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) [2025-02-07 20:05:42,316 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 172 transitions. [2025-02-07 20:05:42,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-02-07 20:05:42,317 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:05:42,317 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 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] [2025-02-07 20:05:42,324 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-02-07 20:05:42,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:05:42,521 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:05:42,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:05:42,521 INFO L85 PathProgramCache]: Analyzing trace with hash -1631301525, now seen corresponding path program 1 times [2025-02-07 20:05:42,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:05:42,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806634409] [2025-02-07 20:05:42,522 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:05:42,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:05:42,534 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-07 20:05:42,557 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-07 20:05:42,557 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:05:42,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:05:42,983 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 2 proven. 25 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-07 20:05:42,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:05:42,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806634409] [2025-02-07 20:05:42,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806634409] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 20:05:42,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [527391682] [2025-02-07 20:05:42,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:05:42,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:05:42,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:05:42,986 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 20:05:42,988 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-07 20:05:43,071 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-07 20:05:43,109 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-07 20:05:43,109 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:05:43,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:05:43,116 INFO L256 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 57 conjuncts are in the unsatisfiable core [2025-02-07 20:05:43,119 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:05:43,145 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-07 20:05:43,172 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2025-02-07 20:05:43,176 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 20:05:43,177 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-02-07 20:05:43,256 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-07 20:05:43,257 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-07 20:05:43,295 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 20:05:43,296 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 11 [2025-02-07 20:05:43,307 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 20:05:43,308 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-02-07 20:05:43,595 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 19 proven. 9 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-07 20:05:43,595 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 20:05:43,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [527391682] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 20:05:43,656 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-07 20:05:43,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 23 [2025-02-07 20:05:43,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130259611] [2025-02-07 20:05:43,656 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-07 20:05:43,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-02-07 20:05:43,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:05:43,657 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-02-07 20:05:43,657 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=491, Unknown=0, NotChecked=0, Total=552 [2025-02-07 20:05:43,657 INFO L87 Difference]: Start difference. First operand 134 states and 172 transitions. Second operand has 23 states, 22 states have (on average 3.1818181818181817) internal successors, (70), 23 states have internal predecessors, (70), 6 states have call successors, (9), 3 states have call predecessors, (9), 5 states have return successors, (8), 5 states have call predecessors, (8), 6 states have call successors, (8) [2025-02-07 20:05:47,663 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-07 20:05:51,716 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-07 20:05:56,872 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-07 20:06:00,928 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-07 20:06:04,939 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-07 20:06:08,965 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-07 20:06:12,990 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-07 20:06:13,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:06:13,125 INFO L93 Difference]: Finished difference Result 237 states and 309 transitions. [2025-02-07 20:06:13,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-02-07 20:06:13,126 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 3.1818181818181817) internal successors, (70), 23 states have internal predecessors, (70), 6 states have call successors, (9), 3 states have call predecessors, (9), 5 states have return successors, (8), 5 states have call predecessors, (8), 6 states have call successors, (8) Word has length 50 [2025-02-07 20:06:13,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:06:13,127 INFO L225 Difference]: With dead ends: 237 [2025-02-07 20:06:13,127 INFO L226 Difference]: Without dead ends: 159 [2025-02-07 20:06:13,128 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 425 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=350, Invalid=1906, Unknown=0, NotChecked=0, Total=2256 [2025-02-07 20:06:13,128 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 189 mSDsluCounter, 580 mSDsCounter, 0 mSdLazyCounter, 752 mSolverCounterSat, 102 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 28.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 630 SdHoareTripleChecker+Invalid, 861 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 752 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 28.7s IncrementalHoareTripleChecker+Time [2025-02-07 20:06:13,129 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 630 Invalid, 861 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 752 Invalid, 7 Unknown, 0 Unchecked, 28.7s Time] [2025-02-07 20:06:13,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2025-02-07 20:06:13,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 129. [2025-02-07 20:06:13,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 93 states have (on average 1.2365591397849462) internal successors, (115), 102 states have internal predecessors, (115), 18 states have call successors, (18), 9 states have call predecessors, (18), 17 states have return successors, (29), 17 states have call predecessors, (29), 15 states have call successors, (29) [2025-02-07 20:06:13,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 162 transitions. [2025-02-07 20:06:13,154 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 162 transitions. Word has length 50 [2025-02-07 20:06:13,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:06:13,154 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 162 transitions. [2025-02-07 20:06:13,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 3.1818181818181817) internal successors, (70), 23 states have internal predecessors, (70), 6 states have call successors, (9), 3 states have call predecessors, (9), 5 states have return successors, (8), 5 states have call predecessors, (8), 6 states have call successors, (8) [2025-02-07 20:06:13,154 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 162 transitions. [2025-02-07 20:06:13,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-02-07 20:06:13,156 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:06:13,156 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 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] [2025-02-07 20:06:13,165 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-07 20:06:13,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-02-07 20:06:13,356 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:06:13,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:06:13,357 INFO L85 PathProgramCache]: Analyzing trace with hash 1769004877, now seen corresponding path program 2 times [2025-02-07 20:06:13,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:06:13,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898788038] [2025-02-07 20:06:13,357 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 20:06:13,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:06:13,369 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 46 statements into 2 equivalence classes. [2025-02-07 20:06:13,381 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 46 of 46 statements. [2025-02-07 20:06:13,382 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-07 20:06:13,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:06:13,620 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-07 20:06:13,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:06:13,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898788038] [2025-02-07 20:06:13,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898788038] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:06:13,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:06:13,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-07 20:06:13,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183858136] [2025-02-07 20:06:13,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:06:13,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-07 20:06:13,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:06:13,621 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-07 20:06:13,621 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-07 20:06:13,622 INFO L87 Difference]: Start difference. First operand 129 states and 162 transitions. Second operand has 8 states, 7 states have (on average 4.0) internal successors, (28), 5 states have internal predecessors, (28), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-07 20:06:13,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:06:13,689 INFO L93 Difference]: Finished difference Result 157 states and 198 transitions. [2025-02-07 20:06:13,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-07 20:06:13,689 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.0) internal successors, (28), 5 states have internal predecessors, (28), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) Word has length 46 [2025-02-07 20:06:13,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:06:13,691 INFO L225 Difference]: With dead ends: 157 [2025-02-07 20:06:13,691 INFO L226 Difference]: Without dead ends: 155 [2025-02-07 20:06:13,691 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-02-07 20:06:13,691 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 3 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 20:06:13,692 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 322 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 20:06:13,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2025-02-07 20:06:13,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 131. [2025-02-07 20:06:13,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 95 states have (on average 1.231578947368421) internal successors, (117), 102 states have internal predecessors, (117), 18 states have call successors, (18), 9 states have call predecessors, (18), 17 states have return successors, (29), 19 states have call predecessors, (29), 15 states have call successors, (29) [2025-02-07 20:06:13,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 164 transitions. [2025-02-07 20:06:13,714 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 164 transitions. Word has length 46 [2025-02-07 20:06:13,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:06:13,714 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 164 transitions. [2025-02-07 20:06:13,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.0) internal successors, (28), 5 states have internal predecessors, (28), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-07 20:06:13,714 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 164 transitions. [2025-02-07 20:06:13,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-02-07 20:06:13,715 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:06:13,715 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 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] [2025-02-07 20:06:13,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-07 20:06:13,716 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:06:13,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:06:13,716 INFO L85 PathProgramCache]: Analyzing trace with hash 1600649206, now seen corresponding path program 1 times [2025-02-07 20:06:13,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:06:13,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770651772] [2025-02-07 20:06:13,716 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:06:13,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:06:13,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-02-07 20:06:13,775 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-02-07 20:06:13,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:06:13,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:06:14,467 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2025-02-07 20:06:14,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:06:14,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770651772] [2025-02-07 20:06:14,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770651772] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 20:06:14,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [80239071] [2025-02-07 20:06:14,468 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:06:14,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:06:14,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:06:14,470 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 20:06:14,471 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-07 20:06:14,559 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-02-07 20:06:14,601 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-02-07 20:06:14,601 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:06:14,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:06:14,603 INFO L256 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 52 conjuncts are in the unsatisfiable core [2025-02-07 20:06:14,607 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:06:14,626 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-07 20:06:14,648 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2025-02-07 20:06:14,651 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 20:06:14,652 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-02-07 20:06:14,658 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2025-02-07 20:06:14,662 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 20:06:14,662 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-02-07 20:06:14,753 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-07 20:06:14,753 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-07 20:06:14,793 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 20:06:14,794 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 13 [2025-02-07 20:06:14,797 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 20:06:14,798 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 13 [2025-02-07 20:06:14,806 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 20:06:14,807 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-02-07 20:06:14,812 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 20:06:14,813 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-02-07 20:06:15,007 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-02-07 20:06:15,009 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-02-07 20:06:15,031 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 20 proven. 9 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-07 20:06:15,032 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 20:06:15,080 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2025-02-07 20:06:19,155 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 4))) (and (forall ((v_ArrVal_650 (Array Int Int)) (v_ArrVal_652 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~n~0#1.base| v_ArrVal_650) |c_ULTIMATE.start_main_~tail~0#1.base| v_ArrVal_652) |c_ULTIMATE.start_main_~x~0#1.base|) .cse0) 0)) (forall ((v_ArrVal_649 (Array Int Int)) (v_ArrVal_651 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~n~0#1.base| v_ArrVal_649) |c_ULTIMATE.start_main_~tail~0#1.base| v_ArrVal_651) |c_ULTIMATE.start_main_~x~0#1.base|) .cse0) 0)))) is different from false [2025-02-07 20:06:23,341 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:06:23,341 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 34 [2025-02-07 20:06:23,346 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 140 treesize of output 122 [2025-02-07 20:06:23,352 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2025-02-07 20:06:23,356 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2025-02-07 20:06:23,380 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:06:23,381 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 34 [2025-02-07 20:06:23,383 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-07 20:06:23,385 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2025-02-07 20:06:25,576 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2025-02-07 20:06:25,599 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 29 trivial. 1 not checked. [2025-02-07 20:06:25,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [80239071] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 20:06:25,599 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 20:06:25,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 25 [2025-02-07 20:06:25,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385524244] [2025-02-07 20:06:25,599 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 20:06:25,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-02-07 20:06:25,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:06:25,600 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-02-07 20:06:25,600 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=483, Unknown=3, NotChecked=44, Total=600 [2025-02-07 20:06:25,601 INFO L87 Difference]: Start difference. First operand 131 states and 164 transitions. Second operand has 25 states, 25 states have (on average 2.96) internal successors, (74), 25 states have internal predecessors, (74), 5 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2025-02-07 20:06:26,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:06:26,219 INFO L93 Difference]: Finished difference Result 192 states and 240 transitions. [2025-02-07 20:06:26,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-07 20:06:26,220 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.96) internal successors, (74), 25 states have internal predecessors, (74), 5 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) Word has length 51 [2025-02-07 20:06:26,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:06:26,221 INFO L225 Difference]: With dead ends: 192 [2025-02-07 20:06:26,221 INFO L226 Difference]: Without dead ends: 138 [2025-02-07 20:06:26,222 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 89 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 11.0s TimeCoverageRelationStatistics Valid=239, Invalid=952, Unknown=3, NotChecked=66, Total=1260 [2025-02-07 20:06:26,222 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 117 mSDsluCounter, 410 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 451 SdHoareTripleChecker+Invalid, 328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 52 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 20:06:26,222 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 451 Invalid, 328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 248 Invalid, 0 Unknown, 52 Unchecked, 0.2s Time] [2025-02-07 20:06:26,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2025-02-07 20:06:26,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 131. [2025-02-07 20:06:26,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 95 states have (on average 1.2210526315789474) internal successors, (116), 102 states have internal predecessors, (116), 18 states have call successors, (18), 9 states have call predecessors, (18), 17 states have return successors, (29), 19 states have call predecessors, (29), 15 states have call successors, (29) [2025-02-07 20:06:26,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 163 transitions. [2025-02-07 20:06:26,239 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 163 transitions. Word has length 51 [2025-02-07 20:06:26,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:06:26,239 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 163 transitions. [2025-02-07 20:06:26,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.96) internal successors, (74), 25 states have internal predecessors, (74), 5 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2025-02-07 20:06:26,239 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 163 transitions. [2025-02-07 20:06:26,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-02-07 20:06:26,240 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:06:26,240 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 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] [2025-02-07 20:06:26,249 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-02-07 20:06:26,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-02-07 20:06:26,441 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:06:26,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:06:26,442 INFO L85 PathProgramCache]: Analyzing trace with hash -437407083, now seen corresponding path program 1 times [2025-02-07 20:06:26,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:06:26,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839400718] [2025-02-07 20:06:26,442 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:06:26,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:06:26,458 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-02-07 20:06:26,484 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-02-07 20:06:26,484 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:06:26,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:06:26,663 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2025-02-07 20:06:26,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:06:26,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839400718] [2025-02-07 20:06:26,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839400718] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 20:06:26,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [906811151] [2025-02-07 20:06:26,663 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:06:26,663 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:06:26,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:06:26,666 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 20:06:26,672 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-07 20:06:26,764 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-02-07 20:06:26,806 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-02-07 20:06:26,806 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:06:26,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:06:26,808 INFO L256 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 70 conjuncts are in the unsatisfiable core [2025-02-07 20:06:26,816 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:06:26,846 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-07 20:06:26,876 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2025-02-07 20:06:26,880 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 20:06:26,880 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-02-07 20:06:26,887 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2025-02-07 20:06:26,891 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 20:06:26,892 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 18 [2025-02-07 20:06:27,011 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-07 20:06:27,011 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-07 20:06:27,067 INFO L349 Elim1Store]: treesize reduction 33, result has 13.2 percent of original size [2025-02-07 20:06:27,067 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 58 treesize of output 48 [2025-02-07 20:06:27,076 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 20:06:27,076 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 18 [2025-02-07 20:06:27,090 INFO L349 Elim1Store]: treesize reduction 23, result has 4.2 percent of original size [2025-02-07 20:06:27,090 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 1 [2025-02-07 20:06:27,477 INFO L349 Elim1Store]: treesize reduction 70, result has 19.5 percent of original size [2025-02-07 20:06:27,477 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 39 [2025-02-07 20:06:27,480 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 20 [2025-02-07 20:06:27,943 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-07 20:06:27,943 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 20:06:28,321 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_768 (Array Int Int)) (v_ArrVal_769 (Array Int Int)) (v_ArrVal_771 (Array Int Int)) (v_ArrVal_770 (Array Int Int))) (let ((.cse1 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~n~0#1.base| v_ArrVal_771) |c_ULTIMATE.start_main_~tail~0#1.base| v_ArrVal_768))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_main_~x~0#1.base|))) (or (not (= (select .cse0 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 4)) 0)) (not (= (select (select (let ((.cse2 (select .cse0 |c_ULTIMATE.start_main_~x~0#1.offset|))) (store .cse1 .cse2 (store (select .cse1 .cse2) (+ 4 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~n~0#1.base| v_ArrVal_769) |c_ULTIMATE.start_main_~tail~0#1.base| v_ArrVal_770) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|)) 0))) |c_ULTIMATE.start_main_~#list~0#1.base|) (+ |c_ULTIMATE.start_main_~#list~0#1.offset| 4)) |c_ULTIMATE.start_main_~x~0#1.base|)))))) is different from false [2025-02-07 20:06:28,440 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_768 (Array Int Int)) (v_ArrVal_769 (Array Int Int)) (v_ArrVal_771 (Array Int Int)) (v_ArrVal_770 (Array Int Int)) (|v_ULTIMATE.start_main_~n~0#1.base_25| Int)) (let ((.cse1 (store (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~n~0#1.base_25| v_ArrVal_771) |c_ULTIMATE.start_main_~tail~0#1.base| v_ArrVal_768))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_main_~n~0#1.base|))) (or (not (= (select .cse0 (+ |c_ULTIMATE.start_main_~n~0#1.offset| 4)) 0)) (not (= (select (select (let ((.cse2 (select .cse0 |c_ULTIMATE.start_main_~n~0#1.offset|))) (store .cse1 .cse2 (store (select .cse1 .cse2) (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~n~0#1.base_25| v_ArrVal_769) |c_ULTIMATE.start_main_~tail~0#1.base| v_ArrVal_770) |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|) 4) 0))) |c_ULTIMATE.start_main_~#list~0#1.base|) (+ |c_ULTIMATE.start_main_~#list~0#1.offset| 4)) |c_ULTIMATE.start_main_~n~0#1.base|)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~n~0#1.base_25|) 0)))))) is different from false [2025-02-07 20:06:28,455 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:06:28,455 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 157 treesize of output 110 [2025-02-07 20:06:28,470 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:06:28,470 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 75 treesize of output 81 [2025-02-07 20:06:28,544 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:06:28,544 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 14955 treesize of output 14353 [2025-02-07 20:06:28,731 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 12705 treesize of output 12247 [2025-02-07 20:06:28,974 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2646 treesize of output 2582 [2025-02-07 20:06:29,033 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:06:29,033 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 2993 treesize of output 2603 [2025-02-07 20:06:29,094 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2494 treesize of output 2446 [2025-02-07 20:06:29,164 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:06:29,164 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 2651 treesize of output 2477 [2025-02-07 20:06:32,666 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 9 [2025-02-07 20:06:32,685 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2025-02-07 20:06:32,732 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2025-02-07 20:06:32,747 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2025-02-07 20:06:32,805 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2025-02-07 20:06:32,817 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2025-02-07 20:06:32,840 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2025-02-07 20:06:32,870 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2025-02-07 20:06:32,884 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2025-02-07 20:06:32,890 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2025-02-07 20:06:32,920 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2025-02-07 20:06:32,926 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2025-02-07 20:06:32,950 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2025-02-07 20:06:32,967 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2025-02-07 20:06:32,977 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-02-07 20:06:32,983 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2025-02-07 20:06:32,989 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2025-02-07 20:06:33,003 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-02-07 20:06:35,991 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2025-02-07 20:06:35,995 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2025-02-07 20:06:36,010 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2025-02-07 20:06:36,026 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2025-02-07 20:06:36,040 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:06:36,040 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 9 [2025-02-07 20:06:36,076 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2025-02-07 20:06:36,091 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2025-02-07 20:06:36,107 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2025-02-07 20:06:36,118 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2025-02-07 20:06:36,149 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2025-02-07 20:06:36,166 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2025-02-07 20:06:36,172 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2025-02-07 20:06:36,200 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2025-02-07 20:06:36,219 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2025-02-07 20:06:36,224 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 9 [2025-02-07 20:06:36,247 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2025-02-07 20:06:41,020 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2025-02-07 20:06:41,033 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 68 [2025-02-07 20:06:41,055 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 40 [2025-02-07 20:06:41,064 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:06:41,064 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 51 [2025-02-07 20:06:41,080 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-02-07 20:06:41,101 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:06:41,102 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 54 [2025-02-07 20:06:41,134 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:06:41,135 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 24 [2025-02-07 20:06:41,147 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 31 [2025-02-07 20:06:41,163 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2025-02-07 20:06:41,179 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-02-07 20:06:41,179 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 1 [2025-02-07 20:06:41,209 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:06:41,210 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 51 [2025-02-07 20:06:41,232 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:06:41,233 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 54 [2025-02-07 20:06:41,272 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:06:41,272 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 24 [2025-02-07 20:06:41,294 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2025-02-07 20:06:41,305 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 27 [2025-02-07 20:06:41,316 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-02-07 20:06:41,320 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-02-07 20:06:41,328 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-02-07 20:06:41,328 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 1 [2025-02-07 20:06:41,460 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:06:41,461 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 60 [2025-02-07 20:06:41,562 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 16 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 2 not checked. [2025-02-07 20:06:41,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [906811151] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 20:06:41,562 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 20:06:41,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 17, 16] total 36 [2025-02-07 20:06:41,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157230547] [2025-02-07 20:06:41,563 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 20:06:41,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-02-07 20:06:41,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:06:41,563 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-02-07 20:06:41,564 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=1020, Unknown=2, NotChecked=130, Total=1260 [2025-02-07 20:06:41,564 INFO L87 Difference]: Start difference. First operand 131 states and 163 transitions. Second operand has 36 states, 34 states have (on average 2.764705882352941) internal successors, (94), 33 states have internal predecessors, (94), 9 states have call successors, (11), 4 states have call predecessors, (11), 7 states have return successors, (11), 9 states have call predecessors, (11), 9 states have call successors, (11)