./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-9.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_codestructure_dependencies_file-9.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 c2c331e2f68e9d93ed0b3a3f04be22ea072b7c552ef634090004a61d599de390 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 20:27:18,217 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 20:27:18,274 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 20:27:18,281 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 20:27:18,281 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 20:27:18,301 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 20:27:18,302 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 20:27:18,302 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 20:27:18,302 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 20:27:18,302 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 20:27:18,303 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 20:27:18,303 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 20:27:18,304 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 20:27:18,304 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 20:27:18,304 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 20:27:18,304 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 20:27:18,304 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 20:27:18,304 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 20:27:18,304 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 20:27:18,304 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 20:27:18,304 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 20:27:18,305 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 20:27:18,305 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 20:27:18,305 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 20:27:18,305 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 20:27:18,305 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 20:27:18,305 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 20:27:18,305 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 20:27:18,305 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 20:27:18,305 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 20:27:18,305 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 20:27:18,306 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 20:27:18,306 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 20:27:18,306 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 20:27:18,306 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 20:27:18,306 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 20:27:18,306 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 20:27:18,306 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 20:27:18,306 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 20:27:18,306 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 20:27:18,307 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 20:27:18,307 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 20:27:18,307 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 20:27:18,307 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 -> c2c331e2f68e9d93ed0b3a3f04be22ea072b7c552ef634090004a61d599de390 [2025-02-05 20:27:18,559 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 20:27:18,568 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 20:27:18,569 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 20:27:18,570 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 20:27:18,570 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 20:27:18,572 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-9.i [2025-02-05 20:27:19,738 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6d47f7d03/57a8c921954f493190a80a0647d8aa86/FLAG0d1b9d772 [2025-02-05 20:27:20,023 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 20:27:20,024 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-9.i [2025-02-05 20:27:20,046 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6d47f7d03/57a8c921954f493190a80a0647d8aa86/FLAG0d1b9d772 [2025-02-05 20:27:20,329 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6d47f7d03/57a8c921954f493190a80a0647d8aa86 [2025-02-05 20:27:20,330 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 20:27:20,331 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 20:27:20,332 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 20:27:20,332 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 20:27:20,335 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 20:27:20,336 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 08:27:20" (1/1) ... [2025-02-05 20:27:20,336 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3eb1fd76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:27:20, skipping insertion in model container [2025-02-05 20:27:20,337 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 08:27:20" (1/1) ... [2025-02-05 20:27:20,346 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 20:27:20,434 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_codestructure_dependencies_file-9.i[918,931] [2025-02-05 20:27:20,461 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 20:27:20,473 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 20:27:20,483 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_codestructure_dependencies_file-9.i[918,931] [2025-02-05 20:27:20,507 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 20:27:20,524 INFO L204 MainTranslator]: Completed translation [2025-02-05 20:27:20,524 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:27:20 WrapperNode [2025-02-05 20:27:20,524 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 20:27:20,525 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 20:27:20,525 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 20:27:20,525 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 20:27:20,529 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:27:20" (1/1) ... [2025-02-05 20:27:20,534 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:27:20" (1/1) ... [2025-02-05 20:27:20,551 INFO L138 Inliner]: procedures = 26, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 169 [2025-02-05 20:27:20,552 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 20:27:20,552 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 20:27:20,552 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 20:27:20,552 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 20:27:20,560 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:27:20" (1/1) ... [2025-02-05 20:27:20,561 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:27:20" (1/1) ... [2025-02-05 20:27:20,562 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:27:20" (1/1) ... [2025-02-05 20:27:20,575 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-05 20:27:20,575 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:27:20" (1/1) ... [2025-02-05 20:27:20,576 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:27:20" (1/1) ... [2025-02-05 20:27:20,580 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:27:20" (1/1) ... [2025-02-05 20:27:20,580 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:27:20" (1/1) ... [2025-02-05 20:27:20,581 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:27:20" (1/1) ... [2025-02-05 20:27:20,582 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:27:20" (1/1) ... [2025-02-05 20:27:20,584 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 20:27:20,584 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 20:27:20,584 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 20:27:20,584 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 20:27:20,585 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:27:20" (1/1) ... [2025-02-05 20:27:20,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 20:27:20,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:27:20,612 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 20:27:20,616 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 20:27:20,633 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 20:27:20,633 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-05 20:27:20,633 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-05 20:27:20,633 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 20:27:20,633 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 20:27:20,633 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 20:27:20,684 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 20:27:20,686 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 20:27:20,958 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L114: havoc property_#t~bitwise15#1;havoc property_#t~ite17#1;havoc property_#t~bitwise16#1;havoc property_#t~bitwise18#1;havoc property_#t~short19#1; [2025-02-05 20:27:20,975 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-02-05 20:27:20,976 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 20:27:20,988 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 20:27:20,989 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 20:27:20,989 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 08:27:20 BoogieIcfgContainer [2025-02-05 20:27:20,989 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 20:27:20,991 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 20:27:20,991 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 20:27:20,994 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 20:27:20,994 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 08:27:20" (1/3) ... [2025-02-05 20:27:20,995 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68e82e90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 08:27:20, skipping insertion in model container [2025-02-05 20:27:20,995 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:27:20" (2/3) ... [2025-02-05 20:27:20,995 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68e82e90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 08:27:20, skipping insertion in model container [2025-02-05 20:27:20,995 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 08:27:20" (3/3) ... [2025-02-05 20:27:20,996 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-9.i [2025-02-05 20:27:21,006 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 20:27:21,008 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_dependencies_file-9.i that has 2 procedures, 70 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 20:27:21,043 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 20:27:21,051 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;@1ea46450, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 20:27:21,051 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 20:27:21,054 INFO L276 IsEmpty]: Start isEmpty. Operand has 70 states, 52 states have (on average 1.4230769230769231) internal successors, (74), 53 states have internal predecessors, (74), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-02-05 20:27:21,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-02-05 20:27:21,061 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:27:21,061 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:27:21,061 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:27:21,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:27:21,065 INFO L85 PathProgramCache]: Analyzing trace with hash 2020987939, now seen corresponding path program 1 times [2025-02-05 20:27:21,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:27:21,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144309195] [2025-02-05 20:27:21,072 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:27:21,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:27:21,132 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-02-05 20:27:21,173 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-02-05 20:27:21,173 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:27:21,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:27:21,472 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-02-05 20:27:21,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:27:21,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144309195] [2025-02-05 20:27:21,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144309195] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:27:21,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:27:21,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 20:27:21,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801274907] [2025-02-05 20:27:21,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:27:21,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 20:27:21,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:27:21,491 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 20:27:21,492 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 20:27:21,494 INFO L87 Difference]: Start difference. First operand has 70 states, 52 states have (on average 1.4230769230769231) internal successors, (74), 53 states have internal predecessors, (74), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-05 20:27:21,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:27:21,545 INFO L93 Difference]: Finished difference Result 135 states and 220 transitions. [2025-02-05 20:27:21,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 20:27:21,550 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 105 [2025-02-05 20:27:21,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:27:21,557 INFO L225 Difference]: With dead ends: 135 [2025-02-05 20:27:21,558 INFO L226 Difference]: Without dead ends: 68 [2025-02-05 20:27:21,560 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 20:27:21,567 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 0 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 20:27:21,568 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 180 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 20:27:21,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2025-02-05 20:27:21,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2025-02-05 20:27:21,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 51 states have (on average 1.3725490196078431) internal successors, (70), 51 states have internal predecessors, (70), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-02-05 20:27:21,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 100 transitions. [2025-02-05 20:27:21,611 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 100 transitions. Word has length 105 [2025-02-05 20:27:21,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:27:21,613 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 100 transitions. [2025-02-05 20:27:21,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-05 20:27:21,615 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 100 transitions. [2025-02-05 20:27:21,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-02-05 20:27:21,620 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:27:21,620 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:27:21,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 20:27:21,621 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:27:21,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:27:21,622 INFO L85 PathProgramCache]: Analyzing trace with hash 1977614401, now seen corresponding path program 1 times [2025-02-05 20:27:21,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:27:21,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646380561] [2025-02-05 20:27:21,623 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:27:21,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:27:21,645 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-02-05 20:27:21,720 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-02-05 20:27:21,720 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:27:21,720 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:27:24,285 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 33 proven. 9 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-02-05 20:27:24,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:27:24,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646380561] [2025-02-05 20:27:24,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646380561] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 20:27:24,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [50963445] [2025-02-05 20:27:24,286 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:27:24,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:27:24,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:27:24,288 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 20:27:24,290 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 20:27:24,347 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-02-05 20:27:24,393 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-02-05 20:27:24,393 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:27:24,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:27:24,397 INFO L256 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-05 20:27:24,406 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 20:27:24,735 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 174 proven. 42 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2025-02-05 20:27:24,736 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 20:27:25,053 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-02-05 20:27:25,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [50963445] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 20:27:25,053 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 20:27:25,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 6, 6] total 17 [2025-02-05 20:27:25,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127025842] [2025-02-05 20:27:25,054 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 20:27:25,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-02-05 20:27:25,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:27:25,056 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-02-05 20:27:25,056 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2025-02-05 20:27:25,057 INFO L87 Difference]: Start difference. First operand 68 states and 100 transitions. Second operand has 17 states, 17 states have (on average 5.0) internal successors, (85), 17 states have internal predecessors, (85), 5 states have call successors, (43), 3 states have call predecessors, (43), 5 states have return successors, (45), 5 states have call predecessors, (45), 5 states have call successors, (45) [2025-02-05 20:27:27,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:27:27,567 INFO L93 Difference]: Finished difference Result 216 states and 312 transitions. [2025-02-05 20:27:27,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-05 20:27:27,569 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 5.0) internal successors, (85), 17 states have internal predecessors, (85), 5 states have call successors, (43), 3 states have call predecessors, (43), 5 states have return successors, (45), 5 states have call predecessors, (45), 5 states have call successors, (45) Word has length 106 [2025-02-05 20:27:27,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:27:27,573 INFO L225 Difference]: With dead ends: 216 [2025-02-05 20:27:27,573 INFO L226 Difference]: Without dead ends: 151 [2025-02-05 20:27:27,574 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=147, Invalid=503, Unknown=0, NotChecked=0, Total=650 [2025-02-05 20:27:27,575 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 394 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 664 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 394 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 669 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 664 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-02-05 20:27:27,575 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [394 Valid, 366 Invalid, 669 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 664 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-02-05 20:27:27,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2025-02-05 20:27:27,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 99. [2025-02-05 20:27:27,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 80 states have (on average 1.3875) internal successors, (111), 80 states have internal predecessors, (111), 15 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-02-05 20:27:27,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 141 transitions. [2025-02-05 20:27:27,592 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 141 transitions. Word has length 106 [2025-02-05 20:27:27,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:27:27,592 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 141 transitions. [2025-02-05 20:27:27,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 5.0) internal successors, (85), 17 states have internal predecessors, (85), 5 states have call successors, (43), 3 states have call predecessors, (43), 5 states have return successors, (45), 5 states have call predecessors, (45), 5 states have call successors, (45) [2025-02-05 20:27:27,593 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 141 transitions. [2025-02-05 20:27:27,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-02-05 20:27:27,594 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:27:27,594 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:27:27,607 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-05 20:27:27,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:27:27,796 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:27:27,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:27:27,797 INFO L85 PathProgramCache]: Analyzing trace with hash -1257446205, now seen corresponding path program 1 times [2025-02-05 20:27:27,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:27:27,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902823099] [2025-02-05 20:27:27,797 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:27:27,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:27:27,816 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-02-05 20:27:27,874 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-02-05 20:27:27,878 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:27:27,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:27:29,705 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 33 proven. 9 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-02-05 20:27:29,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:27:29,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902823099] [2025-02-05 20:27:29,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902823099] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 20:27:29,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [666272856] [2025-02-05 20:27:29,705 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:27:29,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:27:29,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:27:29,708 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 20:27:29,711 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-05 20:27:29,746 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-02-05 20:27:29,921 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-02-05 20:27:29,922 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:27:29,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:27:29,923 INFO L256 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-02-05 20:27:29,925 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 20:27:30,435 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 228 proven. 42 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2025-02-05 20:27:30,435 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 20:27:30,839 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 36 proven. 45 refuted. 0 times theorem prover too weak. 339 trivial. 0 not checked. [2025-02-05 20:27:30,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [666272856] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 20:27:30,839 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 20:27:30,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 10] total 27 [2025-02-05 20:27:30,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606427824] [2025-02-05 20:27:30,839 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 20:27:30,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-02-05 20:27:30,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:27:30,842 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-02-05 20:27:30,843 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=586, Unknown=0, NotChecked=0, Total=702 [2025-02-05 20:27:30,843 INFO L87 Difference]: Start difference. First operand 99 states and 141 transitions. Second operand has 27 states, 27 states have (on average 3.7037037037037037) internal successors, (100), 27 states have internal predecessors, (100), 7 states have call successors, (45), 4 states have call predecessors, (45), 8 states have return successors, (45), 7 states have call predecessors, (45), 7 states have call successors, (45) [2025-02-05 20:27:34,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:27:34,178 INFO L93 Difference]: Finished difference Result 427 states and 591 transitions. [2025-02-05 20:27:34,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-02-05 20:27:34,179 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 3.7037037037037037) internal successors, (100), 27 states have internal predecessors, (100), 7 states have call successors, (45), 4 states have call predecessors, (45), 8 states have return successors, (45), 7 states have call predecessors, (45), 7 states have call successors, (45) Word has length 106 [2025-02-05 20:27:34,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:27:34,181 INFO L225 Difference]: With dead ends: 427 [2025-02-05 20:27:34,181 INFO L226 Difference]: Without dead ends: 331 [2025-02-05 20:27:34,183 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 200 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 740 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=531, Invalid=2439, Unknown=0, NotChecked=0, Total=2970 [2025-02-05 20:27:34,187 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 1405 mSDsluCounter, 913 mSDsCounter, 0 mSdLazyCounter, 1375 mSolverCounterSat, 201 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1406 SdHoareTripleChecker+Valid, 1017 SdHoareTripleChecker+Invalid, 1576 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 201 IncrementalHoareTripleChecker+Valid, 1375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-02-05 20:27:34,187 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1406 Valid, 1017 Invalid, 1576 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [201 Valid, 1375 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-02-05 20:27:34,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2025-02-05 20:27:34,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 179. [2025-02-05 20:27:34,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 140 states have (on average 1.3428571428571427) internal successors, (188), 140 states have internal predecessors, (188), 30 states have call successors, (30), 8 states have call predecessors, (30), 8 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-02-05 20:27:34,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 248 transitions. [2025-02-05 20:27:34,205 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 248 transitions. Word has length 106 [2025-02-05 20:27:34,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:27:34,205 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 248 transitions. [2025-02-05 20:27:34,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 3.7037037037037037) internal successors, (100), 27 states have internal predecessors, (100), 7 states have call successors, (45), 4 states have call predecessors, (45), 8 states have return successors, (45), 7 states have call predecessors, (45), 7 states have call successors, (45) [2025-02-05 20:27:34,206 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 248 transitions. [2025-02-05 20:27:34,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-02-05 20:27:34,207 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:27:34,207 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:27:34,213 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-05 20:27:34,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:27:34,411 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:27:34,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:27:34,412 INFO L85 PathProgramCache]: Analyzing trace with hash 687139041, now seen corresponding path program 1 times [2025-02-05 20:27:34,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:27:34,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580837196] [2025-02-05 20:27:34,412 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:27:34,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:27:34,422 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-02-05 20:27:34,437 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-02-05 20:27:34,437 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:27:34,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:27:35,045 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 33 proven. 9 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-02-05 20:27:35,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:27:35,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580837196] [2025-02-05 20:27:35,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580837196] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 20:27:35,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1558623651] [2025-02-05 20:27:35,046 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:27:35,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:27:35,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:27:35,048 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-05 20:27:35,053 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-05 20:27:35,087 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-02-05 20:27:35,230 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-02-05 20:27:35,230 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:27:35,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:27:35,232 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-02-05 20:27:35,235 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 20:27:35,536 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 134 proven. 6 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2025-02-05 20:27:35,537 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 20:27:35,885 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-02-05 20:27:35,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1558623651] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-05 20:27:35,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-02-05 20:27:35,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [9, 10] total 18 [2025-02-05 20:27:35,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899662224] [2025-02-05 20:27:35,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:27:35,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 20:27:35,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:27:35,887 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 20:27:35,887 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=219, Unknown=0, NotChecked=0, Total=306 [2025-02-05 20:27:35,887 INFO L87 Difference]: Start difference. First operand 179 states and 248 transitions. Second operand has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-05 20:27:36,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:27:36,744 INFO L93 Difference]: Finished difference Result 495 states and 692 transitions. [2025-02-05 20:27:36,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 20:27:36,745 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 106 [2025-02-05 20:27:36,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:27:36,747 INFO L225 Difference]: With dead ends: 495 [2025-02-05 20:27:36,747 INFO L226 Difference]: Without dead ends: 319 [2025-02-05 20:27:36,748 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 207 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=106, Invalid=274, Unknown=0, NotChecked=0, Total=380 [2025-02-05 20:27:36,748 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 212 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 20:27:36,748 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 426 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 302 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 20:27:36,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2025-02-05 20:27:36,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 198. [2025-02-05 20:27:36,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 159 states have (on average 1.371069182389937) internal successors, (218), 159 states have internal predecessors, (218), 30 states have call successors, (30), 8 states have call predecessors, (30), 8 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-02-05 20:27:36,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 278 transitions. [2025-02-05 20:27:36,768 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 278 transitions. Word has length 106 [2025-02-05 20:27:36,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:27:36,768 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 278 transitions. [2025-02-05 20:27:36,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-05 20:27:36,768 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 278 transitions. [2025-02-05 20:27:36,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-02-05 20:27:36,769 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:27:36,770 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:27:36,778 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-05 20:27:36,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:27:36,970 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:27:36,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:27:36,971 INFO L85 PathProgramCache]: Analyzing trace with hash -450845928, now seen corresponding path program 1 times [2025-02-05 20:27:36,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:27:36,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996723635] [2025-02-05 20:27:36,971 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:27:36,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:27:36,976 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-02-05 20:27:36,989 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-02-05 20:27:36,989 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:27:36,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:27:37,724 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 33 proven. 9 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-02-05 20:27:37,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:27:37,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996723635] [2025-02-05 20:27:37,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996723635] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 20:27:37,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1491903082] [2025-02-05 20:27:37,724 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:27:37,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:27:37,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:27:37,729 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-05 20:27:37,730 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-05 20:27:37,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-02-05 20:27:37,820 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-02-05 20:27:37,820 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:27:37,820 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:27:37,821 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-05 20:27:37,824 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 20:27:38,318 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-02-05 20:27:38,318 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 20:27:38,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1491903082] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:27:38,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 20:27:38,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 13 [2025-02-05 20:27:38,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465879541] [2025-02-05 20:27:38,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:27:38,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 20:27:38,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:27:38,319 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 20:27:38,319 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2025-02-05 20:27:38,320 INFO L87 Difference]: Start difference. First operand 198 states and 278 transitions. Second operand has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-05 20:27:38,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:27:38,663 INFO L93 Difference]: Finished difference Result 489 states and 685 transitions. [2025-02-05 20:27:38,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 20:27:38,663 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 106 [2025-02-05 20:27:38,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:27:38,665 INFO L225 Difference]: With dead ends: 489 [2025-02-05 20:27:38,665 INFO L226 Difference]: Without dead ends: 294 [2025-02-05 20:27:38,665 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2025-02-05 20:27:38,666 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 130 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 287 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 20:27:38,666 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 432 Invalid, 289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 287 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 20:27:38,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2025-02-05 20:27:38,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 231. [2025-02-05 20:27:38,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 192 states have (on average 1.3854166666666667) internal successors, (266), 192 states have internal predecessors, (266), 30 states have call successors, (30), 8 states have call predecessors, (30), 8 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-02-05 20:27:38,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 326 transitions. [2025-02-05 20:27:38,681 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 326 transitions. Word has length 106 [2025-02-05 20:27:38,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:27:38,682 INFO L471 AbstractCegarLoop]: Abstraction has 231 states and 326 transitions. [2025-02-05 20:27:38,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-05 20:27:38,682 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 326 transitions. [2025-02-05 20:27:38,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-02-05 20:27:38,683 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:27:38,683 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:27:38,689 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-05 20:27:38,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:27:38,884 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:27:38,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:27:38,885 INFO L85 PathProgramCache]: Analyzing trace with hash -1501920192, now seen corresponding path program 1 times [2025-02-05 20:27:38,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:27:38,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894925615] [2025-02-05 20:27:38,885 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:27:38,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:27:38,892 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-02-05 20:27:38,921 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-02-05 20:27:38,922 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:27:38,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-05 20:27:38,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1705633772] [2025-02-05 20:27:38,924 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:27:38,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:27:38,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:27:38,930 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 20:27:38,931 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-05 20:27:38,965 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-02-05 20:27:39,068 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-02-05 20:27:39,069 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:27:39,069 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:27:39,070 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-02-05 20:27:39,076 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 20:27:39,387 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 200 proven. 30 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2025-02-05 20:27:39,387 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 20:27:39,552 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 12 proven. 30 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-02-05 20:27:39,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:27:39,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894925615] [2025-02-05 20:27:39,553 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-05 20:27:39,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1705633772] [2025-02-05 20:27:39,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1705633772] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 20:27:39,553 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-05 20:27:39,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 15 [2025-02-05 20:27:39,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453081260] [2025-02-05 20:27:39,554 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-05 20:27:39,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-05 20:27:39,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:27:39,555 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-05 20:27:39,555 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2025-02-05 20:27:39,555 INFO L87 Difference]: Start difference. First operand 231 states and 326 transitions. Second operand has 15 states, 15 states have (on average 4.333333333333333) internal successors, (65), 15 states have internal predecessors, (65), 4 states have call successors, (28), 3 states have call predecessors, (28), 5 states have return successors, (28), 4 states have call predecessors, (28), 4 states have call successors, (28) [2025-02-05 20:27:40,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:27:40,162 INFO L93 Difference]: Finished difference Result 629 states and 866 transitions. [2025-02-05 20:27:40,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-02-05 20:27:40,163 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.333333333333333) internal successors, (65), 15 states have internal predecessors, (65), 4 states have call successors, (28), 3 states have call predecessors, (28), 5 states have return successors, (28), 4 states have call predecessors, (28), 4 states have call successors, (28) Word has length 108 [2025-02-05 20:27:40,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:27:40,165 INFO L225 Difference]: With dead ends: 629 [2025-02-05 20:27:40,165 INFO L226 Difference]: Without dead ends: 401 [2025-02-05 20:27:40,165 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=159, Invalid=393, Unknown=0, NotChecked=0, Total=552 [2025-02-05 20:27:40,166 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 168 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 568 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 490 SdHoareTripleChecker+Invalid, 583 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 568 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 20:27:40,166 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 490 Invalid, 583 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 568 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 20:27:40,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2025-02-05 20:27:40,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 298. [2025-02-05 20:27:40,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 257 states have (on average 1.3929961089494163) internal successors, (358), 257 states have internal predecessors, (358), 30 states have call successors, (30), 10 states have call predecessors, (30), 10 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-02-05 20:27:40,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 418 transitions. [2025-02-05 20:27:40,198 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 418 transitions. Word has length 108 [2025-02-05 20:27:40,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:27:40,198 INFO L471 AbstractCegarLoop]: Abstraction has 298 states and 418 transitions. [2025-02-05 20:27:40,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.333333333333333) internal successors, (65), 15 states have internal predecessors, (65), 4 states have call successors, (28), 3 states have call predecessors, (28), 5 states have return successors, (28), 4 states have call predecessors, (28), 4 states have call successors, (28) [2025-02-05 20:27:40,198 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 418 transitions. [2025-02-05 20:27:40,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-02-05 20:27:40,200 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:27:40,201 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:27:40,209 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-05 20:27:40,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:27:40,402 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:27:40,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:27:40,403 INFO L85 PathProgramCache]: Analyzing trace with hash 111185079, now seen corresponding path program 1 times [2025-02-05 20:27:40,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:27:40,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697086184] [2025-02-05 20:27:40,403 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:27:40,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:27:40,413 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-02-05 20:27:40,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-02-05 20:27:40,419 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:27:40,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:27:40,449 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-02-05 20:27:40,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:27:40,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697086184] [2025-02-05 20:27:40,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697086184] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:27:40,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:27:40,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 20:27:40,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176800925] [2025-02-05 20:27:40,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:27:40,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 20:27:40,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:27:40,453 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 20:27:40,454 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 20:27:40,454 INFO L87 Difference]: Start difference. First operand 298 states and 418 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-05 20:27:40,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:27:40,560 INFO L93 Difference]: Finished difference Result 585 states and 811 transitions. [2025-02-05 20:27:40,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 20:27:40,561 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 108 [2025-02-05 20:27:40,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:27:40,563 INFO L225 Difference]: With dead ends: 585 [2025-02-05 20:27:40,563 INFO L226 Difference]: Without dead ends: 406 [2025-02-05 20:27:40,564 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 20:27:40,564 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 81 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 20:27:40,564 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 170 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 20:27:40,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2025-02-05 20:27:40,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 271. [2025-02-05 20:27:40,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 230 states have (on average 1.373913043478261) internal successors, (316), 230 states have internal predecessors, (316), 30 states have call successors, (30), 10 states have call predecessors, (30), 10 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-02-05 20:27:40,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 376 transitions. [2025-02-05 20:27:40,585 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 376 transitions. Word has length 108 [2025-02-05 20:27:40,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:27:40,585 INFO L471 AbstractCegarLoop]: Abstraction has 271 states and 376 transitions. [2025-02-05 20:27:40,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-05 20:27:40,586 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 376 transitions. [2025-02-05 20:27:40,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-02-05 20:27:40,586 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:27:40,586 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:27:40,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 20:27:40,587 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:27:40,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:27:40,587 INFO L85 PathProgramCache]: Analyzing trace with hash 334211065, now seen corresponding path program 1 times [2025-02-05 20:27:40,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:27:40,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627296585] [2025-02-05 20:27:40,587 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:27:40,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:27:40,594 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-02-05 20:27:40,623 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-02-05 20:27:40,623 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:27:40,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:27:40,832 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-02-05 20:27:40,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:27:40,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627296585] [2025-02-05 20:27:40,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1627296585] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:27:40,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:27:40,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 20:27:40,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89074925] [2025-02-05 20:27:40,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:27:40,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 20:27:40,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:27:40,834 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 20:27:40,834 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-05 20:27:40,834 INFO L87 Difference]: Start difference. First operand 271 states and 376 transitions. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-05 20:27:41,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:27:41,094 INFO L93 Difference]: Finished difference Result 788 states and 1069 transitions. [2025-02-05 20:27:41,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 20:27:41,095 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 108 [2025-02-05 20:27:41,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:27:41,097 INFO L225 Difference]: With dead ends: 788 [2025-02-05 20:27:41,097 INFO L226 Difference]: Without dead ends: 520 [2025-02-05 20:27:41,097 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-02-05 20:27:41,098 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 137 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 20:27:41,098 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 350 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 20:27:41,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2025-02-05 20:27:41,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 286. [2025-02-05 20:27:41,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 245 states have (on average 1.3877551020408163) internal successors, (340), 245 states have internal predecessors, (340), 30 states have call successors, (30), 10 states have call predecessors, (30), 10 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-02-05 20:27:41,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 400 transitions. [2025-02-05 20:27:41,127 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 400 transitions. Word has length 108 [2025-02-05 20:27:41,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:27:41,127 INFO L471 AbstractCegarLoop]: Abstraction has 286 states and 400 transitions. [2025-02-05 20:27:41,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-05 20:27:41,127 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 400 transitions. [2025-02-05 20:27:41,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-02-05 20:27:41,128 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:27:41,128 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:27:41,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 20:27:41,128 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:27:41,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:27:41,129 INFO L85 PathProgramCache]: Analyzing trace with hash 412077920, now seen corresponding path program 1 times [2025-02-05 20:27:41,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:27:41,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830019030] [2025-02-05 20:27:41,129 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:27:41,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:27:41,134 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-02-05 20:27:41,148 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-02-05 20:27:41,148 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:27:41,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:27:42,242 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-02-05 20:27:42,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:27:42,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830019030] [2025-02-05 20:27:42,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830019030] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:27:42,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:27:42,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-02-05 20:27:42,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674435205] [2025-02-05 20:27:42,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:27:42,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-05 20:27:42,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:27:42,244 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-05 20:27:42,244 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2025-02-05 20:27:42,244 INFO L87 Difference]: Start difference. First operand 286 states and 400 transitions. Second operand has 13 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 13 states have internal predecessors, (37), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-05 20:27:43,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:27:43,150 INFO L93 Difference]: Finished difference Result 703 states and 977 transitions. [2025-02-05 20:27:43,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-05 20:27:43,150 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 13 states have internal predecessors, (37), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 109 [2025-02-05 20:27:43,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:27:43,152 INFO L225 Difference]: With dead ends: 703 [2025-02-05 20:27:43,152 INFO L226 Difference]: Without dead ends: 420 [2025-02-05 20:27:43,153 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2025-02-05 20:27:43,153 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 318 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 715 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 318 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 720 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 715 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 20:27:43,154 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [318 Valid, 381 Invalid, 720 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 715 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 20:27:43,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2025-02-05 20:27:43,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 350. [2025-02-05 20:27:43,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 350 states, 309 states have (on average 1.3915857605177993) internal successors, (430), 309 states have internal predecessors, (430), 30 states have call successors, (30), 10 states have call predecessors, (30), 10 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-02-05 20:27:43,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 490 transitions. [2025-02-05 20:27:43,177 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 490 transitions. Word has length 109 [2025-02-05 20:27:43,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:27:43,177 INFO L471 AbstractCegarLoop]: Abstraction has 350 states and 490 transitions. [2025-02-05 20:27:43,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 13 states have internal predecessors, (37), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-05 20:27:43,178 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 490 transitions. [2025-02-05 20:27:43,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-02-05 20:27:43,178 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:27:43,179 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:27:43,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 20:27:43,179 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:27:43,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:27:43,179 INFO L85 PathProgramCache]: Analyzing trace with hash 635103906, now seen corresponding path program 1 times [2025-02-05 20:27:43,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:27:43,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861202136] [2025-02-05 20:27:43,179 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:27:43,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:27:43,186 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-02-05 20:27:43,211 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-02-05 20:27:43,211 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:27:43,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:27:43,340 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-02-05 20:27:43,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:27:43,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861202136] [2025-02-05 20:27:43,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861202136] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:27:43,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:27:43,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 20:27:43,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494746957] [2025-02-05 20:27:43,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:27:43,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 20:27:43,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:27:43,342 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 20:27:43,342 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-05 20:27:43,342 INFO L87 Difference]: Start difference. First operand 350 states and 490 transitions. Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-05 20:27:43,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:27:43,646 INFO L93 Difference]: Finished difference Result 1027 states and 1431 transitions. [2025-02-05 20:27:43,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 20:27:43,646 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 109 [2025-02-05 20:27:43,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:27:43,648 INFO L225 Difference]: With dead ends: 1027 [2025-02-05 20:27:43,648 INFO L226 Difference]: Without dead ends: 680 [2025-02-05 20:27:43,649 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-02-05 20:27:43,650 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 127 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 20:27:43,650 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 412 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 20:27:43,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 680 states. [2025-02-05 20:27:43,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 680 to 574. [2025-02-05 20:27:43,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 574 states, 493 states have (on average 1.3488843813387423) internal successors, (665), 493 states have internal predecessors, (665), 60 states have call successors, (60), 20 states have call predecessors, (60), 20 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2025-02-05 20:27:43,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 785 transitions. [2025-02-05 20:27:43,687 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 785 transitions. Word has length 109 [2025-02-05 20:27:43,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:27:43,688 INFO L471 AbstractCegarLoop]: Abstraction has 574 states and 785 transitions. [2025-02-05 20:27:43,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-05 20:27:43,689 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 785 transitions. [2025-02-05 20:27:43,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-02-05 20:27:43,689 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:27:43,689 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:27:43,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 20:27:43,690 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:27:43,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:27:43,690 INFO L85 PathProgramCache]: Analyzing trace with hash 841310269, now seen corresponding path program 1 times [2025-02-05 20:27:43,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:27:43,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095963982] [2025-02-05 20:27:43,690 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:27:43,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:27:43,696 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-02-05 20:27:43,722 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-02-05 20:27:43,723 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:27:43,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-05 20:27:43,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [261633647] [2025-02-05 20:27:43,724 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:27:43,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:27:43,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:27:43,726 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 20:27:43,733 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-05 20:27:43,772 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-02-05 20:27:44,124 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-02-05 20:27:44,125 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:27:44,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-05 20:27:44,125 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-05 20:27:44,138 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-02-05 20:27:44,166 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-02-05 20:27:44,166 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:27:44,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-05 20:27:44,225 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-05 20:27:44,227 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-05 20:27:44,228 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-05 20:27:44,238 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-02-05 20:27:44,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-02-05 20:27:44,433 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:27:44,508 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-05 20:27:44,514 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.02 08:27:44 BoogieIcfgContainer [2025-02-05 20:27:44,514 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-05 20:27:44,515 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-05 20:27:44,515 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-05 20:27:44,515 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-05 20:27:44,516 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 08:27:20" (3/4) ... [2025-02-05 20:27:44,517 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-05 20:27:44,518 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-05 20:27:44,518 INFO L158 Benchmark]: Toolchain (without parser) took 24186.83ms. Allocated memory was 142.6MB in the beginning and 385.9MB in the end (delta: 243.3MB). Free memory was 106.7MB in the beginning and 339.0MB in the end (delta: -232.4MB). Peak memory consumption was 10.2MB. Max. memory is 16.1GB. [2025-02-05 20:27:44,519 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 128.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 20:27:44,519 INFO L158 Benchmark]: CACSL2BoogieTranslator took 192.34ms. Allocated memory is still 142.6MB. Free memory was 106.7MB in the beginning and 92.6MB in the end (delta: 14.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-05 20:27:44,519 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.79ms. Allocated memory is still 142.6MB. Free memory was 92.6MB in the beginning and 90.8MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 20:27:44,519 INFO L158 Benchmark]: Boogie Preprocessor took 31.40ms. Allocated memory is still 142.6MB. Free memory was 90.8MB in the beginning and 88.0MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 20:27:44,519 INFO L158 Benchmark]: IcfgBuilder took 404.98ms. Allocated memory is still 142.6MB. Free memory was 88.0MB in the beginning and 66.6MB in the end (delta: 21.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-05 20:27:44,520 INFO L158 Benchmark]: TraceAbstraction took 23523.60ms. Allocated memory was 142.6MB in the beginning and 385.9MB in the end (delta: 243.3MB). Free memory was 65.7MB in the beginning and 339.2MB in the end (delta: -273.5MB). Peak memory consumption was 178.0MB. Max. memory is 16.1GB. [2025-02-05 20:27:44,520 INFO L158 Benchmark]: Witness Printer took 2.83ms. Allocated memory is still 385.9MB. Free memory was 339.2MB in the beginning and 339.0MB in the end (delta: 120.0kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 20:27:44,521 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.22ms. Allocated memory is still 201.3MB. Free memory is still 128.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 192.34ms. Allocated memory is still 142.6MB. Free memory was 106.7MB in the beginning and 92.6MB in the end (delta: 14.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.79ms. Allocated memory is still 142.6MB. Free memory was 92.6MB in the beginning and 90.8MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 31.40ms. Allocated memory is still 142.6MB. Free memory was 90.8MB in the beginning and 88.0MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 404.98ms. Allocated memory is still 142.6MB. Free memory was 88.0MB in the beginning and 66.6MB in the end (delta: 21.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 23523.60ms. Allocated memory was 142.6MB in the beginning and 385.9MB in the end (delta: 243.3MB). Free memory was 65.7MB in the beginning and 339.2MB in the end (delta: -273.5MB). Peak memory consumption was 178.0MB. Max. memory is 16.1GB. * Witness Printer took 2.83ms. Allocated memory is still 385.9MB. Free memory was 339.2MB in the beginning and 339.0MB in the end (delta: 120.0kB). 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 shiftLeft at line 51, overapproximation of shiftLeft at line 114, overapproximation of someBinaryDOUBLEComparisonOperation at line 98, overapproximation of someBinaryDOUBLEComparisonOperation at line 114, overapproximation of someBinaryDOUBLEComparisonOperation at line 100, overapproximation of someBinaryDOUBLEComparisonOperation at line 60. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 5.5; [L23] signed short int var_1_3 = 1; [L24] signed long int var_1_5 = -64; [L25] signed char var_1_6 = 10; [L26] signed char var_1_7 = 5; [L27] double var_1_8 = 16.25; [L28] double var_1_9 = 1.8; [L29] unsigned char var_1_10 = 32; [L30] unsigned char var_1_11 = 64; [L31] unsigned short int var_1_12 = 16; [L32] unsigned long int var_1_13 = 128; [L33] unsigned char var_1_15 = 1; [L34] unsigned short int var_1_16 = 256; [L35] signed char var_1_18 = -2; [L36] unsigned char last_1_var_1_10 = 32; [L37] unsigned short int last_1_var_1_12 = 16; [L38] unsigned long int last_1_var_1_13 = 128; VAL [isInitial=0, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=1, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L118] isInitial = 1 [L119] FCALL initially() [L120] COND TRUE 1 [L121] CALL updateLastVariables() [L109] last_1_var_1_10 = var_1_10 [L110] last_1_var_1_12 = var_1_12 [L111] last_1_var_1_13 = var_1_13 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=1, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L121] RET updateLastVariables() [L122] CALL updateVariables() [L84] var_1_3 = __VERIFIER_nondet_short() [L85] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L85] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L86] CALL assume_abort_if_not(var_1_3 <= 8) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L86] RET assume_abort_if_not(var_1_3 <= 8) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L87] var_1_5 = __VERIFIER_nondet_long() [L88] CALL assume_abort_if_not(var_1_5 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=13, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=13, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L88] RET assume_abort_if_not(var_1_5 >= -2147483648) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=13, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L89] CALL assume_abort_if_not(var_1_5 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=13, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=13, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L89] RET assume_abort_if_not(var_1_5 <= 2147483647) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=13, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L90] CALL assume_abort_if_not(var_1_5 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=13, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=13, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L90] RET assume_abort_if_not(var_1_5 != 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=13, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L91] var_1_6 = __VERIFIER_nondet_char() [L92] CALL assume_abort_if_not(var_1_6 >= 6) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=13, var_1_6=12, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=13, var_1_6=12, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L92] RET assume_abort_if_not(var_1_6 >= 6) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=13, var_1_6=12, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L93] CALL assume_abort_if_not(var_1_6 <= 12) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=13, var_1_6=12, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=13, var_1_6=12, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L93] RET assume_abort_if_not(var_1_6 <= 12) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=13, var_1_6=12, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L94] var_1_7 = __VERIFIER_nondet_char() [L95] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=13, var_1_6=12, var_1_7=0, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=13, var_1_6=12, var_1_7=0, var_1_8=65/4, var_1_9=9/5] [L95] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=13, var_1_6=12, var_1_7=0, var_1_8=65/4, var_1_9=9/5] [L96] CALL assume_abort_if_not(var_1_7 <= 6) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=13, var_1_6=12, var_1_7=0, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=13, var_1_6=12, var_1_7=0, var_1_8=65/4, var_1_9=9/5] [L96] RET assume_abort_if_not(var_1_7 <= 6) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=13, var_1_6=12, var_1_7=0, var_1_8=65/4, var_1_9=9/5] [L97] var_1_8 = __VERIFIER_nondet_double() [L98] CALL assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=13, var_1_6=12, var_1_7=0, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=13, var_1_6=12, var_1_7=0, var_1_9=9/5] [L98] RET assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=13, var_1_6=12, var_1_7=0, var_1_9=9/5] [L99] var_1_9 = __VERIFIER_nondet_double() [L100] CALL assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=13, var_1_6=12, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=13, var_1_6=12, var_1_7=0] [L100] RET assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=13, var_1_6=12, var_1_7=0] [L101] var_1_11 = __VERIFIER_nondet_uchar() [L102] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=13, var_1_6=12, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=13, var_1_6=12, var_1_7=0] [L102] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=13, var_1_6=12, var_1_7=0] [L103] CALL assume_abort_if_not(var_1_11 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=12, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=13, var_1_6=12, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=12, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=13, var_1_6=12, var_1_7=0] [L103] RET assume_abort_if_not(var_1_11 <= 254) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=12, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=13, var_1_6=12, var_1_7=0] [L104] var_1_15 = __VERIFIER_nondet_uchar() [L105] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=12, var_1_12=16, var_1_13=128, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=13, var_1_6=12, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=12, var_1_12=16, var_1_13=128, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=13, var_1_6=12, var_1_7=0] [L105] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=12, var_1_12=16, var_1_13=128, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=13, var_1_6=12, var_1_7=0] [L106] CALL assume_abort_if_not(var_1_15 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=12, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=13, var_1_6=12, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=12, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=13, var_1_6=12, var_1_7=0] [L106] RET assume_abort_if_not(var_1_15 <= 1) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=12, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=13, var_1_6=12, var_1_7=0] [L122] RET updateVariables() [L123] CALL step() [L42] COND TRUE ((var_1_6 >> 2) * last_1_var_1_13) > last_1_var_1_10 [L43] var_1_12 = var_1_6 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=12, var_1_12=12, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=13, var_1_6=12, var_1_7=0] [L45] COND TRUE var_1_6 <= (last_1_var_1_12 + var_1_7) [L46] var_1_10 = var_1_11 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=12, var_1_11=12, var_1_12=12, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=13, var_1_6=12, var_1_7=0] [L50] var_1_18 = var_1_3 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=12, var_1_11=12, var_1_12=12, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=13, var_1_6=12, var_1_7=0] [L51] EXPR 1 << var_1_10 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=12, var_1_11=12, var_1_12=12, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=13, var_1_6=12, var_1_7=0] [L51] COND FALSE !((1 << var_1_10) != (-500 / -100)) [L58] var_1_13 = var_1_6 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=12, var_1_11=12, var_1_12=12, var_1_13=12, var_1_15=1, var_1_16=256, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=13, var_1_6=12, var_1_7=0] [L60] COND FALSE !((- var_1_9) <= var_1_8) [L73] var_1_16 = var_1_10 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=12, var_1_11=12, var_1_12=12, var_1_13=12, var_1_15=1, var_1_16=12, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=13, var_1_6=12, var_1_7=0] [L75] EXPR var_1_16 >> var_1_3 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=12, var_1_11=12, var_1_12=12, var_1_13=12, var_1_15=1, var_1_16=12, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=13, var_1_6=12, var_1_7=0] [L75] COND FALSE !((var_1_16 >> var_1_3) == (var_1_10 / var_1_5)) [L123] RET step() [L124] CALL, EXPR property() [L114] EXPR var_1_16 >> var_1_3 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=12, var_1_11=12, var_1_12=12, var_1_13=12, var_1_15=1, var_1_16=12, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=13, var_1_6=12, var_1_7=0] [L114] EXPR ((var_1_16 >> var_1_3) == (var_1_10 / var_1_5)) ? (((var_1_3 << (var_1_6 - var_1_7)) > ((var_1_10 & 0) * var_1_5)) ? (var_1_1 == ((double) ((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))))) : (var_1_1 == ((double) var_1_8))) : 1 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=12, var_1_11=12, var_1_12=12, var_1_13=12, var_1_15=1, var_1_16=12, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=13, var_1_6=12, var_1_7=0] [L114] EXPR (((((var_1_16 >> var_1_3) == (var_1_10 / var_1_5)) ? (((var_1_3 << (var_1_6 - var_1_7)) > ((var_1_10 & 0) * var_1_5)) ? (var_1_1 == ((double) ((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))))) : (var_1_1 == ((double) var_1_8))) : 1) && ((var_1_6 <= (last_1_var_1_12 + var_1_7)) ? (var_1_10 == ((unsigned char) var_1_11)) : (var_1_10 == ((unsigned char) (var_1_3 + var_1_7))))) && ((((var_1_6 >> 2) * last_1_var_1_13) > last_1_var_1_10) ? (var_1_12 == ((unsigned short int) var_1_6)) : 1)) && (((1 << var_1_10) != (-500 / -100)) ? (((var_1_6 - var_1_3) >= (var_1_12 + 256)) ? (var_1_13 == ((unsigned long int) var_1_11)) : (var_1_13 == ((unsigned long int) var_1_12))) : (var_1_13 == ((unsigned long int) var_1_6))) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=12, var_1_11=12, var_1_12=12, var_1_13=12, var_1_15=1, var_1_16=12, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=13, var_1_6=12, var_1_7=0] [L114] EXPR 1 << var_1_10 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=12, var_1_11=12, var_1_12=12, var_1_13=12, var_1_15=1, var_1_16=12, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=13, var_1_6=12, var_1_7=0] [L114] EXPR (((((var_1_16 >> var_1_3) == (var_1_10 / var_1_5)) ? (((var_1_3 << (var_1_6 - var_1_7)) > ((var_1_10 & 0) * var_1_5)) ? (var_1_1 == ((double) ((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))))) : (var_1_1 == ((double) var_1_8))) : 1) && ((var_1_6 <= (last_1_var_1_12 + var_1_7)) ? (var_1_10 == ((unsigned char) var_1_11)) : (var_1_10 == ((unsigned char) (var_1_3 + var_1_7))))) && ((((var_1_6 >> 2) * last_1_var_1_13) > last_1_var_1_10) ? (var_1_12 == ((unsigned short int) var_1_6)) : 1)) && (((1 << var_1_10) != (-500 / -100)) ? (((var_1_6 - var_1_3) >= (var_1_12 + 256)) ? (var_1_13 == ((unsigned long int) var_1_11)) : (var_1_13 == ((unsigned long int) var_1_12))) : (var_1_13 == ((unsigned long int) var_1_6))) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=12, var_1_11=12, var_1_12=12, var_1_13=12, var_1_15=1, var_1_16=12, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=13, var_1_6=12, var_1_7=0] [L114-L115] return (((((((var_1_16 >> var_1_3) == (var_1_10 / var_1_5)) ? (((var_1_3 << (var_1_6 - var_1_7)) > ((var_1_10 & 0) * var_1_5)) ? (var_1_1 == ((double) ((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))))) : (var_1_1 == ((double) var_1_8))) : 1) && ((var_1_6 <= (last_1_var_1_12 + var_1_7)) ? (var_1_10 == ((unsigned char) var_1_11)) : (var_1_10 == ((unsigned char) (var_1_3 + var_1_7))))) && ((((var_1_6 >> 2) * last_1_var_1_13) > last_1_var_1_10) ? (var_1_12 == ((unsigned short int) var_1_6)) : 1)) && (((1 << var_1_10) != (-500 / -100)) ? (((var_1_6 - var_1_3) >= (var_1_12 + 256)) ? (var_1_13 == ((unsigned long int) var_1_11)) : (var_1_13 == ((unsigned long int) var_1_12))) : (var_1_13 == ((unsigned long int) var_1_6)))) && (((- var_1_9) <= var_1_8) ? (var_1_15 ? ((((((var_1_11) > ((var_1_12 * -64))) ? (var_1_11) : ((var_1_12 * -64)))) < var_1_12) ? ((var_1_13 == var_1_10) ? (var_1_16 == ((unsigned short int) var_1_11)) : 1) : (var_1_16 == ((unsigned short int) 256))) : (var_1_16 == ((unsigned short int) var_1_3))) : (var_1_16 == ((unsigned short int) var_1_10)))) && (var_1_18 == ((signed char) var_1_3)) ; [L124] RET, EXPR property() [L124] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=12, var_1_11=12, var_1_12=12, var_1_13=12, var_1_15=1, var_1_16=12, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=13, var_1_6=12, var_1_7=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=12, var_1_11=12, var_1_12=12, var_1_13=12, var_1_15=1, var_1_16=12, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=13, var_1_6=12, var_1_7=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 70 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 23.4s, OverallIterations: 11, TraceHistogramMax: 15, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 9.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2979 SdHoareTripleChecker+Valid, 6.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2972 mSDsluCounter, 4224 SdHoareTripleChecker+Invalid, 6.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3162 mSDsCounter, 244 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4439 IncrementalHoareTripleChecker+Invalid, 4683 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 244 mSolverCounterUnsat, 1062 mSDtfsCounter, 4439 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1098 GetRequests, 939 SyntacticMatches, 1 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1005 ImplicationChecksByTransitivity, 5.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=574occurred in iteration=10, InterpolantAutomatonStates: 112, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 10 MinimizatonAttempts, 1036 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 10.7s InterpolantComputationTime, 1821 NumberOfCodeBlocks, 1821 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 1903 ConstructedInterpolants, 0 QuantifiedInterpolants, 8966 SizeOfPredicates, 32 NumberOfNonLiveVariables, 1294 ConjunctsInSsa, 56 ConjunctsInUnsatCore, 18 InterpolantComputations, 7 PerfectInterpolantSequences, 7287/7560 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-05 20:27:44,595 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with 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_codestructure_dependencies_file-9.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 c2c331e2f68e9d93ed0b3a3f04be22ea072b7c552ef634090004a61d599de390 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 20:27:46,379 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 20:27:46,460 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-02-05 20:27:46,466 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 20:27:46,466 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 20:27:46,489 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 20:27:46,489 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 20:27:46,489 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 20:27:46,489 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 20:27:46,489 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 20:27:46,490 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 20:27:46,490 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 20:27:46,490 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 20:27:46,490 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 20:27:46,490 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 20:27:46,490 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 20:27:46,490 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 20:27:46,490 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 20:27:46,490 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 20:27:46,490 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 20:27:46,490 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 20:27:46,490 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 20:27:46,490 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 20:27:46,490 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-05 20:27:46,490 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-05 20:27:46,490 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-05 20:27:46,491 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 20:27:46,491 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 20:27:46,491 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 20:27:46,491 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 20:27:46,491 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 20:27:46,491 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 20:27:46,491 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 20:27:46,491 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 20:27:46,491 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 20:27:46,491 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 20:27:46,491 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 20:27:46,491 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 20:27:46,491 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 20:27:46,491 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-05 20:27:46,491 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-05 20:27:46,493 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 20:27:46,493 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 20:27:46,494 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 20:27:46,494 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 20:27:46,494 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 -> c2c331e2f68e9d93ed0b3a3f04be22ea072b7c552ef634090004a61d599de390 [2025-02-05 20:27:46,746 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 20:27:46,760 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 20:27:46,761 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 20:27:46,762 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 20:27:46,762 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 20:27:46,772 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-9.i [2025-02-05 20:27:47,952 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ae38be286/8fbaa3436da04fc0952158aba2529c15/FLAGd7e1b3244 [2025-02-05 20:27:48,166 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 20:27:48,166 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-9.i [2025-02-05 20:27:48,174 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ae38be286/8fbaa3436da04fc0952158aba2529c15/FLAGd7e1b3244 [2025-02-05 20:27:48,515 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ae38be286/8fbaa3436da04fc0952158aba2529c15 [2025-02-05 20:27:48,517 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 20:27:48,518 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 20:27:48,519 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 20:27:48,519 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 20:27:48,522 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 20:27:48,522 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 08:27:48" (1/1) ... [2025-02-05 20:27:48,523 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59b78c92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:27:48, skipping insertion in model container [2025-02-05 20:27:48,523 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 08:27:48" (1/1) ... [2025-02-05 20:27:48,534 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 20:27:48,626 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_codestructure_dependencies_file-9.i[918,931] [2025-02-05 20:27:48,664 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 20:27:48,676 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 20:27:48,684 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_codestructure_dependencies_file-9.i[918,931] [2025-02-05 20:27:48,697 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 20:27:48,708 INFO L204 MainTranslator]: Completed translation [2025-02-05 20:27:48,709 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:27:48 WrapperNode [2025-02-05 20:27:48,709 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 20:27:48,710 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 20:27:48,710 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 20:27:48,710 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 20:27:48,714 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:27:48" (1/1) ... [2025-02-05 20:27:48,720 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:27:48" (1/1) ... [2025-02-05 20:27:48,733 INFO L138 Inliner]: procedures = 27, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 113 [2025-02-05 20:27:48,734 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 20:27:48,734 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 20:27:48,734 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 20:27:48,734 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 20:27:48,740 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:27:48" (1/1) ... [2025-02-05 20:27:48,740 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:27:48" (1/1) ... [2025-02-05 20:27:48,742 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:27:48" (1/1) ... [2025-02-05 20:27:48,749 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-05 20:27:48,750 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:27:48" (1/1) ... [2025-02-05 20:27:48,750 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:27:48" (1/1) ... [2025-02-05 20:27:48,758 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:27:48" (1/1) ... [2025-02-05 20:27:48,759 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:27:48" (1/1) ... [2025-02-05 20:27:48,762 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:27:48" (1/1) ... [2025-02-05 20:27:48,763 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:27:48" (1/1) ... [2025-02-05 20:27:48,768 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 20:27:48,769 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 20:27:48,769 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 20:27:48,769 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 20:27:48,769 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:27:48" (1/1) ... [2025-02-05 20:27:48,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 20:27:48,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:27:48,798 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 20:27:48,807 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 20:27:48,821 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 20:27:48,822 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-05 20:27:48,822 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-05 20:27:48,822 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-05 20:27:48,822 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 20:27:48,822 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 20:27:48,875 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 20:27:48,876 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 20:27:49,185 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-02-05 20:27:49,185 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 20:27:49,191 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 20:27:49,191 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 20:27:49,192 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 08:27:49 BoogieIcfgContainer [2025-02-05 20:27:49,192 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 20:27:49,193 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 20:27:49,193 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 20:27:49,198 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 20:27:49,198 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 08:27:48" (1/3) ... [2025-02-05 20:27:49,199 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f292aaa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 08:27:49, skipping insertion in model container [2025-02-05 20:27:49,199 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:27:48" (2/3) ... [2025-02-05 20:27:49,199 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f292aaa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 08:27:49, skipping insertion in model container [2025-02-05 20:27:49,199 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 08:27:49" (3/3) ... [2025-02-05 20:27:49,200 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-9.i [2025-02-05 20:27:49,210 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 20:27:49,211 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_dependencies_file-9.i that has 2 procedures, 52 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 20:27:49,241 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 20:27:49,248 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;@3f816bdb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 20:27:49,248 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 20:27:49,251 INFO L276 IsEmpty]: Start isEmpty. Operand has 52 states, 34 states have (on average 1.411764705882353) internal successors, (48), 35 states have internal predecessors, (48), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-02-05 20:27:49,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-02-05 20:27:49,256 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:27:49,257 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:27:49,257 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:27:49,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:27:49,261 INFO L85 PathProgramCache]: Analyzing trace with hash -505723850, now seen corresponding path program 1 times [2025-02-05 20:27:49,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 20:27:49,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [233960330] [2025-02-05 20:27:49,268 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:27:49,268 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-05 20:27:49,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 20:27:49,270 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-05 20:27:49,272 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-02-05 20:27:49,328 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-02-05 20:27:49,420 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-02-05 20:27:49,421 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:27:49,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:27:49,427 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 20:27:49,436 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 20:27:49,463 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 208 proven. 0 refuted. 0 times theorem prover too weak. 212 trivial. 0 not checked. [2025-02-05 20:27:49,464 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 20:27:49,464 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 20:27:49,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [233960330] [2025-02-05 20:27:49,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [233960330] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:27:49,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:27:49,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 20:27:49,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050467018] [2025-02-05 20:27:49,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:27:49,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 20:27:49,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 20:27:49,498 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 20:27:49,499 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 20:27:49,501 INFO L87 Difference]: Start difference. First operand has 52 states, 34 states have (on average 1.411764705882353) internal successors, (48), 35 states have internal predecessors, (48), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-05 20:27:49,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:27:49,514 INFO L93 Difference]: Finished difference Result 98 states and 166 transitions. [2025-02-05 20:27:49,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 20:27:49,515 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 98 [2025-02-05 20:27:49,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:27:49,518 INFO L225 Difference]: With dead ends: 98 [2025-02-05 20:27:49,519 INFO L226 Difference]: Without dead ends: 49 [2025-02-05 20:27:49,520 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 97 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-05 20:27:49,522 INFO L435 NwaCegarLoop]: 72 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, 72 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-05 20:27:49,522 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 20:27:49,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-02-05 20:27:49,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2025-02-05 20:27:49,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 32 states have (on average 1.3125) internal successors, (42), 32 states have internal predecessors, (42), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-02-05 20:27:49,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 72 transitions. [2025-02-05 20:27:49,544 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 72 transitions. Word has length 98 [2025-02-05 20:27:49,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:27:49,545 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 72 transitions. [2025-02-05 20:27:49,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-05 20:27:49,545 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 72 transitions. [2025-02-05 20:27:49,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-02-05 20:27:49,547 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:27:49,547 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:27:49,554 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-02-05 20:27:49,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-05 20:27:49,749 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:27:49,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:27:49,750 INFO L85 PathProgramCache]: Analyzing trace with hash 1767961136, now seen corresponding path program 1 times [2025-02-05 20:27:49,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 20:27:49,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [346642262] [2025-02-05 20:27:49,751 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:27:49,751 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-05 20:27:49,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 20:27:49,753 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-05 20:27:49,754 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-02-05 20:27:49,790 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-02-05 20:27:49,874 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-02-05 20:27:49,874 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:27:49,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:27:49,882 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-05 20:27:49,887 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 20:27:50,800 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 215 proven. 48 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked. [2025-02-05 20:27:50,800 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 20:27:51,533 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 20:27:51,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [346642262] [2025-02-05 20:27:51,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [346642262] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 20:27:51,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [721208557] [2025-02-05 20:27:51,534 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:27:51,534 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-02-05 20:27:51,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2025-02-05 20:27:51,536 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-02-05 20:27:51,541 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Waiting until timeout for monitored process [2025-02-05 20:27:51,588 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-02-05 20:27:51,875 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-02-05 20:27:51,875 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:27:51,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:27:51,882 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-05 20:27:51,885 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 20:27:52,338 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 204 proven. 27 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2025-02-05 20:27:52,338 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 20:27:52,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [721208557] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 20:27:52,788 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-05 20:27:52,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 9 [2025-02-05 20:27:52,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527160764] [2025-02-05 20:27:52,789 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-05 20:27:52,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 20:27:52,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 20:27:52,790 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 20:27:52,791 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=157, Unknown=0, NotChecked=0, Total=240 [2025-02-05 20:27:52,791 INFO L87 Difference]: Start difference. First operand 49 states and 72 transitions. Second operand has 10 states, 10 states have (on average 4.6) internal successors, (46), 9 states have internal predecessors, (46), 3 states have call successors, (23), 3 states have call predecessors, (23), 5 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) [2025-02-05 20:27:53,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:27:53,409 INFO L93 Difference]: Finished difference Result 152 states and 219 transitions. [2025-02-05 20:27:53,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-05 20:27:53,414 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.6) internal successors, (46), 9 states have internal predecessors, (46), 3 states have call successors, (23), 3 states have call predecessors, (23), 5 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) Word has length 99 [2025-02-05 20:27:53,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:27:53,415 INFO L225 Difference]: With dead ends: 152 [2025-02-05 20:27:53,415 INFO L226 Difference]: Without dead ends: 106 [2025-02-05 20:27:53,416 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 332 GetRequests, 308 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=232, Invalid=418, Unknown=0, NotChecked=0, Total=650 [2025-02-05 20:27:53,417 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 47 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 20:27:53,417 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 363 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 20:27:53,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2025-02-05 20:27:53,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 87. [2025-02-05 20:27:53,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 52 states have (on average 1.1923076923076923) internal successors, (62), 52 states have internal predecessors, (62), 30 states have call successors, (30), 4 states have call predecessors, (30), 4 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-02-05 20:27:53,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 122 transitions. [2025-02-05 20:27:53,441 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 122 transitions. Word has length 99 [2025-02-05 20:27:53,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:27:53,441 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 122 transitions. [2025-02-05 20:27:53,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.6) internal successors, (46), 9 states have internal predecessors, (46), 3 states have call successors, (23), 3 states have call predecessors, (23), 5 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) [2025-02-05 20:27:53,441 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 122 transitions. [2025-02-05 20:27:53,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-02-05 20:27:53,442 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:27:53,442 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:27:53,450 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-02-05 20:27:53,648 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Forceful destruction successful, exit code 0 [2025-02-05 20:27:53,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2025-02-05 20:27:53,844 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:27:53,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:27:53,846 INFO L85 PathProgramCache]: Analyzing trace with hash -730054801, now seen corresponding path program 1 times [2025-02-05 20:27:53,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 20:27:53,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1291369805] [2025-02-05 20:27:53,847 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:27:53,847 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-05 20:27:53,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 20:27:53,849 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-05 20:27:53,851 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-02-05 20:27:53,878 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-02-05 20:27:53,963 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-02-05 20:27:53,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:27:53,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:27:53,976 INFO L256 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-02-05 20:27:53,984 INFO L279 TraceCheckSpWp]: Computing forward predicates...