./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-55.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-55.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 3559b3594a82cd675e67391d8043202d21aa0bea5a13d40b68d97450424826dd --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 00:37:06,287 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 00:37:06,363 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-06 00:37:06,369 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 00:37:06,372 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 00:37:06,396 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 00:37:06,396 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 00:37:06,396 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 00:37:06,397 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 00:37:06,397 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 00:37:06,397 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 00:37:06,397 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 00:37:06,397 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 00:37:06,398 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 00:37:06,398 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 00:37:06,399 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 00:37:06,399 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 00:37:06,399 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 00:37:06,399 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 00:37:06,399 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 00:37:06,400 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 00:37:06,400 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 00:37:06,400 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 00:37:06,400 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 00:37:06,400 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 00:37:06,400 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 00:37:06,400 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 00:37:06,400 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 00:37:06,400 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 00:37:06,401 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 00:37:06,401 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 00:37:06,401 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 00:37:06,401 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 00:37:06,401 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 00:37:06,402 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 00:37:06,402 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 00:37:06,402 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 00:37:06,402 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 00:37:06,402 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 00:37:06,402 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 00:37:06,402 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 00:37:06,402 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 00:37:06,402 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 00:37:06,402 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 -> 3559b3594a82cd675e67391d8043202d21aa0bea5a13d40b68d97450424826dd [2025-02-06 00:37:06,672 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 00:37:06,681 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 00:37:06,685 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 00:37:06,687 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 00:37:06,687 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 00:37:06,689 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-55.i [2025-02-06 00:37:07,997 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/701fabaaa/42221f71cf3f49c7ba737c79d9e0d0e6/FLAG1cd0b9f7e [2025-02-06 00:37:08,284 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 00:37:08,285 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-55.i [2025-02-06 00:37:08,294 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/701fabaaa/42221f71cf3f49c7ba737c79d9e0d0e6/FLAG1cd0b9f7e [2025-02-06 00:37:08,559 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/701fabaaa/42221f71cf3f49c7ba737c79d9e0d0e6 [2025-02-06 00:37:08,561 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 00:37:08,562 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 00:37:08,563 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 00:37:08,563 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 00:37:08,567 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 00:37:08,568 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 12:37:08" (1/1) ... [2025-02-06 00:37:08,568 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d119d39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:37:08, skipping insertion in model container [2025-02-06 00:37:08,568 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 12:37:08" (1/1) ... [2025-02-06 00:37:08,583 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 00:37:08,719 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/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-55.i[916,929] [2025-02-06 00:37:08,773 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 00:37:08,788 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 00:37:08,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/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-55.i[916,929] [2025-02-06 00:37:08,825 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 00:37:08,848 INFO L204 MainTranslator]: Completed translation [2025-02-06 00:37:08,849 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:37:08 WrapperNode [2025-02-06 00:37:08,851 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 00:37:08,852 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 00:37:08,852 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 00:37:08,852 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 00:37:08,858 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:37:08" (1/1) ... [2025-02-06 00:37:08,865 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:37:08" (1/1) ... [2025-02-06 00:37:08,905 INFO L138 Inliner]: procedures = 26, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 152 [2025-02-06 00:37:08,909 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 00:37:08,909 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 00:37:08,909 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 00:37:08,910 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 00:37:08,918 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:37:08" (1/1) ... [2025-02-06 00:37:08,918 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:37:08" (1/1) ... [2025-02-06 00:37:08,920 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:37:08" (1/1) ... [2025-02-06 00:37:08,942 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-06 00:37:08,947 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:37:08" (1/1) ... [2025-02-06 00:37:08,947 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:37:08" (1/1) ... [2025-02-06 00:37:08,955 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:37:08" (1/1) ... [2025-02-06 00:37:08,956 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:37:08" (1/1) ... [2025-02-06 00:37:08,961 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:37:08" (1/1) ... [2025-02-06 00:37:08,961 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:37:08" (1/1) ... [2025-02-06 00:37:08,963 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 00:37:08,967 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 00:37:08,967 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 00:37:08,967 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 00:37:08,968 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:37:08" (1/1) ... [2025-02-06 00:37:08,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 00:37:08,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 00:37:09,001 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-06 00:37:09,005 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-06 00:37:09,026 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 00:37:09,027 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 00:37:09,027 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 00:37:09,027 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 00:37:09,027 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 00:37:09,027 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 00:37:09,092 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 00:37:09,093 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 00:37:09,350 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L101: havoc property_#t~bitwise15#1;havoc property_#t~ite17#1;havoc property_#t~bitwise16#1;havoc property_#t~short18#1; [2025-02-06 00:37:09,384 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2025-02-06 00:37:09,384 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 00:37:09,397 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 00:37:09,398 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 00:37:09,398 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:37:09 BoogieIcfgContainer [2025-02-06 00:37:09,398 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 00:37:09,400 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 00:37:09,400 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 00:37:09,404 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 00:37:09,404 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 12:37:08" (1/3) ... [2025-02-06 00:37:09,405 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72cab54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 12:37:09, skipping insertion in model container [2025-02-06 00:37:09,405 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:37:08" (2/3) ... [2025-02-06 00:37:09,405 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72cab54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 12:37:09, skipping insertion in model container [2025-02-06 00:37:09,406 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:37:09" (3/3) ... [2025-02-06 00:37:09,407 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-55.i [2025-02-06 00:37:09,419 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 00:37:09,420 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_floatingpointinfluence_no-floats_file-55.i that has 2 procedures, 65 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 00:37:09,467 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 00:37:09,475 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;@7dd0b743, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 00:37:09,476 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 00:37:09,479 INFO L276 IsEmpty]: Start isEmpty. Operand has 65 states, 46 states have (on average 1.3695652173913044) internal successors, (63), 47 states have internal predecessors, (63), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-02-06 00:37:09,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-02-06 00:37:09,492 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:37:09,492 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 00:37:09,493 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:37:09,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:37:09,498 INFO L85 PathProgramCache]: Analyzing trace with hash 2075706855, now seen corresponding path program 1 times [2025-02-06 00:37:09,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 00:37:09,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149485633] [2025-02-06 00:37:09,505 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:37:09,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 00:37:09,576 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-02-06 00:37:09,599 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-02-06 00:37:09,600 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:37:09,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:37:09,719 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2025-02-06 00:37:09,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 00:37:09,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149485633] [2025-02-06 00:37:09,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149485633] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 00:37:09,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1818810764] [2025-02-06 00:37:09,721 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:37:09,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 00:37:09,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 00:37:09,724 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-06 00:37:09,726 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-06 00:37:09,792 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-02-06 00:37:09,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-02-06 00:37:09,851 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:37:09,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:37:09,853 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 00:37:09,863 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 00:37:09,893 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2025-02-06 00:37:09,894 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 00:37:09,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1818810764] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 00:37:09,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 00:37:09,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-06 00:37:09,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645625846] [2025-02-06 00:37:09,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 00:37:09,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 00:37:09,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 00:37:09,917 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 00:37:09,918 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 00:37:09,920 INFO L87 Difference]: Start difference. First operand has 65 states, 46 states have (on average 1.3695652173913044) internal successors, (63), 47 states have internal predecessors, (63), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-06 00:37:09,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 00:37:09,961 INFO L93 Difference]: Finished difference Result 124 states and 201 transitions. [2025-02-06 00:37:09,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 00:37:09,963 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 106 [2025-02-06 00:37:09,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 00:37:09,969 INFO L225 Difference]: With dead ends: 124 [2025-02-06 00:37:09,972 INFO L226 Difference]: Without dead ends: 62 [2025-02-06 00:37:09,975 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 107 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-06 00:37:09,978 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 00:37:09,978 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 86 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 00:37:09,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2025-02-06 00:37:10,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2025-02-06 00:37:10,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 44 states have (on average 1.3181818181818181) internal successors, (58), 44 states have internal predecessors, (58), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-02-06 00:37:10,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 90 transitions. [2025-02-06 00:37:10,022 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 90 transitions. Word has length 106 [2025-02-06 00:37:10,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 00:37:10,022 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 90 transitions. [2025-02-06 00:37:10,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-06 00:37:10,023 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 90 transitions. [2025-02-06 00:37:10,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-02-06 00:37:10,026 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:37:10,026 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 00:37:10,035 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-06 00:37:10,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-02-06 00:37:10,227 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:37:10,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:37:10,228 INFO L85 PathProgramCache]: Analyzing trace with hash 143406567, now seen corresponding path program 1 times [2025-02-06 00:37:10,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 00:37:10,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124994371] [2025-02-06 00:37:10,228 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:37:10,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 00:37:10,244 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-02-06 00:37:10,276 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-02-06 00:37:10,277 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:37:10,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:37:10,444 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-02-06 00:37:10,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 00:37:10,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124994371] [2025-02-06 00:37:10,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124994371] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 00:37:10,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 00:37:10,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 00:37:10,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221403480] [2025-02-06 00:37:10,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 00:37:10,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 00:37:10,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 00:37:10,447 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 00:37:10,447 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 00:37:10,447 INFO L87 Difference]: Start difference. First operand 62 states and 90 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-02-06 00:37:10,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 00:37:10,500 INFO L93 Difference]: Finished difference Result 149 states and 215 transitions. [2025-02-06 00:37:10,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 00:37:10,502 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 106 [2025-02-06 00:37:10,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 00:37:10,503 INFO L225 Difference]: With dead ends: 149 [2025-02-06 00:37:10,503 INFO L226 Difference]: Without dead ends: 90 [2025-02-06 00:37:10,504 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 00:37:10,504 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 38 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 00:37:10,505 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 160 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 00:37:10,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2025-02-06 00:37:10,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 63. [2025-02-06 00:37:10,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 45 states have (on average 1.3111111111111111) internal successors, (59), 45 states have internal predecessors, (59), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-02-06 00:37:10,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 91 transitions. [2025-02-06 00:37:10,518 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 91 transitions. Word has length 106 [2025-02-06 00:37:10,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 00:37:10,521 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 91 transitions. [2025-02-06 00:37:10,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-02-06 00:37:10,521 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 91 transitions. [2025-02-06 00:37:10,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-02-06 00:37:10,523 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:37:10,524 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 00:37:10,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 00:37:10,524 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:37:10,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:37:10,525 INFO L85 PathProgramCache]: Analyzing trace with hash 272489286, now seen corresponding path program 1 times [2025-02-06 00:37:10,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 00:37:10,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979943869] [2025-02-06 00:37:10,526 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:37:10,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 00:37:10,538 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-02-06 00:37:10,566 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-02-06 00:37:10,566 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:37:10,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:37:10,744 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-02-06 00:37:10,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 00:37:10,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979943869] [2025-02-06 00:37:10,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979943869] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 00:37:10,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 00:37:10,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 00:37:10,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938123781] [2025-02-06 00:37:10,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 00:37:10,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 00:37:10,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 00:37:10,745 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 00:37:10,746 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 00:37:10,746 INFO L87 Difference]: Start difference. First operand 63 states and 91 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-02-06 00:37:10,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 00:37:10,808 INFO L93 Difference]: Finished difference Result 123 states and 179 transitions. [2025-02-06 00:37:10,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 00:37:10,810 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 106 [2025-02-06 00:37:10,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 00:37:10,812 INFO L225 Difference]: With dead ends: 123 [2025-02-06 00:37:10,812 INFO L226 Difference]: Without dead ends: 63 [2025-02-06 00:37:10,813 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 00:37:10,813 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 0 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 00:37:10,814 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 149 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 00:37:10,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2025-02-06 00:37:10,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2025-02-06 00:37:10,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 45 states have (on average 1.288888888888889) internal successors, (58), 45 states have internal predecessors, (58), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-02-06 00:37:10,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 90 transitions. [2025-02-06 00:37:10,827 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 90 transitions. Word has length 106 [2025-02-06 00:37:10,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 00:37:10,828 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 90 transitions. [2025-02-06 00:37:10,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-02-06 00:37:10,828 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 90 transitions. [2025-02-06 00:37:10,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-02-06 00:37:10,829 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:37:10,829 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 00:37:10,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 00:37:10,829 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:37:10,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:37:10,830 INFO L85 PathProgramCache]: Analyzing trace with hash 671245318, now seen corresponding path program 1 times [2025-02-06 00:37:10,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 00:37:10,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642192901] [2025-02-06 00:37:10,830 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:37:10,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 00:37:10,850 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-02-06 00:37:10,888 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-02-06 00:37:10,888 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:37:10,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:37:11,501 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-02-06 00:37:11,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 00:37:11,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642192901] [2025-02-06 00:37:11,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642192901] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 00:37:11,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 00:37:11,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 00:37:11,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443360164] [2025-02-06 00:37:11,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 00:37:11,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 00:37:11,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 00:37:11,503 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 00:37:11,503 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 00:37:11,503 INFO L87 Difference]: Start difference. First operand 63 states and 90 transitions. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-02-06 00:37:11,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 00:37:11,805 INFO L93 Difference]: Finished difference Result 184 states and 265 transitions. [2025-02-06 00:37:11,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 00:37:11,806 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 108 [2025-02-06 00:37:11,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 00:37:11,808 INFO L225 Difference]: With dead ends: 184 [2025-02-06 00:37:11,810 INFO L226 Difference]: Without dead ends: 124 [2025-02-06 00:37:11,811 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-06 00:37:11,811 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 109 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 00:37:11,813 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 275 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 00:37:11,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2025-02-06 00:37:11,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 114. [2025-02-06 00:37:11,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 79 states have (on average 1.2658227848101267) internal successors, (100), 79 states have internal predecessors, (100), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-02-06 00:37:11,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 164 transitions. [2025-02-06 00:37:11,847 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 164 transitions. Word has length 108 [2025-02-06 00:37:11,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 00:37:11,848 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 164 transitions. [2025-02-06 00:37:11,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-02-06 00:37:11,848 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 164 transitions. [2025-02-06 00:37:11,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-02-06 00:37:11,852 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:37:11,852 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 00:37:11,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 00:37:11,852 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:37:11,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:37:11,853 INFO L85 PathProgramCache]: Analyzing trace with hash 1157102109, now seen corresponding path program 1 times [2025-02-06 00:37:11,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 00:37:11,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749396100] [2025-02-06 00:37:11,853 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:37:11,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 00:37:11,869 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-02-06 00:37:11,904 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-02-06 00:37:11,905 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:37:11,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:37:12,544 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-02-06 00:37:12,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 00:37:12,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749396100] [2025-02-06 00:37:12,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749396100] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 00:37:12,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 00:37:12,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 00:37:12,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014176044] [2025-02-06 00:37:12,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 00:37:12,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 00:37:12,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 00:37:12,547 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 00:37:12,547 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 00:37:12,547 INFO L87 Difference]: Start difference. First operand 114 states and 164 transitions. Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-02-06 00:37:12,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 00:37:12,925 INFO L93 Difference]: Finished difference Result 236 states and 325 transitions. [2025-02-06 00:37:12,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 00:37:12,926 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 110 [2025-02-06 00:37:12,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 00:37:12,928 INFO L225 Difference]: With dead ends: 236 [2025-02-06 00:37:12,928 INFO L226 Difference]: Without dead ends: 176 [2025-02-06 00:37:12,928 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-02-06 00:37:12,929 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 129 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 00:37:12,929 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 297 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 00:37:12,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2025-02-06 00:37:12,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 138. [2025-02-06 00:37:12,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 103 states have (on average 1.2621359223300972) internal successors, (130), 103 states have internal predecessors, (130), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-02-06 00:37:12,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 194 transitions. [2025-02-06 00:37:12,969 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 194 transitions. Word has length 110 [2025-02-06 00:37:12,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 00:37:12,970 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 194 transitions. [2025-02-06 00:37:12,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-02-06 00:37:12,970 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 194 transitions. [2025-02-06 00:37:12,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-02-06 00:37:12,974 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:37:12,975 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 00:37:12,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 00:37:12,975 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:37:12,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:37:12,976 INFO L85 PathProgramCache]: Analyzing trace with hash 1887721101, now seen corresponding path program 1 times [2025-02-06 00:37:12,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 00:37:12,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647159618] [2025-02-06 00:37:12,976 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:37:12,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 00:37:12,986 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-02-06 00:37:13,002 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-02-06 00:37:13,003 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:37:13,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:37:13,470 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-02-06 00:37:13,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 00:37:13,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647159618] [2025-02-06 00:37:13,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647159618] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 00:37:13,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 00:37:13,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 00:37:13,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869140436] [2025-02-06 00:37:13,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 00:37:13,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 00:37:13,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 00:37:13,472 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 00:37:13,472 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-06 00:37:13,473 INFO L87 Difference]: Start difference. First operand 138 states and 194 transitions. Second operand has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-02-06 00:37:13,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 00:37:13,824 INFO L93 Difference]: Finished difference Result 361 states and 497 transitions. [2025-02-06 00:37:13,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 00:37:13,825 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 111 [2025-02-06 00:37:13,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 00:37:13,827 INFO L225 Difference]: With dead ends: 361 [2025-02-06 00:37:13,827 INFO L226 Difference]: Without dead ends: 273 [2025-02-06 00:37:13,828 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2025-02-06 00:37:13,829 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 188 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 481 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 00:37:13,829 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 481 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 00:37:13,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2025-02-06 00:37:13,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 190. [2025-02-06 00:37:13,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 138 states have (on average 1.2536231884057971) internal successors, (173), 138 states have internal predecessors, (173), 48 states have call successors, (48), 3 states have call predecessors, (48), 3 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2025-02-06 00:37:13,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 269 transitions. [2025-02-06 00:37:13,864 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 269 transitions. Word has length 111 [2025-02-06 00:37:13,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 00:37:13,864 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 269 transitions. [2025-02-06 00:37:13,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-02-06 00:37:13,865 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 269 transitions. [2025-02-06 00:37:13,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-02-06 00:37:13,866 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:37:13,866 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 00:37:13,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 00:37:13,867 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:37:13,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:37:13,867 INFO L85 PathProgramCache]: Analyzing trace with hash 84108118, now seen corresponding path program 1 times [2025-02-06 00:37:13,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 00:37:13,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136880358] [2025-02-06 00:37:13,868 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:37:13,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 00:37:13,879 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-02-06 00:37:13,890 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-02-06 00:37:13,890 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:37:13,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:37:13,949 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-02-06 00:37:13,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 00:37:13,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136880358] [2025-02-06 00:37:13,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136880358] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 00:37:13,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 00:37:13,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 00:37:13,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187637025] [2025-02-06 00:37:13,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 00:37:13,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 00:37:13,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 00:37:13,951 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 00:37:13,952 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 00:37:13,952 INFO L87 Difference]: Start difference. First operand 190 states and 269 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-02-06 00:37:14,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 00:37:14,005 INFO L93 Difference]: Finished difference Result 322 states and 460 transitions. [2025-02-06 00:37:14,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 00:37:14,006 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 114 [2025-02-06 00:37:14,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 00:37:14,008 INFO L225 Difference]: With dead ends: 322 [2025-02-06 00:37:14,008 INFO L226 Difference]: Without dead ends: 192 [2025-02-06 00:37:14,009 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 00:37:14,009 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 0 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 00:37:14,012 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 148 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 00:37:14,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2025-02-06 00:37:14,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 192. [2025-02-06 00:37:14,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 140 states have (on average 1.2357142857142858) internal successors, (173), 140 states have internal predecessors, (173), 48 states have call successors, (48), 3 states have call predecessors, (48), 3 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2025-02-06 00:37:14,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 269 transitions. [2025-02-06 00:37:14,044 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 269 transitions. Word has length 114 [2025-02-06 00:37:14,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 00:37:14,045 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 269 transitions. [2025-02-06 00:37:14,045 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-02-06 00:37:14,045 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 269 transitions. [2025-02-06 00:37:14,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-02-06 00:37:14,047 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:37:14,048 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 00:37:14,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 00:37:14,049 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:37:14,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:37:14,049 INFO L85 PathProgramCache]: Analyzing trace with hash 638160244, now seen corresponding path program 1 times [2025-02-06 00:37:14,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 00:37:14,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540273047] [2025-02-06 00:37:14,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:37:14,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 00:37:14,059 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-02-06 00:37:14,117 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-02-06 00:37:14,118 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:37:14,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:37:15,965 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 36 proven. 9 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2025-02-06 00:37:15,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 00:37:15,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540273047] [2025-02-06 00:37:15,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540273047] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 00:37:15,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1519997381] [2025-02-06 00:37:15,966 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:37:15,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 00:37:15,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 00:37:15,968 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-06 00:37:15,970 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-06 00:37:16,008 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-02-06 00:37:16,229 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-02-06 00:37:16,229 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:37:16,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:37:16,231 INFO L256 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-02-06 00:37:16,236 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 00:37:17,402 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 294 proven. 45 refuted. 0 times theorem prover too weak. 141 trivial. 0 not checked. [2025-02-06 00:37:17,403 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 00:37:18,687 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 36 proven. 9 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2025-02-06 00:37:18,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1519997381] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 00:37:18,687 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 00:37:18,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17, 11] total 35 [2025-02-06 00:37:18,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315025846] [2025-02-06 00:37:18,691 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 00:37:18,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-02-06 00:37:18,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 00:37:18,693 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-02-06 00:37:18,693 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=1007, Unknown=0, NotChecked=0, Total=1190 [2025-02-06 00:37:18,694 INFO L87 Difference]: Start difference. First operand 192 states and 269 transitions. Second operand has 35 states, 35 states have (on average 3.4857142857142858) internal successors, (122), 35 states have internal predecessors, (122), 6 states have call successors, (44), 3 states have call predecessors, (44), 7 states have return successors, (45), 7 states have call predecessors, (45), 6 states have call successors, (45) [2025-02-06 00:37:21,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 00:37:21,853 INFO L93 Difference]: Finished difference Result 595 states and 763 transitions. [2025-02-06 00:37:21,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2025-02-06 00:37:21,854 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 3.4857142857142858) internal successors, (122), 35 states have internal predecessors, (122), 6 states have call successors, (44), 3 states have call predecessors, (44), 7 states have return successors, (45), 7 states have call predecessors, (45), 6 states have call successors, (45) Word has length 117 [2025-02-06 00:37:21,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 00:37:21,860 INFO L225 Difference]: With dead ends: 595 [2025-02-06 00:37:21,860 INFO L226 Difference]: Without dead ends: 463 [2025-02-06 00:37:21,864 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 219 SyntacticMatches, 1 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1747 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=1103, Invalid=5539, Unknown=0, NotChecked=0, Total=6642 [2025-02-06 00:37:21,865 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 801 mSDsluCounter, 747 mSDsCounter, 0 mSdLazyCounter, 1362 mSolverCounterSat, 271 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 821 SdHoareTripleChecker+Valid, 805 SdHoareTripleChecker+Invalid, 1633 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 271 IncrementalHoareTripleChecker+Valid, 1362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-02-06 00:37:21,866 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [821 Valid, 805 Invalid, 1633 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [271 Valid, 1362 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-02-06 00:37:21,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2025-02-06 00:37:21,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 253. [2025-02-06 00:37:21,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 193 states have (on average 1.2227979274611398) internal successors, (236), 193 states have internal predecessors, (236), 48 states have call successors, (48), 11 states have call predecessors, (48), 11 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2025-02-06 00:37:21,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 332 transitions. [2025-02-06 00:37:21,903 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 332 transitions. Word has length 117 [2025-02-06 00:37:21,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 00:37:21,903 INFO L471 AbstractCegarLoop]: Abstraction has 253 states and 332 transitions. [2025-02-06 00:37:21,903 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 3.4857142857142858) internal successors, (122), 35 states have internal predecessors, (122), 6 states have call successors, (44), 3 states have call predecessors, (44), 7 states have return successors, (45), 7 states have call predecessors, (45), 6 states have call successors, (45) [2025-02-06 00:37:21,904 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 332 transitions. [2025-02-06 00:37:21,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-02-06 00:37:21,905 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:37:21,905 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 00:37:21,913 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-06 00:37:22,105 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-06 00:37:22,106 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:37:22,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:37:22,106 INFO L85 PathProgramCache]: Analyzing trace with hash 862649245, now seen corresponding path program 1 times [2025-02-06 00:37:22,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 00:37:22,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017877420] [2025-02-06 00:37:22,107 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:37:22,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 00:37:22,115 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-02-06 00:37:22,142 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-02-06 00:37:22,144 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:37:22,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:37:22,281 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 36 proven. 9 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2025-02-06 00:37:22,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 00:37:22,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017877420] [2025-02-06 00:37:22,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017877420] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 00:37:22,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [645474257] [2025-02-06 00:37:22,282 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:37:22,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 00:37:22,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 00:37:22,284 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-06 00:37:22,287 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-06 00:37:22,326 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-02-06 00:37:22,360 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-02-06 00:37:22,361 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:37:22,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:37:22,364 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-06 00:37:22,370 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 00:37:22,481 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 183 proven. 9 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2025-02-06 00:37:22,482 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 00:37:22,665 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 36 proven. 9 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2025-02-06 00:37:22,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [645474257] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 00:37:22,665 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 00:37:22,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 13 [2025-02-06 00:37:22,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246945882] [2025-02-06 00:37:22,666 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 00:37:22,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-06 00:37:22,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 00:37:22,668 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 00:37:22,668 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2025-02-06 00:37:22,668 INFO L87 Difference]: Start difference. First operand 253 states and 332 transitions. Second operand has 13 states, 13 states have (on average 5.615384615384615) internal successors, (73), 13 states have internal predecessors, (73), 3 states have call successors, (22), 2 states have call predecessors, (22), 4 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) [2025-02-06 00:37:23,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 00:37:23,072 INFO L93 Difference]: Finished difference Result 558 states and 724 transitions. [2025-02-06 00:37:23,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-06 00:37:23,072 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.615384615384615) internal successors, (73), 13 states have internal predecessors, (73), 3 states have call successors, (22), 2 states have call predecessors, (22), 4 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) Word has length 118 [2025-02-06 00:37:23,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 00:37:23,075 INFO L225 Difference]: With dead ends: 558 [2025-02-06 00:37:23,075 INFO L226 Difference]: Without dead ends: 353 [2025-02-06 00:37:23,076 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 230 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=125, Invalid=255, Unknown=0, NotChecked=0, Total=380 [2025-02-06 00:37:23,076 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 221 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 406 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 00:37:23,076 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 239 Invalid, 406 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 295 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 00:37:23,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2025-02-06 00:37:23,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 256. [2025-02-06 00:37:23,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 196 states have (on average 1.1938775510204083) internal successors, (234), 196 states have internal predecessors, (234), 48 states have call successors, (48), 11 states have call predecessors, (48), 11 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2025-02-06 00:37:23,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 330 transitions. [2025-02-06 00:37:23,103 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 330 transitions. Word has length 118 [2025-02-06 00:37:23,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 00:37:23,103 INFO L471 AbstractCegarLoop]: Abstraction has 256 states and 330 transitions. [2025-02-06 00:37:23,103 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.615384615384615) internal successors, (73), 13 states have internal predecessors, (73), 3 states have call successors, (22), 2 states have call predecessors, (22), 4 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) [2025-02-06 00:37:23,104 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 330 transitions. [2025-02-06 00:37:23,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-02-06 00:37:23,105 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:37:23,105 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 00:37:23,114 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-06 00:37:23,308 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-06 00:37:23,309 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:37:23,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:37:23,309 INFO L85 PathProgramCache]: Analyzing trace with hash 357090620, now seen corresponding path program 1 times [2025-02-06 00:37:23,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 00:37:23,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597766605] [2025-02-06 00:37:23,310 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:37:23,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 00:37:23,316 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-02-06 00:37:23,354 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-02-06 00:37:23,354 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:37:23,354 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 00:37:23,355 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 00:37:23,359 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-02-06 00:37:23,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-02-06 00:37:23,386 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:37:23,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 00:37:23,426 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 00:37:23,427 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 00:37:23,428 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-06 00:37:23,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 00:37:23,434 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 00:37:23,538 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 00:37:23,542 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 12:37:23 BoogieIcfgContainer [2025-02-06 00:37:23,544 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 00:37:23,544 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 00:37:23,544 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 00:37:23,544 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 00:37:23,545 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:37:09" (3/4) ... [2025-02-06 00:37:23,547 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-06 00:37:23,548 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 00:37:23,549 INFO L158 Benchmark]: Toolchain (without parser) took 14986.45ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 112.4MB in the beginning and 186.1MB in the end (delta: -73.7MB). Peak memory consumption was 66.0MB. Max. memory is 16.1GB. [2025-02-06 00:37:23,549 INFO L158 Benchmark]: CDTParser took 0.54ms. Allocated memory is still 226.5MB. Free memory is still 146.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 00:37:23,550 INFO L158 Benchmark]: CACSL2BoogieTranslator took 288.01ms. Allocated memory is still 142.6MB. Free memory was 112.4MB in the beginning and 99.7MB in the end (delta: 12.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 00:37:23,550 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.08ms. Allocated memory is still 142.6MB. Free memory was 99.7MB in the beginning and 97.2MB in the end (delta: 2.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 00:37:23,551 INFO L158 Benchmark]: Boogie Preprocessor took 57.02ms. Allocated memory is still 142.6MB. Free memory was 97.2MB in the beginning and 94.9MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 00:37:23,551 INFO L158 Benchmark]: IcfgBuilder took 431.15ms. Allocated memory is still 142.6MB. Free memory was 94.9MB in the beginning and 74.7MB in the end (delta: 20.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 00:37:23,551 INFO L158 Benchmark]: TraceAbstraction took 14143.63ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 74.1MB in the beginning and 189.3MB in the end (delta: -115.2MB). Peak memory consumption was 32.4MB. Max. memory is 16.1GB. [2025-02-06 00:37:23,552 INFO L158 Benchmark]: Witness Printer took 3.66ms. Allocated memory is still 285.2MB. Free memory was 189.3MB in the beginning and 186.1MB in the end (delta: 3.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 00:37:23,553 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.54ms. Allocated memory is still 226.5MB. Free memory is still 146.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 288.01ms. Allocated memory is still 142.6MB. Free memory was 112.4MB in the beginning and 99.7MB in the end (delta: 12.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 57.08ms. Allocated memory is still 142.6MB. Free memory was 99.7MB in the beginning and 97.2MB in the end (delta: 2.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 57.02ms. Allocated memory is still 142.6MB. Free memory was 97.2MB in the beginning and 94.9MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 431.15ms. Allocated memory is still 142.6MB. Free memory was 94.9MB in the beginning and 74.7MB in the end (delta: 20.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 14143.63ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 74.1MB in the beginning and 189.3MB in the end (delta: -115.2MB). Peak memory consumption was 32.4MB. Max. memory is 16.1GB. * Witness Printer took 3.66ms. Allocated memory is still 285.2MB. Free memory was 189.3MB in the beginning and 186.1MB in the end (delta: 3.2MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of shiftRight at line 101, overapproximation of shiftRight at line 60, overapproximation of shiftRight at line 101, overapproximation of shiftRight at line 60. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 10; [L23] unsigned char var_1_2 = 0; [L24] unsigned char var_1_5 = 0; [L25] signed long int var_1_7 = 256; [L26] signed long int var_1_8 = 63; [L27] signed long int var_1_9 = 1; [L28] signed long int var_1_10 = 0; [L29] signed long int var_1_11 = 16; [L30] signed long int var_1_12 = -5; [L31] unsigned char var_1_14 = 128; [L32] signed long int var_1_15 = 4; [L33] unsigned long int var_1_16 = 500; [L34] unsigned char var_1_17 = 2; [L35] unsigned char var_1_18 = 100; [L36] signed long int last_1_var_1_12 = -5; [L37] unsigned char last_1_var_1_17 = 2; VAL [isInitial=0, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=16, var_1_12=-5, var_1_14=128, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_5=0, var_1_7=256, var_1_8=63, var_1_9=1] [L105] isInitial = 1 [L106] FCALL initially() [L107] COND TRUE 1 [L108] CALL updateLastVariables() [L97] last_1_var_1_12 = var_1_12 [L98] last_1_var_1_17 = var_1_17 VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=16, var_1_12=-5, var_1_14=128, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_5=0, var_1_7=256, var_1_8=63, var_1_9=1] [L108] RET updateLastVariables() [L109] CALL updateVariables() [L71] var_1_2 = __VERIFIER_nondet_uchar() [L72] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=16, var_1_12=-5, var_1_14=128, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_5=0, var_1_7=256, var_1_8=63, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=16, var_1_12=-5, var_1_14=128, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_5=0, var_1_7=256, var_1_8=63, var_1_9=1] [L72] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=16, var_1_12=-5, var_1_14=128, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_5=0, var_1_7=256, var_1_8=63, var_1_9=1] [L73] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=16, var_1_12=-5, var_1_14=128, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_5=0, var_1_7=256, var_1_8=63, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=16, var_1_12=-5, var_1_14=128, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_5=0, var_1_7=256, var_1_8=63, var_1_9=1] [L73] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=16, var_1_12=-5, var_1_14=128, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_5=0, var_1_7=256, var_1_8=63, var_1_9=1] [L74] var_1_5 = __VERIFIER_nondet_uchar() [L75] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=16, var_1_12=-5, var_1_14=128, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_7=256, var_1_8=63, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=16, var_1_12=-5, var_1_14=128, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_7=256, var_1_8=63, var_1_9=1] [L75] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=16, var_1_12=-5, var_1_14=128, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_7=256, var_1_8=63, var_1_9=1] [L76] CALL assume_abort_if_not(var_1_5 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=16, var_1_12=-5, var_1_14=128, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=63, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=16, var_1_12=-5, var_1_14=128, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=63, var_1_9=1] [L76] RET assume_abort_if_not(var_1_5 <= 1) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=16, var_1_12=-5, var_1_14=128, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=63, var_1_9=1] [L77] var_1_8 = __VERIFIER_nondet_long() [L78] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=16, var_1_12=-5, var_1_14=128, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=16, var_1_12=-5, var_1_14=128, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=1] [L78] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=16, var_1_12=-5, var_1_14=128, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=1] [L79] CALL assume_abort_if_not(var_1_8 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=16, var_1_12=-5, var_1_14=128, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=16, var_1_12=-5, var_1_14=128, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=1] [L79] RET assume_abort_if_not(var_1_8 <= 2147483647) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=16, var_1_12=-5, var_1_14=128, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=1] [L80] var_1_9 = __VERIFIER_nondet_long() [L81] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=16, var_1_12=-5, var_1_14=128, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=16, var_1_12=-5, var_1_14=128, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L81] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=16, var_1_12=-5, var_1_14=128, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L82] CALL assume_abort_if_not(var_1_9 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=16, var_1_12=-5, var_1_14=128, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=16, var_1_12=-5, var_1_14=128, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L82] RET assume_abort_if_not(var_1_9 <= 2147483647) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=16, var_1_12=-5, var_1_14=128, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L83] var_1_10 = __VERIFIER_nondet_long() [L84] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=16, var_1_12=-5, var_1_14=128, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=16, var_1_12=-5, var_1_14=128, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L84] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=16, var_1_12=-5, var_1_14=128, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L85] CALL assume_abort_if_not(var_1_10 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=16, var_1_12=-5, var_1_14=128, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=16, var_1_12=-5, var_1_14=128, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L85] RET assume_abort_if_not(var_1_10 <= 2147483647) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=16, var_1_12=-5, var_1_14=128, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L86] var_1_11 = __VERIFIER_nondet_long() [L87] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=0, var_1_12=-5, var_1_14=128, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=0, var_1_12=-5, var_1_14=128, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L87] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=0, var_1_12=-5, var_1_14=128, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L88] CALL assume_abort_if_not(var_1_11 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=0, var_1_12=-5, var_1_14=128, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=0, var_1_12=-5, var_1_14=128, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L88] RET assume_abort_if_not(var_1_11 <= 2147483647) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=0, var_1_12=-5, var_1_14=128, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L89] var_1_14 = __VERIFIER_nondet_uchar() [L90] CALL assume_abort_if_not(var_1_14 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=0, var_1_12=-5, var_1_14=255, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=0, var_1_12=-5, var_1_14=255, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L90] RET assume_abort_if_not(var_1_14 >= 127) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=0, var_1_12=-5, var_1_14=255, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L91] CALL assume_abort_if_not(var_1_14 <= 255) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=0, var_1_12=-5, var_1_14=255, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=0, var_1_12=-5, var_1_14=255, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L91] RET assume_abort_if_not(var_1_14 <= 255) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=0, var_1_12=-5, var_1_14=255, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L92] var_1_18 = __VERIFIER_nondet_uchar() [L93] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=0, var_1_12=-5, var_1_14=255, var_1_15=4, var_1_16=500, var_1_17=2, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=0, var_1_12=-5, var_1_14=255, var_1_15=4, var_1_16=500, var_1_17=2, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L93] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=0, var_1_12=-5, var_1_14=255, var_1_15=4, var_1_16=500, var_1_17=2, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L94] CALL assume_abort_if_not(var_1_18 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=0, var_1_12=-5, var_1_14=255, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=254, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=0, var_1_12=-5, var_1_14=255, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=254, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L94] RET assume_abort_if_not(var_1_18 <= 254) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=0, var_1_12=-5, var_1_14=255, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=254, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L109] RET updateVariables() [L110] CALL step() [L41] unsigned char stepLocal_1 = last_1_var_1_12 >= last_1_var_1_17; [L42] signed long int stepLocal_0 = last_1_var_1_17; VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, stepLocal_0=2, stepLocal_1=0, var_1_10=0, var_1_11=0, var_1_12=-5, var_1_14=255, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=254, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L43] COND FALSE !(\read(var_1_2)) [L52] var_1_1 = last_1_var_1_17 VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, stepLocal_0=2, stepLocal_1=0, var_1_10=0, var_1_11=0, var_1_12=-5, var_1_14=255, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=254, var_1_1=2, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L54] COND FALSE !(\read(var_1_2)) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, stepLocal_0=2, stepLocal_1=0, var_1_10=0, var_1_11=0, var_1_12=-5, var_1_14=255, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=254, var_1_1=2, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L57] var_1_15 = var_1_8 [L58] var_1_16 = var_1_14 [L59] var_1_17 = var_1_18 VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, stepLocal_0=2, stepLocal_1=0, var_1_10=0, var_1_11=0, var_1_12=-5, var_1_14=255, var_1_15=0, var_1_16=255, var_1_17=254, var_1_18=254, var_1_1=2, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L60] EXPR -4 >> var_1_1 VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, stepLocal_0=2, stepLocal_1=0, var_1_10=0, var_1_11=0, var_1_12=-5, var_1_14=255, var_1_15=0, var_1_16=255, var_1_17=254, var_1_18=254, var_1_1=2, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L60] EXPR (((-4 >> var_1_1)) < (var_1_1)) ? ((-4 >> var_1_1)) : (var_1_1) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, stepLocal_0=2, stepLocal_1=0, var_1_10=0, var_1_11=0, var_1_12=-5, var_1_14=255, var_1_15=0, var_1_16=255, var_1_17=254, var_1_18=254, var_1_1=2, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L60] EXPR -4 >> var_1_1 VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, stepLocal_0=2, stepLocal_1=0, var_1_10=0, var_1_11=0, var_1_12=-5, var_1_14=255, var_1_15=0, var_1_16=255, var_1_17=254, var_1_18=254, var_1_1=2, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L60] EXPR (((-4 >> var_1_1)) < (var_1_1)) ? ((-4 >> var_1_1)) : (var_1_1) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, stepLocal_0=2, stepLocal_1=0, var_1_10=0, var_1_11=0, var_1_12=-5, var_1_14=255, var_1_15=0, var_1_16=255, var_1_17=254, var_1_18=254, var_1_1=2, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L60] signed long int stepLocal_3 = ((((-4 >> var_1_1)) < (var_1_1)) ? ((-4 >> var_1_1)) : (var_1_1)); [L61] signed long int stepLocal_2 = var_1_1 / -8; VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, stepLocal_0=2, stepLocal_1=0, stepLocal_2=0, stepLocal_3=-255, var_1_10=0, var_1_11=0, var_1_12=-5, var_1_14=255, var_1_15=0, var_1_16=255, var_1_17=254, var_1_18=254, var_1_1=2, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L62] COND TRUE (~ var_1_17) <= stepLocal_3 VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, stepLocal_0=2, stepLocal_1=0, stepLocal_2=0, var_1_10=0, var_1_11=0, var_1_12=-5, var_1_14=255, var_1_15=0, var_1_16=255, var_1_17=254, var_1_18=254, var_1_1=2, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L63] COND FALSE !((var_1_14 - 64) < stepLocal_2) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, stepLocal_0=2, stepLocal_1=0, var_1_10=0, var_1_11=0, var_1_12=-5, var_1_14=255, var_1_15=0, var_1_16=255, var_1_17=254, var_1_18=254, var_1_1=2, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L110] RET step() [L111] CALL, EXPR property() [L101] EXPR ((var_1_2 ? (((last_1_var_1_12 >= last_1_var_1_17) && var_1_5) ? ((last_1_var_1_12 >= last_1_var_1_17) ? (var_1_1 == ((unsigned short int) 5)) : (var_1_1 == ((unsigned short int) ((((25) < (last_1_var_1_17)) ? (25) : (last_1_var_1_17)))))) : 1) : (var_1_1 == ((unsigned short int) last_1_var_1_17))) && (var_1_2 ? (var_1_7 == ((signed long int) (((var_1_8 + var_1_9) + var_1_10) - var_1_11))) : 1)) && (((~ var_1_17) <= (((((-4 >> var_1_1)) < (var_1_1)) ? ((-4 >> var_1_1)) : (var_1_1)))) ? (((var_1_14 - 64) < (var_1_1 / -8)) ? (var_1_12 == ((signed long int) var_1_1)) : 1) : (var_1_12 == ((signed long int) (var_1_17 - var_1_14)))) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=0, var_1_12=-5, var_1_14=255, var_1_15=0, var_1_16=255, var_1_17=254, var_1_18=254, var_1_1=2, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L101] EXPR -4 >> var_1_1 VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=0, var_1_12=-5, var_1_14=255, var_1_15=0, var_1_16=255, var_1_17=254, var_1_18=254, var_1_1=2, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L101] EXPR (((-4 >> var_1_1)) < (var_1_1)) ? ((-4 >> var_1_1)) : (var_1_1) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=0, var_1_12=-5, var_1_14=255, var_1_15=0, var_1_16=255, var_1_17=254, var_1_18=254, var_1_1=2, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L101] EXPR -4 >> var_1_1 VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=0, var_1_12=-5, var_1_14=255, var_1_15=0, var_1_16=255, var_1_17=254, var_1_18=254, var_1_1=2, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L101] EXPR (((-4 >> var_1_1)) < (var_1_1)) ? ((-4 >> var_1_1)) : (var_1_1) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=0, var_1_12=-5, var_1_14=255, var_1_15=0, var_1_16=255, var_1_17=254, var_1_18=254, var_1_1=2, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L101] EXPR ((var_1_2 ? (((last_1_var_1_12 >= last_1_var_1_17) && var_1_5) ? ((last_1_var_1_12 >= last_1_var_1_17) ? (var_1_1 == ((unsigned short int) 5)) : (var_1_1 == ((unsigned short int) ((((25) < (last_1_var_1_17)) ? (25) : (last_1_var_1_17)))))) : 1) : (var_1_1 == ((unsigned short int) last_1_var_1_17))) && (var_1_2 ? (var_1_7 == ((signed long int) (((var_1_8 + var_1_9) + var_1_10) - var_1_11))) : 1)) && (((~ var_1_17) <= (((((-4 >> var_1_1)) < (var_1_1)) ? ((-4 >> var_1_1)) : (var_1_1)))) ? (((var_1_14 - 64) < (var_1_1 / -8)) ? (var_1_12 == ((signed long int) var_1_1)) : 1) : (var_1_12 == ((signed long int) (var_1_17 - var_1_14)))) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=0, var_1_12=-5, var_1_14=255, var_1_15=0, var_1_16=255, var_1_17=254, var_1_18=254, var_1_1=2, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L101-L102] return (((((var_1_2 ? (((last_1_var_1_12 >= last_1_var_1_17) && var_1_5) ? ((last_1_var_1_12 >= last_1_var_1_17) ? (var_1_1 == ((unsigned short int) 5)) : (var_1_1 == ((unsigned short int) ((((25) < (last_1_var_1_17)) ? (25) : (last_1_var_1_17)))))) : 1) : (var_1_1 == ((unsigned short int) last_1_var_1_17))) && (var_1_2 ? (var_1_7 == ((signed long int) (((var_1_8 + var_1_9) + var_1_10) - var_1_11))) : 1)) && (((~ var_1_17) <= (((((-4 >> var_1_1)) < (var_1_1)) ? ((-4 >> var_1_1)) : (var_1_1)))) ? (((var_1_14 - 64) < (var_1_1 / -8)) ? (var_1_12 == ((signed long int) var_1_1)) : 1) : (var_1_12 == ((signed long int) (var_1_17 - var_1_14))))) && (var_1_15 == ((signed long int) var_1_8))) && (var_1_16 == ((unsigned long int) var_1_14))) && (var_1_17 == ((unsigned char) var_1_18)) ; [L111] RET, EXPR property() [L111] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=0, var_1_12=-5, var_1_14=255, var_1_15=0, var_1_16=255, var_1_17=254, var_1_18=254, var_1_1=2, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=0, var_1_12=-5, var_1_14=255, var_1_15=0, var_1_16=255, var_1_17=254, var_1_18=254, var_1_1=2, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 65 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 14.0s, OverallIterations: 10, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1530 SdHoareTripleChecker+Valid, 2.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1486 mSDsluCounter, 2640 SdHoareTripleChecker+Invalid, 2.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1911 mSDsCounter, 592 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2121 IncrementalHoareTripleChecker+Invalid, 2713 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 592 mSolverCounterUnsat, 729 mSDtfsCounter, 2121 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 704 GetRequests, 575 SyntacticMatches, 2 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1825 ImplicationChecksByTransitivity, 3.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=256occurred in iteration=9, InterpolantAutomatonStates: 106, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 9 MinimizatonAttempts, 465 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 7.0s InterpolantComputationTime, 1455 NumberOfCodeBlocks, 1455 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 1558 ConstructedInterpolants, 0 QuantifiedInterpolants, 5626 SizeOfPredicates, 13 NumberOfNonLiveVariables, 807 ConjunctsInSsa, 45 ConjunctsInUnsatCore, 14 InterpolantComputations, 7 PerfectInterpolantSequences, 6600/6720 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-02-06 00:37:23,579 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-55.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.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 3559b3594a82cd675e67391d8043202d21aa0bea5a13d40b68d97450424826dd --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 00:37:25,928 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 00:37:26,046 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-02-06 00:37:26,054 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 00:37:26,055 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 00:37:26,080 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 00:37:26,081 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 00:37:26,082 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 00:37:26,083 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 00:37:26,083 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 00:37:26,083 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 00:37:26,083 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 00:37:26,084 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 00:37:26,084 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 00:37:26,084 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 00:37:26,085 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 00:37:26,085 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 00:37:26,085 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 00:37:26,085 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 00:37:26,085 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 00:37:26,086 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 00:37:26,086 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 00:37:26,086 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 00:37:26,086 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 00:37:26,086 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-06 00:37:26,086 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-06 00:37:26,086 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 00:37:26,086 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 00:37:26,086 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 00:37:26,087 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 00:37:26,087 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 00:37:26,087 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 00:37:26,087 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 00:37:26,088 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 00:37:26,088 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 00:37:26,088 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 00:37:26,088 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 00:37:26,088 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 00:37:26,088 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 00:37:26,088 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-06 00:37:26,088 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-06 00:37:26,089 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 00:37:26,089 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 00:37:26,089 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 00:37:26,089 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 00:37:26,089 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 -> 3559b3594a82cd675e67391d8043202d21aa0bea5a13d40b68d97450424826dd [2025-02-06 00:37:26,385 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 00:37:26,393 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 00:37:26,395 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 00:37:26,396 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 00:37:26,396 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 00:37:26,401 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-55.i [2025-02-06 00:37:27,697 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/986c702b2/73fd6ee515a5430fb470de320656609c/FLAG8571fc1bf [2025-02-06 00:37:27,902 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 00:37:27,904 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-55.i [2025-02-06 00:37:27,915 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/986c702b2/73fd6ee515a5430fb470de320656609c/FLAG8571fc1bf [2025-02-06 00:37:27,933 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/986c702b2/73fd6ee515a5430fb470de320656609c [2025-02-06 00:37:27,937 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 00:37:27,938 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 00:37:27,940 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 00:37:27,941 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 00:37:27,945 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 00:37:27,946 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 12:37:27" (1/1) ... [2025-02-06 00:37:27,947 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1651e9c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:37:27, skipping insertion in model container [2025-02-06 00:37:27,947 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 12:37:27" (1/1) ... [2025-02-06 00:37:27,967 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 00:37:28,102 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/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-55.i[916,929] [2025-02-06 00:37:28,152 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 00:37:28,172 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 00:37:28,185 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/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-55.i[916,929] [2025-02-06 00:37:28,213 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 00:37:28,230 INFO L204 MainTranslator]: Completed translation [2025-02-06 00:37:28,232 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:37:28 WrapperNode [2025-02-06 00:37:28,232 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 00:37:28,233 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 00:37:28,234 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 00:37:28,234 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 00:37:28,240 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:37:28" (1/1) ... [2025-02-06 00:37:28,250 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:37:28" (1/1) ... [2025-02-06 00:37:28,275 INFO L138 Inliner]: procedures = 27, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 108 [2025-02-06 00:37:28,275 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 00:37:28,275 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 00:37:28,276 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 00:37:28,276 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 00:37:28,284 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:37:28" (1/1) ... [2025-02-06 00:37:28,286 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:37:28" (1/1) ... [2025-02-06 00:37:28,288 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:37:28" (1/1) ... [2025-02-06 00:37:28,310 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-06 00:37:28,310 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:37:28" (1/1) ... [2025-02-06 00:37:28,310 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:37:28" (1/1) ... [2025-02-06 00:37:28,320 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:37:28" (1/1) ... [2025-02-06 00:37:28,321 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:37:28" (1/1) ... [2025-02-06 00:37:28,323 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:37:28" (1/1) ... [2025-02-06 00:37:28,324 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:37:28" (1/1) ... [2025-02-06 00:37:28,326 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 00:37:28,326 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 00:37:28,327 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 00:37:28,327 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 00:37:28,328 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:37:28" (1/1) ... [2025-02-06 00:37:28,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 00:37:28,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 00:37:28,362 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-06 00:37:28,366 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-06 00:37:28,388 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 00:37:28,389 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-06 00:37:28,389 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 00:37:28,389 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 00:37:28,389 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 00:37:28,389 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 00:37:28,465 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 00:37:28,466 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 00:37:28,743 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2025-02-06 00:37:28,744 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 00:37:28,753 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 00:37:28,753 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 00:37:28,754 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:37:28 BoogieIcfgContainer [2025-02-06 00:37:28,754 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 00:37:28,755 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 00:37:28,756 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 00:37:28,760 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 00:37:28,760 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 12:37:27" (1/3) ... [2025-02-06 00:37:28,760 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35cb7ed1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 12:37:28, skipping insertion in model container [2025-02-06 00:37:28,760 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:37:28" (2/3) ... [2025-02-06 00:37:28,760 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35cb7ed1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 12:37:28, skipping insertion in model container [2025-02-06 00:37:28,761 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:37:28" (3/3) ... [2025-02-06 00:37:28,762 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-55.i [2025-02-06 00:37:28,776 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 00:37:28,778 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_floatingpointinfluence_no-floats_file-55.i that has 2 procedures, 49 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 00:37:28,839 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 00:37:28,849 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;@5b7860e6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 00:37:28,849 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 00:37:28,853 INFO L276 IsEmpty]: Start isEmpty. Operand has 49 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 31 states have internal predecessors, (40), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-02-06 00:37:28,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-02-06 00:37:28,863 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:37:28,864 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 00:37:28,865 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:37:28,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:37:28,870 INFO L85 PathProgramCache]: Analyzing trace with hash -392786085, now seen corresponding path program 1 times [2025-02-06 00:37:28,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 00:37:28,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [751399294] [2025-02-06 00:37:28,881 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:37:28,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 00:37:28,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 00:37:28,884 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-06 00:37:28,886 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-06 00:37:28,981 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-02-06 00:37:29,024 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-02-06 00:37:29,025 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:37:29,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:37:29,028 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 00:37:29,035 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 00:37:29,077 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2025-02-06 00:37:29,077 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 00:37:29,077 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 00:37:29,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [751399294] [2025-02-06 00:37:29,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [751399294] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 00:37:29,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 00:37:29,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 00:37:29,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198750184] [2025-02-06 00:37:29,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 00:37:29,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 00:37:29,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 00:37:29,104 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 00:37:29,105 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 00:37:29,106 INFO L87 Difference]: Start difference. First operand has 49 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 31 states have internal predecessors, (40), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-06 00:37:29,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 00:37:29,130 INFO L93 Difference]: Finished difference Result 92 states and 155 transitions. [2025-02-06 00:37:29,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 00:37:29,133 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 101 [2025-02-06 00:37:29,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 00:37:29,140 INFO L225 Difference]: With dead ends: 92 [2025-02-06 00:37:29,140 INFO L226 Difference]: Without dead ends: 46 [2025-02-06 00:37:29,144 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 100 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-06 00:37:29,148 INFO L435 NwaCegarLoop]: 67 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, 67 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-06 00:37:29,149 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 00:37:29,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2025-02-06 00:37:29,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2025-02-06 00:37:29,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 28 states have (on average 1.25) internal successors, (35), 28 states have internal predecessors, (35), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-02-06 00:37:29,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 67 transitions. [2025-02-06 00:37:29,207 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 67 transitions. Word has length 101 [2025-02-06 00:37:29,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 00:37:29,208 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 67 transitions. [2025-02-06 00:37:29,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-06 00:37:29,209 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 67 transitions. [2025-02-06 00:37:29,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-02-06 00:37:29,215 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:37:29,216 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 00:37:29,223 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-06 00:37:29,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 00:37:29,417 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:37:29,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:37:29,417 INFO L85 PathProgramCache]: Analyzing trace with hash -1587732645, now seen corresponding path program 1 times [2025-02-06 00:37:29,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 00:37:29,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1400740604] [2025-02-06 00:37:29,419 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:37:29,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 00:37:29,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 00:37:29,421 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-06 00:37:29,423 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-06 00:37:29,484 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-02-06 00:37:29,516 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-02-06 00:37:29,516 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:37:29,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:37:29,519 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-06 00:37:29,523 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 00:37:29,555 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-02-06 00:37:29,555 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 00:37:29,555 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 00:37:29,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1400740604] [2025-02-06 00:37:29,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1400740604] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 00:37:29,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 00:37:29,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 00:37:29,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948118600] [2025-02-06 00:37:29,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 00:37:29,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 00:37:29,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 00:37:29,557 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 00:37:29,557 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 00:37:29,558 INFO L87 Difference]: Start difference. First operand 46 states and 67 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-02-06 00:37:29,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 00:37:29,599 INFO L93 Difference]: Finished difference Result 101 states and 146 transitions. [2025-02-06 00:37:29,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 00:37:29,601 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 101 [2025-02-06 00:37:29,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 00:37:29,602 INFO L225 Difference]: With dead ends: 101 [2025-02-06 00:37:29,602 INFO L226 Difference]: Without dead ends: 58 [2025-02-06 00:37:29,603 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 00:37:29,604 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 15 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 00:37:29,604 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 121 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 00:37:29,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2025-02-06 00:37:29,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 47. [2025-02-06 00:37:29,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 29 states have internal predecessors, (36), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-02-06 00:37:29,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 68 transitions. [2025-02-06 00:37:29,621 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 68 transitions. Word has length 101 [2025-02-06 00:37:29,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 00:37:29,623 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 68 transitions. [2025-02-06 00:37:29,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-02-06 00:37:29,625 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 68 transitions. [2025-02-06 00:37:29,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-02-06 00:37:29,626 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:37:29,627 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 00:37:29,636 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-06 00:37:29,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 00:37:29,828 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:37:29,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:37:29,829 INFO L85 PathProgramCache]: Analyzing trace with hash -700228964, now seen corresponding path program 1 times [2025-02-06 00:37:29,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 00:37:29,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1544321216] [2025-02-06 00:37:29,829 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:37:29,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 00:37:29,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 00:37:29,834 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-06 00:37:29,836 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-06 00:37:29,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-02-06 00:37:29,936 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-02-06 00:37:29,936 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:37:29,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:37:29,938 INFO L256 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-06 00:37:29,942 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 00:37:30,228 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-02-06 00:37:30,229 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 00:37:30,229 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 00:37:30,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1544321216] [2025-02-06 00:37:30,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1544321216] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 00:37:30,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 00:37:30,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 00:37:30,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360746066] [2025-02-06 00:37:30,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 00:37:30,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 00:37:30,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 00:37:30,232 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 00:37:30,232 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 00:37:30,233 INFO L87 Difference]: Start difference. First operand 47 states and 68 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-02-06 00:37:30,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 00:37:30,463 INFO L93 Difference]: Finished difference Result 190 states and 277 transitions. [2025-02-06 00:37:30,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 00:37:30,464 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 101 [2025-02-06 00:37:30,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 00:37:30,466 INFO L225 Difference]: With dead ends: 190 [2025-02-06 00:37:30,466 INFO L226 Difference]: Without dead ends: 146 [2025-02-06 00:37:30,467 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-02-06 00:37:30,467 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 125 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 00:37:30,468 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 403 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 00:37:30,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2025-02-06 00:37:30,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 121. [2025-02-06 00:37:30,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 69 states have (on average 1.2173913043478262) internal successors, (84), 69 states have internal predecessors, (84), 48 states have call successors, (48), 3 states have call predecessors, (48), 3 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2025-02-06 00:37:30,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 180 transitions. [2025-02-06 00:37:30,496 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 180 transitions. Word has length 101 [2025-02-06 00:37:30,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 00:37:30,496 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 180 transitions. [2025-02-06 00:37:30,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-02-06 00:37:30,497 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 180 transitions. [2025-02-06 00:37:30,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-02-06 00:37:30,498 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:37:30,498 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 00:37:30,506 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-06 00:37:30,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 00:37:30,702 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:37:30,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:37:30,703 INFO L85 PathProgramCache]: Analyzing trace with hash -202647191, now seen corresponding path program 1 times [2025-02-06 00:37:30,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 00:37:30,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [955854743] [2025-02-06 00:37:30,703 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:37:30,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 00:37:30,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 00:37:30,706 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-06 00:37:30,707 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-06 00:37:30,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-02-06 00:37:30,778 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-02-06 00:37:30,779 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:37:30,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:37:30,781 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-06 00:37:30,790 INFO L279 TraceCheckSpWp]: Computing forward predicates...